1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 4038 4039 4040 4041 4042 4043 4044 4045 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 4065 4066 4067 4068 4069 4070 4071 4072 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 4220 4221 4222 4223 4224 4225 4226 4227 4228 4229 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 4256 4257 4258 4259 4260 4261 4262 4263 4264 4265 4266 4267 4268 4269 4270 4271 4272 4273 4274 4275 4276 4277 4278 4279 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 4305 4306 4307 4308 4309 4310 4311 4312 4313 4314 4315 4316 4317 4318 4319 4320 4321 4322 4323 4324 4325 4326 4327 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 4482 4483 4484 4485 4486 4487 4488 4489 4490 4491 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 4767 4768 4769 4770 4771 4772 4773 4774 4775 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 4801 4802 4803 4804 4805 4806 4807 4808 4809 4810 4811 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 4931 4932 4933 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 4961 4962 4963 4964 4965 4966 4967 4968 4969 4970 4971 4972 4973 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 4989 4990 4991 4992 4993 4994 4995 4996 4997 4998 4999 5000 5001 5002 5003 5004 5005 5006 5007 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 5023 5024 5025 5026 5027 5028 5029 5030 5031 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 5126 5127 5128 5129 5130 5131 5132 5133 5134 5135 5136 5137 5138 5139 5140 5141 5142 5143 5144 5145 5146 5147 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 5466 5467 5468 5469 5470 5471 5472 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628 5629 5630 5631 5632 5633 5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728 5729 5730 5731 5732 5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748 5749 5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 5784 5785 5786 5787 5788 5789 5790 5791 5792 5793 5794 5795 5796 5797 5798 5799 5800 5801 5802 5803 5804 5805 5806 5807 5808 5809 5810 5811 5812 5813 5814 5815 5816 5817 5818 5819 5820 5821 5822 5823 5824 5825 5826 5827 5828 5829 5830 5831 5832 5833 5834 5835 5836 5837 5838 5839 5840 5841 5842 5843 5844 5845 5846 5847 5848 5849 5850 5851 5852 5853 5854 5855 5856 5857 5858 5859 5860 5861 5862 5863 5864 5865 5866 5867 5868 5869 5870 5871 5872 5873 5874 5875 5876 5877 5878 5879 5880 5881 5882 5883 5884 5885 5886 5887 5888 5889 5890 5891 5892 5893 5894 5895 5896 5897 5898 5899 5900 5901 5902 5903 5904 5905 5906 5907 5908 5909 5910 5911 5912 5913 5914 5915 5916 5917 5918 5919 5920 5921 5922 5923 5924 5925 5926 5927 5928 5929 5930 5931 5932 5933 5934 5935 5936 5937 5938 5939 5940 5941 5942 5943 5944 5945 5946 5947 5948 5949 5950 5951 5952 5953 5954 5955 5956 5957 5958 5959 5960 5961 5962 5963 5964 5965 5966 5967 5968 5969 5970 5971 5972 5973 5974 5975 5976 5977 5978 5979 5980 5981 5982 5983 5984 5985 5986 5987 5988 5989 5990 5991 5992 5993 5994 5995 5996 5997 5998 5999 6000 6001 6002 6003 6004 6005 6006 6007 6008 6009 6010 6011 6012 6013 6014 6015 6016 6017 6018 6019 6020 6021 6022 6023 6024 6025 6026 6027 6028 6029 6030 6031 6032 6033 6034 6035 6036 6037 6038 6039 6040 6041 6042 6043 6044 6045 6046 6047 6048 6049 6050 6051 6052 6053 6054 6055 6056 6057 6058 6059 6060 6061 6062 6063 6064 6065 6066 6067 6068 6069 6070 6071 6072 6073 6074 6075 6076 6077 6078 6079 6080 6081 6082 6083 6084 6085 6086 6087 6088 6089 6090 6091 6092 6093 6094 6095 6096 6097 6098 6099 6100 6101 6102 6103 6104 6105 6106 6107 6108 6109 6110 6111 6112 6113 6114 6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 6125 6126 6127 6128 6129 6130 6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 6143 6144 6145 6146 6147 6148 6149 6150 6151 6152 6153 6154 6155 6156 6157 6158 6159 6160 6161 6162 6163 6164 6165 6166 6167 6168 6169 6170 6171 6172 6173 6174 6175 6176 6177 6178 6179 6180 6181 6182 6183 6184 6185 6186 6187 6188 6189 6190 6191 6192 6193 6194 6195 6196 6197 6198 6199 6200 6201 6202 6203 6204 6205 6206 6207 6208 6209 6210 6211 6212 6213 6214 6215 6216 6217 6218 6219 6220 6221 6222 6223 6224 6225 6226 6227 6228 6229 6230 6231 6232 6233 6234 6235 6236 6237 6238 6239 6240 6241 6242 6243 6244 6245 6246 6247 6248 6249 6250 6251 6252 6253 6254 6255 6256 6257 6258 6259 6260 6261 6262 6263 6264 6265 6266 6267 6268 6269 6270 6271 6272 6273 6274 6275 6276 6277 6278 6279 6280 6281 6282 6283 6284 6285 6286 6287 6288 6289 6290 6291 6292 6293 6294 6295 6296 6297 6298 6299 6300 6301 6302 6303 6304 6305 6306 6307 6308 6309 6310 6311 6312 6313 6314 6315 6316 6317 6318 6319 6320 6321 6322 6323 6324 6325 6326 6327 6328 6329 6330 6331 6332 6333 6334 6335 6336 6337 6338 6339 6340 6341 6342 6343 6344 6345 6346 6347 6348 6349 6350 6351 6352 6353 6354 6355 6356 6357 6358 6359 6360 6361 6362 6363 6364 6365 6366 6367 6368 6369 6370 6371 6372 6373 6374 6375 6376 6377 6378 6379 6380 6381 6382 6383 6384 6385 6386 6387 6388 6389 6390 6391 6392 6393 6394 6395 6396 6397 6398 6399 6400 6401 6402 6403 6404 6405 6406 6407 6408 6409 6410 6411 6412 6413 6414 6415 6416 6417 6418 6419 6420 6421 6422 6423 6424 6425 6426 6427 6428 6429 6430 6431 6432 6433 6434 6435 6436 6437 6438 6439 6440 6441 6442 6443 6444 6445 6446 6447 6448 6449 6450 6451 6452 6453 6454 6455 6456 6457 6458 6459 6460 6461 6462 6463 6464 6465 6466 6467 6468 6469 6470 6471 6472 6473 6474 6475 6476 6477 6478 6479 6480 6481 6482 6483 6484 6485 6486 6487 6488 6489 6490 6491 6492 6493 6494 6495 6496 6497 6498 6499 6500 6501 6502 6503 6504 6505 6506 6507 6508 6509 6510 6511 6512 6513 6514 6515 6516 6517 6518 6519 6520 6521 6522 6523 6524 6525 6526 6527 6528 6529 6530 6531 6532 6533 6534 6535 6536 6537 6538 6539 6540 6541 6542 6543 6544 6545 6546 6547 6548 6549 6550 6551 6552 6553 6554 6555 6556 6557 6558 6559 6560 6561 6562 6563 6564 6565 6566 6567 6568 6569 6570 6571 6572 6573 6574 6575 6576 6577 6578 6579 6580 6581 6582 6583 6584 6585 6586 6587 6588 6589 6590 6591 6592 6593 6594 6595 6596 6597 6598 6599 6600 6601 6602 6603 6604 6605 6606 6607 6608 6609 6610 6611 6612 6613 6614 6615 6616 6617 6618 6619 6620 6621 6622 6623 6624 6625 6626 6627 6628 6629 6630 6631 6632 6633 6634 6635 6636 6637 6638 6639 6640 6641 6642 6643 6644 6645 6646 6647 6648 6649 6650 6651 6652 6653 6654 6655 6656 6657 6658 6659 6660 6661 6662 6663 6664 6665 6666 6667 6668 6669 6670 6671 6672 6673 6674 6675 6676 6677 6678 6679 6680 6681 6682 6683 6684 6685 6686 6687 6688 6689 6690 6691 6692 6693 6694 6695 6696 6697 6698 6699 6700 6701 6702 6703 6704 6705 6706 6707 6708 6709 6710 6711 6712 6713 6714 6715 6716 6717 6718 6719 6720 6721 6722 6723 6724 6725 6726 6727 6728 6729 6730 6731 6732 6733 6734 6735 6736 6737 6738 6739 6740 6741 6742 6743 6744 6745 6746 6747 6748 6749 6750 6751 6752 6753 6754 6755 6756 6757 6758 6759 6760 6761 6762 6763 6764 6765 6766 6767 6768 6769 6770 6771 6772 6773 6774 6775 6776 6777 6778 6779 6780 6781 6782 6783 6784 6785 6786 6787 6788 6789 6790 6791 6792 6793 6794 6795 6796 6797 6798 6799 6800 6801 6802 6803 6804 6805 6806 6807 6808 6809 6810 6811 6812 6813 6814 6815 6816 6817 6818 6819 6820 6821 6822 6823 6824 6825 6826 6827 6828 6829 6830 6831 6832 6833 6834 6835 6836 6837 6838 6839 6840 6841 6842 6843 6844 6845 6846 6847 6848 6849 6850 6851 6852 6853 6854 6855 6856 6857 6858 6859 6860 6861 6862 6863 6864 6865 6866 6867 6868 6869 6870 6871 6872 6873 6874 6875 6876 6877 6878 6879 6880 6881 6882 6883 6884 6885 6886 6887 6888 6889 6890 6891 6892 6893 6894 6895 6896 6897 6898 6899 6900 6901 6902 6903 6904 6905 6906 6907 6908 6909 6910 6911 6912 6913 6914 6915 6916 6917 6918 6919 6920 6921 6922 6923 6924 6925 6926 6927 6928 6929 6930 6931 6932 6933 6934 6935 6936 6937 6938 6939 6940 6941 6942 6943 6944 6945 6946 6947 6948 6949 6950 6951 6952 6953 6954 6955 6956 6957 6958 6959 6960 6961 6962 6963 6964 6965 6966 6967 6968 6969 6970 6971 6972 6973 6974 6975 6976 6977 6978 6979 6980 6981 6982 6983 6984 6985 6986 6987 6988 6989 6990 6991 6992 6993 6994 6995 6996 6997 6998 6999 7000 7001 7002 7003 7004 7005 7006 7007 7008 7009 7010 7011 7012 7013 7014 7015 7016 7017 7018 7019 7020 7021 7022 7023 7024 7025 7026 7027 7028 7029 7030 7031 7032 7033 7034 7035 7036 7037 7038 7039 7040 7041 7042 7043 7044 7045 7046 7047 7048 7049 7050 7051 7052 7053 7054 7055 7056 7057 7058 7059 7060 7061 7062 7063 7064 7065 7066 7067 7068 7069 7070 7071 7072 7073 7074 7075 7076 7077 7078 7079 7080 7081 7082 7083 7084 7085 7086 7087 7088 7089 7090 7091 7092 7093 7094 7095 7096 7097 7098 7099 7100 7101 7102 7103 7104 7105 7106 7107 7108 7109 7110 7111 7112 7113 7114 7115 7116 7117 7118 7119 7120 7121 7122 7123 7124 7125 7126 7127 7128 7129 7130 7131 7132 7133 7134 7135 7136 7137 7138 7139 7140 7141 7142 7143 7144 7145 7146 7147 7148 7149 7150 7151 7152 7153 7154 7155 7156 7157 7158 7159 7160 7161 7162 7163 7164 7165 7166 7167 7168 7169 7170 7171 7172 7173 7174 7175 7176 7177 7178 7179 7180 7181 7182 7183 7184 7185 7186 7187 7188 7189 7190 7191 7192 7193 7194 7195 7196 7197 7198 7199 7200 7201 7202 7203 7204 7205 7206 7207 7208 7209 7210 7211 7212 7213 7214 7215 7216 7217 7218 7219 7220 7221 7222 7223 7224 7225 7226 7227 7228 7229 7230 7231 7232 7233 7234 7235 7236 7237 7238 7239 7240 7241 7242 7243 7244 7245 7246 7247 7248 7249 7250 7251 7252 7253 7254 7255 7256 7257 7258 7259 7260 7261 7262 7263 7264 7265 7266 7267 7268 7269 7270 7271 7272 7273 7274 7275 7276 7277 7278 7279 7280 7281 7282 7283 7284 7285 7286 7287 7288 7289 7290 7291 7292 7293 7294 7295 7296 7297 7298 7299 7300 7301 7302 7303 7304 7305 7306 7307 7308 7309 7310 7311 7312 7313 7314 7315 7316 7317 7318 7319 7320 7321 7322 7323 7324 7325 7326 7327 7328 7329 7330 7331 7332 7333 7334 7335 7336 7337 7338 7339 7340 7341 7342 7343 7344 7345 7346 7347 7348 7349 7350 7351 7352 7353 7354 7355 7356 7357 7358 7359 7360 7361 7362 7363 7364 7365 7366 7367 7368 7369 7370 7371 7372 7373 7374 7375 7376 7377 7378 7379 7380 7381 7382 7383 7384 7385 7386 7387 7388 7389 7390 7391 7392 7393 7394 7395 7396 7397 7398 7399 7400 7401 7402 7403 7404 7405 7406 7407 7408 7409 7410 7411 7412 7413 7414 7415 7416 7417 7418 7419 7420 7421 7422 7423 7424 7425 7426 7427 7428 7429 7430 7431 7432 7433 7434 7435 7436 7437 7438 7439 7440 7441 7442 7443 7444 7445 7446 7447 7448 7449 7450 7451 7452 7453 7454 7455 7456 7457 7458 7459 7460 7461 7462 7463 7464 7465 7466 7467 7468 7469 7470 7471 7472 7473 7474 7475 7476 7477 7478 7479 7480 7481 7482 7483 7484 7485 7486 7487 7488 7489 7490 7491 7492 7493 7494 7495 7496 7497 7498 7499 7500 7501 7502 7503 7504 7505 7506 7507 7508 7509 7510 7511 7512 7513 7514 7515 7516 7517 7518 7519 7520 7521 7522 7523 7524 7525 7526 7527 7528 7529 7530 7531 7532 7533 7534 7535 7536 7537 7538 7539 7540 7541 7542 7543 7544 7545 7546 7547 7548 7549 7550 7551 7552 7553 7554 7555 7556 7557 7558 7559 7560 7561 7562 7563 7564 7565 7566 7567 7568 7569 7570 7571 7572 7573 7574 7575 7576 7577 7578 7579 7580 7581 7582 7583 7584 7585 7586 7587 7588 7589 7590 7591 7592 7593 7594 7595 7596 7597 7598 7599 7600 7601 7602 7603 7604 7605 7606 7607 7608 7609 7610 7611 7612 7613 7614 7615 7616 7617 7618 7619 7620 7621 7622 7623 7624 7625 7626 7627 7628 7629 7630 7631 7632 7633 7634 7635 7636 7637 7638 7639 7640 7641 7642 7643 7644 7645 7646 7647 7648 7649 7650 7651 7652 7653 7654 7655 7656 7657 7658 7659 7660 7661 7662 7663 7664 7665 7666 7667 7668 7669 7670 7671 7672 7673 7674 7675 7676 7677 7678 7679 7680 7681 7682 7683 7684 7685 7686 7687 7688 7689 7690 7691 7692 7693 7694 7695 7696 7697 7698 7699 7700 7701 7702 7703 7704 7705 7706 7707 7708 7709 7710 7711 7712 7713 7714 7715 7716 7717 7718 7719 7720 7721 7722 7723 7724 7725 7726 7727 7728 7729 7730 7731 7732 7733 7734 7735 7736 7737 7738 7739 7740 7741 7742 7743 7744 7745 7746 7747 7748 7749 7750 7751 7752 7753 7754 7755 7756 7757 7758 7759 7760 7761 7762 7763 7764 7765 7766 7767 7768 7769 7770 7771 7772 7773 7774 7775 7776 7777 7778 7779 7780 7781 7782 7783 7784 7785 7786 7787 7788 7789 7790 7791 7792 7793 7794 7795 7796 7797 7798 7799 7800 7801 7802 7803 7804 7805 7806 7807 7808 7809 7810 7811 7812 7813 7814 7815 7816 7817 7818 7819 7820 7821 7822 7823 7824 7825 7826 7827 7828 7829 7830 7831 7832 7833 7834 7835 7836 7837 7838 7839 7840 7841 7842 7843 7844 7845 7846 7847 7848 7849 7850 7851 7852 7853 7854 7855 7856 7857 7858 7859 7860 7861 7862 7863 7864 7865 7866 7867 7868 7869 7870 7871 7872 7873 7874 7875 7876 7877 7878 7879 7880 7881 7882 7883 7884 7885 7886 7887 7888 7889 7890 7891 7892 7893 7894 7895 7896 7897 7898 7899 7900 7901 7902 7903 7904 7905 7906 7907 7908 7909 7910 7911 7912 7913 7914 7915 7916 7917 7918 7919 7920 7921 7922 7923 7924 7925 7926 7927 7928 7929 7930 7931 7932 7933 7934 7935 7936 7937 7938 7939 7940 7941 7942 7943 7944 7945 7946 7947 7948 7949 7950 7951 7952 7953 7954 7955 7956 7957 7958 7959 7960 7961 7962 7963 7964 7965 7966 7967 7968 7969 7970 7971 7972 7973 7974 7975 7976 7977 7978 7979 7980 7981 7982 7983 7984 7985 7986 7987 7988 7989 7990 7991 7992 7993 7994 7995 7996 7997 7998 7999 8000 8001 8002 8003 8004 8005 8006 8007 8008 8009 8010 8011 8012 8013 8014 8015 8016 8017 8018 8019 8020 8021 8022 8023 8024 8025 8026 8027 8028 8029 8030 8031 8032 8033 8034 8035 8036 8037 8038 8039 8040 8041 8042 8043 8044 8045 8046 8047 8048 8049 8050 8051 8052 8053 8054 8055 8056 8057 8058 8059 8060 8061 8062 8063 8064 8065 8066 8067 8068 8069 8070 8071 8072 8073 8074 8075 8076 8077 8078 8079 8080 8081 8082 8083 8084 8085 8086 8087 8088 8089 8090 8091 8092 8093 8094 8095 8096 8097 8098 8099 8100 8101 8102 8103 8104 8105 8106 8107 8108 8109 8110 8111 8112 8113 8114 8115 8116 8117 8118 8119 8120 8121 8122 8123 8124 8125 8126 8127 8128 8129 8130 8131 8132 8133 8134 8135 8136 8137 8138 8139 8140 8141 8142 8143 8144 8145 8146 8147 8148 8149 8150 8151 8152 8153 8154 8155 8156 8157 8158 8159 8160 8161 8162 8163 8164 8165 8166 8167 8168 8169 8170 8171 8172 8173 8174 8175 8176 8177 8178 8179 8180 8181 8182 8183 8184 8185 8186 8187 8188 8189 8190 8191 8192 8193 8194 8195 8196 8197 8198 8199 8200 8201 8202 8203 8204 8205 8206 8207 8208 8209 8210 8211 8212 8213 8214 8215 8216 8217 8218 8219 8220 8221 8222 8223 8224 8225 8226 8227 8228 8229 8230 8231 8232 8233 8234 8235 8236 8237 8238 8239 8240 8241 8242 8243 8244 8245 8246 8247 8248 8249 8250 8251 8252 8253 8254 8255 8256 8257 8258 8259 8260 8261 8262 8263 8264 8265 8266 8267 8268 8269 8270 8271 8272 8273 8274 8275 8276 8277 8278 8279 8280 8281 8282 8283 8284 8285 8286 8287 8288 8289 8290 8291 8292 8293 8294 8295 8296 8297 8298 8299 8300 8301 8302 8303 8304 8305 8306 8307 8308 8309 8310 8311 8312 8313 8314 8315 8316 8317 8318 8319 8320 8321 8322 8323 8324 8325 8326 8327 8328 8329 8330 8331 8332 8333 8334 8335 8336 8337 8338 8339 8340 8341 8342 8343 8344 8345 8346 8347 8348 8349 8350 8351 8352 8353 8354 8355 8356 8357 8358 8359 8360 8361 8362 8363 8364 8365 8366 8367 8368 8369 8370 8371 8372 8373 8374 8375 8376 8377 8378 8379 8380 8381 8382 8383 8384 8385 8386 8387 8388 8389 8390 8391 8392 8393 8394 8395 8396 8397 8398 8399 8400 8401 8402 8403 8404 8405 8406 8407 8408 8409 8410 8411 8412 8413 8414 8415 8416 8417 8418 8419 8420 8421 8422 8423 8424 8425 8426 8427 8428 8429 8430 8431 8432 8433 8434 8435 8436 8437 8438 8439 8440 8441 8442 8443 8444 8445 8446 8447 8448 8449 8450 8451 8452 8453 8454 8455 8456 8457 8458 8459 8460 8461 8462 8463 8464 8465 8466 8467 8468 8469 8470 8471 8472 8473 8474 8475 8476 8477 8478 8479 8480 8481 8482 8483 8484 8485 8486 8487 8488 8489 8490 8491 8492 8493 8494 8495 8496 8497 8498 8499 8500 8501 8502 8503 8504 8505 8506 8507 8508 8509 8510 8511 8512 8513 8514 8515 8516 8517 8518 8519 8520 8521 8522 8523 8524 8525 8526 8527 8528 8529 8530 8531 8532 8533 8534 8535 8536 8537 8538 8539 8540 8541 8542 8543 8544 8545 8546 8547 8548 8549 8550 8551 8552 8553 8554 8555 8556 8557 8558 8559 8560 8561 8562 8563 8564 8565 8566 8567 8568 8569 8570 8571 8572 8573 8574 8575 8576 8577 8578 8579 8580 8581 8582 8583 8584 8585 8586 8587 8588 8589 8590 8591 8592 8593 8594 8595 8596 8597 8598 8599 8600 8601 8602 8603 8604 8605 8606 8607 8608 8609 8610 8611 8612 8613 8614 8615 8616 8617 8618 8619 8620 8621 8622 8623 8624 8625 8626 8627 8628 8629 8630 8631 8632 8633 8634 8635 8636 8637 8638 8639 8640 8641 8642 8643 8644 8645 8646 8647 8648 8649 8650 8651 8652 8653 8654 8655 8656 8657 8658 8659 8660 8661 8662 8663 8664 8665 8666 8667 8668 8669 8670 8671 8672 8673 8674 8675 8676 8677 8678 8679 8680 8681 8682 8683 8684 8685 8686 8687 8688 8689 8690 8691 8692 8693 8694 8695 8696 8697 8698 8699 8700 8701 8702 8703 8704 8705 8706 8707 8708 8709 8710 8711 8712 8713 8714 8715 8716 8717 8718 8719 8720 8721 8722 8723 8724 8725 8726 8727 8728 8729 8730 8731 8732 8733 8734 8735 8736 8737 8738 8739 8740 8741 8742 8743 8744 8745 8746 8747 8748 8749 8750 8751 8752 8753 8754 8755 8756 8757 8758 8759 8760 8761 8762 8763 8764 8765 8766 8767 8768 8769 8770 8771 8772 8773 8774 8775 8776 8777 8778 8779 8780 8781 8782 8783 8784 8785 8786 8787 8788 8789 8790 8791 8792 8793 8794 8795 8796 8797 8798 8799 8800 8801 8802 8803 8804 8805 8806 8807 8808 8809 8810 8811 8812 8813 8814 8815 8816 8817 8818 8819 8820 8821 8822 8823 8824 8825 8826 8827 8828 8829 8830 8831 8832 8833 8834 8835 8836 8837 8838 8839 8840 8841 8842 8843 8844 8845 8846 8847 8848 8849 8850 8851 8852 8853 8854 8855 8856 8857 8858 8859 8860 8861 8862 8863 8864 8865 8866 8867 8868 8869 8870 8871 8872 8873 8874 8875 8876 8877 8878 8879 8880 8881 8882 8883 8884 8885 8886 8887 8888 8889 8890 8891 8892 8893 8894 8895 8896 8897 8898 8899 8900 8901 8902 8903 8904 8905 8906 8907 8908 8909 8910 8911 8912 8913 8914 8915 8916 8917 8918 8919 8920 8921 8922 8923 8924 8925 8926 8927 8928 8929 8930 8931 8932 8933 8934 8935 8936 8937 8938 8939 8940 8941 8942 8943 8944 8945 8946 8947 8948 8949 8950 8951 8952 8953 8954 8955 8956 8957 8958 8959 8960 8961 8962 8963 8964 8965 8966 8967 8968 8969 8970 8971 8972 8973 8974 8975 8976 8977 8978 8979 8980 8981 8982 8983 8984 8985 8986 8987 8988 8989 8990 8991 8992 8993 8994 8995 8996 8997 8998 8999 9000 9001 9002 9003 9004 9005 9006 9007 9008 9009 9010 9011 9012 9013 9014 9015 9016 9017 9018 9019 9020 9021 9022 9023 9024 9025 9026 9027 9028 9029 9030 9031 9032 9033 9034 9035 9036 9037 9038 9039 9040 9041 9042 9043 9044 9045 9046 9047 9048 9049 9050 9051 9052 9053 9054 9055 9056 9057 9058 9059 9060 9061 9062 9063 9064 9065 9066 9067 9068 9069 9070 9071 9072 9073 9074 9075 9076 9077 9078 9079 9080 9081 9082 9083 9084 9085 9086 9087 9088 9089 9090 9091 9092 9093 9094 9095 9096 9097 9098 9099 9100 9101 9102 9103 9104 9105 9106 9107 9108 9109 9110 9111 9112 9113 9114 9115 9116 9117 9118 9119 9120 9121 9122 9123 9124 9125 9126 9127 9128 9129 9130 9131 9132 9133 9134 9135 9136 9137 9138 9139 9140 9141 9142 9143 9144 9145 9146 9147 9148 9149 9150 9151 9152 9153 9154 9155 9156 9157 9158 9159 9160 9161 9162 9163 9164 9165 9166 9167 9168 9169 9170 9171 9172 9173 9174 9175 9176 9177 9178 9179 9180 9181 9182 9183 9184 9185 9186 9187 9188 9189 9190 9191 9192 9193 9194 9195 9196 9197 9198 9199 9200 9201 9202 9203 9204 9205 9206 9207 9208 9209 9210 9211 9212 9213 9214 9215 9216 9217 9218 9219 9220 9221 9222 9223 9224 9225 9226 9227 9228 9229 9230 9231 9232 9233 9234 9235 9236 9237 9238 9239 9240 9241 9242 9243 9244 9245 9246 9247 9248 9249 9250 9251 9252 9253 9254 9255 9256 9257 9258 9259 9260 9261 9262 9263 9264 9265 9266 9267 9268 9269 9270 9271 9272 9273 9274 9275 9276 9277 9278 9279 9280 9281 9282 9283 9284 9285 9286 9287 9288 9289 9290 9291 9292 9293 9294 9295 9296 9297 9298 9299 9300 9301 9302 9303 9304 9305 9306 9307 9308 9309 9310 9311 9312 9313 9314 9315 9316 9317 9318 9319 9320 9321 9322 9323 9324 9325 9326 9327 9328 9329 9330 9331 9332 9333 9334 9335 9336 9337 9338 9339 9340 9341 9342 9343 9344 9345 9346 9347 9348 9349 9350 9351 9352 9353 9354 9355 9356 9357 9358 9359 9360 9361 9362 9363 9364 9365 9366 9367 9368 9369 9370 9371 9372 9373 9374 9375 9376 9377 9378 9379 9380 9381 9382 9383 9384 9385 9386 9387 9388 9389 9390 9391 9392 9393 9394 9395 9396 9397 9398 9399 9400 9401 9402 9403 9404 9405 9406 9407 9408 9409 9410 9411 9412 9413 9414 9415 9416 9417 9418 9419 9420 9421 9422 9423 9424 9425 9426 9427 9428 9429 9430 9431 9432 9433 9434 9435 9436 9437 9438 9439 9440 9441 9442 9443 9444 9445 9446 9447 9448 9449 9450 9451 9452 9453 9454 9455 9456 9457 9458 9459 9460 9461 9462 9463 9464 9465 9466 9467 9468 9469 9470 9471 9472 9473 9474 9475 9476 9477 9478 9479 9480 9481 9482 9483 9484 9485 9486 9487 9488 9489 9490 9491 9492 9493 9494 9495 9496 9497 9498 9499 9500 9501 9502 9503 9504 9505 9506 9507 9508 9509 9510 9511 9512 9513 9514 9515 9516 9517 9518 9519 9520 9521 9522 9523 9524 9525 9526 9527 9528 9529 9530 9531 9532 9533 9534 9535 9536 9537 9538 9539 9540 9541 9542 9543 9544 9545 9546 9547 9548 9549 9550 9551 9552 9553 9554 9555 9556 9557 9558 9559 9560 9561 9562 9563 9564 9565 9566 9567 9568 9569 9570 9571 9572 9573 9574 9575 9576 9577 9578 9579 9580 9581 9582 9583 9584 9585 9586 9587 9588 9589 9590 9591 9592 9593 9594 9595 9596 9597 9598 9599 9600 9601 9602 9603 9604 9605 9606 9607 9608 9609 9610 9611 9612 9613 9614 9615 9616 9617 9618 9619 9620 9621 9622 9623 9624 9625 9626 9627 9628 9629 9630 9631 9632 9633 9634 9635 9636 9637 9638 9639 9640 9641 9642 9643 9644 9645 9646 9647 9648 9649 9650 9651 9652 9653 9654 9655 9656 9657 9658 9659 9660 9661 9662 9663 9664 9665 9666 9667 9668 9669 9670 9671 9672 9673 9674 9675 9676 9677 9678 9679 9680 9681 9682 9683 9684 9685 9686 9687 9688 9689 9690 9691 9692 9693 9694 9695 9696 9697 9698 9699 9700 9701 9702 9703 9704 9705 9706 9707 9708 9709 9710 9711 9712 9713 9714 9715 9716 9717 9718 9719 9720 9721 9722 9723 9724 9725 9726 9727 9728 9729 9730 9731 9732 9733 9734 9735 9736 9737 9738 9739 9740 9741 9742 9743 9744 9745 9746 9747 9748 9749 9750 9751 9752 9753 9754 9755 9756 9757 9758 9759 9760 9761 9762 9763 9764 9765 9766 9767 9768 9769 9770 9771 9772 9773 9774 9775 9776 9777 9778 9779 9780 9781 9782 9783 9784 9785 9786 9787 9788 9789 9790 9791 9792 9793 9794 9795 9796 9797 9798 9799 9800 9801 9802 9803 9804 9805 9806 9807 9808 9809 9810 9811 9812 9813 9814 9815 9816 9817 9818 9819 9820 9821 9822 9823 9824 9825 9826 9827 9828 9829 9830 9831 9832 9833 9834 9835 9836 9837 9838 9839 9840 9841 9842 9843 9844 9845 9846 9847 9848 9849 9850 9851 9852 9853 9854 9855 9856 9857 9858 9859 9860 9861 9862 9863 9864 9865 9866 9867 9868 9869 9870 9871 9872 9873 9874 9875 9876 9877 9878 9879 9880 9881 9882 9883 9884 9885 9886 9887 9888 9889 9890 9891 9892 9893 9894 9895 9896 9897 9898 9899 9900 9901 9902 9903 9904 9905 9906 9907 9908 9909 9910 9911 9912 9913 9914 9915 9916 9917 9918 9919 9920 9921 9922 9923 9924 9925 9926 9927 9928 9929 9930 9931 9932 9933 9934 9935 9936 9937 9938 9939 9940 9941 9942 9943 9944 9945 9946 9947 9948 9949 9950 9951 9952 9953 9954 9955 9956 9957 9958 9959 9960 9961 9962 9963 9964 9965 9966 9967 9968 9969 9970 9971 9972 9973 9974 9975 9976 9977 9978 9979 9980 9981 9982 9983 9984 9985 9986 9987 9988 9989 9990 9991 9992 9993 9994 9995 9996 9997 9998 9999 10000 10001 10002 10003 10004 10005 10006 10007 10008 10009 10010 10011 10012 10013 10014 10015 10016 10017 10018 10019 10020 10021 10022 10023 10024 10025 10026 10027 10028 10029 10030 10031 10032 10033 10034 10035 10036 10037 10038 10039 10040 10041 10042 10043 10044 10045 10046 10047 10048 10049 10050 10051 10052 10053 10054 10055 10056 10057 10058 10059 10060 10061 10062 10063 10064 10065 10066 10067 10068 10069 10070 10071 10072 10073 10074 10075 10076 10077 10078 10079 10080 10081 10082 10083 10084 10085 10086 10087 10088 10089 10090 10091 10092 10093 10094 10095 10096 10097 10098 10099 10100 10101 10102 10103 10104 10105 10106 10107 10108 10109 10110 10111 10112 10113 10114 10115 10116 10117 10118 10119 10120 10121 10122 10123 10124 10125 10126 10127 10128 10129 10130 10131 10132 10133 10134 10135 10136 10137 10138 10139 10140 10141 10142 10143 10144 10145 10146 10147 10148 10149 10150 10151 10152 10153 10154 10155 10156 10157 10158 10159 10160 10161 10162 10163 10164 10165 10166 10167 10168 10169 10170 10171 10172 10173 10174 10175 10176 10177 10178 10179 10180 10181 10182 10183 10184 10185 10186 10187 10188 10189 10190 10191 10192 10193 10194 10195 10196 10197 10198 10199 10200 10201 10202 10203 10204 10205 10206 10207 10208 10209 10210 10211 10212 10213 10214 10215 10216 10217 10218 10219 10220 10221 10222 10223 10224 10225 10226 10227 10228 10229 10230 10231 10232 10233 10234 10235 10236 10237 10238 10239 10240 10241 10242 10243 10244 10245 10246 10247 10248 10249 10250 10251 10252 10253 10254 10255 10256 10257 10258 10259 10260 10261 10262 10263 10264 10265 10266 10267 10268 10269 10270 10271 10272 10273 10274 10275 10276 10277 10278 10279 10280 10281 10282 10283 10284 10285 10286 10287 10288 10289 10290 10291 10292 10293 10294 10295 10296 10297 10298 10299 10300 10301 10302 10303 10304 10305 10306 10307 10308 10309 10310 10311 10312 10313 10314 10315 10316 10317 10318 10319 10320 10321 10322 10323 10324 10325 10326 10327 10328 10329 10330 10331 10332 10333 10334 10335 10336 10337 10338 10339 10340 10341 10342 10343 10344 10345 10346 10347 10348 10349 10350 10351 10352 10353 10354 10355 10356 10357 10358 10359 10360 10361 10362 10363 10364 10365 10366 10367 10368 10369 10370 10371 10372 10373 10374 10375 10376 10377 10378 10379 10380 10381 10382 10383 10384 10385 10386 10387 10388 10389 10390 10391 10392 10393 10394 10395 10396 10397 10398 10399 10400 10401 10402 10403 10404 10405 10406 10407 10408 10409 10410 10411 10412 10413 10414 10415 10416 10417 10418 10419 10420 10421 10422 10423 10424 10425 10426 10427 10428 10429 10430 10431 10432 10433 10434 10435 10436 10437 10438 10439 10440 10441 10442 10443 10444 10445 10446 10447 10448 10449 10450 10451 10452 10453 10454 10455 10456 10457 10458 10459 10460 10461 10462 10463 10464 10465 10466 10467 10468 10469 10470 10471 10472 10473 10474 10475 10476 10477 10478 10479 10480 10481 10482 10483 10484 10485 10486 10487 10488 10489 10490 10491 10492 10493 10494 10495 10496 10497 10498 10499 10500 10501 10502 10503 10504 10505 10506 10507 10508 10509 10510 10511 10512 10513 10514 10515 10516 10517 10518 10519 10520 10521 10522 10523 10524 10525 10526 10527 10528 10529 10530 10531 10532 10533 10534 10535 10536 10537 10538 10539 10540 10541 10542 10543 10544 10545 10546 10547 10548 10549 10550 10551 10552 10553 10554 10555 10556 10557 10558 10559 10560 10561 10562 10563 10564 10565 10566 10567 10568 10569 10570 10571 10572 10573 10574 10575 10576 10577 10578 10579 10580 10581 10582 10583 10584 10585 10586 10587 10588 10589 10590 10591 10592 10593 10594 10595 10596 10597 10598 10599 10600 10601 10602 10603 10604 10605 10606 10607 10608 10609 10610 10611 10612 10613 10614 10615 10616 10617 10618 10619 10620 10621 10622 10623 10624 10625 10626 10627 10628 10629 10630 10631 10632 10633 10634 10635 10636 10637 10638 10639 10640 10641 10642 10643 10644 10645 10646 10647 10648 10649 10650 10651 10652 10653 10654 10655 10656 10657 10658 10659 10660 10661 10662 10663 10664 10665 10666 10667 10668 10669 10670 10671 10672 10673 10674 10675 10676 10677 10678 10679 10680 10681 10682 10683 10684 10685 10686 10687 10688 10689 10690 10691 10692 10693 10694 10695 10696 10697 10698 10699 10700 10701 10702 10703 10704 10705 10706 10707 10708 10709 10710 10711 10712 10713 10714 10715 10716 10717 10718 10719 10720 10721 10722 10723 10724 10725 10726 10727 10728 10729 10730 10731 10732 10733 10734 10735 10736 10737 10738 10739 10740 10741 10742 10743 10744 10745 10746 10747 10748 10749 10750 10751 10752 10753 10754 10755 10756 10757 10758 10759 10760 10761 10762 10763 10764 10765 10766 10767 10768 10769 10770 10771 10772 10773 10774 10775 10776 10777 10778 10779 10780 10781 10782 10783 10784 10785 10786 10787 10788 10789 10790 10791 10792 10793 10794 10795 10796 10797 10798 10799 10800 10801 10802 10803 10804 10805 10806 10807 10808 10809 10810 10811 10812 10813 10814 10815 10816 10817 10818 10819 10820 10821 10822 10823 10824 10825 10826 10827 10828 10829 10830 10831 10832 10833 10834 10835 10836 10837 10838 10839 10840 10841 10842 10843 10844 10845 10846 10847 10848 10849 10850 10851 10852 10853 10854 10855 10856 10857 10858 10859 10860 10861 10862 10863 10864 10865 10866 10867 10868 10869 10870 10871 10872 10873 10874 10875 10876 10877 10878 10879 10880 10881 10882 10883 10884 10885 10886 10887 10888 10889 10890 10891 10892 10893 10894 10895 10896 10897 10898 10899 10900 10901 10902 10903 10904 10905 10906 10907 10908 10909 10910 10911 10912 10913 10914 10915 10916 10917 10918 10919 10920 10921 10922 10923 10924 10925 10926 10927 10928 10929 10930 10931 10932 10933 10934 10935 10936 10937 10938 10939 10940 10941 10942 10943 10944 10945 10946 10947 10948 10949 10950 10951 10952 10953 10954 10955 10956 10957 10958 10959 10960 10961 10962 10963 10964 10965 10966 10967 10968 10969 10970 10971 10972 10973 10974 10975 10976 10977 10978 10979 10980 10981 10982 10983 10984 10985 10986 10987 10988 10989 10990 10991 10992 10993 10994 10995 10996 10997 10998 10999 11000 11001 11002 11003 11004 11005 11006 11007 11008 11009 11010 11011 11012 11013 11014 11015 11016 11017 11018 11019 11020 11021 11022 11023 11024 11025 11026 11027 11028 11029 11030 11031 11032 11033 11034 11035 11036 11037 11038 11039 11040 11041 11042 11043 11044 11045 11046 11047 11048 11049 11050 11051 11052 11053 11054 11055 11056 11057 11058 11059 11060 11061 11062 11063 11064 11065 11066 11067 11068 11069 11070 11071 11072 11073 11074 11075 11076 11077 11078 11079 11080 11081 11082 11083 11084 11085 11086 11087 11088 11089 11090 11091 11092 11093 11094 11095 11096 11097 11098 11099 11100 11101 11102 11103 11104 11105 11106 11107 11108 11109 11110 11111 11112 11113 11114 11115 11116 11117 11118 11119 11120 11121 11122 11123 11124 11125 11126 11127 11128 11129 11130 11131 11132 11133 11134 11135 11136 11137 11138 11139 11140 11141 11142 11143 11144 11145 11146 11147 11148 11149 11150 11151 11152 11153 11154 11155 11156 11157 11158 11159 11160 11161 11162 11163 11164 11165 11166 11167 11168 11169 11170 11171 11172 11173 11174 11175 11176 11177 11178 11179 11180 11181 11182 11183 11184 11185 11186 11187 11188 11189 11190 11191 11192 11193 11194 11195 11196 11197 11198 11199 11200 11201 11202 11203 11204 11205 11206 11207 11208 11209 11210 11211 11212 11213 11214 11215 11216 11217 11218 11219 11220 11221 11222 11223 11224 11225 11226 11227 11228 11229 11230 11231 11232 11233 11234 11235 11236 11237 11238 11239 11240 11241 11242 11243 11244 11245 11246 11247 11248 11249 11250 11251 11252 11253 11254 11255 11256 11257 11258 11259 11260 11261 11262 11263 11264 11265 11266 11267 11268 11269 11270 11271 11272 11273 11274 11275 11276 11277 11278 11279 11280 11281 11282 11283 11284 11285 11286 11287 11288 11289 11290 11291 11292 11293 11294 11295 11296 11297 11298 11299 11300 11301 11302 11303 11304 11305 11306 11307 11308 11309 11310 11311 11312 11313 11314 11315 11316 11317 11318 11319 11320 11321 11322 11323 11324 11325 11326 11327 11328 11329 11330 11331 11332 11333 11334 11335 11336 11337 11338 11339 11340 11341 11342 11343 11344 11345 11346 11347 11348 11349 11350 11351 11352 11353 11354 11355 11356 11357 11358 11359 11360 11361 11362 11363 11364 11365 11366 11367 11368 11369 11370 11371 11372 11373 11374 11375 11376 11377 11378 11379 11380 11381 11382 11383 11384 11385 11386 11387 11388 11389 11390 11391 11392 11393 11394 11395 11396 11397 11398 11399 11400 11401 11402 11403 11404 11405 11406 11407 11408 11409 11410 11411 11412 11413 11414 11415 11416 11417 11418 11419 11420 11421 11422 11423 11424 11425 11426 11427 11428 11429 11430 11431 11432 11433 11434 11435 11436 11437 11438 11439 11440 11441 11442 11443 11444 11445 11446 11447 11448 11449 11450 11451 11452 11453 11454 11455 11456 11457 11458 11459 11460 11461 11462 11463 11464 11465 11466 11467 11468 11469 11470 11471 11472 11473 11474 11475 11476 11477 11478 11479 11480 11481 11482 11483 11484 11485 11486 11487 11488 11489 11490 11491 11492 11493 11494 11495 11496 11497 11498 11499 11500 11501 11502 11503 11504 11505 11506 11507 11508 11509 11510 11511 11512 11513 11514 11515 11516 11517 11518 11519 11520 11521 11522 11523 11524 11525 11526 11527 11528 11529 11530 11531 11532 11533 11534 11535 11536 11537 11538 11539 11540 11541 11542 11543 11544 11545 11546 11547 11548 11549 11550 11551 11552 11553 11554 11555 11556 11557 11558 11559 11560 11561 11562 11563 11564 11565 11566 11567 11568 11569 11570 11571 11572 11573 11574 11575 11576 11577 11578 11579 11580 11581 11582 11583 11584 11585 11586 11587 11588 11589 11590 11591 11592 11593 11594 11595 11596 11597 11598 11599 11600 11601 11602 11603 11604 11605 11606 11607 11608 11609 11610 11611 11612 11613 11614 11615 11616 11617 11618 11619 11620 11621 11622 11623 11624 11625 11626 11627 11628 11629 11630 11631 11632 11633 11634 11635 11636 11637 11638 11639 11640 11641 11642 11643 11644 11645 11646 11647 11648 11649 11650 11651 11652 11653 11654 11655 11656 11657 11658 11659 11660 11661 11662 11663 11664 11665 11666 11667 11668 11669 11670 11671 11672 11673 11674 11675 11676 11677 11678 11679 11680 11681 11682 11683 11684 11685 11686 11687 11688 11689 11690 11691 11692 11693 11694 11695 11696 11697 11698 11699 11700 11701 11702 11703 11704 11705 11706 11707 11708 11709 11710 11711 11712 11713 11714 11715 11716 11717 11718 11719 11720 11721 11722 11723 11724 11725 11726 11727 11728 11729 11730 11731 11732 11733 11734 11735 11736 11737 11738 11739 11740 11741 11742 11743 11744 11745 11746 11747 11748 11749 11750 11751 11752 11753 11754 11755 11756 11757 11758 11759 11760 11761 11762 11763 11764 11765 11766 11767 11768 11769 11770 11771 11772 11773 11774 11775 11776 11777 11778 11779 11780 11781 11782 11783 11784 11785 11786 11787 11788 11789 11790 11791 11792 11793 11794 11795 11796 11797 11798 11799 11800 11801 11802 11803 11804 11805 11806 11807 11808 11809 11810 11811 11812 11813 11814 11815 11816 11817 11818 11819 11820 11821 11822 11823 11824 11825 11826 11827 11828 11829 11830 11831 11832 11833 11834 11835 11836 11837 11838 11839 11840 11841 11842 11843 11844 11845 11846 11847 11848 11849 11850 11851 11852 11853 11854 11855 11856 11857 11858 11859 11860 11861 11862 11863 11864 11865 11866 11867 11868 11869 11870 11871 11872 11873 11874 11875 11876 11877 11878 11879 11880 11881 11882 11883 11884 11885 11886 11887 11888 11889 11890 11891 11892 11893 11894 11895 11896 11897 11898 11899 11900 11901 11902 11903 11904 11905 11906 11907 11908 11909 11910 11911 11912 11913 11914 11915 11916 11917 11918 11919 11920 11921 11922 11923 11924 11925 11926 11927 11928 11929 11930 11931 11932 11933 11934 11935 11936 11937 11938 11939 11940 11941 11942 11943 11944 11945 11946 11947 11948 11949 11950 11951 11952 11953 11954 11955 11956 11957 11958 11959 11960 11961 11962 11963 11964 11965 11966 11967 11968 11969 11970 11971 11972 11973 11974 11975 11976 11977 11978 11979 11980 11981 11982 11983 11984 11985 11986 11987 11988 11989 11990 11991 11992 11993 11994 11995 11996 11997 11998 11999 12000 12001 12002 12003 12004 12005 12006 12007 12008 12009 12010 12011 12012 12013 12014 12015 12016 12017 12018 12019 12020 12021 12022 12023 12024 12025 12026 12027 12028 12029 12030 12031 12032 12033 12034 12035 12036 12037 12038 12039 12040 12041 12042 12043 12044 12045 12046 12047 12048 12049 12050 12051 12052 12053 12054 12055 12056 12057 12058 12059 12060 12061 12062 12063 12064 12065 12066 12067 12068 12069 12070 12071 12072 12073 12074 12075 12076 12077 12078 12079 12080 12081 12082 12083 12084 12085 12086 12087 12088 12089 12090 12091 12092 12093 12094 12095 12096 12097 12098 12099 12100 12101 12102 12103 12104 12105 12106 12107 12108 12109 12110 12111 12112 12113 12114 12115 12116 12117 12118 12119 12120 12121 12122 12123 12124 12125 12126 12127 12128 12129 12130 12131 12132 12133 12134 12135 12136 12137 12138 12139 12140 12141 12142 12143 12144 12145 12146 12147 12148 12149 12150 12151 12152 12153 12154 12155 12156 12157 12158 12159 12160 12161 12162 12163 12164 12165 12166 12167 12168 12169 12170 12171 12172 12173 12174 12175 12176 12177 12178 12179 12180 12181 12182 12183 12184 12185 12186 12187 12188 12189 12190 12191 12192 12193 12194 12195 12196 12197 12198 12199 12200 12201 12202 12203 12204 12205 12206 12207 12208 12209 12210 12211 12212 12213 12214 12215 12216 12217 12218 12219 12220 12221 12222 12223 12224 12225 12226 12227 12228 12229 12230 12231 12232 12233 12234 12235 12236 12237 12238 12239 12240 12241 12242 12243 12244 12245 12246 12247 12248 12249 12250 12251 12252 12253 12254 12255 12256 12257 12258 12259 12260 12261 12262 12263 12264 12265 12266 12267 12268 12269 12270 12271 12272 12273 12274 12275 12276 12277 12278 12279 12280 12281 12282 12283 12284 12285 12286 12287 12288 12289 12290 12291 12292 12293 12294 12295 12296 12297 12298 12299 12300 12301 12302 12303 12304 12305 12306 12307 12308 12309 12310 12311 12312 12313 12314 12315 12316 12317 12318 12319 12320 12321 12322 12323 12324 12325 12326 12327 12328 12329 12330 12331 12332 12333 12334 12335 12336 12337 12338 12339 12340 12341 12342 12343 12344 12345 12346 12347 12348 12349 12350 12351 12352 12353 12354 12355 12356 12357 12358 12359 12360 12361 12362 12363 12364 12365 12366 12367 12368 12369 12370 12371 12372 12373 12374 12375 12376 12377 12378 12379 12380 12381 12382 12383 12384 12385 12386 12387 12388 12389 12390 12391 12392 12393 12394 12395 12396 12397 12398 12399 12400 12401 12402 12403 12404 12405 12406 12407 12408 12409 12410 12411 12412 12413 12414 12415 12416 12417 12418 12419 12420 12421 12422 12423 12424 12425 12426 12427 12428 12429 12430 12431 12432 12433 12434 12435 12436 12437 12438 12439 12440 12441 12442 12443 12444 12445 12446 12447 12448 12449 12450 12451 12452 12453 12454 12455 12456 12457 12458 12459 12460 12461 12462 12463 12464 12465 12466 12467 12468 12469 12470 12471 12472 12473 12474 12475 12476 12477 12478 12479 12480 12481 12482 12483 12484 12485 12486 12487 12488 12489 12490 12491 12492 12493 12494 12495 12496 12497 12498 12499 12500 12501 12502 12503 12504 12505 12506 12507 12508 12509 12510 12511 12512 12513 12514 12515 12516 12517 12518 12519 12520 12521 12522 12523 12524 12525 12526 12527 12528 12529 12530 12531 12532 12533 12534 12535 12536 12537 12538 12539 12540 12541 12542 12543 12544 12545 12546 12547 12548 12549 12550 12551 12552 12553 12554 12555 12556 12557 12558 12559 12560 12561 12562 12563 12564 12565 12566 12567 12568 12569 12570 12571 12572 12573 12574 12575 12576 12577 12578 12579 12580 12581 12582 12583 12584 12585 12586 12587 12588 12589 12590 12591 12592 12593 12594 12595 12596 12597 12598 12599 12600 12601 12602 12603 12604 12605 12606 12607 12608 12609 12610 12611 12612 12613 12614 12615 12616 12617 12618 12619 12620 12621 12622 12623 12624 12625 12626 12627 12628 12629 12630 12631 12632 12633 12634 12635 12636 12637 12638 12639 12640 12641 12642 12643 12644 12645 12646 12647 12648 12649 12650 12651 12652 12653 12654 12655 12656 12657 12658 12659 12660 12661 12662 12663 12664 12665 12666 12667 12668 12669 12670 12671 12672 12673 12674 12675 12676 12677 12678 12679 12680 12681 12682 12683 12684 12685 12686 12687 12688 12689 12690 12691 12692 12693 12694 12695 12696 12697 12698 12699 12700 12701 12702 12703 12704 12705 12706 12707 12708 12709 12710 12711 12712 12713 12714 12715 12716 12717 12718 12719 12720 12721 12722 12723 12724 12725 12726 12727 12728 12729 12730 12731 12732 12733 12734 12735 12736 12737 12738 12739 12740 12741 12742 12743 12744 12745 12746 12747 12748 12749 12750 12751 12752 12753 12754 12755 12756 12757 12758 12759 12760 12761 12762 12763 12764 12765 12766 12767 12768 12769 12770 12771 12772 12773 12774 12775 12776 12777 12778 12779 12780 12781 12782 12783 12784 12785 12786 12787 12788 12789 12790 12791 12792 12793 12794 12795 12796 12797 12798 12799 12800 12801 12802 12803 12804 12805 12806 12807 12808 12809 12810 12811 12812 12813 12814 12815 12816 12817 12818 12819 12820 12821 12822 12823 12824 12825 12826 12827 12828 12829 12830 12831 12832 12833 12834 12835 12836 12837 12838 12839 12840 12841 12842 12843 12844 12845 12846 12847 12848 12849 12850 12851 12852 12853 12854 12855 12856 12857 12858 12859 12860 12861 12862 12863 12864 12865 12866 12867 12868 12869 12870 12871 12872 12873 12874 12875 12876 12877 12878 12879 12880 12881 12882 12883 12884 12885 12886 12887 12888 12889 12890 12891 12892 12893 12894 12895 12896 12897 12898 12899 12900 12901 12902 12903 12904 12905 12906 12907 12908 12909 12910 12911 12912 12913 12914 12915 12916 12917 12918 12919 12920 12921 12922 12923 12924 12925 12926 12927 12928 12929 12930 12931 12932 12933 12934 12935 12936 12937 12938 12939 12940 12941 12942 12943 12944 12945 12946 12947 12948 12949 12950 12951 12952 12953 12954 12955 12956 12957 12958 12959 12960 12961 12962 12963 12964 12965 12966 12967 12968 12969 12970 12971 12972 12973 12974 12975 12976 12977 12978 12979 12980 12981 12982 12983 12984 12985 12986 12987 12988 12989 12990 12991 12992 12993 12994 12995 12996 12997 12998 12999 13000 13001 13002 13003 13004 13005 13006 13007 13008 13009 13010 13011 13012 13013 13014 13015 13016 13017 13018 13019 13020 13021 13022 13023 13024 13025 13026 13027 13028 13029 13030 13031 13032 13033 13034 13035 13036 13037 13038 13039 13040 13041 13042 13043 13044 13045 13046 13047 13048 13049 13050 13051 13052 13053 13054 13055 13056 13057 13058 13059 13060 13061 13062 13063 13064 13065 13066 13067 13068 13069 13070 13071 13072 13073 13074 13075 13076 13077 13078 13079 13080 13081 13082 13083 13084 13085 13086 13087 13088 13089 13090 13091 13092 13093 13094 13095 13096 13097 13098 13099 13100 13101 13102 13103 13104 13105 13106 13107 13108 13109 13110 13111 13112 13113 13114 13115 13116 13117 13118 13119 13120 13121 13122 13123 13124 13125 13126 13127 13128 13129 13130 13131 13132 13133 13134 13135 13136 13137 13138 13139 13140 13141 13142 13143 13144 13145 13146 13147 13148 13149 13150 13151 13152 13153 13154 13155 13156 13157 13158 13159 13160 13161 13162 13163 13164 13165 13166 13167 13168 13169 13170 13171 13172 13173 13174 13175 13176 13177 13178 13179 13180 13181 13182 13183 13184 13185 13186 13187 13188 13189 13190 13191 13192 13193 13194 13195 13196 13197 13198 13199 13200 13201 13202 13203 13204 13205 13206 13207 13208 13209 13210 13211 13212 13213 13214 13215 13216 13217 13218 13219 13220 13221 13222 13223 13224 13225 13226 13227 13228 13229 13230 13231 13232 13233 13234 13235 13236 13237 13238 13239 13240 13241 13242 13243 13244 13245 13246 13247 13248 13249 13250 13251 13252 13253 13254 13255 13256 13257 13258 13259 13260 13261 13262 13263 13264 13265 13266 13267 13268 13269 13270 13271 13272 13273 13274 13275 13276 13277 13278 13279 13280 13281 13282 13283 13284 13285 13286 13287 13288 13289 13290 13291 13292 13293 13294 13295 13296 13297 13298 13299 13300 13301 13302 13303 13304 13305 13306 13307 13308 13309 13310 13311 13312 13313 13314 13315 13316 13317 13318 13319 13320 13321 13322 13323 13324 13325 13326 13327 13328 13329 13330 13331 13332 13333 13334 13335 13336 13337 13338 13339 13340 13341 13342 13343 13344 13345 13346 13347 13348 13349 13350 13351 13352 13353 13354 13355 13356 13357 13358 13359 13360 13361 13362 13363 13364 13365 13366 13367 13368 13369 13370 13371 13372 13373 13374 13375 13376 13377 13378 13379 13380 13381 13382 13383 13384 13385 13386 13387 13388 13389 13390 13391 13392 13393 13394 13395 13396 13397 13398 13399 13400 13401 13402 13403 13404 13405 13406 13407 13408 13409 13410 13411 13412 13413 13414 13415 13416 13417 13418 13419 13420 13421 13422 13423 13424 13425 13426 13427 13428 13429 13430 13431 13432 13433 13434 13435 13436 13437 13438 13439 13440 13441 13442 13443 13444 13445 13446 13447 13448 13449 13450 13451 13452 13453 13454 13455 13456 13457 13458 13459 13460 13461 13462 13463 13464 13465 13466 13467 13468 13469 13470 13471 13472 13473 13474 13475 13476 13477 13478 13479 13480 13481 13482 13483 13484 13485 13486 13487 13488 13489 13490 13491 13492 13493 13494 13495 13496 13497 13498 13499 13500 13501 13502 13503 13504 13505 13506 13507 13508 13509 13510 13511 13512 13513 13514 13515 13516 13517 13518 13519 13520 13521 13522 13523 13524 13525 13526 13527 13528 13529 13530 13531 13532 13533 13534 13535 13536 13537 13538 13539 13540 13541 13542 13543 13544 13545 13546 13547 13548 13549 13550 13551 13552 13553 13554 13555 13556 13557 13558 13559 13560 13561 13562 13563 13564 13565 13566 13567 13568 13569 13570 13571 13572 13573 13574 13575 13576 13577 13578 13579 13580 13581 13582 13583 13584 13585 13586 13587 13588 13589 13590 13591 13592 13593 13594 13595 13596 13597 13598 13599 13600 13601 13602 13603 13604 13605 13606 13607 13608 13609 13610 13611 13612 13613 13614 13615 13616 13617 13618 13619 13620 13621 13622 13623 13624 13625 13626 13627 13628 13629 13630 13631 13632 13633 13634 13635 13636 13637 13638 13639 13640 13641 13642 13643 13644 13645 13646 13647 13648 13649 13650 13651 13652 13653 13654 13655 13656 13657 13658 13659 13660 13661 13662 13663 13664 13665 13666 13667 13668 13669 13670 13671 13672 13673 13674 13675 13676 13677 13678 13679 13680 13681 13682 13683 13684 13685 13686 13687 13688 13689 13690 13691 13692 13693 13694 13695 13696 13697 13698 13699 13700 13701 13702 13703 13704 13705 13706 13707 13708 13709 13710 13711 13712 13713 13714 13715 13716 13717 13718 13719 13720 13721 13722 13723 13724 13725 13726 13727 13728 13729 13730 13731 13732 13733 13734 13735 13736 13737 13738 13739 13740 13741 13742 13743 13744 13745 13746 13747 13748 13749 13750 13751 13752 13753 13754 13755 13756 13757 13758 13759 13760 13761 13762 13763 13764 13765 13766 13767 13768 13769 13770 13771 13772 13773 13774 13775 13776 13777 13778 13779 13780 13781 13782 13783 13784 13785 13786 13787 13788 13789 13790 13791 13792 13793 13794 13795 13796 13797 13798 13799 13800 13801 13802 13803 13804 13805 13806 13807 13808 13809 13810 13811 13812 13813 13814 13815 13816 13817 13818 13819 13820 13821 13822 13823 13824 13825 13826 13827 13828 13829 13830 13831 13832 13833 13834 13835 13836 13837 13838 13839 13840 13841 13842 13843 13844 13845 13846 13847 13848 13849 13850 13851 13852 13853 13854 13855 13856 13857 13858 13859 13860 13861 13862 13863 13864 13865 13866 13867 13868 13869 13870 13871 13872 13873 13874 13875 13876 13877 13878 13879 13880 13881 13882 13883 13884 13885 13886 13887 13888 13889 13890 13891 13892 13893 13894 13895 13896 13897 13898 13899 13900 13901 13902 13903 13904 13905 13906 13907 13908 13909 13910 13911 13912 13913 13914 13915 13916 13917 13918 13919 13920 13921 13922 13923 13924 13925 13926 13927 13928 13929 13930 13931 13932 13933 13934 13935 13936 13937 13938 13939 13940 13941 13942 13943 13944 13945 13946 13947 13948 13949 13950 13951 13952 13953 13954 13955 13956 13957 13958 13959 13960 13961 13962 13963 13964 13965 13966 13967 13968 13969 13970 13971 13972 13973 13974 13975 13976 13977 13978 13979 13980 13981 13982 13983 13984 13985 13986 13987 13988 13989 13990 13991 13992 13993 13994 13995 13996 13997 13998 13999 14000 14001 14002 14003 14004 14005 14006 14007 14008 14009 14010 14011 14012 14013 14014 14015 14016 14017 14018 14019 14020 14021 14022 14023 14024 14025 14026 14027 14028 14029 14030 14031 14032 14033 14034 14035 14036 14037 14038 14039 14040 14041 14042 14043 14044 14045 14046 14047 14048 14049 14050 14051 14052 14053 14054 14055 14056 14057 14058 14059 14060 14061 14062 14063 14064 14065 14066 14067 14068 14069 14070 14071 14072 14073 14074 14075 14076 14077 14078 14079 14080 14081 14082 14083 14084 14085 14086 14087 14088 14089 14090 14091 14092 14093 14094 14095 14096 14097 14098 14099 14100 14101 14102 14103 14104 14105 14106 14107 14108 14109 14110 14111 14112 14113 14114 14115 14116 14117 14118 14119 14120 14121 14122 14123 14124 14125 14126 14127 14128 14129 14130 14131 14132 14133 14134 14135 14136 14137 14138 14139 14140 14141 14142 14143 14144 14145 14146 14147 14148 14149 14150 14151 14152 14153 14154 14155 14156 14157 14158 14159 14160 14161 14162 14163 14164 14165 14166 14167 14168 14169 14170 14171 14172 14173 14174 14175 14176 14177 14178 14179 14180 14181 14182 14183 14184 14185 14186 14187 14188 14189 14190 14191 14192 14193 14194 14195 14196 14197 14198 14199 14200 14201 14202 14203 14204 14205 14206 14207 14208 14209 14210 14211 14212 14213 14214 14215 14216 14217 14218 14219 14220 14221 14222 14223 14224 14225 14226 14227 14228 14229 14230 14231 14232 14233 14234 14235 14236 14237 14238 14239 14240 14241 14242 14243 14244 14245 14246 14247 14248 14249 14250 14251 14252 14253 14254 14255 14256 14257 14258 14259 14260 14261 14262 14263 14264 14265 14266 14267 14268 14269 14270 14271 14272 14273 14274 14275 14276 14277 14278 14279 14280 14281 14282 14283 14284 14285 14286 14287 14288 14289 14290 14291 14292 14293 14294 14295 14296 14297 14298 14299 14300 14301 14302 14303 14304 14305 14306 14307 14308 14309 14310 14311 14312 14313 14314 14315 14316 14317 14318 14319 14320 14321 14322 14323 14324 14325 14326 14327 14328 14329 14330 14331 14332 14333 14334 14335 14336 14337 14338 14339 14340 14341 14342 14343 14344 14345 14346 14347 14348 14349 14350 14351 14352 14353 14354 14355 14356 14357 14358 14359 14360 14361 14362 14363 14364 14365 14366 14367 14368 14369 14370 14371 14372 14373 14374 14375 14376 14377 14378 14379 14380 14381 14382 14383 14384 14385 14386 14387 14388 14389 14390 14391 14392 14393 14394 14395 14396 14397 14398 14399 14400 14401 14402 14403 14404 14405 14406 14407 14408 14409 14410 14411 14412 14413 14414 14415 14416 14417 14418 14419 14420 14421 14422 14423 14424 14425 14426 14427 14428 14429 14430 14431 14432 14433 14434 14435 14436 14437 14438 14439 14440 14441 14442 14443 14444 14445 14446 14447 14448 14449 14450 14451 14452 14453 14454 14455 14456 14457 14458 14459 14460 14461 14462 14463 14464 14465 14466 14467 14468 14469 14470 14471 14472 14473 14474 14475 14476 14477 14478 14479 14480 14481 14482 14483 14484 14485 14486 14487 14488 14489 14490 14491 14492 14493 14494 14495 14496 14497 14498 14499 14500 14501 14502 14503 14504 14505 14506 14507 14508 14509 14510 14511 14512 14513 14514 14515 14516 14517 14518 14519 14520 14521 14522 14523 14524 14525 14526 14527 14528 14529 14530 14531 14532 14533 14534 14535 14536 14537 14538 14539 14540 14541 14542 14543 14544 14545 14546 14547 14548 14549 14550 14551 14552 14553 14554 14555 14556 14557 14558 14559 14560 14561 14562 14563 14564 14565 14566 14567 14568 14569 14570 14571 14572 14573 14574 14575 14576 14577 14578 14579 14580 14581 14582 14583 14584 14585 14586 14587 14588 14589 14590 14591 14592 14593 14594 14595 14596 14597 14598 14599 14600 14601 14602 14603 14604 14605 14606 14607 14608 14609 14610 14611 14612 14613 14614 14615 14616 14617 14618 14619 14620 14621 14622 14623 14624 14625 14626 14627 14628 14629 14630 14631 14632 14633 14634 14635 14636 14637 14638 14639 14640 14641 14642 14643 14644 14645 14646 14647 14648 14649 14650 14651 14652 14653 14654 14655 14656 14657 14658 14659 14660 14661 14662 14663 14664 14665 14666 14667 14668 14669 14670 14671 14672 14673 14674 14675 14676 14677 14678 14679 14680 14681 14682 14683 14684 14685 14686 14687 14688 14689 14690 14691 14692 14693 14694 14695 14696 14697 14698 14699 14700 14701 14702 14703 14704 14705 14706 14707 14708 14709 14710 14711 14712 14713 14714 14715 14716 14717 14718 14719 14720 14721 14722 14723 14724 14725 14726 14727 14728 14729 14730 14731 14732 14733 14734 14735 14736 14737 14738 14739 14740 14741 14742 14743 14744 14745 14746 14747 14748 14749 14750 14751 14752 14753 14754 14755 14756 14757 14758 14759 14760 14761 14762 14763 14764 14765 14766 14767 14768 14769 14770 14771 14772 14773 14774 14775 14776 14777 14778 14779 14780 14781 14782 14783 14784 14785 14786 14787 14788 14789 14790 14791 14792 14793 14794 14795 14796 14797 14798 14799 14800 14801 14802 14803 14804 14805 14806 14807 14808 14809 14810 14811 14812 14813 14814 14815 14816 14817 14818 14819 14820 14821 14822 14823 14824 14825 14826 14827 14828 14829 14830 14831 14832 14833 14834 14835 14836 14837 14838 14839 14840 14841 14842 14843 14844 14845 14846 14847 14848 14849 14850 14851 14852 14853 14854 14855 14856 14857 14858 14859 14860 14861 14862 14863 14864 14865 14866 14867 14868 14869 14870 14871 14872 14873 14874 14875 14876 14877 14878 14879 14880 14881 14882 14883 14884 14885 14886 14887 14888 14889 14890 14891 14892 14893 14894 14895 14896 14897 14898 14899 14900 14901 14902 14903 14904 14905 14906 14907 14908 14909 14910 14911 14912 14913 14914 14915 14916 14917 14918 14919 14920 14921 14922 14923 14924 14925 14926 14927 14928 14929 14930 14931 14932 14933 14934 14935 14936 14937 14938 14939 14940 14941 14942 14943 14944 14945 14946 14947 14948 14949 14950 14951 14952 14953 14954 14955 14956 14957 14958 14959 14960 14961 14962 14963 14964 14965 14966 14967 14968 14969 14970 14971 14972 14973 14974 14975 14976 14977 14978 14979 14980 14981 14982 14983 14984 14985 14986 14987 14988 14989 14990 14991 14992 14993 14994 14995 14996 14997 14998 14999 15000 15001 15002 15003 15004 15005 15006 15007 15008 15009 15010 15011 15012 15013 15014 15015 15016 15017 15018 15019 15020 15021 15022 15023 15024 15025 15026 15027 15028 15029 15030 15031 15032 15033 15034 15035 15036 15037 15038 15039 15040 15041 15042 15043 15044 15045 15046 15047 15048 15049 15050 15051 15052 15053 15054 15055 15056 15057 15058 15059 15060 15061 15062 15063 15064 15065 15066 15067 15068 15069 15070 15071 15072 15073 15074 15075 15076 15077 15078 15079 15080 15081 15082 15083 15084 15085 15086 15087 15088 15089 15090 15091 15092 15093 15094 15095 15096 15097 15098 15099 15100 15101 15102 15103 15104 15105 15106 15107 15108 15109 15110 15111 15112 15113 15114 15115 15116 15117 15118 15119 15120 15121 15122 15123 15124 15125 15126 15127 15128 15129 15130 15131 15132 15133 15134 15135 15136 15137 15138 15139 15140 15141 15142 15143 15144 15145 15146 15147 15148 15149 15150 15151 15152 15153 15154 15155 15156 15157 15158 15159 15160 15161 15162 15163 15164 15165 15166 15167 15168 15169 15170 15171 15172 15173 15174 15175 15176 15177 15178 15179 15180 15181 15182 15183 15184 15185 15186 15187 15188 15189 15190 15191 15192 15193 15194 15195 15196 15197 15198 15199 15200 15201 15202 15203 15204 15205 15206 15207 15208 15209 15210 15211 15212 15213 15214 15215 15216 15217 15218 15219 15220 15221 15222 15223 15224 15225 15226 15227 15228 15229 15230 15231 15232 15233 15234 15235 15236 15237 15238 15239 15240 15241 15242 15243 15244 15245 15246 15247 15248 15249 15250 15251 15252 15253 15254 15255 15256 15257 15258 15259 15260 15261 15262 15263 15264 15265 15266 15267 15268 15269 15270 15271 15272 15273 15274 15275 15276 15277 15278 15279 15280 15281 15282 15283 15284 15285 15286 15287 15288 15289 15290 15291 15292 15293 15294 15295 15296 15297 15298 15299 15300 15301 15302 15303 15304 15305 15306 15307 15308 15309 15310 15311 15312 15313 15314 15315 15316 15317 15318 15319 15320 15321 15322 15323 15324 15325 15326 15327 15328 15329 15330 15331 15332 15333 15334 15335 15336 15337 15338 15339 15340 15341 15342 15343 15344 15345 15346 15347 15348 15349 15350 15351 15352 15353 15354 15355 15356 15357 15358 15359 15360 15361 15362 15363 15364 15365 15366 15367 15368 15369 15370 15371 15372 15373 15374 15375 15376 15377 15378 15379 15380 15381 15382 15383 15384 15385 15386 15387 15388 15389 15390 15391 15392 15393 15394 15395 15396 15397 15398 15399 15400 15401 15402 15403 15404 15405 15406 15407 15408 15409 15410 15411 15412 15413 15414 15415 15416 15417 15418 15419 15420 15421 15422 15423 15424 15425 15426 15427 15428 15429 15430 15431 15432 15433 15434 15435 15436 15437 15438 15439 15440 15441 15442 15443 15444 15445 15446 15447 15448 15449 15450 15451 15452 15453 15454 15455 15456 15457 15458 15459 15460 15461 15462 15463 15464 15465 15466 15467 15468 15469 15470 15471 15472 15473 15474 15475 15476 15477 15478 15479 15480 15481 15482 15483 15484 15485 15486 15487 15488 15489 15490 15491 15492 15493 15494 15495 15496 15497 15498 15499 15500 15501 15502 15503 15504 15505 15506 15507 15508 15509 15510 15511 15512 15513 15514 15515 15516 15517 15518 15519 15520 15521 15522 15523 15524 15525 15526 15527 15528 15529 15530 15531 15532 15533 15534 15535 15536 15537 15538 15539 15540 15541 15542 15543 15544 15545 15546 15547 15548 15549 15550 15551 15552 15553 15554 15555 15556 15557 15558 15559 15560 15561 15562 15563 15564 15565 15566 15567 15568 15569 15570 15571 15572 15573 15574 15575 15576 15577 15578 15579 15580 15581 15582 15583 15584 15585 15586 15587 15588 15589 15590 15591 15592 15593 15594 15595 15596 15597 15598 15599 15600 15601 15602 15603 15604 15605 15606 15607 15608 15609 15610 15611 15612 15613 15614 15615 15616 15617 15618 15619 15620 15621 15622 15623 15624 15625 15626 15627 15628 15629 15630 15631 15632 15633 15634 15635 15636 15637 15638 15639 15640 15641 15642 15643 15644 15645 15646 15647 15648 15649 15650 15651 15652 15653 15654 15655 15656 15657 15658 15659 15660 15661 15662 15663 15664 15665 15666 15667 15668 15669 15670 15671 15672 15673 15674 15675 15676 15677 15678 15679 15680 15681 15682 15683 15684 15685 15686 15687 15688 15689 15690 15691 15692 15693 15694 15695 15696 15697 15698 15699 15700 15701 15702 15703 15704 15705 15706 15707 15708 15709 15710 15711 15712 15713 15714 15715 15716 15717 15718 15719 15720 15721 15722 15723 15724 15725 15726 15727 15728 15729 15730 15731 15732 15733 15734 15735 15736 15737 15738 15739 15740 15741 15742 15743 15744 15745 15746 15747 15748 15749 15750 15751 15752 15753 15754 15755 15756 15757 15758 15759 15760 15761 15762 15763 15764 15765 15766 15767 15768 15769 15770 15771 15772 15773 15774 15775 15776 15777 15778 15779 15780 15781 15782 15783 15784 15785 15786 15787 15788 15789 15790 15791 15792 15793 15794 15795 15796 15797 15798 15799 15800 15801 15802 15803 15804 15805 15806 15807 15808 15809 15810 15811 15812 15813 15814 15815 15816 15817 15818 15819 15820 15821 15822 15823 15824 15825 15826 15827 15828 15829 15830 15831 15832 15833 15834 15835 15836 15837 15838 15839 15840 15841 15842 15843 15844 15845 15846 15847 15848 15849 15850 15851 15852 15853 15854 15855 15856 15857 15858 15859 15860 15861 15862 15863 15864 15865 15866 15867 15868 15869 15870 15871 15872 15873 15874 15875 15876 15877 15878 15879 15880 15881 15882 15883 15884 15885 15886 15887 15888 15889 15890 15891 15892 15893 15894 15895 15896 15897 15898 15899 15900 15901 15902 15903 15904 15905 15906 15907 15908 15909 15910 15911 15912 15913 15914 15915 15916 15917 15918 15919 15920 15921 15922 15923 15924 15925 15926 15927 15928 15929 15930 15931 15932 15933 15934 15935 15936 15937 15938 15939 15940 15941 15942 15943 15944 15945 15946 15947 15948 15949 15950 15951 15952 15953 15954 15955 15956 15957 15958 15959 15960 15961 15962 15963 15964 15965 15966 15967 15968 15969 15970 15971 15972 15973 15974 15975 15976 15977 15978 15979 15980 15981 15982 15983 15984 15985 15986 15987 15988 15989 15990 15991 15992 15993 15994 15995 15996 15997 15998 15999 16000 16001 16002 16003 16004 16005 16006 16007 16008 16009 16010 16011 16012 16013 16014 16015 16016 16017 16018 16019 16020 16021 16022 16023 16024 16025 16026 16027 16028 16029 16030 16031 16032 16033 16034 16035 16036 16037 16038 16039 16040 16041 16042 16043 16044 16045 16046 16047 16048 16049 16050 16051 16052 16053 16054 16055 16056 16057 16058 16059 16060 16061 16062 16063 16064 16065 16066 16067 16068 16069 16070 16071 16072 16073 16074 16075 16076 16077 16078 16079 16080 16081 16082 16083 16084 16085 16086 16087 16088 16089 16090 16091 16092 16093 16094 16095 16096 16097 16098 16099 16100 16101 16102 16103 16104 16105 16106 16107 16108 16109 16110 16111 16112 16113 16114 16115 16116 16117 16118 16119 16120 16121 16122 16123 16124 16125 16126 16127 16128 16129 16130 16131 16132 16133 16134 16135 16136 16137 16138 16139 16140 16141 16142 16143 16144 16145 16146 16147 16148 16149 16150 16151 16152 16153 16154 16155 16156 16157 16158 16159 16160 16161 16162 16163 16164 16165 16166 16167 16168 16169 16170 16171 16172 16173 16174 16175 16176 16177 16178 16179 16180 16181 16182 16183 16184 16185 16186 16187 16188 16189 16190 16191 16192 16193 16194 16195 16196 16197 16198 16199 16200 16201 16202 16203 16204 16205 16206 16207 16208 16209 16210 16211 16212 16213 16214 16215 16216 16217 16218 16219 16220 16221 16222 16223 16224 16225 16226 16227 16228 16229 16230 16231 16232 16233 16234 16235 16236 16237 16238 16239 16240 16241 16242 16243 16244 16245 16246 16247 16248 16249 16250 16251 16252 16253 16254 16255 16256 16257 16258 16259 16260 16261 16262 16263 16264 16265 16266 16267 16268 16269 16270 16271 16272 16273 16274 16275 16276 16277 16278 16279 16280 16281 16282 16283 16284 16285 16286 16287 16288 16289 16290 16291 16292 16293 16294 16295 16296 16297 16298 16299 16300 16301 16302 16303 16304 16305 16306 16307 16308 16309 16310 16311 16312 16313 16314 16315 16316 16317 16318 16319 16320 16321 16322 16323 16324 16325 16326 16327 16328 16329 16330 16331 16332 16333 16334 16335 16336 16337 16338 16339 16340 16341 16342 16343 16344 16345 16346 16347 16348 16349 16350 16351 16352 16353 16354 16355 16356 16357 16358 16359 16360 16361 16362 16363 16364 16365 16366 16367 16368 16369 16370 16371 16372 16373 16374 16375 16376 16377 16378 16379 16380 16381 16382 16383 16384 16385 16386 16387 16388 16389 16390 16391 16392 16393 16394 16395 16396 16397 16398 16399 16400 16401 16402 16403 16404 16405 16406 16407 16408 16409 16410 16411 16412 16413 16414 16415 16416 16417 16418 16419 16420 16421 16422 16423 16424 16425 16426 16427 16428 16429 16430 16431 16432 16433 16434 16435 16436 16437 16438 16439 16440 16441 16442 16443 16444 16445 16446 16447 16448 16449 16450 16451 16452 16453 16454 16455 16456 16457 16458 16459 16460 16461 16462 16463 16464 16465 16466 16467 16468 16469 16470 16471 16472 16473 16474 16475 16476 16477 16478 16479 16480 16481 16482 16483 16484 16485 16486 16487 16488 16489 16490 16491 16492 16493 16494 16495 16496 16497 16498 16499 16500 16501 16502 16503 16504 16505 16506 16507 16508 16509 16510 16511 16512 16513 16514 16515 16516 16517 16518 16519 16520 16521 16522 16523 16524 16525 16526 16527 16528 16529 16530 16531 16532 16533 16534 16535 16536 16537 16538 16539 16540 16541 16542 16543 16544 16545 16546 16547 16548 16549 16550 16551 16552 16553 16554 16555 16556 16557 16558 16559 16560 16561 16562 16563 16564 16565 16566 16567 16568 16569 16570 16571 16572 16573 16574 16575 16576 16577 16578 16579 16580 16581 16582 16583 16584 16585 16586 16587 16588 16589 16590 16591 16592 16593 16594 16595 16596 16597 16598 16599 16600 16601 16602 16603 16604 16605 16606 16607 16608 16609 16610 16611 16612 16613 16614 16615 16616 16617 16618 16619 16620 16621 16622 16623 16624 16625 16626 16627 16628 16629 16630 16631 16632 16633 16634 16635 16636 16637 16638 16639 16640 16641 16642 16643 16644 16645 16646 16647 16648 16649 16650 16651 16652 16653 16654 16655 16656 16657 16658 16659 16660 16661 16662 16663 16664 16665 16666 16667 16668 16669 16670 16671 16672 16673 16674 16675 16676 16677 16678 16679 16680 16681 16682 16683 16684 16685 16686 16687 16688 16689 16690 16691 16692 16693 16694 16695 16696 16697 16698 16699 16700 16701 16702 16703 16704 16705 16706 16707 16708 16709 16710 16711 16712 16713 16714 16715 16716 16717 16718 16719 16720 16721 16722 16723 16724 16725 16726 16727 16728 16729 16730 16731 16732 16733 16734 16735 16736 16737 16738 16739 16740 16741 16742 16743 16744 16745 16746 16747 16748 16749 16750 16751 16752 16753 16754 16755 16756 16757 16758 16759 16760 16761 16762 16763 16764 16765 16766 16767 16768 16769 16770 16771 16772 16773 16774 16775 16776 16777 16778 16779 16780 16781 16782 16783 16784 16785 16786 16787 16788 16789 16790 16791 16792 16793 16794 16795 16796 16797 16798 16799 16800 16801 16802 16803 16804 16805 16806 16807 16808 16809 16810 16811 16812 16813 16814 16815 16816 16817 16818 16819 16820 16821 16822 16823 16824 16825 16826 16827 16828 16829 16830 16831 16832 16833 16834 16835 16836 16837 16838 16839 16840 16841 16842 16843 16844 16845 16846 16847 16848 16849 16850 16851 16852 16853 16854 16855 16856 16857 16858 16859 16860 16861 16862 16863 16864 16865 16866 16867 16868 16869 16870 16871 16872 16873 16874 16875 16876 16877 16878 16879 16880 16881 16882 16883 16884 16885 16886 16887 16888 16889 16890 16891 16892 16893 16894 16895 16896 16897 16898 16899 16900 16901 16902 16903 16904 16905 16906 16907 16908 16909 16910 16911 16912 16913 16914 16915 16916 16917 16918 16919 16920 16921 16922 16923 16924 16925 16926 16927 16928 16929 16930 16931 16932 16933 16934 16935 16936 16937 16938 16939 16940 16941 16942 16943 16944 16945 16946 16947 16948 16949 16950 16951 16952 16953 16954 16955 16956 16957 16958 16959 16960 16961 16962 16963 16964 16965 16966 16967 16968 16969 16970 16971 16972 16973 16974 16975 16976 16977 16978 16979 16980 16981 16982 16983 16984 16985 16986 16987 16988 16989 16990 16991 16992 16993 16994 16995 16996 16997 16998 16999 17000 17001 17002 17003 17004 17005 17006 17007 17008 17009 17010 17011 17012 17013 17014 17015 17016 17017 17018 17019 17020 17021 17022 17023 17024 17025 17026 17027 17028 17029 17030 17031 17032 17033 17034 17035 17036 17037 17038 17039 17040 17041 17042 17043 17044 17045 17046 17047 17048 17049 17050 17051 17052 17053 17054 17055 17056 17057 17058 17059 17060 17061 17062 17063 17064 17065 17066 17067 17068 17069 17070 17071 17072 17073 17074 17075 17076 17077 17078 17079 17080 17081 17082 17083 17084 17085 17086 17087 17088 17089 17090 17091 17092 17093 17094 17095 17096 17097 17098 17099 17100 17101 17102 17103 17104 17105 17106 17107 17108 17109 17110 17111 17112 17113 17114 17115 17116 17117 17118 17119 17120 17121 17122 17123 17124 17125 17126 17127 17128 17129 17130 17131 17132 17133 17134 17135 17136 17137 17138 17139 17140 17141 17142 17143 17144 17145 17146 17147 17148 17149 17150 17151 17152 17153 17154 17155 17156 17157 17158 17159 17160 17161 17162 17163 17164 17165 17166 17167 17168 17169 17170 17171 17172 17173 17174 17175 17176 17177 17178 17179 17180 17181 17182 17183 17184 17185 17186 17187 17188 17189 17190 17191 17192 17193 17194 17195 17196 17197 17198 17199 17200 17201 17202 17203 17204 17205 17206 17207 17208 17209 17210 17211 17212 17213 17214 17215 17216 17217 17218 17219 17220 17221 17222 17223 17224 17225 17226 17227 17228 17229 17230 17231 17232 17233 17234 17235 17236 17237 17238 17239 17240 17241 17242 17243 17244 17245 17246 17247 17248 17249 17250 17251 17252 17253 17254 17255 17256 17257 17258 17259 17260 17261 17262 17263 17264 17265 17266 17267 17268 17269 17270 17271 17272 17273 17274 17275 17276 17277 17278 17279 17280 17281 17282 17283 17284 17285 17286 17287 17288 17289 17290 17291 17292 17293 17294 17295 17296 17297 17298 17299 17300 17301 17302 17303 17304 17305 17306 17307 17308 17309 17310 17311 17312 17313 17314 17315 17316 17317 17318 17319 17320 17321 17322 17323 17324 17325 17326 17327 17328 17329 17330 17331 17332 17333 17334 17335 17336 17337 17338 17339 17340 17341 17342 17343 17344 17345 17346 17347 17348 17349 17350 17351 17352 17353 17354 17355 17356 17357 17358 17359 17360 17361 17362 17363 17364 17365 17366 17367 17368 17369 17370 17371 17372 17373 17374 17375 17376 17377 17378 17379 17380 17381 17382 17383 17384 17385 17386 17387 17388 17389 17390 17391 17392 17393 17394 17395 17396 17397 17398 17399 17400 17401 17402 17403 17404 17405 17406 17407 17408 17409 17410 17411 17412 17413 17414 17415 17416 17417 17418 17419 17420 17421 17422 17423 17424 17425 17426 17427 17428 17429 17430 17431 17432 17433 17434 17435 17436 17437 17438 17439 17440 17441 17442 17443 17444 17445 17446 17447 17448 17449 17450 17451 17452 17453 17454 17455 17456 17457 17458 17459 17460 17461 17462 17463 17464 17465 17466 17467 17468 17469 17470 17471 17472 17473 17474 17475 17476 17477 17478 17479 17480 17481 17482 17483 17484 17485 17486 17487 17488 17489 17490 17491 17492 17493 17494 17495 17496 17497 17498 17499 17500 17501 17502 17503 17504 17505 17506 17507 17508 17509 17510 17511 17512 17513 17514 17515 17516 17517 17518 17519 17520 17521 17522 17523 17524 17525 17526 17527 17528 17529 17530 17531 17532 17533 17534 17535 17536 17537 17538 17539 17540 17541 17542 17543 17544 17545 17546 17547 17548 17549 17550 17551 17552 17553 17554 17555 17556 17557 17558 17559 17560 17561 17562 17563 17564 17565 17566 17567 17568 17569 17570 17571 17572 17573 17574 17575 17576 17577 17578 17579 17580 17581 17582 17583 17584 17585 17586 17587 17588 17589 17590 17591 17592 17593 17594 17595 17596 17597 17598 17599 17600 17601 17602 17603 17604 17605 17606 17607 17608 17609 17610 17611 17612 17613 17614 17615 17616 17617 17618 17619 17620 17621 17622 17623 17624 17625 17626 17627 17628 17629 17630 17631 17632 17633 17634 17635 17636 17637 17638 17639 17640 17641 17642 17643 17644 17645 17646 17647 17648 17649 17650 17651 17652 17653 17654 17655 17656 17657 17658 17659 17660 17661 17662 17663 17664 17665 17666 17667 17668 17669 17670 17671 17672 17673 17674 17675 17676 17677 17678 17679 17680 17681 17682 17683 17684 17685 17686 17687 17688 17689 17690 17691 17692 17693 17694 17695 17696 17697 17698 17699 17700 17701 17702 17703 17704 17705 17706 17707 17708 17709 17710 17711 17712 17713 17714 17715 17716 17717 17718 17719 17720 17721 17722 17723 17724 17725 17726 17727 17728 17729 17730 17731 17732 17733 17734 17735 17736 17737 17738 17739 17740 17741 17742 17743 17744 17745 17746 17747 17748 17749 17750 17751 17752 17753 17754 17755 17756 17757 17758 17759 17760 17761 17762 17763 17764 17765 17766 17767 17768 17769 17770 17771 17772 17773 17774 17775 17776 17777 17778 17779 17780 17781 17782 17783 17784 17785 17786 17787 17788 17789 17790 17791 17792 17793 17794 17795 17796 17797 17798 17799 17800 17801 17802 17803 17804 17805 17806 17807 17808 17809 17810 17811 17812 17813 17814 17815 17816 17817 17818 17819 17820 17821 17822 17823 17824 17825 17826 17827 17828 17829 17830 17831 17832 17833 17834 17835 17836 17837 17838 17839 17840 17841 17842 17843 17844 17845 17846 17847 17848 17849 17850 17851 17852 17853 17854 17855 17856 17857 17858 17859 17860 17861 17862 17863 17864 17865 17866 17867 17868 17869 17870 17871 17872 17873 17874 17875 17876 17877 17878 17879 17880 17881 17882 17883 17884 17885 17886 17887 17888 17889 17890 17891 17892 17893 17894 17895 17896 17897 17898 17899 17900 17901 17902 17903 17904 17905 17906 17907 17908 17909 17910 17911 17912 17913 17914 17915 17916 17917 17918 17919 17920 17921 17922 17923 17924 17925 17926 17927 17928 17929 17930 17931 17932 17933 17934 17935 17936 17937 17938 17939 17940 17941 17942 17943 17944 17945 17946 17947 17948 17949 17950 17951 17952 17953 17954 17955 17956 17957 17958 17959 17960 17961 17962 17963 17964 17965 17966 17967 17968 17969 17970 17971 17972 17973 17974 17975 17976 17977 17978 17979 17980 17981 17982 17983 17984 17985 17986 17987 17988 17989 17990 17991 17992 17993 17994 17995 17996 17997 17998 17999 18000 18001 18002 18003 18004 18005 18006 18007 18008 18009 18010 18011 18012 18013 18014 18015 18016 18017 18018 18019 18020 18021 18022 18023 18024 18025 18026 18027 18028 18029 18030 18031 18032 18033 18034 18035 18036 18037 18038 18039 18040 18041 18042 18043 18044 18045 18046 18047 18048 18049 18050 18051 18052 18053 18054 18055 18056 18057 18058 18059 18060 18061 18062 18063 18064 18065 18066 18067 18068 18069 18070 18071 18072 18073 18074 18075 18076 18077 18078 18079 18080 18081 18082 18083 18084 18085 18086 18087 18088 18089 18090 18091 18092 18093 18094 18095 18096 18097 18098 18099 18100 18101 18102 18103 18104 18105 18106 18107 18108 18109 18110 18111 18112 18113 18114 18115 18116 18117 18118 18119 18120 18121 18122 18123 18124 18125 18126 18127 18128 18129 18130 18131 18132 18133 18134 18135 18136 18137 18138 18139 18140 18141 18142 18143 18144 18145 18146 18147 18148 18149 18150 18151 18152 18153 18154 18155 18156 18157 18158 18159 18160 18161 18162 18163 18164 18165 18166 18167 18168 18169 18170 18171 18172 18173 18174 18175 18176 18177 18178 18179 18180 18181 18182 18183 18184 18185 18186 18187 18188 18189 18190 18191 18192 18193 18194 18195 18196 18197 18198 18199 18200 18201 18202 18203 18204 18205 18206 18207 18208 18209 18210 18211 18212 18213 18214 18215 18216 18217 18218 18219 18220 18221 18222 18223 18224 18225 18226 18227 18228 18229 18230 18231 18232 18233 18234 18235 18236 18237 18238 18239 18240 18241 18242 18243 18244 18245 18246 18247 18248 18249 18250 18251 18252 18253 18254 18255 18256 18257 18258 18259 18260 18261 18262 18263 18264 18265 18266 18267 18268 18269 18270 18271 18272 18273 18274 18275 18276 18277 18278 18279 18280 18281 18282 18283 18284 18285 18286 18287 18288 18289 18290 18291 18292 18293 18294 18295 18296 18297 18298 18299 18300 18301 18302 18303 18304 18305 18306 18307 18308 18309 18310 18311 18312 18313 18314 18315 18316 18317 18318 18319 18320 18321 18322 18323 18324 18325 18326 18327 18328 18329 18330 18331 18332 18333 18334 18335 18336 18337 18338 18339 18340 18341 18342 18343 18344 18345 18346 18347 18348 18349 18350 18351 18352 18353 18354 18355 18356 18357 18358 18359 18360 18361 18362 18363 18364 18365 18366 18367 18368 18369 18370 18371 18372 18373 18374 18375 18376 18377 18378 18379 18380 18381 18382 18383 18384 18385 18386 18387 18388 18389 18390 18391 18392 18393 18394 18395 18396 18397 18398 18399 18400 18401 18402 18403 18404 18405 18406 18407 18408 18409 18410 18411 18412 18413 18414 18415 18416 18417 18418 18419 18420 18421 18422 18423 18424 18425 18426 18427 18428 18429 18430 18431 18432 18433 18434 18435 18436 18437 18438 18439 18440 18441 18442 18443 18444 18445 18446
/*
Copyright (c) 2021 MOSEK ApS. All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
3. All advertising materials mentioning features or use of this software must
display the following acknowledgement:
This product includes software developed by the the organization.
4. Neither the name of the copyright holder nor the names of its contributors
may be used to endorse or promote products derived from this software without
specific prior written permission.
THIS SOFTWARE IS PROVIDED BY COPYRIGHT HOLDER "AS IS" AND ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL COPYRIGHT
HOLDER BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
DAMAGE.
*/
/// MOSEK Solver API for Rust.
///
/// Most functionality is provided through the [Task] object and it's
/// member functions.
// Generted for MOSEK v[10, 1, 27]
extern crate libc;
use std::ffi::CString;
use std::ffi::CStr;
use libc::c_void;
use std::convert::TryInto;
use std::default::Default;
use std::marker::Send;
//#[link(name = "mosek64")]
extern {
fn MSK_linkfunctotaskstream(task : * const u8,
whichstream : i32,
handle : * const c_void,
func : extern fn (handle : * const c_void, msg : * const libc::c_char)) -> i32;
fn MSK_putcallbackfunc(task : * const u8,
func : extern fn (task : * const u8, handle : * const c_void, caller : i32, douinf : * const f64, intinf : * const i32, lintinf : * const i64) -> i32,
handle : * const c_void) -> i32;
#[link_name = "MSK_putcallbackfunc"]
#[allow(clashing_extern_declarations)]
fn MSK_putcallbackfunc_ptr(task : * const u8,
func : * const u8,
handle : * const c_void) -> i32;
fn MSK_getcallbackfunc(task : * const u8,
func : * mut * const u8,
handle : * mut * const c_void) -> i32;
fn MSK_getlasterror64(task : * const u8,
lastreacode : * mut i32,
sizelastmsg : i64,
lastmsglen : * mut i64,
lastmsg : * mut u8) -> i32;
fn MSK_writedatahandle(task : * const u8,
func : extern fn (handle : * const c_void, src : * const u8, count : usize) -> usize,
handle : * const c_void,
format : i32,
compress : i32) -> i32;
#[allow(dead_code)]
fn MSK_analyzenames(task_ : * const u8,whichstream_ : i32,nametype_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_analyzeproblem(task_ : * const u8,whichstream_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_analyzesolution(task_ : * const u8,whichstream_ : i32,whichsol_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_appendacc(task_ : * const u8,domidx_ : i64,numafeidx_ : i64,afeidxlist_ : * const i64,b_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_appendaccs(task_ : * const u8,numaccs_ : i64,domidxs_ : * const i64,numafeidx_ : i64,afeidxlist_ : * const i64,b_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_appendaccseq(task_ : * const u8,domidx_ : i64,numafeidx_ : i64,afeidxfirst_ : i64,b_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_appendaccsseq(task_ : * const u8,numaccs_ : i64,domidxs_ : * const i64,numafeidx_ : i64,afeidxfirst_ : i64,b_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_appendafes(task_ : * const u8,num_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_appendbarvars(task_ : * const u8,num_ : i32,dim_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_appendcone(task_ : * const u8,ct_ : i32,conepar_ : f64,nummem_ : i32,submem_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_appendconeseq(task_ : * const u8,ct_ : i32,conepar_ : f64,nummem_ : i32,j_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_appendconesseq(task_ : * const u8,num_ : i32,ct_ : * const i32,conepar_ : * const f64,nummem_ : * const i32,j_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_appendcons(task_ : * const u8,num_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_appenddjcs(task_ : * const u8,num_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_appenddualexpconedomain(task_ : * const u8,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appenddualgeomeanconedomain(task_ : * const u8,n_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appenddualpowerconedomain(task_ : * const u8,n_ : i64,nleft_ : i64,alpha_ : * const f64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendprimalexpconedomain(task_ : * const u8,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendprimalgeomeanconedomain(task_ : * const u8,n_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendprimalpowerconedomain(task_ : * const u8,n_ : i64,nleft_ : i64,alpha_ : * const f64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendquadraticconedomain(task_ : * const u8,n_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendrdomain(task_ : * const u8,n_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendrminusdomain(task_ : * const u8,n_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendrplusdomain(task_ : * const u8,n_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendrquadraticconedomain(task_ : * const u8,n_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendrzerodomain(task_ : * const u8,n_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendsparsesymmat(task_ : * const u8,dim_ : i32,nz_ : i64,subi_ : * const i32,subj_ : * const i32,valij_ : * const f64,idx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendsparsesymmatlist(task_ : * const u8,num_ : i32,dims_ : * const i32,nz_ : * const i64,subi_ : * const i32,subj_ : * const i32,valij_ : * const f64,idx_ : * mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendsvecpsdconedomain(task_ : * const u8,n_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_appendvars(task_ : * const u8,num_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_asyncgetlog(task_ : * const u8,addr_ : * const libc::c_char,accesstoken_ : * const libc::c_char,token_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_asyncgetresult(task_ : * const u8,address_ : * const libc::c_char,accesstoken_ : * const libc::c_char,token_ : * const libc::c_char,respavailable_ : & mut i32,resp_ : &mut i32,trm_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_asyncoptimize(task_ : * const u8,address_ : * const libc::c_char,accesstoken_ : * const libc::c_char,token : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_asyncpoll(task_ : * const u8,address_ : * const libc::c_char,accesstoken_ : * const libc::c_char,token_ : * const libc::c_char,respavailable_ : & mut i32,resp_ : &mut i32,trm_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_asyncstop(task_ : * const u8,address_ : * const libc::c_char,accesstoken_ : * const libc::c_char,token_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_basiscond(task_ : * const u8,nrmbasis_ : & mut f64,nrminvbasis_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_bktostr(task_ : * const u8,bk_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_checkmemtask(task_ : * const u8,file_ : * const libc::c_char,line_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_chgconbound(task_ : * const u8,i_ : i32,lower_ : i32,finite_ : i32,value_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_chgvarbound(task_ : * const u8,j_ : i32,lower_ : i32,finite_ : i32,value_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_clonetask(task_ : * const u8,clonedtask_ : & mut * const u8) -> i32;
#[allow(dead_code)]
fn MSK_commitchanges(task_ : * const u8) -> i32;
#[allow(dead_code)]
fn MSK_conetypetostr(task_ : * const u8,ct_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_deletesolution(task_ : * const u8,whichsol_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_deletetask(task_ : & mut * const u8) -> i32;
#[allow(dead_code)]
fn MSK_dualsensitivity(task_ : * const u8,numj_ : i32,subj_ : * const i32,leftpricej_ : * mut f64,rightpricej_ : * mut f64,leftrangej_ : * mut f64,rightrangej_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_emptyafebarfrow(task_ : * const u8,afeidx_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_emptyafebarfrowlist(task_ : * const u8,numafeidx_ : i64,afeidxlist_ : * const i64) -> i32;
#[allow(dead_code)]
fn MSK_emptyafefcol(task_ : * const u8,varidx_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_emptyafefcollist(task_ : * const u8,numvaridx_ : i64,varidx_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_emptyafefrow(task_ : * const u8,afeidx_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_emptyafefrowlist(task_ : * const u8,numafeidx_ : i64,afeidx_ : * const i64) -> i32;
#[allow(dead_code)]
fn MSK_evaluateacc(task_ : * const u8,whichsol_ : i32,accidx_ : i64,activity_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_evaluateaccs(task_ : * const u8,whichsol_ : i32,activity_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_freetask(task_ : * const u8,buffer_ : *mut u8) -> i32;
#[allow(dead_code)]
fn MSK_generateaccnames(task_ : * const u8,num_ : i64,sub_ : * const i64,fmt_ : * const libc::c_char,ndims_ : i32,dims_ : * const i32,sp_ : * const i64,numnamedaxis_ : i32,namedaxisidxs_ : * const i32,numnames_ : i64,names_ : * const * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_generatebarvarnames(task_ : * const u8,num_ : i32,subj_ : * const i32,fmt_ : * const libc::c_char,ndims_ : i32,dims_ : * const i32,sp_ : * const i64,numnamedaxis_ : i32,namedaxisidxs_ : * const i32,numnames_ : i64,names_ : * const * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_generateconenames(task_ : * const u8,num_ : i32,subk_ : * const i32,fmt_ : * const libc::c_char,ndims_ : i32,dims_ : * const i32,sp_ : * const i64,numnamedaxis_ : i32,namedaxisidxs_ : * const i32,numnames_ : i64,names_ : * const * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_generateconnames(task_ : * const u8,num_ : i32,subi_ : * const i32,fmt_ : * const libc::c_char,ndims_ : i32,dims_ : * const i32,sp_ : * const i64,numnamedaxis_ : i32,namedaxisidxs_ : * const i32,numnames_ : i64,names_ : * const * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_generatedjcnames(task_ : * const u8,num_ : i64,sub_ : * const i64,fmt_ : * const libc::c_char,ndims_ : i32,dims_ : * const i32,sp_ : * const i64,numnamedaxis_ : i32,namedaxisidxs_ : * const i32,numnames_ : i64,names_ : * const * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_generatevarnames(task_ : * const u8,num_ : i32,subj_ : * const i32,fmt_ : * const libc::c_char,ndims_ : i32,dims_ : * const i32,sp_ : * const i64,numnamedaxis_ : i32,namedaxisidxs_ : * const i32,numnames_ : i64,names_ : * const * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_getaccafeidxlist(task_ : * const u8,accidx_ : i64,afeidxlist_ : * mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getaccb(task_ : * const u8,accidx_ : i64,b_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getaccbarfblocktriplet(task_ : * const u8,maxnumtrip_ : i64,numtrip_ : & mut i64,acc_afe_ : * mut i64,bar_var_ : * mut i32,blk_row_ : * mut i32,blk_col_ : * mut i32,blk_val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getaccbarfnumblocktriplets(task_ : * const u8,numtrip_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getaccdomain(task_ : * const u8,accidx_ : i64,domidx_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getaccdoty(task_ : * const u8,whichsol_ : i32,accidx_ : i64,doty_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getaccdotys(task_ : * const u8,whichsol_ : i32,doty_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getaccfnumnz(task_ : * const u8,accfnnz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getaccftrip(task_ : * const u8,frow_ : * mut i64,fcol_ : * mut i32,fval_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getaccgvector(task_ : * const u8,g_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getaccn(task_ : * const u8,accidx_ : i64,n_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getaccname(task_ : * const u8,accidx_ : i64,sizename_ : i32,name : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getaccnamelen(task_ : * const u8,accidx_ : i64,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getaccntot(task_ : * const u8,n_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getaccs(task_ : * const u8,domidxlist_ : * mut i64,afeidxlist_ : * mut i64,b_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getacol(task_ : * const u8,j_ : i32,nzj_ : & mut i32,subj_ : * mut i32,valj_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getacolnumnz(task_ : * const u8,i_ : i32,nzj_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getacolslice(task_ : * const u8,first_ : i32,last_ : i32,maxnumnz_ : i32,ptrb_ : * mut i32,ptre_ : * mut i32,sub_ : * mut i32,val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getacolslice64(task_ : * const u8,first_ : i32,last_ : i32,maxnumnz_ : i64,ptrb_ : * mut i64,ptre_ : * mut i64,sub_ : * mut i32,val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getacolslicenumnz(task_ : * const u8,first_ : i32,last_ : i32,numnz_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getacolslicenumnz64(task_ : * const u8,first_ : i32,last_ : i32,numnz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getacolslicetrip(task_ : * const u8,first_ : i32,last_ : i32,maxnumnz_ : i64,subi_ : * mut i32,subj_ : * mut i32,val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getafebarfblocktriplet(task_ : * const u8,maxnumtrip_ : i64,numtrip_ : & mut i64,afeidx_ : * mut i64,barvaridx_ : * mut i32,subk_ : * mut i32,subl_ : * mut i32,valkl_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getafebarfnumblocktriplets(task_ : * const u8,numtrip_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getafebarfnumrowentries(task_ : * const u8,afeidx_ : i64,numentr_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getafebarfrow(task_ : * const u8,afeidx_ : i64,barvaridx_ : * mut i32,ptrterm_ : * mut i64,numterm_ : * mut i64,termidx_ : * mut i64,termweight_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getafebarfrowinfo(task_ : * const u8,afeidx_ : i64,numentr_ : & mut i32,numterm_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getafefnumnz(task_ : * const u8,numnz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getafefrow(task_ : * const u8,afeidx_ : i64,numnz_ : & mut i32,varidx_ : * mut i32,val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getafefrownumnz(task_ : * const u8,afeidx_ : i64,numnz_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getafeftrip(task_ : * const u8,afeidx_ : * mut i64,varidx_ : * mut i32,val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getafeg(task_ : * const u8,afeidx_ : i64,g_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getafegslice(task_ : * const u8,first_ : i64,last_ : i64,g_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getaij(task_ : * const u8,i_ : i32,j_ : i32,aij_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getapiecenumnz(task_ : * const u8,firsti_ : i32,lasti_ : i32,firstj_ : i32,lastj_ : i32,numnz_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getarow(task_ : * const u8,i_ : i32,nzi_ : & mut i32,subi_ : * mut i32,vali_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getarownumnz(task_ : * const u8,i_ : i32,nzi_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getarowslice(task_ : * const u8,first_ : i32,last_ : i32,maxnumnz_ : i32,ptrb_ : * mut i32,ptre_ : * mut i32,sub_ : * mut i32,val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getarowslice64(task_ : * const u8,first_ : i32,last_ : i32,maxnumnz_ : i64,ptrb_ : * mut i64,ptre_ : * mut i64,sub_ : * mut i32,val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getarowslicenumnz(task_ : * const u8,first_ : i32,last_ : i32,numnz_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getarowslicenumnz64(task_ : * const u8,first_ : i32,last_ : i32,numnz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getarowslicetrip(task_ : * const u8,first_ : i32,last_ : i32,maxnumnz_ : i64,subi_ : * mut i32,subj_ : * mut i32,val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getatrip(task_ : * const u8,maxnumnz_ : i64,subi_ : * mut i32,subj_ : * mut i32,val_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getatruncatetol(task_ : * const u8,tolzero_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getbarablocktriplet(task_ : * const u8,maxnum_ : i64,num_ : & mut i64,subi_ : * mut i32,subj_ : * mut i32,subk_ : * mut i32,subl_ : * mut i32,valijkl_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getbaraidx(task_ : * const u8,idx_ : i64,maxnum_ : i64,i_ : & mut i32,j_ : & mut i32,num_ : & mut i64,sub_ : * mut i64,weights_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getbaraidxij(task_ : * const u8,idx_ : i64,i_ : & mut i32,j_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getbaraidxinfo(task_ : * const u8,idx_ : i64,num_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getbarasparsity(task_ : * const u8,maxnumnz_ : i64,numnz_ : & mut i64,idxij_ : * mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getbarcblocktriplet(task_ : * const u8,maxnum_ : i64,num_ : & mut i64,subj_ : * mut i32,subk_ : * mut i32,subl_ : * mut i32,valjkl_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getbarcidx(task_ : * const u8,idx_ : i64,maxnum_ : i64,j_ : & mut i32,num_ : & mut i64,sub_ : * mut i64,weights_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getbarcidxinfo(task_ : * const u8,idx_ : i64,num_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getbarcidxj(task_ : * const u8,idx_ : i64,j_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getbarcsparsity(task_ : * const u8,maxnumnz_ : i64,numnz_ : & mut i64,idxj_ : * mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getbarsj(task_ : * const u8,whichsol_ : i32,j_ : i32,barsj_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getbarsslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,slicesize_ : i64,barsslice_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getbarvarname(task_ : * const u8,i_ : i32,sizename_ : i32,name : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getbarvarnameindex(task_ : * const u8,somename_ : * const libc::c_char,asgn_ : & mut i32,index_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getbarvarnamelen(task_ : * const u8,i_ : i32,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getbarxj(task_ : * const u8,whichsol_ : i32,j_ : i32,barxj_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getbarxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,slicesize_ : i64,barxslice_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getc(task_ : * const u8,c_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getcfix(task_ : * const u8,cfix_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getcj(task_ : * const u8,j_ : i32,cj_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getclist(task_ : * const u8,num_ : i32,subj_ : * const i32,c_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getconbound(task_ : * const u8,i_ : i32,bk_ : &mut i32,bl_ : & mut f64,bu_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getconboundslice(task_ : * const u8,first_ : i32,last_ : i32,bk_ : * mut i32,bl_ : * mut f64,bu_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getcone(task_ : * const u8,k_ : i32,ct_ : &mut i32,conepar_ : & mut f64,nummem_ : & mut i32,submem_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getconeinfo(task_ : * const u8,k_ : i32,ct_ : &mut i32,conepar_ : & mut f64,nummem_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getconename(task_ : * const u8,i_ : i32,sizename_ : i32,name : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getconenameindex(task_ : * const u8,somename_ : * const libc::c_char,asgn_ : & mut i32,index_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getconenamelen(task_ : * const u8,i_ : i32,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getconname(task_ : * const u8,i_ : i32,sizename_ : i32,name : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getconnameindex(task_ : * const u8,somename_ : * const libc::c_char,asgn_ : & mut i32,index_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getconnamelen(task_ : * const u8,i_ : i32,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getcslice(task_ : * const u8,first_ : i32,last_ : i32,c_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdimbarvarj(task_ : * const u8,j_ : i32,dimbarvarj_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getdjcafeidxlist(task_ : * const u8,djcidx_ : i64,afeidxlist_ : * mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdjcb(task_ : * const u8,djcidx_ : i64,b_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdjcdomainidxlist(task_ : * const u8,djcidx_ : i64,domidxlist_ : * mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdjcname(task_ : * const u8,djcidx_ : i64,sizename_ : i32,name : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getdjcnamelen(task_ : * const u8,djcidx_ : i64,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getdjcnumafe(task_ : * const u8,djcidx_ : i64,numafe_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdjcnumafetot(task_ : * const u8,numafetot_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdjcnumdomain(task_ : * const u8,djcidx_ : i64,numdomain_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdjcnumdomaintot(task_ : * const u8,numdomaintot_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdjcnumterm(task_ : * const u8,djcidx_ : i64,numterm_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdjcnumtermtot(task_ : * const u8,numtermtot_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdjcs(task_ : * const u8,domidxlist_ : * mut i64,afeidxlist_ : * mut i64,b_ : * mut f64,termsizelist_ : * mut i64,numterms_ : * mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdjctermsizelist(task_ : * const u8,djcidx_ : i64,termsizelist_ : * mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdomainn(task_ : * const u8,domidx_ : i64,n_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getdomainname(task_ : * const u8,domidx_ : i64,sizename_ : i32,name : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getdomainnamelen(task_ : * const u8,domidx_ : i64,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getdomaintype(task_ : * const u8,domidx_ : i64,domtype_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getdouinf(task_ : * const u8,whichdinf_ : i32,dvalue_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdouparam(task_ : * const u8,param_ : i32,parvalue_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdualobj(task_ : * const u8,whichsol_ : i32,dualobj_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdualsolutionnorms(task_ : * const u8,whichsol_ : i32,nrmy_ : & mut f64,nrmslc_ : & mut f64,nrmsuc_ : & mut f64,nrmslx_ : & mut f64,nrmsux_ : & mut f64,nrmsnx_ : & mut f64,nrmbars_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdviolacc(task_ : * const u8,whichsol_ : i32,numaccidx_ : i64,accidxlist_ : * const i64,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdviolbarvar(task_ : * const u8,whichsol_ : i32,num_ : i32,sub_ : * const i32,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdviolcon(task_ : * const u8,whichsol_ : i32,num_ : i32,sub_ : * const i32,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdviolcones(task_ : * const u8,whichsol_ : i32,num_ : i32,sub_ : * const i32,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getdviolvar(task_ : * const u8,whichsol_ : i32,num_ : i32,sub_ : * const i32,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getenv(task_ : * const u8,env_ : & mut * const u8) -> i32;
#[allow(dead_code)]
fn MSK_getinfeasiblesubproblem(task_ : * const u8,whichsol_ : i32,inftask_ : & mut * const u8) -> i32;
#[allow(dead_code)]
fn MSK_getinfindex(task_ : * const u8,inftype_ : i32,infname_ : * const libc::c_char,infindex_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getinfmax(task_ : * const u8,inftype_ : i32,infmax_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getinfname(task_ : * const u8,inftype_ : i32,whichinf_ : i32,infname : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getintinf(task_ : * const u8,whichiinf_ : i32,ivalue_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getintparam(task_ : * const u8,param_ : i32,parvalue_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getlenbarvarj(task_ : * const u8,j_ : i32,lenbarvarj_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getlintinf(task_ : * const u8,whichliinf_ : i32,ivalue_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getmaxnamelen(task_ : * const u8,maxlen_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getmaxnumanz(task_ : * const u8,maxnumanz_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getmaxnumanz64(task_ : * const u8,maxnumanz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getmaxnumbarvar(task_ : * const u8,maxnumbarvar_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getmaxnumcon(task_ : * const u8,maxnumcon_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getmaxnumcone(task_ : * const u8,maxnumcone_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getmaxnumqnz(task_ : * const u8,maxnumqnz_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getmaxnumqnz64(task_ : * const u8,maxnumqnz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getmaxnumvar(task_ : * const u8,maxnumvar_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getmemusagetask(task_ : * const u8,meminuse_ : & mut i64,maxmemuse_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getmionumthreads(task_ : * const u8,numthreads_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnadouinf(task_ : * const u8,infitemname_ : * const libc::c_char,dvalue_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getnadouparam(task_ : * const u8,paramname_ : * const libc::c_char,parvalue_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getnaintinf(task_ : * const u8,infitemname_ : * const libc::c_char,ivalue_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnaintparam(task_ : * const u8,paramname_ : * const libc::c_char,parvalue_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnastrparam(task_ : * const u8,paramname_ : * const libc::c_char,sizeparamname_ : i32,len_ : & mut i32,parvalue : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getnumacc(task_ : * const u8,num_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumafe(task_ : * const u8,numafe_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumanz(task_ : * const u8,numanz_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnumanz64(task_ : * const u8,numanz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumbarablocktriplets(task_ : * const u8,num_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumbaranz(task_ : * const u8,nz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumbarcblocktriplets(task_ : * const u8,num_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumbarcnz(task_ : * const u8,nz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumbarvar(task_ : * const u8,numbarvar_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnumcon(task_ : * const u8,numcon_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnumcone(task_ : * const u8,numcone_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnumconemem(task_ : * const u8,k_ : i32,nummem_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnumdjc(task_ : * const u8,num_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumdomain(task_ : * const u8,numdomain_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumintvar(task_ : * const u8,numintvar_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnumparam(task_ : * const u8,partype_ : i32,numparam_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnumqconknz(task_ : * const u8,k_ : i32,numqcnz_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnumqconknz64(task_ : * const u8,k_ : i32,numqcnz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumqobjnz(task_ : * const u8,numqonz_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getnumqobjnz64(task_ : * const u8,numqonz_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumsymmat(task_ : * const u8,num_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getnumvar(task_ : * const u8,numvar_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getobjname(task_ : * const u8,sizeobjname_ : i32,objname : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getobjnamelen(task_ : * const u8,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getobjsense(task_ : * const u8,sense_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getparammax(task_ : * const u8,partype_ : i32,parammax_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getparamname(task_ : * const u8,partype_ : i32,param_ : i32,parname : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getpowerdomainalpha(task_ : * const u8,domidx_ : i64,alpha_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getpowerdomaininfo(task_ : * const u8,domidx_ : i64,n_ : & mut i64,nleft_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_getprimalobj(task_ : * const u8,whichsol_ : i32,primalobj_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getprimalsolutionnorms(task_ : * const u8,whichsol_ : i32,nrmxc_ : & mut f64,nrmxx_ : & mut f64,nrmbarx_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getprobtype(task_ : * const u8,probtype_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getprosta(task_ : * const u8,whichsol_ : i32,problemsta_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getpviolacc(task_ : * const u8,whichsol_ : i32,numaccidx_ : i64,accidxlist_ : * const i64,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getpviolbarvar(task_ : * const u8,whichsol_ : i32,num_ : i32,sub_ : * const i32,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getpviolcon(task_ : * const u8,whichsol_ : i32,num_ : i32,sub_ : * const i32,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getpviolcones(task_ : * const u8,whichsol_ : i32,num_ : i32,sub_ : * const i32,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getpvioldjc(task_ : * const u8,whichsol_ : i32,numdjcidx_ : i64,djcidxlist_ : * const i64,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getpviolvar(task_ : * const u8,whichsol_ : i32,num_ : i32,sub_ : * const i32,viol_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getqconk(task_ : * const u8,k_ : i32,maxnumqcnz_ : i32,numqcnz_ : & mut i32,qcsubi_ : * mut i32,qcsubj_ : * mut i32,qcval_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getqconk64(task_ : * const u8,k_ : i32,maxnumqcnz_ : i64,numqcnz_ : & mut i64,qcsubi_ : * mut i32,qcsubj_ : * mut i32,qcval_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getqobj(task_ : * const u8,maxnumqonz_ : i32,numqonz_ : & mut i32,qosubi_ : * mut i32,qosubj_ : * mut i32,qoval_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getqobj64(task_ : * const u8,maxnumqonz_ : i64,numqonz_ : & mut i64,qosubi_ : * mut i32,qosubj_ : * mut i32,qoval_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getqobjij(task_ : * const u8,i_ : i32,j_ : i32,qoij_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getreducedcosts(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,redcosts_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getskc(task_ : * const u8,whichsol_ : i32,skc_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getskcslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,skc_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getskn(task_ : * const u8,whichsol_ : i32,skn_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getskx(task_ : * const u8,whichsol_ : i32,skx_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getskxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,skx_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getslc(task_ : * const u8,whichsol_ : i32,slc_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getslcslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,slc_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getslx(task_ : * const u8,whichsol_ : i32,slx_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getslxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,slx_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsnx(task_ : * const u8,whichsol_ : i32,snx_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsnxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,snx_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsolsta(task_ : * const u8,whichsol_ : i32,solutionsta_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getsolution(task_ : * const u8,whichsol_ : i32,problemsta_ : &mut i32,solutionsta_ : &mut i32,skc_ : * mut i32,skx_ : * mut i32,skn_ : * mut i32,xc_ : * mut f64,xx_ : * mut f64,y_ : * mut f64,slc_ : * mut f64,suc_ : * mut f64,slx_ : * mut f64,sux_ : * mut f64,snx_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsolutioninfo(task_ : * const u8,whichsol_ : i32,pobj_ : & mut f64,pviolcon_ : & mut f64,pviolvar_ : & mut f64,pviolbarvar_ : & mut f64,pviolcone_ : & mut f64,pviolitg_ : & mut f64,dobj_ : & mut f64,dviolcon_ : & mut f64,dviolvar_ : & mut f64,dviolbarvar_ : & mut f64,dviolcone_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsolutioninfonew(task_ : * const u8,whichsol_ : i32,pobj_ : & mut f64,pviolcon_ : & mut f64,pviolvar_ : & mut f64,pviolbarvar_ : & mut f64,pviolcone_ : & mut f64,pviolacc_ : & mut f64,pvioldjc_ : & mut f64,pviolitg_ : & mut f64,dobj_ : & mut f64,dviolcon_ : & mut f64,dviolvar_ : & mut f64,dviolbarvar_ : & mut f64,dviolcone_ : & mut f64,dviolacc_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsolutionnew(task_ : * const u8,whichsol_ : i32,problemsta_ : &mut i32,solutionsta_ : &mut i32,skc_ : * mut i32,skx_ : * mut i32,skn_ : * mut i32,xc_ : * mut f64,xx_ : * mut f64,y_ : * mut f64,slc_ : * mut f64,suc_ : * mut f64,slx_ : * mut f64,sux_ : * mut f64,snx_ : * mut f64,doty_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsolutionslice(task_ : * const u8,whichsol_ : i32,solitem_ : i32,first_ : i32,last_ : i32,values_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsparsesymmat(task_ : * const u8,idx_ : i64,maxlen_ : i64,subi_ : * mut i32,subj_ : * mut i32,valij_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getstrparam(task_ : * const u8,param_ : i32,maxlen_ : i32,len_ : & mut i32,parvalue : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getstrparamlen(task_ : * const u8,param_ : i32,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getsuc(task_ : * const u8,whichsol_ : i32,suc_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsucslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,suc_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsux(task_ : * const u8,whichsol_ : i32,sux_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsuxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,sux_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getsymbcon(task_ : * const u8,i_ : i32,sizevalue_ : i32,name : * mut u8,value_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getsymmatinfo(task_ : * const u8,idx_ : i64,dim_ : & mut i32,nz_ : & mut i64,mattype_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_gettaskname(task_ : * const u8,sizetaskname_ : i32,taskname : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_gettasknamelen(task_ : * const u8,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getvarbound(task_ : * const u8,i_ : i32,bk_ : &mut i32,bl_ : & mut f64,bu_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getvarboundslice(task_ : * const u8,first_ : i32,last_ : i32,bk_ : * mut i32,bl_ : * mut f64,bu_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getvarname(task_ : * const u8,j_ : i32,sizename_ : i32,name : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getvarnameindex(task_ : * const u8,somename_ : * const libc::c_char,asgn_ : & mut i32,index_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getvarnamelen(task_ : * const u8,i_ : i32,len_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getvartype(task_ : * const u8,j_ : i32,vartype_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getvartypelist(task_ : * const u8,num_ : i32,subj_ : * const i32,vartype_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getxc(task_ : * const u8,whichsol_ : i32,xc_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getxcslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,xc_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getxx(task_ : * const u8,whichsol_ : i32,xx_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getxxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,xx_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_gety(task_ : * const u8,whichsol_ : i32,y_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getyslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,y_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_infeasibilityreport(task_ : * const u8,whichstream_ : i32,whichsol_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_initbasissolve(task_ : * const u8,basis_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_inputdata(task_ : * const u8,maxnumcon_ : i32,maxnumvar_ : i32,numcon_ : i32,numvar_ : i32,c_ : * const f64,cfix_ : f64,aptrb_ : * const i32,aptre_ : * const i32,asub_ : * const i32,aval_ : * const f64,bkc_ : * const i32,blc_ : * const f64,buc_ : * const f64,bkx_ : * const i32,blx_ : * const f64,bux_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_inputdata64(task_ : * const u8,maxnumcon_ : i32,maxnumvar_ : i32,numcon_ : i32,numvar_ : i32,c_ : * const f64,cfix_ : f64,aptrb_ : * const i64,aptre_ : * const i64,asub_ : * const i32,aval_ : * const f64,bkc_ : * const i32,blc_ : * const f64,buc_ : * const f64,bkx_ : * const i32,blx_ : * const f64,bux_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_isdouparname(task_ : * const u8,parname_ : * const libc::c_char,param_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_isintparname(task_ : * const u8,parname_ : * const libc::c_char,param_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_isstrparname(task_ : * const u8,parname_ : * const libc::c_char,param_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_linkfiletotaskstream(task_ : * const u8,whichstream_ : i32,filename_ : * const libc::c_char,append_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_onesolutionsummary(task_ : * const u8,whichstream_ : i32,whichsol_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_optimize(task_ : * const u8) -> i32;
#[allow(dead_code)]
fn MSK_optimizermt(task_ : * const u8,address_ : * const libc::c_char,accesstoken_ : * const libc::c_char,trmcode_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_optimizersummary(task_ : * const u8,whichstream_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_optimizetrm(task_ : * const u8,trmcode_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_primalrepair(task_ : * const u8,wlc_ : * const f64,wuc_ : * const f64,wlx_ : * const f64,wux_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_primalsensitivity(task_ : * const u8,numi_ : i32,subi_ : * const i32,marki_ : * const i32,numj_ : i32,subj_ : * const i32,markj_ : * const i32,leftpricei_ : * mut f64,rightpricei_ : * mut f64,leftrangei_ : * mut f64,rightrangei_ : * mut f64,leftpricej_ : * mut f64,rightpricej_ : * mut f64,leftrangej_ : * mut f64,rightrangej_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_printparam(task_ : * const u8) -> i32;
#[allow(dead_code)]
fn MSK_probtypetostr(task_ : * const u8,probtype_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_prostatostr(task_ : * const u8,problemsta_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_putacc(task_ : * const u8,accidx_ : i64,domidx_ : i64,numafeidx_ : i64,afeidxlist_ : * const i64,b_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putaccb(task_ : * const u8,accidx_ : i64,lengthb_ : i64,b_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putaccbj(task_ : * const u8,accidx_ : i64,j_ : i64,bj_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putaccdoty(task_ : * const u8,whichsol_ : i32,accidx_ : i64,doty_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_putacclist(task_ : * const u8,numaccs_ : i64,accidxs_ : * const i64,domidxs_ : * const i64,numafeidx_ : i64,afeidxlist_ : * const i64,b_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putaccname(task_ : * const u8,accidx_ : i64,name_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putacol(task_ : * const u8,j_ : i32,nzj_ : i32,subj_ : * const i32,valj_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putacollist(task_ : * const u8,num_ : i32,sub_ : * const i32,ptrb_ : * const i32,ptre_ : * const i32,asub_ : * const i32,aval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putacollist64(task_ : * const u8,num_ : i32,sub_ : * const i32,ptrb_ : * const i64,ptre_ : * const i64,asub_ : * const i32,aval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putacolslice(task_ : * const u8,first_ : i32,last_ : i32,ptrb_ : * const i32,ptre_ : * const i32,asub_ : * const i32,aval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putacolslice64(task_ : * const u8,first_ : i32,last_ : i32,ptrb_ : * const i64,ptre_ : * const i64,asub_ : * const i32,aval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafebarfblocktriplet(task_ : * const u8,numtrip_ : i64,afeidx_ : * const i64,barvaridx_ : * const i32,subk_ : * const i32,subl_ : * const i32,valkl_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafebarfentry(task_ : * const u8,afeidx_ : i64,barvaridx_ : i32,numterm_ : i64,termidx_ : * const i64,termweight_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafebarfentrylist(task_ : * const u8,numafeidx_ : i64,afeidx_ : * const i64,barvaridx_ : * const i32,numterm_ : * const i64,ptrterm_ : * const i64,lenterm_ : i64,termidx_ : * const i64,termweight_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafebarfrow(task_ : * const u8,afeidx_ : i64,numentr_ : i32,barvaridx_ : * const i32,numterm_ : * const i64,ptrterm_ : * const i64,lenterm_ : i64,termidx_ : * const i64,termweight_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafefcol(task_ : * const u8,varidx_ : i32,numnz_ : i64,afeidx_ : * const i64,val_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafefentry(task_ : * const u8,afeidx_ : i64,varidx_ : i32,value_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putafefentrylist(task_ : * const u8,numentr_ : i64,afeidx_ : * const i64,varidx_ : * const i32,val_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafefrow(task_ : * const u8,afeidx_ : i64,numnz_ : i32,varidx_ : * const i32,val_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafefrowlist(task_ : * const u8,numafeidx_ : i64,afeidx_ : * const i64,numnzrow_ : * const i32,ptrrow_ : * const i64,lenidxval_ : i64,varidx_ : * const i32,val_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafeg(task_ : * const u8,afeidx_ : i64,g_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putafeglist(task_ : * const u8,numafeidx_ : i64,afeidx_ : * const i64,g_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putafegslice(task_ : * const u8,first_ : i64,last_ : i64,slice_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putaij(task_ : * const u8,i_ : i32,j_ : i32,aij_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putaijlist(task_ : * const u8,num_ : i32,subi_ : * const i32,subj_ : * const i32,valij_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putaijlist64(task_ : * const u8,num_ : i64,subi_ : * const i32,subj_ : * const i32,valij_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putarow(task_ : * const u8,i_ : i32,nzi_ : i32,subi_ : * const i32,vali_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putarowlist(task_ : * const u8,num_ : i32,sub_ : * const i32,ptrb_ : * const i32,ptre_ : * const i32,asub_ : * const i32,aval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putarowlist64(task_ : * const u8,num_ : i32,sub_ : * const i32,ptrb_ : * const i64,ptre_ : * const i64,asub_ : * const i32,aval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putarowslice(task_ : * const u8,first_ : i32,last_ : i32,ptrb_ : * const i32,ptre_ : * const i32,asub_ : * const i32,aval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putarowslice64(task_ : * const u8,first_ : i32,last_ : i32,ptrb_ : * const i64,ptre_ : * const i64,asub_ : * const i32,aval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putatruncatetol(task_ : * const u8,tolzero_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putbarablocktriplet(task_ : * const u8,num_ : i64,subi_ : * const i32,subj_ : * const i32,subk_ : * const i32,subl_ : * const i32,valijkl_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putbaraij(task_ : * const u8,i_ : i32,j_ : i32,num_ : i64,sub_ : * const i64,weights_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putbaraijlist(task_ : * const u8,num_ : i32,subi_ : * const i32,subj_ : * const i32,alphaptrb_ : * const i64,alphaptre_ : * const i64,matidx_ : * const i64,weights_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putbararowlist(task_ : * const u8,num_ : i32,subi_ : * const i32,ptrb_ : * const i64,ptre_ : * const i64,subj_ : * const i32,nummat_ : * const i64,matidx_ : * const i64,weights_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putbarcblocktriplet(task_ : * const u8,num_ : i64,subj_ : * const i32,subk_ : * const i32,subl_ : * const i32,valjkl_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putbarcj(task_ : * const u8,j_ : i32,num_ : i64,sub_ : * const i64,weights_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putbarsj(task_ : * const u8,whichsol_ : i32,j_ : i32,barsj_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putbarvarname(task_ : * const u8,j_ : i32,name_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putbarxj(task_ : * const u8,whichsol_ : i32,j_ : i32,barxj_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putcfix(task_ : * const u8,cfix_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putcj(task_ : * const u8,j_ : i32,cj_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putclist(task_ : * const u8,num_ : i32,subj_ : * const i32,val_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putconbound(task_ : * const u8,i_ : i32,bkc_ : i32,blc_ : f64,buc_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putconboundlist(task_ : * const u8,num_ : i32,sub_ : * const i32,bkc_ : * const i32,blc_ : * const f64,buc_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putconboundlistconst(task_ : * const u8,num_ : i32,sub_ : * const i32,bkc_ : i32,blc_ : f64,buc_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putconboundslice(task_ : * const u8,first_ : i32,last_ : i32,bkc_ : * const i32,blc_ : * const f64,buc_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putconboundsliceconst(task_ : * const u8,first_ : i32,last_ : i32,bkc_ : i32,blc_ : f64,buc_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putcone(task_ : * const u8,k_ : i32,ct_ : i32,conepar_ : f64,nummem_ : i32,submem_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_putconename(task_ : * const u8,j_ : i32,name_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putconname(task_ : * const u8,i_ : i32,name_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putconsolutioni(task_ : * const u8,i_ : i32,whichsol_ : i32,sk_ : i32,x_ : f64,sl_ : f64,su_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putcslice(task_ : * const u8,first_ : i32,last_ : i32,slice_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putdjc(task_ : * const u8,djcidx_ : i64,numdomidx_ : i64,domidxlist_ : * const i64,numafeidx_ : i64,afeidxlist_ : * const i64,b_ : * const f64,numterms_ : i64,termsizelist_ : * const i64) -> i32;
#[allow(dead_code)]
fn MSK_putdjcname(task_ : * const u8,djcidx_ : i64,name_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putdjcslice(task_ : * const u8,idxfirst_ : i64,idxlast_ : i64,numdomidx_ : i64,domidxlist_ : * const i64,numafeidx_ : i64,afeidxlist_ : * const i64,b_ : * const f64,numterms_ : i64,termsizelist_ : * const i64,termsindjc_ : * const i64) -> i32;
#[allow(dead_code)]
fn MSK_putdomainname(task_ : * const u8,domidx_ : i64,name_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putdouparam(task_ : * const u8,param_ : i32,parvalue_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putintparam(task_ : * const u8,param_ : i32,parvalue_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumacc(task_ : * const u8,maxnumacc_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumafe(task_ : * const u8,maxnumafe_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumanz(task_ : * const u8,maxnumanz_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumbarvar(task_ : * const u8,maxnumbarvar_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumcon(task_ : * const u8,maxnumcon_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumcone(task_ : * const u8,maxnumcone_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumdjc(task_ : * const u8,maxnumdjc_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumdomain(task_ : * const u8,maxnumdomain_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumqnz(task_ : * const u8,maxnumqnz_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_putmaxnumvar(task_ : * const u8,maxnumvar_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_putnadouparam(task_ : * const u8,paramname_ : * const libc::c_char,parvalue_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putnaintparam(task_ : * const u8,paramname_ : * const libc::c_char,parvalue_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_putnastrparam(task_ : * const u8,paramname_ : * const libc::c_char,parvalue_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putobjname(task_ : * const u8,objname_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putobjsense(task_ : * const u8,sense_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_putoptserverhost(task_ : * const u8,host_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putparam(task_ : * const u8,parname_ : * const libc::c_char,parvalue_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putqcon(task_ : * const u8,numqcnz_ : i32,qcsubk_ : * const i32,qcsubi_ : * const i32,qcsubj_ : * const i32,qcval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putqconk(task_ : * const u8,k_ : i32,numqcnz_ : i32,qcsubi_ : * const i32,qcsubj_ : * const i32,qcval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putqobj(task_ : * const u8,numqonz_ : i32,qosubi_ : * const i32,qosubj_ : * const i32,qoval_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putqobjij(task_ : * const u8,i_ : i32,j_ : i32,qoij_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putskc(task_ : * const u8,whichsol_ : i32,skc_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_putskcslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,skc_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_putskx(task_ : * const u8,whichsol_ : i32,skx_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_putskxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,skx_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_putslc(task_ : * const u8,whichsol_ : i32,slc_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putslcslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,slc_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putslx(task_ : * const u8,whichsol_ : i32,slx_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putslxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,slx_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putsnx(task_ : * const u8,whichsol_ : i32,sux_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putsnxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,snx_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putsolution(task_ : * const u8,whichsol_ : i32,skc_ : * const i32,skx_ : * const i32,skn_ : * const i32,xc_ : * const f64,xx_ : * const f64,y_ : * const f64,slc_ : * const f64,suc_ : * const f64,slx_ : * const f64,sux_ : * const f64,snx_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putsolutionnew(task_ : * const u8,whichsol_ : i32,skc_ : * const i32,skx_ : * const i32,skn_ : * const i32,xc_ : * const f64,xx_ : * const f64,y_ : * const f64,slc_ : * const f64,suc_ : * const f64,slx_ : * const f64,sux_ : * const f64,snx_ : * const f64,doty_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putsolutionyi(task_ : * const u8,i_ : i32,whichsol_ : i32,y_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putstrparam(task_ : * const u8,param_ : i32,parvalue_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putsuc(task_ : * const u8,whichsol_ : i32,suc_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putsucslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,suc_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putsux(task_ : * const u8,whichsol_ : i32,sux_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putsuxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,sux_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_puttaskname(task_ : * const u8,taskname_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putvarbound(task_ : * const u8,j_ : i32,bkx_ : i32,blx_ : f64,bux_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putvarboundlist(task_ : * const u8,num_ : i32,sub_ : * const i32,bkx_ : * const i32,blx_ : * const f64,bux_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putvarboundlistconst(task_ : * const u8,num_ : i32,sub_ : * const i32,bkx_ : i32,blx_ : f64,bux_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putvarboundslice(task_ : * const u8,first_ : i32,last_ : i32,bkx_ : * const i32,blx_ : * const f64,bux_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putvarboundsliceconst(task_ : * const u8,first_ : i32,last_ : i32,bkx_ : i32,blx_ : f64,bux_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putvarname(task_ : * const u8,j_ : i32,name_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putvarsolutionj(task_ : * const u8,j_ : i32,whichsol_ : i32,sk_ : i32,x_ : f64,sl_ : f64,su_ : f64,sn_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_putvartype(task_ : * const u8,j_ : i32,vartype_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_putvartypelist(task_ : * const u8,num_ : i32,subj_ : * const i32,vartype_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_putxc(task_ : * const u8,whichsol_ : i32,xc_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_putxcslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,xc_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putxx(task_ : * const u8,whichsol_ : i32,xx_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putxxslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,xx_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_puty(task_ : * const u8,whichsol_ : i32,y_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_putyslice(task_ : * const u8,whichsol_ : i32,first_ : i32,last_ : i32,y_ : * const f64) -> i32;
#[allow(dead_code)]
fn MSK_readbsolution(task_ : * const u8,filename_ : * const libc::c_char,compress_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_readdata(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readdataautoformat(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readdataformat(task_ : * const u8,filename_ : * const libc::c_char,format_ : i32,compress_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_readjsonsol(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readjsonstring(task_ : * const u8,data_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readlpstring(task_ : * const u8,data_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readopfstring(task_ : * const u8,data_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readparamfile(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readptfstring(task_ : * const u8,data_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readsolution(task_ : * const u8,whichsol_ : i32,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readsolutionfile(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_readsummary(task_ : * const u8,whichstream_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_readtask(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_removebarvars(task_ : * const u8,num_ : i32,subset_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_removecones(task_ : * const u8,num_ : i32,subset_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_removecons(task_ : * const u8,num_ : i32,subset_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_removevars(task_ : * const u8,num_ : i32,subset_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_resizetask(task_ : * const u8,maxnumcon_ : i32,maxnumvar_ : i32,maxnumcone_ : i32,maxnumanz_ : i64,maxnumqnz_ : i64) -> i32;
#[allow(dead_code)]
fn MSK_sensitivityreport(task_ : * const u8,whichstream_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_setdefaults(task_ : * const u8) -> i32;
#[allow(dead_code)]
fn MSK_sktostr(task_ : * const u8,sk_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_solstatostr(task_ : * const u8,solutionsta_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_solutiondef(task_ : * const u8,whichsol_ : i32,isdef_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_solutionsummary(task_ : * const u8,whichstream_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_solvewithbasis(task_ : * const u8,transp_ : bool,numnz_ : i32,sub_ : * mut i32,val_ : * mut f64,numnzout_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_strtoconetype(task_ : * const u8,str_ : * const libc::c_char,conetype_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_strtosk(task_ : * const u8,str_ : * const libc::c_char,sk_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_toconic(task_ : * const u8) -> i32;
#[allow(dead_code)]
fn MSK_unlinkfuncfromtaskstream(task_ : * const u8,whichstream_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_updatesolutioninfo(task_ : * const u8,whichsol_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_whichparam(task_ : * const u8,parname_ : * const libc::c_char,partype_ : &mut i32,param_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_writebsolution(task_ : * const u8,filename_ : * const libc::c_char,compress_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_writedata(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_writejsonsol(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_writeparamfile(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_writesolution(task_ : * const u8,whichsol_ : i32,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_writesolutionfile(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_writestat(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_writetask(task_ : * const u8,filename_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_writetasksolverresult_file(task_ : * const u8,filename_ : * const libc::c_char,compress_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_axpy(env_ : * const u8,n_ : i32,alpha_ : f64,x_ : * const f64,y_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_callbackcodetostr(code_ : i32,callbackcodestr : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_checkinall(env_ : * const u8) -> i32;
#[allow(dead_code)]
fn MSK_checkinlicense(env_ : * const u8,feature_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_checkmemenv(env_ : * const u8,file_ : * const libc::c_char,line_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_checkoutlicense(env_ : * const u8,feature_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_checkversion(env_ : * const u8,major_ : i32,minor_ : i32,revision_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_computesparsecholesky(env_ : * const u8,numthreads_ : i32,ordermethod_ : i32,tolsingular_ : f64,n_ : i32,anzc_ : * const i32,aptrc_ : * const i64,asubc_ : * const i32,avalc_ : * const f64,perm_ : & mut * const i32,diag_ : & mut * const f64,lnzc_ : & mut * const i32,lptrc_ : & mut * const i64,lensubnval_ : & mut i64,lsubc_ : & mut * const i32,lvalc_ : & mut * const f64) -> i32;
#[allow(dead_code)]
fn MSK_deleteenv(env_ : & mut * const u8) -> i32;
#[allow(dead_code)]
fn MSK_dinfitemtostr(item_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_dot(env_ : * const u8,n_ : i32,x_ : * const f64,y_ : * const f64,xty_ : & mut f64) -> i32;
#[allow(dead_code)]
fn MSK_echointro(env_ : * const u8,longver_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_enablegarcolenv(env_ : * const u8) -> i32;
#[allow(dead_code)]
fn MSK_expirylicenses(env_ : * const u8,expiry_ : & mut i64) -> i32;
#[allow(dead_code)]
fn MSK_freeenv(env_ : * const u8,buffer_ : *mut u8) -> i32;
#[allow(dead_code)]
fn MSK_gemm(env_ : * const u8,transa_ : i32,transb_ : i32,m_ : i32,n_ : i32,k_ : i32,alpha_ : f64,a_ : * const f64,b_ : * const f64,beta_ : f64,c_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_gemv(env_ : * const u8,transa_ : i32,m_ : i32,n_ : i32,alpha_ : f64,a_ : * const f64,x_ : * const f64,beta_ : f64,y_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_getbuildinfo(buildstate : * mut u8,builddate : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getcodedesc(code_ : i32,symname : * mut u8,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_getresponseclass(r_ : i32,rc_ : &mut i32) -> i32;
#[allow(dead_code)]
fn MSK_getversion(major_ : & mut i32,minor_ : & mut i32,revision_ : & mut i32) -> i32;
#[allow(dead_code)]
fn MSK_iinfitemtostr(item_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_isinfinity(value_ : f64) -> i32;
#[allow(dead_code)]
fn MSK_licensecleanup() -> i32;
#[allow(dead_code)]
fn MSK_liinfitemtostr(item_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_linkfiletoenvstream(env_ : * const u8,whichstream_ : i32,filename_ : * const libc::c_char,append_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_makeemptytask(env_ : * const u8,task_ : & mut * const u8) -> i32;
#[allow(dead_code)]
fn MSK_makeenv(env_ : & mut * const u8,dbgfile_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_makeenvdebug(env_ : & mut * const u8,maxnumalloc_ : i64,dbgfile_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_maketask(env_ : * const u8,maxnumcon_ : i32,maxnumvar_ : i32,task_ : & mut * const u8) -> i32;
#[allow(dead_code)]
fn MSK_optimizebatch(env_ : * const u8,israce_ : bool,maxtime_ : f64,numthreads_ : i32,numtask_ : i64,task_ : * const * const u8,trmcode_ : * mut i32,rcode_ : * mut i32) -> i32;
#[allow(dead_code)]
fn MSK_potrf(env_ : * const u8,uplo_ : i32,n_ : i32,a_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_putlicensecode(env_ : * const u8,code_ : * const i32) -> i32;
#[allow(dead_code)]
fn MSK_putlicensedebug(env_ : * const u8,licdebug_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_putlicensepath(env_ : * const u8,licensepath_ : * const libc::c_char) -> i32;
#[allow(dead_code)]
fn MSK_putlicensewait(env_ : * const u8,licwait_ : i32) -> i32;
#[allow(dead_code)]
fn MSK_rescodetostr(res_ : i32,str : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_resetexpirylicenses(env_ : * const u8) -> i32;
#[allow(dead_code)]
fn MSK_sparsetriangularsolvedense(env_ : * const u8,transposed_ : i32,n_ : i32,lnzc_ : * const i32,lptrc_ : * const i64,lensubnval_ : i64,lsubc_ : * const i32,lvalc_ : * const f64,b_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_syeig(env_ : * const u8,uplo_ : i32,n_ : i32,a_ : * const f64,w_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_syevd(env_ : * const u8,uplo_ : i32,n_ : i32,a_ : * mut f64,w_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_symnamtovalue(name_ : * const libc::c_char,value : * mut u8) -> i32;
#[allow(dead_code)]
fn MSK_syrk(env_ : * const u8,uplo_ : i32,trans_ : i32,n_ : i32,k_ : i32,alpha_ : f64,a_ : * const f64,beta_ : f64,c_ : * mut f64) -> i32;
#[allow(dead_code)]
fn MSK_unlinkfuncfromenvstream(env_ : * const u8,whichstream_ : i32) -> i32;
}
/// Basis identification
#[non_exhaustive]
pub struct Basindtype;
impl Basindtype {
/// Never do basis identification.
pub const NEVER : i32 = 0;
/// Basis identification is always performed even if the interior-point optimizer terminates abnormally.
pub const ALWAYS : i32 = 1;
/// Basis identification is performed if the interior-point optimizer terminates without an error.
pub const NO_ERROR : i32 = 2;
/// Basis identification is not performed if the interior-point optimizer terminates with a problem status saying that the problem is primal or dual infeasible.
pub const IF_FEASIBLE : i32 = 3;
/// Not currently in use.
pub const RESERVERED : i32 = 4;
} // impl Basindtype
/// Bound keys
#[non_exhaustive]
pub struct Boundkey;
impl Boundkey {
/// The constraint or variable has a finite lower bound and an infinite upper bound.
pub const LO : i32 = 0;
/// The constraint or variable has an infinite lower bound and an finite upper bound.
pub const UP : i32 = 1;
/// The constraint or variable is fixed.
pub const FX : i32 = 2;
/// The constraint or variable is free.
pub const FR : i32 = 3;
/// The constraint or variable is ranged.
pub const RA : i32 = 4;
} // impl Boundkey
/// Mark
#[non_exhaustive]
pub struct Mark;
impl Mark {
/// The lower bound is selected for sensitivity analysis.
pub const LO : i32 = 0;
/// The upper bound is selected for sensitivity analysis.
pub const UP : i32 = 1;
} // impl Mark
/// Degeneracy strategies
#[non_exhaustive]
pub struct Simdegen;
impl Simdegen {
/// The simplex optimizer should use no degeneration strategy.
pub const NONE : i32 = 0;
/// The simplex optimizer chooses the degeneration strategy.
pub const FREE : i32 = 1;
/// The simplex optimizer should use an aggressive degeneration strategy.
pub const AGGRESSIVE : i32 = 2;
/// The simplex optimizer should use a moderate degeneration strategy.
pub const MODERATE : i32 = 3;
/// The simplex optimizer should use a minimum degeneration strategy.
pub const MINIMUM : i32 = 4;
} // impl Simdegen
/// Transposed matrix.
#[non_exhaustive]
pub struct Transpose;
impl Transpose {
/// No transpose is applied.
pub const NO : i32 = 0;
/// A transpose is applied.
pub const YES : i32 = 1;
} // impl Transpose
/// Triangular part of a symmetric matrix.
#[non_exhaustive]
pub struct Uplo;
impl Uplo {
/// Lower part.
pub const LO : i32 = 0;
/// Upper part.
pub const UP : i32 = 1;
} // impl Uplo
/// Problem reformulation.
#[non_exhaustive]
pub struct Simreform;
impl Simreform {
/// Disallow the simplex optimizer to reformulate the problem.
pub const OFF : i32 = 0;
/// Allow the simplex optimizer to reformulate the problem.
pub const ON : i32 = 1;
/// The simplex optimizer can choose freely.
pub const FREE : i32 = 2;
/// The simplex optimizer should use an aggressive reformulation strategy.
pub const AGGRESSIVE : i32 = 3;
} // impl Simreform
/// Exploit duplicate columns.
#[non_exhaustive]
pub struct Simdupvec;
impl Simdupvec {
/// Disallow the simplex optimizer to exploit duplicated columns.
pub const OFF : i32 = 0;
/// Allow the simplex optimizer to exploit duplicated columns.
pub const ON : i32 = 1;
/// The simplex optimizer can choose freely.
pub const FREE : i32 = 2;
} // impl Simdupvec
/// Hot-start type employed by the simplex optimizer
#[non_exhaustive]
pub struct Simhotstart;
impl Simhotstart {
/// The simplex optimizer performs a coldstart.
pub const NONE : i32 = 0;
/// The simplex optimize chooses the hot-start type.
pub const FREE : i32 = 1;
/// Only the status keys of the constraints and variables are used to choose the type of hot-start.
pub const STATUS_KEYS : i32 = 2;
} // impl Simhotstart
/// Hot-start type employed by the interior-point optimizers.
#[non_exhaustive]
pub struct Intpnthotstart;
impl Intpnthotstart {
/// The interior-point optimizer performs a coldstart.
pub const NONE : i32 = 0;
/// The interior-point optimizer exploits the primal solution only.
pub const PRIMAL : i32 = 1;
/// The interior-point optimizer exploits the dual solution only.
pub const DUAL : i32 = 2;
/// The interior-point optimizer exploits both the primal and dual solution.
pub const PRIMAL_DUAL : i32 = 3;
} // impl Intpnthotstart
/// Solution purification employed optimizer.
#[non_exhaustive]
pub struct Purify;
impl Purify {
/// The optimizer performs no solution purification.
pub const NONE : i32 = 0;
/// The optimizer purifies the primal solution.
pub const PRIMAL : i32 = 1;
/// The optimizer purifies the dual solution.
pub const DUAL : i32 = 2;
/// The optimizer purifies both the primal and dual solution.
pub const PRIMAL_DUAL : i32 = 3;
/// TBD
pub const AUTO : i32 = 4;
} // impl Purify
/// Progress callback codes
#[non_exhaustive]
pub struct Callbackcode;
impl Callbackcode {
/// The basis identification procedure has been started.
pub const BEGIN_BI : i32 = 0;
/// The callback function is called when the conic optimizer is started.
pub const BEGIN_CONIC : i32 = 1;
/// The callback function is called from within the basis identification procedure when the dual phase is started.
pub const BEGIN_DUAL_BI : i32 = 2;
/// Dual sensitivity analysis is started.
pub const BEGIN_DUAL_SENSITIVITY : i32 = 3;
/// The callback function is called when the dual BI phase is started.
pub const BEGIN_DUAL_SETUP_BI : i32 = 4;
/// The callback function is called when the dual simplex optimizer started.
pub const BEGIN_DUAL_SIMPLEX : i32 = 5;
/// The callback function is called from within the basis identification procedure when the dual simplex clean-up phase is started.
pub const BEGIN_DUAL_SIMPLEX_BI : i32 = 6;
/// The callback function is called when the infeasibility analyzer is started.
pub const BEGIN_INFEAS_ANA : i32 = 7;
/// The callback function is called when the interior-point optimizer is started.
pub const BEGIN_INTPNT : i32 = 8;
/// Begin waiting for license.
pub const BEGIN_LICENSE_WAIT : i32 = 9;
/// The callback function is called when the mixed-integer optimizer is started.
pub const BEGIN_MIO : i32 = 10;
/// The callback function is called when the optimizer is started.
pub const BEGIN_OPTIMIZER : i32 = 11;
/// The callback function is called when the presolve is started.
pub const BEGIN_PRESOLVE : i32 = 12;
/// The callback function is called from within the basis identification procedure when the primal phase is started.
pub const BEGIN_PRIMAL_BI : i32 = 13;
/// Begin primal feasibility repair.
pub const BEGIN_PRIMAL_REPAIR : i32 = 14;
/// Primal sensitivity analysis is started.
pub const BEGIN_PRIMAL_SENSITIVITY : i32 = 15;
/// The callback function is called when the primal BI setup is started.
pub const BEGIN_PRIMAL_SETUP_BI : i32 = 16;
/// The callback function is called when the primal simplex optimizer is started.
pub const BEGIN_PRIMAL_SIMPLEX : i32 = 17;
/// The callback function is called from within the basis identification procedure when the primal simplex clean-up phase is started.
pub const BEGIN_PRIMAL_SIMPLEX_BI : i32 = 18;
/// Begin QCQO reformulation.
pub const BEGIN_QCQO_REFORMULATE : i32 = 19;
/// MOSEK has started reading a problem file.
pub const BEGIN_READ : i32 = 20;
/// The callback function is called when root cut generation is started.
pub const BEGIN_ROOT_CUTGEN : i32 = 21;
/// The callback function is called when the simplex optimizer is started.
pub const BEGIN_SIMPLEX : i32 = 22;
/// The callback function is called from within the basis identification procedure when the simplex clean-up phase is started.
pub const BEGIN_SIMPLEX_BI : i32 = 23;
/// The callback function is called when solution of root relaxation is started.
pub const BEGIN_SOLVE_ROOT_RELAX : i32 = 24;
/// Begin conic reformulation.
pub const BEGIN_TO_CONIC : i32 = 25;
/// MOSEK has started writing a problem file.
pub const BEGIN_WRITE : i32 = 26;
/// The callback function is called from within the conic optimizer after the information database has been updated.
pub const CONIC : i32 = 27;
/// The callback function is called from within the dual simplex optimizer.
pub const DUAL_SIMPLEX : i32 = 28;
/// The callback function is called when the basis identification procedure is terminated.
pub const END_BI : i32 = 29;
/// The callback function is called when the conic optimizer is terminated.
pub const END_CONIC : i32 = 30;
/// The callback function is called from within the basis identification procedure when the dual phase is terminated.
pub const END_DUAL_BI : i32 = 31;
/// Dual sensitivity analysis is terminated.
pub const END_DUAL_SENSITIVITY : i32 = 32;
/// The callback function is called when the dual BI phase is terminated.
pub const END_DUAL_SETUP_BI : i32 = 33;
/// The callback function is called when the dual simplex optimizer is terminated.
pub const END_DUAL_SIMPLEX : i32 = 34;
/// The callback function is called from within the basis identification procedure when the dual clean-up phase is terminated.
pub const END_DUAL_SIMPLEX_BI : i32 = 35;
/// The callback function is called when the infeasibility analyzer is terminated.
pub const END_INFEAS_ANA : i32 = 36;
/// The callback function is called when the interior-point optimizer is terminated.
pub const END_INTPNT : i32 = 37;
/// End waiting for license.
pub const END_LICENSE_WAIT : i32 = 38;
/// The callback function is called when the mixed-integer optimizer is terminated.
pub const END_MIO : i32 = 39;
/// The callback function is called when the optimizer is terminated.
pub const END_OPTIMIZER : i32 = 40;
/// The callback function is called when the presolve is completed.
pub const END_PRESOLVE : i32 = 41;
/// The callback function is called from within the basis identification procedure when the primal phase is terminated.
pub const END_PRIMAL_BI : i32 = 42;
/// End primal feasibility repair.
pub const END_PRIMAL_REPAIR : i32 = 43;
/// Primal sensitivity analysis is terminated.
pub const END_PRIMAL_SENSITIVITY : i32 = 44;
/// The callback function is called when the primal BI setup is terminated.
pub const END_PRIMAL_SETUP_BI : i32 = 45;
/// The callback function is called when the primal simplex optimizer is terminated.
pub const END_PRIMAL_SIMPLEX : i32 = 46;
/// The callback function is called from within the basis identification procedure when the primal clean-up phase is terminated.
pub const END_PRIMAL_SIMPLEX_BI : i32 = 47;
/// End QCQO reformulation.
pub const END_QCQO_REFORMULATE : i32 = 48;
/// MOSEK has finished reading a problem file.
pub const END_READ : i32 = 49;
/// The callback function is called when root cut generation is terminated.
pub const END_ROOT_CUTGEN : i32 = 50;
/// The callback function is called when the simplex optimizer is terminated.
pub const END_SIMPLEX : i32 = 51;
/// The callback function is called from within the basis identification procedure when the simplex clean-up phase is terminated.
pub const END_SIMPLEX_BI : i32 = 52;
/// The callback function is called when solution of root relaxation is terminated.
pub const END_SOLVE_ROOT_RELAX : i32 = 53;
/// End conic reformulation.
pub const END_TO_CONIC : i32 = 54;
/// MOSEK has finished writing a problem file.
pub const END_WRITE : i32 = 55;
/// The callback function is called from within the basis identification procedure at an intermediate point.
pub const IM_BI : i32 = 56;
/// The callback function is called at an intermediate stage within the conic optimizer where the information database has not been updated.
pub const IM_CONIC : i32 = 57;
/// The callback function is called from within the basis identification procedure at an intermediate point in the dual phase.
pub const IM_DUAL_BI : i32 = 58;
/// The callback function is called at an intermediate stage of the dual sensitivity analysis.
pub const IM_DUAL_SENSIVITY : i32 = 59;
/// The callback function is called at an intermediate point in the dual simplex optimizer.
pub const IM_DUAL_SIMPLEX : i32 = 60;
/// The callback function is called at an intermediate stage within the interior-point optimizer where the information database has not been updated.
pub const IM_INTPNT : i32 = 61;
/// MOSEK is waiting for a license.
pub const IM_LICENSE_WAIT : i32 = 62;
/// The callback function is called from within the LU factorization procedure at an intermediate point.
pub const IM_LU : i32 = 63;
/// The callback function is called at an intermediate point in the mixed-integer optimizer.
pub const IM_MIO : i32 = 64;
/// The callback function is called at an intermediate point in the mixed-integer optimizer while running the dual simplex optimizer.
pub const IM_MIO_DUAL_SIMPLEX : i32 = 65;
/// The callback function is called at an intermediate point in the mixed-integer optimizer while running the interior-point optimizer.
pub const IM_MIO_INTPNT : i32 = 66;
/// The callback function is called at an intermediate point in the mixed-integer optimizer while running the primal simplex optimizer.
pub const IM_MIO_PRIMAL_SIMPLEX : i32 = 67;
/// The callback function is called from within the matrix ordering procedure at an intermediate point.
pub const IM_ORDER : i32 = 68;
/// The callback function is called from within the presolve procedure at an intermediate stage.
pub const IM_PRESOLVE : i32 = 69;
/// The callback function is called from within the basis identification procedure at an intermediate point in the primal phase.
pub const IM_PRIMAL_BI : i32 = 70;
/// The callback function is called at an intermediate stage of the primal sensitivity analysis.
pub const IM_PRIMAL_SENSIVITY : i32 = 71;
/// The callback function is called at an intermediate point in the primal simplex optimizer.
pub const IM_PRIMAL_SIMPLEX : i32 = 72;
/// The callback function is called at an intermediate stage of the conic quadratic reformulation.
pub const IM_QO_REFORMULATE : i32 = 73;
/// Intermediate stage in reading.
pub const IM_READ : i32 = 74;
/// The callback is called from within root cut generation at an intermediate stage.
pub const IM_ROOT_CUTGEN : i32 = 75;
/// The callback function is called from within the simplex optimizer at an intermediate point.
pub const IM_SIMPLEX : i32 = 76;
/// The callback function is called from within the basis identification procedure at an intermediate point in the simplex clean-up phase.
pub const IM_SIMPLEX_BI : i32 = 77;
/// The callback function is called from within the interior-point optimizer after the information database has been updated.
pub const INTPNT : i32 = 78;
/// The callback function is called after a new integer solution has been located by the mixed-integer optimizer.
pub const NEW_INT_MIO : i32 = 79;
/// The callback function is called from within the primal simplex optimizer.
pub const PRIMAL_SIMPLEX : i32 = 80;
/// The callback function is called from the OPF reader.
pub const READ_OPF : i32 = 81;
/// A chunk of Q non-zeros has been read from a problem file.
pub const READ_OPF_SECTION : i32 = 82;
/// The callback function is called when the mixed-integer optimizer is restarted.
pub const RESTART_MIO : i32 = 83;
/// The callback function is called while the task is being solved on a remote server.
pub const SOLVING_REMOTE : i32 = 84;
/// The callback function is called from within the basis identification procedure at an intermediate point in the dual phase.
pub const UPDATE_DUAL_BI : i32 = 85;
/// The callback function is called in the dual simplex optimizer.
pub const UPDATE_DUAL_SIMPLEX : i32 = 86;
/// The callback function is called from within the basis identification procedure at an intermediate point in the dual simplex clean-up phase.
pub const UPDATE_DUAL_SIMPLEX_BI : i32 = 87;
/// The callback function is called from within the presolve procedure.
pub const UPDATE_PRESOLVE : i32 = 88;
/// The callback function is called from within the basis identification procedure at an intermediate point in the primal phase.
pub const UPDATE_PRIMAL_BI : i32 = 89;
/// The callback function is called in the primal simplex optimizer.
pub const UPDATE_PRIMAL_SIMPLEX : i32 = 90;
/// The callback function is called from within the basis identification procedure at an intermediate point in the primal simplex clean-up phase.
pub const UPDATE_PRIMAL_SIMPLEX_BI : i32 = 91;
/// The callback function is called from simplex optimizer.
pub const UPDATE_SIMPLEX : i32 = 92;
/// The callback function is called from the OPF writer.
pub const WRITE_OPF : i32 = 93;
} // impl Callbackcode
/// Compression types
#[non_exhaustive]
pub struct Compresstype;
impl Compresstype {
/// No compression is used.
pub const NONE : i32 = 0;
/// The type of compression used is chosen automatically.
pub const FREE : i32 = 1;
/// The type of compression used is gzip compatible.
pub const GZIP : i32 = 2;
/// The type of compression used is zstd compatible.
pub const ZSTD : i32 = 3;
} // impl Compresstype
/// Cone types
#[non_exhaustive]
pub struct Conetype;
impl Conetype {
/// The cone is a quadratic cone.
pub const QUAD : i32 = 0;
/// The cone is a rotated quadratic cone.
pub const RQUAD : i32 = 1;
/// A primal exponential cone.
pub const PEXP : i32 = 2;
/// A dual exponential cone.
pub const DEXP : i32 = 3;
/// A primal power cone.
pub const PPOW : i32 = 4;
/// A dual power cone.
pub const DPOW : i32 = 5;
/// The zero cone.
pub const ZERO : i32 = 6;
} // impl Conetype
/// Cone types
#[non_exhaustive]
pub struct Domaintype;
impl Domaintype {
/// R.
pub const R : i32 = 0;
/// The zero vector.
pub const RZERO : i32 = 1;
/// The positive orthant.
pub const RPLUS : i32 = 2;
/// The negative orthant.
pub const RMINUS : i32 = 3;
/// The quadratic cone.
pub const QUADRATIC_CONE : i32 = 4;
/// The rotated quadratic cone.
pub const RQUADRATIC_CONE : i32 = 5;
/// The primal exponential cone.
pub const PRIMAL_EXP_CONE : i32 = 6;
/// The dual exponential cone.
pub const DUAL_EXP_CONE : i32 = 7;
/// The primal power cone.
pub const PRIMAL_POWER_CONE : i32 = 8;
/// The dual power cone.
pub const DUAL_POWER_CONE : i32 = 9;
/// The primal geometric mean cone.
pub const PRIMAL_GEO_MEAN_CONE : i32 = 10;
/// The dual geometric mean cone.
pub const DUAL_GEO_MEAN_CONE : i32 = 11;
/// The vectorized positive semidefinite cone.
pub const SVEC_PSD_CONE : i32 = 12;
} // impl Domaintype
/// Name types
#[non_exhaustive]
pub struct Nametype;
impl Nametype {
/// General names. However, no duplicate and blank names are allowed.
pub const GEN : i32 = 0;
/// MPS type names.
pub const MPS : i32 = 1;
/// LP type names.
pub const LP : i32 = 2;
} // impl Nametype
/// Cone types
#[non_exhaustive]
pub struct Symmattype;
impl Symmattype {
/// Sparse symmetric matrix.
pub const SPARSE : i32 = 0;
} // impl Symmattype
/// Data format types
#[non_exhaustive]
pub struct Dataformat;
impl Dataformat {
/// The file extension is used to determine the data file format.
pub const EXTENSION : i32 = 0;
/// The data file is MPS formatted.
pub const MPS : i32 = 1;
/// The data file is LP formatted.
pub const LP : i32 = 2;
/// The data file is an optimization problem formatted file.
pub const OP : i32 = 3;
/// The data a free MPS formatted file.
pub const FREE_MPS : i32 = 4;
/// Generic task dump file.
pub const TASK : i32 = 5;
/// (P)retty (T)ext (F)format.
pub const PTF : i32 = 6;
/// Conic benchmark format,
pub const CB : i32 = 7;
/// JSON based task format.
pub const JSON_TASK : i32 = 8;
} // impl Dataformat
/// Data format types
#[non_exhaustive]
pub struct Solformat;
impl Solformat {
/// The file extension is used to determine the data file format.
pub const EXTENSION : i32 = 0;
/// Simple binary format
pub const B : i32 = 1;
/// Tar based format.
pub const TASK : i32 = 2;
/// JSON based format.
pub const JSON_TASK : i32 = 3;
} // impl Solformat
/// Double information items
#[non_exhaustive]
pub struct Dinfitem;
impl Dinfitem {
/// Density percentage of the scalarized constraint matrix.
pub const ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_DENSITY : i32 = 0;
/// Time spent within the dual clean-up optimizer of the basis identification procedure since its invocation.
pub const BI_CLEAN_DUAL_TIME : i32 = 1;
/// Time spent within the primal clean-up optimizer of the basis identification procedure since its invocation.
pub const BI_CLEAN_PRIMAL_TIME : i32 = 2;
/// Time spent within the clean-up phase of the basis identification procedure since its invocation.
pub const BI_CLEAN_TIME : i32 = 3;
/// Time spent within the dual phase basis identification procedure since its invocation.
pub const BI_DUAL_TIME : i32 = 4;
/// Time spent within the primal phase of the basis identification procedure since its invocation.
pub const BI_PRIMAL_TIME : i32 = 5;
/// Time spent within the basis identification procedure since its invocation.
pub const BI_TIME : i32 = 6;
/// Dual feasibility measure reported by the interior-point optimizer.
pub const INTPNT_DUAL_FEAS : i32 = 7;
/// Dual objective value reported by the interior-point optimizer.
pub const INTPNT_DUAL_OBJ : i32 = 8;
/// An estimate of the number of flops used in the factorization.
pub const INTPNT_FACTOR_NUM_FLOPS : i32 = 9;
/// A measure of optimality of the solution.
pub const INTPNT_OPT_STATUS : i32 = 10;
/// Order time (in seconds).
pub const INTPNT_ORDER_TIME : i32 = 11;
/// Primal feasibility measure reported by the interior-point optimizer.
pub const INTPNT_PRIMAL_FEAS : i32 = 12;
/// Primal objective value reported by the interior-point optimizer.
pub const INTPNT_PRIMAL_OBJ : i32 = 13;
/// Time spent within the interior-point optimizer since its invocation.
pub const INTPNT_TIME : i32 = 14;
/// Selection time for clique cuts.
pub const MIO_CLIQUE_SELECTION_TIME : i32 = 15;
/// Separation time for clique cuts.
pub const MIO_CLIQUE_SEPARATION_TIME : i32 = 16;
/// Selection time for CMIR cuts.
pub const MIO_CMIR_SELECTION_TIME : i32 = 17;
/// Separation time for CMIR cuts.
pub const MIO_CMIR_SEPARATION_TIME : i32 = 18;
/// Optimal objective value corresponding to the feasible solution.
pub const MIO_CONSTRUCT_SOLUTION_OBJ : i32 = 19;
/// Value of the dual bound after presolve but before cut generation.
pub const MIO_DUAL_BOUND_AFTER_PRESOLVE : i32 = 20;
/// Selection time for GMI cuts.
pub const MIO_GMI_SELECTION_TIME : i32 = 21;
/// Separation time for GMI cuts.
pub const MIO_GMI_SEPARATION_TIME : i32 = 22;
/// Selection time for implied bound cuts.
pub const MIO_IMPLIED_BOUND_SELECTION_TIME : i32 = 23;
/// Separation time for implied bound cuts.
pub const MIO_IMPLIED_BOUND_SEPARATION_TIME : i32 = 24;
/// Optimal objective value corresponding to the user provided initial solution.
pub const MIO_INITIAL_FEASIBLE_SOLUTION_OBJ : i32 = 25;
/// Selection time for knapsack cover.
pub const MIO_KNAPSACK_COVER_SELECTION_TIME : i32 = 26;
/// Separation time for knapsack cover.
pub const MIO_KNAPSACK_COVER_SEPARATION_TIME : i32 = 27;
/// Selection time for lift-and-project cuts.
pub const MIO_LIPRO_SELECTION_TIME : i32 = 28;
/// Separation time for lift-and-project cuts.
pub const MIO_LIPRO_SEPARATION_TIME : i32 = 29;
/// If the mixed-integer optimizer has computed a feasible solution and a bound, this contains the absolute gap.
pub const MIO_OBJ_ABS_GAP : i32 = 30;
/// The best bound on the objective value known.
pub const MIO_OBJ_BOUND : i32 = 31;
/// The primal objective value corresponding to the best integer feasible solution.
pub const MIO_OBJ_INT : i32 = 32;
/// If the mixed-integer optimizer has computed a feasible solution and a bound, this contains the relative gap.
pub const MIO_OBJ_REL_GAP : i32 = 33;
/// Total time for probing.
pub const MIO_PROBING_TIME : i32 = 34;
/// Total time for cut selection.
pub const MIO_ROOT_CUT_SELECTION_TIME : i32 = 35;
/// Total time for cut separation.
pub const MIO_ROOT_CUT_SEPARATION_TIME : i32 = 36;
/// Time spent in the contiuous optimizer while processing the root node relaxation.
pub const MIO_ROOT_OPTIMIZER_TIME : i32 = 37;
/// Time spent presolving the problem at the root node.
pub const MIO_ROOT_PRESOLVE_TIME : i32 = 38;
/// Time spent processing the root node.
pub const MIO_ROOT_TIME : i32 = 39;
/// Total time for symmetry detection.
pub const MIO_SYMMETRY_DETECTION_TIME : i32 = 40;
/// Degree to which the problem is affected by detected symmetry.
pub const MIO_SYMMETRY_FACTOR : i32 = 41;
/// Time spent in the mixed-integer optimizer.
pub const MIO_TIME : i32 = 42;
/// If the objective cut is used, then this information item has the value of the cut.
pub const MIO_USER_OBJ_CUT : i32 = 43;
/// Total number of ticks spent in the optimizer since it was invoked. It is strictly negative if it is not available.
pub const OPTIMIZER_TICKS : i32 = 44;
/// Total time spent in the optimizer since it was invoked.
pub const OPTIMIZER_TIME : i32 = 45;
/// Total time spent in the eliminator since the presolve was invoked.
pub const PRESOLVE_ELI_TIME : i32 = 46;
/// Total time spent in the linear dependency checker since the presolve was invoked.
pub const PRESOLVE_LINDEP_TIME : i32 = 47;
/// Total time (in seconds) spent in the presolve since it was invoked.
pub const PRESOLVE_TIME : i32 = 48;
/// Total perturbation of the bounds of the primal problem.
pub const PRESOLVE_TOTAL_PRIMAL_PERTURBATION : i32 = 49;
/// The optimal objective value of the penalty function.
pub const PRIMAL_REPAIR_PENALTY_OBJ : i32 = 50;
/// Maximum absolute diagonal perturbation occurring during the QCQO reformulation.
pub const QCQO_REFORMULATE_MAX_PERTURBATION : i32 = 51;
/// Time spent with conic quadratic reformulation.
pub const QCQO_REFORMULATE_TIME : i32 = 52;
/// Worst Cholesky column scaling.
pub const QCQO_REFORMULATE_WORST_CHOLESKY_COLUMN_SCALING : i32 = 53;
/// Worst Cholesky diagonal scaling.
pub const QCQO_REFORMULATE_WORST_CHOLESKY_DIAG_SCALING : i32 = 54;
/// Time spent reading the data file.
pub const READ_DATA_TIME : i32 = 55;
/// The total real time in seconds spent when optimizing on a server by the process performing the optimization on the server
pub const REMOTE_TIME : i32 = 56;
/// Time spent in the dual simplex optimizer since invoking it.
pub const SIM_DUAL_TIME : i32 = 57;
/// Feasibility measure reported by the simplex optimizer.
pub const SIM_FEAS : i32 = 58;
/// Objective value reported by the simplex optimizer.
pub const SIM_OBJ : i32 = 59;
/// Time spent in the primal simplex optimizer since invoking it.
pub const SIM_PRIMAL_TIME : i32 = 60;
/// Time spent in the simplex optimizer since invoking it.
pub const SIM_TIME : i32 = 61;
/// Dual objective value of the basic solution. Updated by the function updatesolutioninfo.
pub const SOL_BAS_DUAL_OBJ : i32 = 62;
/// Maximal dual bound violation for xx in the basic solution. Updated by the function updatesolutioninfo.
pub const SOL_BAS_DVIOLCON : i32 = 63;
/// Maximal dual bound violation for xx in the basic solution. Updated by the function updatesolutioninfo.
pub const SOL_BAS_DVIOLVAR : i32 = 64;
/// Infinity norm of barx in the basic solution.
pub const SOL_BAS_NRM_BARX : i32 = 65;
/// Infinity norm of slc in the basic solution.
pub const SOL_BAS_NRM_SLC : i32 = 66;
/// Infinity norm of slx in the basic solution.
pub const SOL_BAS_NRM_SLX : i32 = 67;
/// Infinity norm of suc in the basic solution.
pub const SOL_BAS_NRM_SUC : i32 = 68;
/// Infinity norm of sux in the basic solution.
pub const SOL_BAS_NRM_SUX : i32 = 69;
/// Infinity norm of xc in the basic solution.
pub const SOL_BAS_NRM_XC : i32 = 70;
/// Infinity norm of xx in the basic solution.
pub const SOL_BAS_NRM_XX : i32 = 71;
/// Infinity norm of Y in the basic solution.
pub const SOL_BAS_NRM_Y : i32 = 72;
/// Primal objective value of the basic solution. Updated by the function updatesolutioninfo.
pub const SOL_BAS_PRIMAL_OBJ : i32 = 73;
/// Maximal primal bound violation for xc in the basic solution. Updated by the function updatesolutioninfo.
pub const SOL_BAS_PVIOLCON : i32 = 74;
/// Maximal primal bound violation for xx in the basic solution. Updated by the function updatesolutioninfo.
pub const SOL_BAS_PVIOLVAR : i32 = 75;
/// Infinity norm of barx in the integer solution.
pub const SOL_ITG_NRM_BARX : i32 = 76;
/// Infinity norm of xc in the integer solution.
pub const SOL_ITG_NRM_XC : i32 = 77;
/// Infinity norm of xx in the integer solution.
pub const SOL_ITG_NRM_XX : i32 = 78;
/// Primal objective value of the integer solution. Updated by the function updatesolutioninfo.
pub const SOL_ITG_PRIMAL_OBJ : i32 = 79;
/// Maximal primal violation for affine conic constraints in the integer solution. Updated by the function updatesolutioninfo.
pub const SOL_ITG_PVIOLACC : i32 = 80;
/// Maximal primal bound violation for barx in the integer solution. Updated by the function updatesolutioninfo.
pub const SOL_ITG_PVIOLBARVAR : i32 = 81;
/// Maximal primal bound violation for xc in the integer solution. Updated by the function updatesolutioninfo.
pub const SOL_ITG_PVIOLCON : i32 = 82;
/// Maximal primal violation for primal conic constraints in the integer solution. Updated by the function updatesolutioninfo.
pub const SOL_ITG_PVIOLCONES : i32 = 83;
/// Maximal primal violation for disjunctive constraints in the integer solution. Updated by the function updatesolutioninfo.
pub const SOL_ITG_PVIOLDJC : i32 = 84;
/// Maximal violation for the integer constraints in the integer solution. Updated by the function updatesolutioninfo.
pub const SOL_ITG_PVIOLITG : i32 = 85;
/// Maximal primal bound violation for xx in the integer solution. Updated by the function updatesolutioninfo.
pub const SOL_ITG_PVIOLVAR : i32 = 86;
/// Dual objective value of the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_DUAL_OBJ : i32 = 87;
/// Maximal dual violation for affine conic constraints in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_DVIOLACC : i32 = 88;
/// Maximal dual bound violation for barx in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_DVIOLBARVAR : i32 = 89;
/// Maximal dual bound violation for xc in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_DVIOLCON : i32 = 90;
/// Maximal dual violation for conic constraints in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_DVIOLCONES : i32 = 91;
/// Maximal dual bound violation for xx in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_DVIOLVAR : i32 = 92;
/// Infinity norm of bars in the interior-point solution.
pub const SOL_ITR_NRM_BARS : i32 = 93;
/// Infinity norm of barx in the interior-point solution.
pub const SOL_ITR_NRM_BARX : i32 = 94;
/// Infinity norm of slc in the interior-point solution.
pub const SOL_ITR_NRM_SLC : i32 = 95;
/// Infinity norm of slx in the interior-point solution.
pub const SOL_ITR_NRM_SLX : i32 = 96;
/// Infinity norm of snx in the interior-point solution.
pub const SOL_ITR_NRM_SNX : i32 = 97;
/// Infinity norm of suc in the interior-point solution.
pub const SOL_ITR_NRM_SUC : i32 = 98;
/// Infinity norm of sux in the interior-point solution.
pub const SOL_ITR_NRM_SUX : i32 = 99;
/// Infinity norm of xc in the interior-point solution.
pub const SOL_ITR_NRM_XC : i32 = 100;
/// Infinity norm of xx in the interior-point solution.
pub const SOL_ITR_NRM_XX : i32 = 101;
/// Infinity norm of Y in the interior-point solution.
pub const SOL_ITR_NRM_Y : i32 = 102;
/// Primal objective value of the interior-point solution.
pub const SOL_ITR_PRIMAL_OBJ : i32 = 103;
/// Maximal primal violation for affine conic constraints in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_PVIOLACC : i32 = 104;
/// Maximal primal bound violation for barx in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_PVIOLBARVAR : i32 = 105;
/// Maximal primal bound violation for xc in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_PVIOLCON : i32 = 106;
/// Maximal primal violation for conic constraints in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_PVIOLCONES : i32 = 107;
/// Maximal primal bound violation for xx in the interior-point solution. Updated by the function updatesolutioninfo.
pub const SOL_ITR_PVIOLVAR : i32 = 108;
/// Time spent in the last to conic reformulation.
pub const TO_CONIC_TIME : i32 = 109;
/// Time spent writing the data file.
pub const WRITE_DATA_TIME : i32 = 110;
pub const END : i32 = 110;
} // impl Dinfitem
/// License feature
#[non_exhaustive]
pub struct Feature;
impl Feature {
/// Base system.
pub const PTS : i32 = 0;
/// Conic extension.
pub const PTON : i32 = 1;
} // impl Feature
/// Double parameters
#[non_exhaustive]
pub struct Dparam;
impl Dparam {
/// If a constraint violates its bound with an amount larger than this value, the constraint name, index and violation will be printed by the solution analyzer.
pub const ANA_SOL_INFEAS_TOL : i32 = 0;
/// Maximum relative dual bound violation allowed in an optimal basic solution.
pub const BASIS_REL_TOL_S : i32 = 1;
/// Maximum absolute dual bound violation in an optimal basic solution.
pub const BASIS_TOL_S : i32 = 2;
/// Maximum absolute primal bound violation allowed in an optimal basic solution.
pub const BASIS_TOL_X : i32 = 3;
/// Not in use.
pub const CHECK_CONVEXITY_REL_TOL : i32 = 4;
/// Zero tolerance threshold for symmetric matrices.
pub const DATA_SYM_MAT_TOL : i32 = 5;
/// Data tolerance threshold.
pub const DATA_SYM_MAT_TOL_HUGE : i32 = 6;
/// Data tolerance threshold.
pub const DATA_SYM_MAT_TOL_LARGE : i32 = 7;
/// Data tolerance threshold.
pub const DATA_TOL_AIJ_HUGE : i32 = 8;
/// Data tolerance threshold.
pub const DATA_TOL_AIJ_LARGE : i32 = 9;
/// Data tolerance threshold.
pub const DATA_TOL_BOUND_INF : i32 = 10;
/// Data tolerance threshold.
pub const DATA_TOL_BOUND_WRN : i32 = 11;
/// Data tolerance threshold.
pub const DATA_TOL_C_HUGE : i32 = 12;
/// Data tolerance threshold.
pub const DATA_TOL_CJ_LARGE : i32 = 13;
/// Data tolerance threshold.
pub const DATA_TOL_QIJ : i32 = 14;
/// Data tolerance threshold.
pub const DATA_TOL_X : i32 = 15;
/// Dual feasibility tolerance used by the interior-point optimizer for conic problems.
pub const INTPNT_CO_TOL_DFEAS : i32 = 16;
/// Infeasibility tolerance used by the interior-point optimizer for conic problems.
pub const INTPNT_CO_TOL_INFEAS : i32 = 17;
/// Relative complementarity gap tolerance used by the interior-point optimizer for conic problems.
pub const INTPNT_CO_TOL_MU_RED : i32 = 18;
/// Optimality tolerance used by the interior-point optimizer for conic problems.
pub const INTPNT_CO_TOL_NEAR_REL : i32 = 19;
/// Primal feasibility tolerance used by the interior-point optimizer for conic problems.
pub const INTPNT_CO_TOL_PFEAS : i32 = 20;
/// Relative gap termination tolerance used by the interior-point optimizer for conic problems.
pub const INTPNT_CO_TOL_REL_GAP : i32 = 21;
/// Dual feasibility tolerance used by the interior-point optimizer for quadratic problems.
pub const INTPNT_QO_TOL_DFEAS : i32 = 22;
/// Infeasibility tolerance used by the interior-point optimizer for quadratic problems.
pub const INTPNT_QO_TOL_INFEAS : i32 = 23;
/// Relative complementarity gap tolerance used by the interior-point optimizer for quadratic problems.
pub const INTPNT_QO_TOL_MU_RED : i32 = 24;
/// Optimality tolerance used by the interior-point optimizer for quadratic problems.
pub const INTPNT_QO_TOL_NEAR_REL : i32 = 25;
/// Primal feasibility tolerance used by the interior-point optimizer for quadratic problems.
pub const INTPNT_QO_TOL_PFEAS : i32 = 26;
/// Relative gap termination tolerance used by the interior-point optimizer for quadratic problems.
pub const INTPNT_QO_TOL_REL_GAP : i32 = 27;
/// Dual feasibility tolerance used by the interior-point optimizer for linear problems.
pub const INTPNT_TOL_DFEAS : i32 = 28;
/// Controls the interior-point dual starting point.
pub const INTPNT_TOL_DSAFE : i32 = 29;
/// Infeasibility tolerance used by the interior-point optimizer for linear problems.
pub const INTPNT_TOL_INFEAS : i32 = 30;
/// Relative complementarity gap tolerance used by the interior-point optimizer for linear problems.
pub const INTPNT_TOL_MU_RED : i32 = 31;
/// Interior-point centering aggressiveness.
pub const INTPNT_TOL_PATH : i32 = 32;
/// Primal feasibility tolerance used by the interior-point optimizer for linear problems.
pub const INTPNT_TOL_PFEAS : i32 = 33;
/// Controls the interior-point primal starting point.
pub const INTPNT_TOL_PSAFE : i32 = 34;
/// Relative gap termination tolerance used by the interior-point optimizer for linear problems.
pub const INTPNT_TOL_REL_GAP : i32 = 35;
/// Relative step size to the boundary for linear and quadratic optimization problems.
pub const INTPNT_TOL_REL_STEP : i32 = 36;
/// Minimal step size tolerance for the interior-point optimizer.
pub const INTPNT_TOL_STEP_SIZE : i32 = 37;
/// Objective bound.
pub const LOWER_OBJ_CUT : i32 = 38;
/// Objective bound.
pub const LOWER_OBJ_CUT_FINITE_TRH : i32 = 39;
/// Maximum allowed big-M value when reformulating disjunctive constraints to linear constraints.
pub const MIO_DJC_MAX_BIGM : i32 = 40;
/// Time limit for the mixed-integer optimizer.
pub const MIO_MAX_TIME : i32 = 41;
/// This value is used to compute the relative gap for the solution to an integer optimization problem.
pub const MIO_REL_GAP_CONST : i32 = 42;
/// Absolute optimality tolerance employed by the mixed-integer optimizer.
pub const MIO_TOL_ABS_GAP : i32 = 43;
/// Integer feasibility tolerance.
pub const MIO_TOL_ABS_RELAX_INT : i32 = 44;
/// Feasibility tolerance for mixed integer solver.
pub const MIO_TOL_FEAS : i32 = 45;
/// Controls cut generation for mixed-integer optimizer.
pub const MIO_TOL_REL_DUAL_BOUND_IMPROVEMENT : i32 = 46;
/// Relative optimality tolerance employed by the mixed-integer optimizer.
pub const MIO_TOL_REL_GAP : i32 = 47;
/// Solver ticks limit.
pub const OPTIMIZER_MAX_TICKS : i32 = 48;
/// Solver time limit.
pub const OPTIMIZER_MAX_TIME : i32 = 49;
/// Absolute tolerance employed by the linear dependency checker.
pub const PRESOLVE_TOL_ABS_LINDEP : i32 = 50;
/// Absolute zero tolerance employed for constraint coefficients in the presolve.
pub const PRESOLVE_TOL_AIJ : i32 = 51;
/// The presolve is allowed to perturb a bound on a constraint or variable by this amount if it removes an infeasibility.
pub const PRESOLVE_TOL_PRIMAL_INFEAS_PERTURBATION : i32 = 52;
/// Relative tolerance employed by the linear dependency checker.
pub const PRESOLVE_TOL_REL_LINDEP : i32 = 53;
/// Absolute zero tolerance employed for slack variables in the presolve.
pub const PRESOLVE_TOL_S : i32 = 54;
/// Absolute zero tolerance employed for variables in the presolve.
pub const PRESOLVE_TOL_X : i32 = 55;
/// This parameter determines when columns are dropped in incomplete Cholesky factorization during reformulation of quadratic problems.
pub const QCQO_REFORMULATE_REL_DROP_TOL : i32 = 56;
/// Tolerance to define a matrix to be positive semidefinite.
pub const SEMIDEFINITE_TOL_APPROX : i32 = 57;
/// Relative pivot tolerance employed when computing the LU factorization of the basis matrix.
pub const SIM_LU_TOL_REL_PIV : i32 = 58;
/// Absolute pivot tolerance employed by the simplex optimizers.
pub const SIMPLEX_ABS_TOL_PIV : i32 = 59;
/// Objective bound.
pub const UPPER_OBJ_CUT : i32 = 60;
/// Objective bound.
pub const UPPER_OBJ_CUT_FINITE_TRH : i32 = 61;
} // impl Dparam
/// Long integer information items.
#[non_exhaustive]
pub struct Liinfitem;
impl Liinfitem {
/// Number of columns in the scalarized constraint matrix.
pub const ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_NUM_COLUMNS : i32 = 0;
/// Number of non-zero entries in the scalarized constraint matrix.
pub const ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_NUM_NZ : i32 = 1;
/// Number of rows in the scalarized constraint matrix.
pub const ANA_PRO_SCALARIZED_CONSTRAINT_MATRIX_NUM_ROWS : i32 = 2;
/// Number of dual degenerate clean iterations performed in the basis identification.
pub const BI_CLEAN_DUAL_DEG_ITER : i32 = 3;
/// Number of dual clean iterations performed in the basis identification.
pub const BI_CLEAN_DUAL_ITER : i32 = 4;
/// Number of primal degenerate clean iterations performed in the basis identification.
pub const BI_CLEAN_PRIMAL_DEG_ITER : i32 = 5;
/// Number of primal clean iterations performed in the basis identification.
pub const BI_CLEAN_PRIMAL_ITER : i32 = 6;
/// Number of dual pivots performed in the basis identification.
pub const BI_DUAL_ITER : i32 = 7;
/// Number of primal pivots performed in the basis identification.
pub const BI_PRIMAL_ITER : i32 = 8;
/// Number of non-zeros in factorization.
pub const INTPNT_FACTOR_NUM_NZ : i32 = 9;
/// Number of non-zero entries in the constraint matrix of the problem to be solved by the mixed-integer optimizer.
pub const MIO_ANZ : i32 = 10;
/// Number of interior-point iterations performed by the mixed-integer optimizer.
pub const MIO_INTPNT_ITER : i32 = 11;
/// Number of dual illposed certificates encountered by the mixed-integer optimizer.
pub const MIO_NUM_DUAL_ILLPOSED_CER : i32 = 12;
/// Number of primal illposed certificates encountered by the mixed-integer optimizer.
pub const MIO_NUM_PRIM_ILLPOSED_CER : i32 = 13;
/// Number of non-zero entries in the constraint matrix of the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_ANZ : i32 = 14;
/// Number of simplex iterations performed by the mixed-integer optimizer.
pub const MIO_SIMPLEX_ITER : i32 = 15;
/// Number of affince conic constraints.
pub const RD_NUMACC : i32 = 16;
/// Number of non-zeros in A that is read.
pub const RD_NUMANZ : i32 = 17;
/// Number of disjuncive constraints.
pub const RD_NUMDJC : i32 = 18;
/// Number of Q non-zeros.
pub const RD_NUMQNZ : i32 = 19;
/// Number of iterations performed by the simplex optimizer.
pub const SIMPLEX_ITER : i32 = 20;
pub const END : i32 = 20;
} // impl Liinfitem
/// Integer information items.
#[non_exhaustive]
pub struct Iinfitem;
impl Iinfitem {
/// Number of constraints in the problem.
pub const ANA_PRO_NUM_CON : i32 = 0;
/// Number of equality constraints.
pub const ANA_PRO_NUM_CON_EQ : i32 = 1;
/// Number of unbounded constraints.
pub const ANA_PRO_NUM_CON_FR : i32 = 2;
/// Number of constraints with a lower bound and an infinite upper bound.
pub const ANA_PRO_NUM_CON_LO : i32 = 3;
/// Number of constraints with finite lower and upper bounds.
pub const ANA_PRO_NUM_CON_RA : i32 = 4;
/// Number of constraints with an upper bound and an infinite lower bound.
pub const ANA_PRO_NUM_CON_UP : i32 = 5;
/// Number of variables in the problem.
pub const ANA_PRO_NUM_VAR : i32 = 6;
/// Number of binary variables.
pub const ANA_PRO_NUM_VAR_BIN : i32 = 7;
/// Number of continuous variables.
pub const ANA_PRO_NUM_VAR_CONT : i32 = 8;
/// Number of fixed variables.
pub const ANA_PRO_NUM_VAR_EQ : i32 = 9;
/// Number of unbounded constraints.
pub const ANA_PRO_NUM_VAR_FR : i32 = 10;
/// Number of general integer variables.
pub const ANA_PRO_NUM_VAR_INT : i32 = 11;
/// Number of variables with a lower bound and an infinite upper bound.
pub const ANA_PRO_NUM_VAR_LO : i32 = 12;
/// Number of variables with finite lower and upper bounds.
pub const ANA_PRO_NUM_VAR_RA : i32 = 13;
/// Number of variables with an upper bound and an infinite lower bound.
pub const ANA_PRO_NUM_VAR_UP : i32 = 14;
/// Dimension of the dense sub system in factorization.
pub const INTPNT_FACTOR_DIM_DENSE : i32 = 15;
/// Number of interior-point iterations since invoking the interior-point optimizer.
pub const INTPNT_ITER : i32 = 16;
/// Number of threads that the interior-point optimizer is using.
pub const INTPNT_NUM_THREADS : i32 = 17;
/// Non-zero if the interior-point optimizer is solving the dual problem.
pub const INTPNT_SOLVE_DUAL : i32 = 18;
/// Non-zero if absolute gap is within tolerances.
pub const MIO_ABSGAP_SATISFIED : i32 = 19;
/// Size of the clique table.
pub const MIO_CLIQUE_TABLE_SIZE : i32 = 20;
/// Informs if MOSEK successfully constructed an initial integer feasible solution.
pub const MIO_CONSTRUCT_SOLUTION : i32 = 21;
/// Informs if MOSEK found the solution provided by the user to be feasible
pub const MIO_INITIAL_FEASIBLE_SOLUTION : i32 = 22;
/// Depth of the last node solved.
pub const MIO_NODE_DEPTH : i32 = 23;
/// Number of active branch and bound nodes.
pub const MIO_NUM_ACTIVE_NODES : i32 = 24;
/// Number of active cuts in the final relaxation after the mixed-integer optimizer's root cut generation.
pub const MIO_NUM_ACTIVE_ROOT_CUTS : i32 = 25;
/// Number of branches performed during the optimization.
pub const MIO_NUM_BRANCH : i32 = 26;
/// Number of integer feasible solutions that have been found.
pub const MIO_NUM_INT_SOLUTIONS : i32 = 27;
/// Number of relaxations solved during the optimization.
pub const MIO_NUM_RELAX : i32 = 28;
/// Number of times presolve was repeated at root.
pub const MIO_NUM_REPEATED_PRESOLVE : i32 = 29;
/// Number of restarts performed during the optimization.
pub const MIO_NUM_RESTARTS : i32 = 30;
/// Number of cut separation rounds at the root node of the mixed-integer optimizer.
pub const MIO_NUM_ROOT_CUT_ROUNDS : i32 = 31;
/// Number of clique cuts selected to be included in the relaxation.
pub const MIO_NUM_SELECTED_CLIQUE_CUTS : i32 = 32;
/// Number of Complemented Mixed Integer Rounding (CMIR) cuts selected to be included in the relaxation.
pub const MIO_NUM_SELECTED_CMIR_CUTS : i32 = 33;
/// Number of Gomory cuts selected to be included in the relaxation.
pub const MIO_NUM_SELECTED_GOMORY_CUTS : i32 = 34;
/// Number of implied bound cuts selected to be included in the relaxation.
pub const MIO_NUM_SELECTED_IMPLIED_BOUND_CUTS : i32 = 35;
/// Number of clique cuts selected to be included in the relaxation.
pub const MIO_NUM_SELECTED_KNAPSACK_COVER_CUTS : i32 = 36;
/// Number of lift-and-project cuts selected to be included in the relaxation.
pub const MIO_NUM_SELECTED_LIPRO_CUTS : i32 = 37;
/// Number of separated clique cuts.
pub const MIO_NUM_SEPARATED_CLIQUE_CUTS : i32 = 38;
/// Number of separated Complemented Mixed Integer Rounding (CMIR) cuts.
pub const MIO_NUM_SEPARATED_CMIR_CUTS : i32 = 39;
/// Number of separated Gomory cuts.
pub const MIO_NUM_SEPARATED_GOMORY_CUTS : i32 = 40;
/// Number of separated implied bound cuts.
pub const MIO_NUM_SEPARATED_IMPLIED_BOUND_CUTS : i32 = 41;
/// Number of separated clique cuts.
pub const MIO_NUM_SEPARATED_KNAPSACK_COVER_CUTS : i32 = 42;
/// Number of separated lift-and-project cuts.
pub const MIO_NUM_SEPARATED_LIPRO_CUTS : i32 = 43;
/// Number of branch and bounds nodes solved in the main branch and bound tree.
pub const MIO_NUM_SOLVED_NODES : i32 = 44;
/// Number of binary variables in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMBIN : i32 = 45;
/// Number of binary cone variables in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMBINCONEVAR : i32 = 46;
/// Number of constraints in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMCON : i32 = 47;
/// Number of cones in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMCONE : i32 = 48;
/// Number of cone variables in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMCONEVAR : i32 = 49;
/// Number of continuous variables in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMCONT : i32 = 50;
/// Number of continuous cone variables in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMCONTCONEVAR : i32 = 51;
/// Number of dual exponential cones in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMDEXPCONES : i32 = 52;
/// Number of disjunctive constraints in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMDJC : i32 = 53;
/// Number of dual power cones in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMDPOWCONES : i32 = 54;
/// Number of integer variables in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMINT : i32 = 55;
/// Number of integer cone variables in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMINTCONEVAR : i32 = 56;
/// Number of primal exponential cones in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMPEXPCONES : i32 = 57;
/// Number of primal power cones in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMPPOWCONES : i32 = 58;
/// Number of quadratic cones in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMQCONES : i32 = 59;
/// Number of rotated quadratic cones in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMRQCONES : i32 = 60;
/// Number of variables in the problem to be solved by the mixed-integer optimizer.
pub const MIO_NUMVAR : i32 = 61;
/// Non-zero if a valid objective bound has been found, otherwise zero.
pub const MIO_OBJ_BOUND_DEFINED : i32 = 62;
/// Number of binary variables in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMBIN : i32 = 63;
/// Number of binary cone variables in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMBINCONEVAR : i32 = 64;
/// Number of constraints in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMCON : i32 = 65;
/// Number of cones in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMCONE : i32 = 66;
/// Number of cone variables in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMCONEVAR : i32 = 67;
/// Number of continuous variables in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMCONT : i32 = 68;
/// Number of continuous cone variables in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMCONTCONEVAR : i32 = 69;
/// Number of dual exponential cones in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMDEXPCONES : i32 = 70;
/// Number of disjunctive constraints in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMDJC : i32 = 71;
/// Number of dual power cones in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMDPOWCONES : i32 = 72;
/// Number of integer variables in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMINT : i32 = 73;
/// Number of integer cone variables in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMINTCONEVAR : i32 = 74;
/// Number of primal exponential cones in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMPEXPCONES : i32 = 75;
/// Number of primal power cones in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMPPOWCONES : i32 = 76;
/// Number of quadratic cones in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMQCONES : i32 = 77;
/// Number of rotated quadratic cones in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMRQCONES : i32 = 78;
/// Number of variables in the problem after the mixed-integer optimizer's presolve.
pub const MIO_PRESOLVED_NUMVAR : i32 = 79;
/// Non-zero if relative gap is within tolerances.
pub const MIO_RELGAP_SATISFIED : i32 = 80;
/// Total number of cuts selected to be included in the relaxation by the mixed-integer optimizer.
pub const MIO_TOTAL_NUM_SELECTED_CUTS : i32 = 81;
/// Total number of cuts separated by the mixed-integer optimizer.
pub const MIO_TOTAL_NUM_SEPARATED_CUTS : i32 = 82;
/// If it is non-zero, then the objective cut is used.
pub const MIO_USER_OBJ_CUT : i32 = 83;
/// Number of constraints in the problem solved when the optimizer is called.
pub const OPT_NUMCON : i32 = 84;
/// Number of variables in the problem solved when the optimizer is called
pub const OPT_NUMVAR : i32 = 85;
/// The response code returned by optimize.
pub const OPTIMIZE_RESPONSE : i32 = 86;
/// Number perturbations to thhe bounds of the primal problem.
pub const PRESOLVE_NUM_PRIMAL_PERTURBATIONS : i32 = 87;
/// Is nonzero if the dual solution is purified.
pub const PURIFY_DUAL_SUCCESS : i32 = 88;
/// Is nonzero if the primal solution is purified.
pub const PURIFY_PRIMAL_SUCCESS : i32 = 89;
/// Number of symmetric variables read.
pub const RD_NUMBARVAR : i32 = 90;
/// Number of constraints read.
pub const RD_NUMCON : i32 = 91;
/// Number of conic constraints read.
pub const RD_NUMCONE : i32 = 92;
/// Number of integer-constrained variables read.
pub const RD_NUMINTVAR : i32 = 93;
/// Number of nonempty Q matrices read.
pub const RD_NUMQ : i32 = 94;
/// Number of variables read.
pub const RD_NUMVAR : i32 = 95;
/// Problem type.
pub const RD_PROTYPE : i32 = 96;
/// The number of dual degenerate iterations.
pub const SIM_DUAL_DEG_ITER : i32 = 97;
/// If 1 then the dual simplex algorithm is solving from an advanced basis.
pub const SIM_DUAL_HOTSTART : i32 = 98;
/// If 1 then a valid basis factorization of full rank was located and used by the dual simplex algorithm.
pub const SIM_DUAL_HOTSTART_LU : i32 = 99;
/// The number of iterations taken with dual infeasibility.
pub const SIM_DUAL_INF_ITER : i32 = 100;
/// Number of dual simplex iterations during the last optimization.
pub const SIM_DUAL_ITER : i32 = 101;
/// Number of constraints in the problem solved by the simplex optimizer.
pub const SIM_NUMCON : i32 = 102;
/// Number of variables in the problem solved by the simplex optimizer.
pub const SIM_NUMVAR : i32 = 103;
/// The number of primal degenerate iterations.
pub const SIM_PRIMAL_DEG_ITER : i32 = 104;
/// If 1 then the primal simplex algorithm is solving from an advanced basis.
pub const SIM_PRIMAL_HOTSTART : i32 = 105;
/// If 1 then a valid basis factorization of full rank was located and used by the primal simplex algorithm.
pub const SIM_PRIMAL_HOTSTART_LU : i32 = 106;
/// The number of iterations taken with primal infeasibility.
pub const SIM_PRIMAL_INF_ITER : i32 = 107;
/// Number of primal simplex iterations during the last optimization.
pub const SIM_PRIMAL_ITER : i32 = 108;
/// Is non-zero if dual problem is solved.
pub const SIM_SOLVE_DUAL : i32 = 109;
/// Problem status of the basic solution. Updated after each optimization.
pub const SOL_BAS_PROSTA : i32 = 110;
/// Solution status of the basic solution. Updated after each optimization.
pub const SOL_BAS_SOLSTA : i32 = 111;
/// Problem status of the integer solution. Updated after each optimization.
pub const SOL_ITG_PROSTA : i32 = 112;
/// Solution status of the integer solution. Updated after each optimization.
pub const SOL_ITG_SOLSTA : i32 = 113;
/// Problem status of the interior-point solution. Updated after each optimization.
pub const SOL_ITR_PROSTA : i32 = 114;
/// Solution status of the interior-point solution. Updated after each optimization.
pub const SOL_ITR_SOLSTA : i32 = 115;
/// Number of times the storage for storing the linear coefficient matrix has been changed.
pub const STO_NUM_A_REALLOC : i32 = 116;
pub const END : i32 = 116;
} // impl Iinfitem
/// Information item types
#[non_exhaustive]
pub struct Inftype;
impl Inftype {
/// Is a double information type.
pub const DOU_TYPE : i32 = 0;
/// Is an integer.
pub const INT_TYPE : i32 = 1;
/// Is a long integer.
pub const LINT_TYPE : i32 = 2;
} // impl Inftype
/// Input/output modes
#[non_exhaustive]
pub struct Iomode;
impl Iomode {
/// The file is read-only.
pub const READ : i32 = 0;
/// The file is write-only. If the file exists then it is truncated when it is opened. Otherwise it is created when it is opened.
pub const WRITE : i32 = 1;
/// The file is to read and write.
pub const READWRITE : i32 = 2;
} // impl Iomode
/// Integer parameters
#[non_exhaustive]
pub struct Iparam;
impl Iparam {
/// Controls whether the basis matrix is analyzed in solution analyzer.
pub const ANA_SOL_BASIS : i32 = 0;
/// Controls whether a list of violated constraints is printed.
pub const ANA_SOL_PRINT_VIOLATED : i32 = 1;
/// Controls whether the elements in each column of A are sorted before an optimization is performed.
pub const AUTO_SORT_A_BEFORE_OPT : i32 = 2;
/// Controls whether the solution information items are automatically updated after an optimization is performed.
pub const AUTO_UPDATE_SOL_INFO : i32 = 3;
/// Controls the sign of the columns in the basis matrix corresponding to slack variables.
pub const BASIS_SOLVE_USE_PLUS_ONE : i32 = 4;
/// Controls which simplex optimizer is used in the clean-up phase.
pub const BI_CLEAN_OPTIMIZER : i32 = 5;
/// Turns on basis identification in case the interior-point optimizer is terminated due to maximum number of iterations.
pub const BI_IGNORE_MAX_ITER : i32 = 6;
/// Turns on basis identification in case the interior-point optimizer is terminated due to a numerical problem.
pub const BI_IGNORE_NUM_ERROR : i32 = 7;
/// Maximum number of iterations after basis identification.
pub const BI_MAX_ITERATIONS : i32 = 8;
/// Control license caching.
pub const CACHE_LICENSE : i32 = 9;
/// Control compression of stat files.
pub const COMPRESS_STATFILE : i32 = 10;
/// Controls the contents of the infeasibility report.
pub const INFEAS_GENERIC_NAMES : i32 = 11;
/// Controls which certificate is used if both primal- and dual- certificate of infeasibility is available.
pub const INFEAS_PREFER_PRIMAL : i32 = 12;
/// Turns the feasibility report on or off.
pub const INFEAS_REPORT_AUTO : i32 = 13;
/// Controls the contents of the infeasibility report.
pub const INFEAS_REPORT_LEVEL : i32 = 14;
/// Controls whether basis identification is performed.
pub const INTPNT_BASIS : i32 = 15;
/// Controls whether different step sizes are allowed in the primal and dual space.
pub const INTPNT_DIFF_STEP : i32 = 16;
/// Currently not in use.
pub const INTPNT_HOTSTART : i32 = 17;
/// Controls the maximum number of iterations allowed in the interior-point optimizer.
pub const INTPNT_MAX_ITERATIONS : i32 = 18;
/// Maximum number of correction steps.
pub const INTPNT_MAX_NUM_COR : i32 = 19;
/// Maximum number of steps to be used by the iterative search direction refinement.
pub const INTPNT_MAX_NUM_REFINEMENT_STEPS : i32 = 20;
/// Controls the aggressiveness of the offending column detection.
pub const INTPNT_OFF_COL_TRH : i32 = 21;
/// This parameter controls the number of random seeds tried.
pub const INTPNT_ORDER_GP_NUM_SEEDS : i32 = 22;
/// Controls the ordering strategy.
pub const INTPNT_ORDER_METHOD : i32 = 23;
/// Currently not in use.
pub const INTPNT_PURIFY : i32 = 24;
/// Controls whether regularization is allowed.
pub const INTPNT_REGULARIZATION_USE : i32 = 25;
/// Controls how the problem is scaled before the interior-point optimizer is used.
pub const INTPNT_SCALING : i32 = 26;
/// Controls whether the primal or the dual problem is solved.
pub const INTPNT_SOLVE_FORM : i32 = 27;
/// Starting point used by the interior-point optimizer.
pub const INTPNT_STARTING_POINT : i32 = 28;
/// Controls the license manager client debugging behavior.
pub const LICENSE_DEBUG : i32 = 29;
/// Controls license manager client behavior.
pub const LICENSE_PAUSE_TIME : i32 = 30;
/// Controls license manager client behavior.
pub const LICENSE_SUPPRESS_EXPIRE_WRNS : i32 = 31;
/// Controls when expiry warnings are issued.
pub const LICENSE_TRH_EXPIRY_WRN : i32 = 32;
/// Controls if MOSEK should queue for a license if none is available.
pub const LICENSE_WAIT : i32 = 33;
/// Controls the amount of log information.
pub const LOG : i32 = 34;
/// Controls amount of output from the problem analyzer.
pub const LOG_ANA_PRO : i32 = 35;
/// Controls the amount of output printed by the basis identification procedure. A higher level implies that more information is logged.
pub const LOG_BI : i32 = 36;
/// Controls the logging frequency.
pub const LOG_BI_FREQ : i32 = 37;
/// Controls the reduction in the log levels for the second and any subsequent optimizations.
pub const LOG_CUT_SECOND_OPT : i32 = 38;
/// Controls the amount of logging when a data item such as the maximum number constrains is expanded.
pub const LOG_EXPAND : i32 = 39;
/// Controls the amount of output printed when performing feasibility repair. A value higher than one means extensive logging.
pub const LOG_FEAS_REPAIR : i32 = 40;
/// If turned on, then some log info is printed when a file is written or read.
pub const LOG_FILE : i32 = 41;
/// Controls whether solution summary should be printed by the optimizer.
pub const LOG_INCLUDE_SUMMARY : i32 = 42;
/// Controls log level for the infeasibility analyzer.
pub const LOG_INFEAS_ANA : i32 = 43;
/// Controls the amount of log information from the interior-point optimizers.
pub const LOG_INTPNT : i32 = 44;
/// Control whether local identifying information is printed to the log.
pub const LOG_LOCAL_INFO : i32 = 45;
/// Controls the amount of log information from the mixed-integer optimizers.
pub const LOG_MIO : i32 = 46;
/// The mixed-integer optimizer logging frequency.
pub const LOG_MIO_FREQ : i32 = 47;
/// If turned on, then factor lines are added to the log.
pub const LOG_ORDER : i32 = 48;
/// Controls amount of output printed by the presolve procedure. A higher level implies that more information is logged.
pub const LOG_PRESOLVE : i32 = 49;
/// Controls amount of output printed when response codes are reported. A higher level implies that more information is logged.
pub const LOG_RESPONSE : i32 = 50;
/// Control logging in sensitivity analyzer.
pub const LOG_SENSITIVITY : i32 = 51;
/// Control logging in sensitivity analyzer.
pub const LOG_SENSITIVITY_OPT : i32 = 52;
/// Controls the amount of log information from the simplex optimizers.
pub const LOG_SIM : i32 = 53;
/// Controls simplex logging frequency.
pub const LOG_SIM_FREQ : i32 = 54;
/// Currently not in use.
pub const LOG_SIM_MINOR : i32 = 55;
/// Controls the memory related log information.
pub const LOG_STORAGE : i32 = 56;
/// Each warning is shown a limited number of times controlled by this parameter. A negative value is identical to infinite number of times.
pub const MAX_NUM_WARNINGS : i32 = 57;
/// Controls whether the mixed-integer optimizer is branching up or down by default.
pub const MIO_BRANCH_DIR : i32 = 58;
/// Toggles outer approximation for conic problems.
pub const MIO_CONIC_OUTER_APPROXIMATION : i32 = 59;
/// Controls if an initial mixed integer solution should be constructed from the values of the integer variables.
pub const MIO_CONSTRUCT_SOL : i32 = 60;
/// Controls whether clique cuts should be generated.
pub const MIO_CUT_CLIQUE : i32 = 61;
/// Controls whether mixed integer rounding cuts should be generated.
pub const MIO_CUT_CMIR : i32 = 62;
/// Controls whether GMI cuts should be generated.
pub const MIO_CUT_GMI : i32 = 63;
/// Controls whether implied bound cuts should be generated.
pub const MIO_CUT_IMPLIED_BOUND : i32 = 64;
/// Controls whether knapsack cover cuts should be generated.
pub const MIO_CUT_KNAPSACK_COVER : i32 = 65;
/// Controls whether lift-and-project cuts should be generated.
pub const MIO_CUT_LIPRO : i32 = 66;
/// Controls how aggressively generated cuts are selected to be included in the relaxation.
pub const MIO_CUT_SELECTION_LEVEL : i32 = 67;
/// Controls what problem data permutation method is appplied to mixed-integer problems.
pub const MIO_DATA_PERMUTATION_METHOD : i32 = 68;
/// Controls the amount of dual ray analysis employed by the mixed-integer optimizer in presolve.
pub const MIO_DUAL_RAY_ANALYSIS_LEVEL : i32 = 69;
/// Controls the way the Feasibility Pump heuristic is employed by the mixed-integer optimizer.
pub const MIO_FEASPUMP_LEVEL : i32 = 70;
/// Controls the heuristic employed by the mixed-integer optimizer to locate an initial integer feasible solution.
pub const MIO_HEURISTIC_LEVEL : i32 = 71;
/// Maximum number of branches allowed during the branch and bound search.
pub const MIO_MAX_NUM_BRANCHES : i32 = 72;
/// Maximum number of relaxations in branch and bound search.
pub const MIO_MAX_NUM_RELAXS : i32 = 73;
/// Maximum number of restarts allowed during the branch and bound search.
pub const MIO_MAX_NUM_RESTARTS : i32 = 74;
/// Maximum number of cut separation rounds at the root node.
pub const MIO_MAX_NUM_ROOT_CUT_ROUNDS : i32 = 75;
/// Controls how many feasible solutions the mixed-integer optimizer investigates.
pub const MIO_MAX_NUM_SOLUTIONS : i32 = 76;
/// Controls how much emphasis is put on reducing memory usage.
pub const MIO_MEMORY_EMPHASIS_LEVEL : i32 = 77;
/// Number of times a variable must have been branched on for its pseudocost to be considered reliable.
pub const MIO_MIN_REL : i32 = 78;
/// Turns on/off the mixed-integer mode.
pub const MIO_MODE : i32 = 79;
/// Controls which optimizer is employed at the non-root nodes in the mixed-integer optimizer.
pub const MIO_NODE_OPTIMIZER : i32 = 80;
/// Controls the node selection strategy employed by the mixed-integer optimizer.
pub const MIO_NODE_SELECTION : i32 = 81;
/// Controls how much emphasis is put on reducing numerical problems
pub const MIO_NUMERICAL_EMPHASIS_LEVEL : i32 = 82;
/// Enables or disables perspective reformulation in presolve.
pub const MIO_PERSPECTIVE_REFORMULATE : i32 = 83;
/// Controls if the aggregator should be used.
pub const MIO_PRESOLVE_AGGREGATOR_USE : i32 = 84;
/// Controls the amount of probing employed by the mixed-integer optimizer in presolve.
pub const MIO_PROBING_LEVEL : i32 = 85;
/// Use objective domain propagation.
pub const MIO_PROPAGATE_OBJECTIVE_CONSTRAINT : i32 = 86;
/// Controls what reformulation method is applied to mixed-integer quadratic problems.
pub const MIO_QCQO_REFORMULATION_METHOD : i32 = 87;
/// Maximum number of nodes in each call to RINS.
pub const MIO_RINS_MAX_NODES : i32 = 88;
/// Controls which optimizer is employed at the root node in the mixed-integer optimizer.
pub const MIO_ROOT_OPTIMIZER : i32 = 89;
/// Controls whether presolve can be repeated at root node.
pub const MIO_ROOT_REPEAT_PRESOLVE_LEVEL : i32 = 90;
/// Sets the random seed used for randomization in the mixed integer optimizer.
pub const MIO_SEED : i32 = 91;
/// Controls the amount of symmetry detection and handling employed by the mixed-integer optimizer in presolve.
pub const MIO_SYMMETRY_LEVEL : i32 = 92;
/// Controls the variable selection strategy employed by the mixed-integer optimizer.
pub const MIO_VAR_SELECTION : i32 = 93;
/// Controls how much effort is put into detecting variable bounds.
pub const MIO_VB_DETECTION_LEVEL : i32 = 94;
/// Set the number of iterations to spin before sleeping.
pub const MT_SPINCOUNT : i32 = 95;
/// Not in use
pub const NG : i32 = 96;
/// The number of threads employed by the optimizer.
pub const NUM_THREADS : i32 = 97;
/// Write a text header with date and MOSEK version in an OPF file.
pub const OPF_WRITE_HEADER : i32 = 98;
/// Write a hint section with problem dimensions in the beginning of an OPF file.
pub const OPF_WRITE_HINTS : i32 = 99;
/// Aim to keep lines in OPF files not much longer than this.
pub const OPF_WRITE_LINE_LENGTH : i32 = 100;
/// Write a parameter section in an OPF file.
pub const OPF_WRITE_PARAMETERS : i32 = 101;
/// Write objective, constraints, bounds etc. to an OPF file.
pub const OPF_WRITE_PROBLEM : i32 = 102;
/// Controls what is written to the OPF files.
pub const OPF_WRITE_SOL_BAS : i32 = 103;
/// Controls what is written to the OPF files.
pub const OPF_WRITE_SOL_ITG : i32 = 104;
/// Controls what is written to the OPF files.
pub const OPF_WRITE_SOL_ITR : i32 = 105;
/// Enable inclusion of solutions in the OPF files.
pub const OPF_WRITE_SOLUTIONS : i32 = 106;
/// Controls which optimizer is used to optimize the task.
pub const OPTIMIZER : i32 = 107;
/// If turned on, then names in the parameter file are case sensitive.
pub const PARAM_READ_CASE_NAME : i32 = 108;
/// If turned on, then errors in parameter settings is ignored.
pub const PARAM_READ_IGN_ERROR : i32 = 109;
/// Maximum amount of fill-in created in one pivot during the elimination phase.
pub const PRESOLVE_ELIMINATOR_MAX_FILL : i32 = 110;
/// Control the maximum number of times the eliminator is tried.
pub const PRESOLVE_ELIMINATOR_MAX_NUM_TRIES : i32 = 111;
/// Currently not used.
pub const PRESOLVE_LEVEL : i32 = 112;
/// Controls linear dependency check in presolve.
pub const PRESOLVE_LINDEP_ABS_WORK_TRH : i32 = 113;
/// Controls whether whether a new experimental linear dependency checker is employed.
pub const PRESOLVE_LINDEP_NEW : i32 = 114;
/// Controls linear dependency check in presolve.
pub const PRESOLVE_LINDEP_REL_WORK_TRH : i32 = 115;
/// Controls whether the linear constraints are checked for linear dependencies.
pub const PRESOLVE_LINDEP_USE : i32 = 116;
/// Control the maximum number of times presolve passes over the problem.
pub const PRESOLVE_MAX_NUM_PASS : i32 = 117;
/// Controls the maximum number of reductions performed by the presolve.
pub const PRESOLVE_MAX_NUM_REDUCTIONS : i32 = 118;
/// Controls whether the presolve is applied to a problem before it is optimized.
pub const PRESOLVE_USE : i32 = 119;
/// Controls which optimizer that is used to find the optimal repair.
pub const PRIMAL_REPAIR_OPTIMIZER : i32 = 120;
/// Controls whether parameters section is written in PTF files.
pub const PTF_WRITE_PARAMETERS : i32 = 121;
/// Controls whether solution section is written in PTF files.
pub const PTF_WRITE_SOLUTIONS : i32 = 122;
/// Controls if simple transformation are done when writing PTF files.
pub const PTF_WRITE_TRANSFORM : i32 = 123;
/// Turns on additional debugging information when reading files.
pub const READ_DEBUG : i32 = 124;
/// Controls whether the free constraints are included in the problem.
pub const READ_KEEP_FREE_CON : i32 = 125;
/// Controls how strictly the MPS file reader interprets the MPS format.
pub const READ_MPS_FORMAT : i32 = 126;
/// Controls the maximal number of characters allowed in one line of the MPS file.
pub const READ_MPS_WIDTH : i32 = 127;
/// Controls what information is used from the task files.
pub const READ_TASK_IGNORE_PARAM : i32 = 128;
/// Use compression when sending data to an optimization server
pub const REMOTE_USE_COMPRESSION : i32 = 129;
/// Removes unused solutions before the optimization is performed.
pub const REMOVE_UNUSED_SOLUTIONS : i32 = 130;
/// Controls sensitivity report behavior.
pub const SENSITIVITY_ALL : i32 = 131;
/// Controls which optimizer is used for optimal partition sensitivity analysis.
pub const SENSITIVITY_OPTIMIZER : i32 = 132;
/// Controls which type of sensitivity analysis is to be performed.
pub const SENSITIVITY_TYPE : i32 = 133;
/// Controls whether an LU factorization of the basis is used in a hot-start.
pub const SIM_BASIS_FACTOR_USE : i32 = 134;
/// Controls how aggressively degeneration is handled.
pub const SIM_DEGEN : i32 = 135;
/// Not in use.
pub const SIM_DETECT_PWL : i32 = 136;
/// Controls whether crashing is performed in the dual simplex optimizer.
pub const SIM_DUAL_CRASH : i32 = 137;
/// An experimental feature.
pub const SIM_DUAL_PHASEONE_METHOD : i32 = 138;
/// Controls how aggressively restricted selection is used.
pub const SIM_DUAL_RESTRICT_SELECTION : i32 = 139;
/// Controls the dual simplex strategy.
pub const SIM_DUAL_SELECTION : i32 = 140;
/// Controls if the simplex optimizers are allowed to exploit duplicated columns.
pub const SIM_EXPLOIT_DUPVEC : i32 = 141;
/// Controls the type of hot-start that the simplex optimizer perform.
pub const SIM_HOTSTART : i32 = 142;
/// Determines if the simplex optimizer should exploit the initial factorization.
pub const SIM_HOTSTART_LU : i32 = 143;
/// Maximum number of iterations that can be used by a simplex optimizer.
pub const SIM_MAX_ITERATIONS : i32 = 144;
/// Controls how many set-backs that are allowed within a simplex optimizer.
pub const SIM_MAX_NUM_SETBACKS : i32 = 145;
/// Controls if the simplex optimizer ensures a non-singular basis, if possible.
pub const SIM_NON_SINGULAR : i32 = 146;
/// Controls the simplex crash.
pub const SIM_PRIMAL_CRASH : i32 = 147;
/// An experimental feature.
pub const SIM_PRIMAL_PHASEONE_METHOD : i32 = 148;
/// Controls how aggressively restricted selection is used.
pub const SIM_PRIMAL_RESTRICT_SELECTION : i32 = 149;
/// Controls the primal simplex strategy.
pub const SIM_PRIMAL_SELECTION : i32 = 150;
/// Controls the basis refactoring frequency.
pub const SIM_REFACTOR_FREQ : i32 = 151;
/// Controls if the simplex optimizers are allowed to reformulate the problem.
pub const SIM_REFORMULATION : i32 = 152;
/// Controls if the LU factorization stored should be replaced with the LU factorization corresponding to the initial basis.
pub const SIM_SAVE_LU : i32 = 153;
/// Controls how much effort is used in scaling the problem before a simplex optimizer is used.
pub const SIM_SCALING : i32 = 154;
/// Controls how the problem is scaled before a simplex optimizer is used.
pub const SIM_SCALING_METHOD : i32 = 155;
/// Sets the random seed used for randomization in the simplex optimizers.
pub const SIM_SEED : i32 = 156;
/// Controls whether the primal or the dual problem is solved by the primal-/dual-simplex optimizer.
pub const SIM_SOLVE_FORM : i32 = 157;
/// Controls how high priority the numerical stability should be given.
pub const SIM_STABILITY_PRIORITY : i32 = 158;
/// Controls the simplex behavior.
pub const SIM_SWITCH_OPTIMIZER : i32 = 159;
/// Control the contents of the solution files.
pub const SOL_FILTER_KEEP_BASIC : i32 = 160;
/// Control the contents of the solution files.
pub const SOL_FILTER_KEEP_RANGED : i32 = 161;
/// Controls the input solution file format.
pub const SOL_READ_NAME_WIDTH : i32 = 162;
/// Controls the input solution file format.
pub const SOL_READ_WIDTH : i32 = 163;
/// Indicates whether solution callbacks will be performed during the optimization.
pub const SOLUTION_CALLBACK : i32 = 164;
/// Controls the amount of timing performed inside MOSEK.
pub const TIMING_LEVEL : i32 = 165;
/// Controls the basic solution file format.
pub const WRITE_BAS_CONSTRAINTS : i32 = 166;
/// Controls the basic solution file format.
pub const WRITE_BAS_HEAD : i32 = 167;
/// Controls the basic solution file format.
pub const WRITE_BAS_VARIABLES : i32 = 168;
/// Controls output file compression.
pub const WRITE_COMPRESSION : i32 = 169;
/// Controls output file data.
pub const WRITE_DATA_PARAM : i32 = 170;
/// Controls the output file data.
pub const WRITE_FREE_CON : i32 = 171;
/// Controls the output file data.
pub const WRITE_GENERIC_NAMES : i32 = 172;
/// Index origin used in generic names.
pub const WRITE_GENERIC_NAMES_IO : i32 = 173;
/// Controls if the writer ignores incompatible problem items when writing files.
pub const WRITE_IGNORE_INCOMPATIBLE_ITEMS : i32 = 174;
/// Controls the integer solution file format.
pub const WRITE_INT_CONSTRAINTS : i32 = 175;
/// Controls the integer solution file format.
pub const WRITE_INT_HEAD : i32 = 176;
/// Controls the integer solution file format.
pub const WRITE_INT_VARIABLES : i32 = 177;
/// When set, the JSON task and solution files are written with indentation for better readability.
pub const WRITE_JSON_INDENTATION : i32 = 178;
/// Write full linear objective
pub const WRITE_LP_FULL_OBJ : i32 = 179;
/// Controls the LP output file format.
pub const WRITE_LP_LINE_WIDTH : i32 = 180;
/// Controls in which format the MPS is written.
pub const WRITE_MPS_FORMAT : i32 = 181;
/// Controls the output file data.
pub const WRITE_MPS_INT : i32 = 182;
/// Controls the solution file format.
pub const WRITE_SOL_BARVARIABLES : i32 = 183;
/// Controls the solution file format.
pub const WRITE_SOL_CONSTRAINTS : i32 = 184;
/// Controls solution file format.
pub const WRITE_SOL_HEAD : i32 = 185;
/// Controls whether the user specified names are employed even if they are invalid names.
pub const WRITE_SOL_IGNORE_INVALID_NAMES : i32 = 186;
/// Controls the solution file format.
pub const WRITE_SOL_VARIABLES : i32 = 187;
/// Controls whether the solutions are stored in the task file too.
pub const WRITE_TASK_INC_SOL : i32 = 188;
/// Controls if linear coefficients should be written by row or column when writing in the XML file format.
pub const WRITE_XML_MODE : i32 = 189;
} // impl Iparam
/// Specifies the branching direction.
#[non_exhaustive]
pub struct Branchdir;
impl Branchdir {
/// The mixed-integer optimizer decides which branch to choose.
pub const FREE : i32 = 0;
/// The mixed-integer optimizer always chooses the up branch first.
pub const UP : i32 = 1;
/// The mixed-integer optimizer always chooses the down branch first.
pub const DOWN : i32 = 2;
/// Branch in direction nearest to selected fractional variable.
pub const NEAR : i32 = 3;
/// Branch in direction farthest from selected fractional variable.
pub const FAR : i32 = 4;
/// Chose direction based on root lp value of selected variable.
pub const ROOT_LP : i32 = 5;
/// Branch in direction of current incumbent.
pub const GUIDED : i32 = 6;
/// Branch based on the pseudocost of the variable.
pub const PSEUDOCOST : i32 = 7;
} // impl Branchdir
/// Specifies the reformulation method for mixed-integer quadratic problems.
#[non_exhaustive]
pub struct Miqcqoreformmethod;
impl Miqcqoreformmethod {
/// The mixed-integer optimizer decides which reformulation method to apply.
pub const FREE : i32 = 0;
/// No reformulation method is applied.
pub const NONE : i32 = 1;
/// A reformulation via linearization is applied.
pub const LINEARIZATION : i32 = 2;
/// The eigenvalue method is applied.
pub const EIGEN_VAL_METHOD : i32 = 3;
/// A perturbation of matrix diagonals via the solution of SDPs is applied.
pub const DIAG_SDP : i32 = 4;
/// A Reformulation based on the solution of an SDP-relaxation of the problem is applied.
pub const RELAX_SDP : i32 = 5;
} // impl Miqcqoreformmethod
/// Specifies the problem data permutation method for mixed-integer problems.
#[non_exhaustive]
pub struct Miodatapermmethod;
impl Miodatapermmethod {
/// No problem data permutation is applied.
pub const NONE : i32 = 0;
/// A random cyclic shift is applied to permute the problem data.
pub const CYCLIC_SHIFT : i32 = 1;
/// A random permutation is applied to the problem data.
pub const RANDOM : i32 = 2;
} // impl Miodatapermmethod
/// Continuous mixed-integer solution type
#[non_exhaustive]
pub struct Miocontsoltype;
impl Miocontsoltype {
/// No interior-point or basic solution.
pub const NONE : i32 = 0;
/// Solutions to the root node problem.
pub const ROOT : i32 = 1;
/// A feasible primal solution.
pub const ITG : i32 = 2;
/// A feasible primal solution or a root node solution if the problem is infeasible.
pub const ITG_REL : i32 = 3;
} // impl Miocontsoltype
/// Integer restrictions
#[non_exhaustive]
pub struct Miomode;
impl Miomode {
/// The integer constraints are ignored and the problem is solved as a continuous problem.
pub const IGNORED : i32 = 0;
/// Integer restrictions should be satisfied.
pub const SATISFIED : i32 = 1;
} // impl Miomode
/// Mixed-integer node selection types
#[non_exhaustive]
pub struct Mionodeseltype;
impl Mionodeseltype {
/// The optimizer decides the node selection strategy.
pub const FREE : i32 = 0;
/// The optimizer employs a depth first node selection strategy.
pub const FIRST : i32 = 1;
/// The optimizer employs a best bound node selection strategy.
pub const BEST : i32 = 2;
/// The optimizer employs selects the node based on a pseudo cost estimate.
pub const PSEUDO : i32 = 3;
} // impl Mionodeseltype
/// Mixed-integer variable selection types
#[non_exhaustive]
pub struct Miovarseltype;
impl Miovarseltype {
/// The optimizer decides the variable selection strategy.
pub const FREE : i32 = 0;
/// The optimizer employs pseudocost variable selection.
pub const PSEUDOCOST : i32 = 1;
/// The optimizer employs strong branching variable selection.
pub const STRONG : i32 = 2;
} // impl Miovarseltype
/// MPS file format type
#[non_exhaustive]
pub struct Mpsformat;
impl Mpsformat {
/// It is assumed that the input file satisfies the MPS format strictly.
pub const STRICT : i32 = 0;
/// It is assumed that the input file satisfies a slightly relaxed version of the MPS format.
pub const RELAXED : i32 = 1;
/// It is assumed that the input file satisfies the free MPS format. This implies that spaces are not allowed in names. Otherwise the format is free.
pub const FREE : i32 = 2;
/// The CPLEX compatible version of the MPS format is employed.
pub const CPLEX : i32 = 3;
} // impl Mpsformat
/// Objective sense types
#[non_exhaustive]
pub struct Objsense;
impl Objsense {
/// The problem should be minimized.
pub const MINIMIZE : i32 = 0;
/// The problem should be maximized.
pub const MAXIMIZE : i32 = 1;
} // impl Objsense
/// On/off
#[non_exhaustive]
pub struct Onoffkey;
impl Onoffkey {
/// Switch the option off.
pub const OFF : i32 = 0;
/// Switch the option on.
pub const ON : i32 = 1;
} // impl Onoffkey
/// Optimizer types
#[non_exhaustive]
pub struct Optimizertype;
impl Optimizertype {
/// The optimizer for problems having conic constraints.
pub const CONIC : i32 = 0;
/// The dual simplex optimizer is used.
pub const DUAL_SIMPLEX : i32 = 1;
/// The optimizer is chosen automatically.
pub const FREE : i32 = 2;
/// One of the simplex optimizers is used.
pub const FREE_SIMPLEX : i32 = 3;
/// The interior-point optimizer is used.
pub const INTPNT : i32 = 4;
/// The mixed-integer optimizer.
pub const MIXED_INT : i32 = 5;
/// The primal simplex optimizer is used.
pub const PRIMAL_SIMPLEX : i32 = 6;
} // impl Optimizertype
/// Ordering strategies
#[non_exhaustive]
pub struct Orderingtype;
impl Orderingtype {
/// The ordering method is chosen automatically.
pub const FREE : i32 = 0;
/// Approximate minimum local fill-in ordering is employed.
pub const APPMINLOC : i32 = 1;
/// This option should not be used.
pub const EXPERIMENTAL : i32 = 2;
/// Always try the graph partitioning based ordering.
pub const TRY_GRAPHPAR : i32 = 3;
/// Always use the graph partitioning based ordering even if it is worse than the approximate minimum local fill ordering.
pub const FORCE_GRAPHPAR : i32 = 4;
/// No ordering is used. Note using this value almost always leads to a significantly slow down.
pub const NONE : i32 = 5;
} // impl Orderingtype
/// Presolve method.
#[non_exhaustive]
pub struct Presolvemode;
impl Presolvemode {
/// The problem is not presolved before it is optimized.
pub const OFF : i32 = 0;
/// The problem is presolved before it is optimized.
pub const ON : i32 = 1;
/// It is decided automatically whether to presolve before the problem is optimized.
pub const FREE : i32 = 2;
} // impl Presolvemode
/// Parameter type
#[non_exhaustive]
pub struct Parametertype;
impl Parametertype {
/// Not a valid parameter.
pub const INVALID_TYPE : i32 = 0;
/// Is a double parameter.
pub const DOU_TYPE : i32 = 1;
/// Is an integer parameter.
pub const INT_TYPE : i32 = 2;
/// Is a string parameter.
pub const STR_TYPE : i32 = 3;
} // impl Parametertype
/// Problem data items
#[non_exhaustive]
pub struct Problemitem;
impl Problemitem {
/// Item is a variable.
pub const VAR : i32 = 0;
/// Item is a constraint.
pub const CON : i32 = 1;
/// Item is a cone.
pub const CONE : i32 = 2;
} // impl Problemitem
/// Problem types
#[non_exhaustive]
pub struct Problemtype;
impl Problemtype {
/// The problem is a linear optimization problem.
pub const LO : i32 = 0;
/// The problem is a quadratic optimization problem.
pub const QO : i32 = 1;
/// The problem is a quadratically constrained optimization problem.
pub const QCQO : i32 = 2;
/// A conic optimization.
pub const CONIC : i32 = 3;
/// General nonlinear constraints and conic constraints. This combination can not be solved by MOSEK.
pub const MIXED : i32 = 4;
} // impl Problemtype
/// Problem status keys
#[non_exhaustive]
pub struct Prosta;
impl Prosta {
/// Unknown problem status.
pub const UNKNOWN : i32 = 0;
/// The problem is primal and dual feasible.
pub const PRIM_AND_DUAL_FEAS : i32 = 1;
/// The problem is primal feasible.
pub const PRIM_FEAS : i32 = 2;
/// The problem is dual feasible.
pub const DUAL_FEAS : i32 = 3;
/// The problem is primal infeasible.
pub const PRIM_INFEAS : i32 = 4;
/// The problem is dual infeasible.
pub const DUAL_INFEAS : i32 = 5;
/// The problem is primal and dual infeasible.
pub const PRIM_AND_DUAL_INFEAS : i32 = 6;
/// The problem is ill-posed. For example, it may be primal and dual feasible but have a positive duality gap.
pub const ILL_POSED : i32 = 7;
/// The problem is either primal infeasible or unbounded. This may occur for mixed-integer problems.
pub const PRIM_INFEAS_OR_UNBOUNDED : i32 = 8;
} // impl Prosta
/// XML writer output mode
#[non_exhaustive]
pub struct Xmlwriteroutputtype;
impl Xmlwriteroutputtype {
/// Write in row order.
pub const ROW : i32 = 0;
/// Write in column order.
pub const COL : i32 = 1;
} // impl Xmlwriteroutputtype
/// Response codes
#[non_exhaustive]
pub struct Rescode;
impl Rescode {
/// No error occurred.
pub const OK : i32 = 0;
/// The parameter file could not be opened.
pub const WRN_OPEN_PARAM_FILE : i32 = 50;
/// A numerically large bound value is specified.
pub const WRN_LARGE_BOUND : i32 = 51;
/// A numerically large lower bound value is specified.
pub const WRN_LARGE_LO_BOUND : i32 = 52;
/// A numerically large upper bound value is specified.
pub const WRN_LARGE_UP_BOUND : i32 = 53;
/// A equality constraint is fixed to numerically large value.
pub const WRN_LARGE_CON_FX : i32 = 54;
/// A numerically large value is specified for one element in c.
pub const WRN_LARGE_CJ : i32 = 57;
/// A numerically large value is specified for an element in A.
pub const WRN_LARGE_AIJ : i32 = 62;
/// One or more zero elements are specified in A.
pub const WRN_ZERO_AIJ : i32 = 63;
/// A name is longer than the buffer that is supposed to hold it.
pub const WRN_NAME_MAX_LEN : i32 = 65;
/// A value for a string parameter is longer than the buffer that is supposed to hold it.
pub const WRN_SPAR_MAX_LEN : i32 = 66;
/// An RHS vector is split into several nonadjacent parts.
pub const WRN_MPS_SPLIT_RHS_VECTOR : i32 = 70;
/// A RANGE vector is split into several nonadjacent parts in an MPS file.
pub const WRN_MPS_SPLIT_RAN_VECTOR : i32 = 71;
/// A BOUNDS vector is split into several nonadjacent parts in an MPS file.
pub const WRN_MPS_SPLIT_BOU_VECTOR : i32 = 72;
/// Missing '/2' after quadratic expressions in bound or objective.
pub const WRN_LP_OLD_QUAD_FORMAT : i32 = 80;
/// Ignore a variable because the variable was not previously defined.
pub const WRN_LP_DROP_VARIABLE : i32 = 85;
/// Non-zero elements specified in the upper triangle of a matrix were ignored.
pub const WRN_NZ_IN_UPR_TRI : i32 = 200;
/// One or more non-zero elements were dropped in the Q matrix in the objective.
pub const WRN_DROPPED_NZ_QOBJ : i32 = 201;
/// Ignored integer constraints.
pub const WRN_IGNORE_INTEGER : i32 = 250;
/// No global optimizer is available.
pub const WRN_NO_GLOBAL_OPTIMIZER : i32 = 251;
/// The final mixed-integer problem with all the integer variables fixed at their optimal values is infeasible.
pub const WRN_MIO_INFEASIBLE_FINAL : i32 = 270;
/// Invalid solution filter is specified.
pub const WRN_SOL_FILTER : i32 = 300;
/// Undefined name occurred in a solution.
pub const WRN_UNDEF_SOL_FILE_NAME : i32 = 350;
/// One or more lines in the constraint section were ignored when reading a solution file.
pub const WRN_SOL_FILE_IGNORED_CON : i32 = 351;
/// One or more lines in the variable section were ignored when reading a solution file.
pub const WRN_SOL_FILE_IGNORED_VAR : i32 = 352;
/// An incomplete basis is specified.
pub const WRN_TOO_FEW_BASIS_VARS : i32 = 400;
/// A basis with too many variables is specified.
pub const WRN_TOO_MANY_BASIS_VARS : i32 = 405;
/// The license expires.
pub const WRN_LICENSE_EXPIRE : i32 = 500;
/// The license server is not responding.
pub const WRN_LICENSE_SERVER : i32 = 501;
/// A variable or constraint name is empty. The output file may be invalid.
pub const WRN_EMPTY_NAME : i32 = 502;
/// Generic names are used because a name is invalid for requested format.
pub const WRN_USING_GENERIC_NAMES : i32 = 503;
/// A name e.g. a row name is not a valid MPS name.
pub const WRN_INVALID_MPS_NAME : i32 = 504;
/// The objective name is not a valid MPS name.
pub const WRN_INVALID_MPS_OBJ_NAME : i32 = 505;
/// The license expires.
pub const WRN_LICENSE_FEATURE_EXPIRE : i32 = 509;
/// Parameter name not recognized.
pub const WRN_PARAM_NAME_DOU : i32 = 510;
/// Parameter name not recognized.
pub const WRN_PARAM_NAME_INT : i32 = 511;
/// Parameter name not recognized.
pub const WRN_PARAM_NAME_STR : i32 = 512;
/// A parameter value is not correct.
pub const WRN_PARAM_STR_VALUE : i32 = 515;
/// A parameter was ignored by the conic mixed integer optimizer.
pub const WRN_PARAM_IGNORED_CMIO : i32 = 516;
/// One or more (near) zero elements are specified in a sparse row of a matrix.
pub const WRN_ZEROS_IN_SPARSE_ROW : i32 = 705;
/// One or more (near) zero elements are specified in a sparse column of a matrix.
pub const WRN_ZEROS_IN_SPARSE_COL : i32 = 710;
/// The linear dependency check(s) is incomplete.
pub const WRN_INCOMPLETE_LINEAR_DEPENDENCY_CHECK : i32 = 800;
/// The eliminator is skipped at least once due to lack of space.
pub const WRN_ELIMINATOR_SPACE : i32 = 801;
/// The presolve is incomplete due to lack of space.
pub const WRN_PRESOLVE_OUTOFSPACE : i32 = 802;
/// The presolve perturbed the bounds of the primal problem. This is an indication that the problem is nearly infeasible.
pub const WRN_PRESOLVE_PRIMAL_PERTUBATIONS : i32 = 803;
/// Some names were changed because they were invalid for the output file format.
pub const WRN_WRITE_CHANGED_NAMES : i32 = 830;
/// The fixed objective term was discarded in the output file.
pub const WRN_WRITE_DISCARDED_CFIX : i32 = 831;
/// Two constraint names are identical.
pub const WRN_DUPLICATE_CONSTRAINT_NAMES : i32 = 850;
/// Two variable names are identical.
pub const WRN_DUPLICATE_VARIABLE_NAMES : i32 = 851;
/// Two barvariable names are identical.
pub const WRN_DUPLICATE_BARVARIABLE_NAMES : i32 = 852;
/// Two cone names are identical.
pub const WRN_DUPLICATE_CONE_NAMES : i32 = 853;
/// LP file will be written with generic variable names.
pub const WRN_WRITE_LP_INVALID_VAR_NAMES : i32 = 854;
/// LP file will be written with generic variable names.
pub const WRN_WRITE_LP_DUPLICATE_VAR_NAMES : i32 = 855;
/// LP file will be written with generic constraint names.
pub const WRN_WRITE_LP_INVALID_CON_NAMES : i32 = 856;
/// LP file will be written with generic constraint names.
pub const WRN_WRITE_LP_DUPLICATE_CON_NAMES : i32 = 857;
/// Warn against very large bounds.
pub const WRN_ANA_LARGE_BOUNDS : i32 = 900;
/// Warn against all objective coefficients being zero.
pub const WRN_ANA_C_ZERO : i32 = 901;
/// Warn against empty columns.
pub const WRN_ANA_EMPTY_COLS : i32 = 902;
/// Warn against close bounds.
pub const WRN_ANA_CLOSE_BOUNDS : i32 = 903;
/// Warn against almost integral bounds.
pub const WRN_ANA_ALMOST_INT_BOUNDS : i32 = 904;
/// An infeasibility report is not available when the problem contains matrix variables.
pub const WRN_NO_INFEASIBILITY_REPORT_WHEN_MATRIX_VARIABLES : i32 = 930;
/// No automatic dualizer is available for the specified problem.
pub const WRN_NO_DUALIZER : i32 = 950;
/// A numerically large value is specified for an element in E.
pub const WRN_SYM_MAT_LARGE : i32 = 960;
/// A double parameter related to solver tolerances has a non-default value.
pub const WRN_MODIFIED_DOUBLE_PARAMETER : i32 = 970;
/// A numerically large value is specified for an element in F.
pub const WRN_LARGE_FIJ : i32 = 980;
/// Invalid license.
pub const ERR_LICENSE : i32 = 1000;
/// The license has expired.
pub const ERR_LICENSE_EXPIRED : i32 = 1001;
/// Invalid license version.
pub const ERR_LICENSE_VERSION : i32 = 1002;
/// The license server version is too old.
pub const ERR_LICENSE_OLD_SERVER_VERSION : i32 = 1003;
/// The problem is bigger than the license.
pub const ERR_SIZE_LICENSE : i32 = 1005;
/// The software is not licensed to solve the problem.
pub const ERR_PROB_LICENSE : i32 = 1006;
/// Invalid license file.
pub const ERR_FILE_LICENSE : i32 = 1007;
/// A license cannot be located.
pub const ERR_MISSING_LICENSE_FILE : i32 = 1008;
/// The problem has too many constraints.
pub const ERR_SIZE_LICENSE_CON : i32 = 1010;
/// The problem has too many variables.
pub const ERR_SIZE_LICENSE_VAR : i32 = 1011;
/// The problem contains too many integer variables.
pub const ERR_SIZE_LICENSE_INTVAR : i32 = 1012;
/// The optimizer required is not licensed.
pub const ERR_OPTIMIZER_LICENSE : i32 = 1013;
/// The license manager reported an error.
pub const ERR_FLEXLM : i32 = 1014;
/// The license server is not responding.
pub const ERR_LICENSE_SERVER : i32 = 1015;
/// Maximum number of licenses is reached.
pub const ERR_LICENSE_MAX : i32 = 1016;
/// The MOSEKLM license manager daemon is not up and running.
pub const ERR_LICENSE_MOSEKLM_DAEMON : i32 = 1017;
/// A requested feature is not available in the license file(s).
pub const ERR_LICENSE_FEATURE : i32 = 1018;
/// A requested license feature is not available for the required platform.
pub const ERR_PLATFORM_NOT_LICENSED : i32 = 1019;
/// The license system cannot allocate the memory required.
pub const ERR_LICENSE_CANNOT_ALLOCATE : i32 = 1020;
/// MOSEK cannot connect to the license server.
pub const ERR_LICENSE_CANNOT_CONNECT : i32 = 1021;
/// The host ID specified in the license file does not match the host ID of the computer.
pub const ERR_LICENSE_INVALID_HOSTID : i32 = 1025;
/// The version specified in the checkout request is greater than the highest version number the daemon supports.
pub const ERR_LICENSE_SERVER_VERSION : i32 = 1026;
/// The license server does not support the requested feature.
pub const ERR_LICENSE_NO_SERVER_SUPPORT : i32 = 1027;
/// No SERVER lines in license file.
pub const ERR_LICENSE_NO_SERVER_LINE : i32 = 1028;
/// The dynamic link library is older than the specified version.
pub const ERR_OLDER_DLL : i32 = 1035;
/// The dynamic link library is newer than the specified version.
pub const ERR_NEWER_DLL : i32 = 1036;
/// A file cannot be linked to a stream in the DLL version.
pub const ERR_LINK_FILE_DLL : i32 = 1040;
/// Could not initialize a mutex.
pub const ERR_THREAD_MUTEX_INIT : i32 = 1045;
/// Could not lock a mutex.
pub const ERR_THREAD_MUTEX_LOCK : i32 = 1046;
/// Could not unlock a mutex.
pub const ERR_THREAD_MUTEX_UNLOCK : i32 = 1047;
/// Could not create a thread.
pub const ERR_THREAD_CREATE : i32 = 1048;
/// Could not initialize a condition.
pub const ERR_THREAD_COND_INIT : i32 = 1049;
/// Unknown error.
pub const ERR_UNKNOWN : i32 = 1050;
/// Out of space.
pub const ERR_SPACE : i32 = 1051;
/// An error occurred while opening a file.
pub const ERR_FILE_OPEN : i32 = 1052;
/// An error occurred while reading file.
pub const ERR_FILE_READ : i32 = 1053;
/// An error occurred while writing to a file.
pub const ERR_FILE_WRITE : i32 = 1054;
/// The data file format cannot be determined from the file name.
pub const ERR_DATA_FILE_EXT : i32 = 1055;
/// An invalid file name has been specified.
pub const ERR_INVALID_FILE_NAME : i32 = 1056;
/// An invalid file name has been specified.
pub const ERR_INVALID_SOL_FILE_NAME : i32 = 1057;
/// End of file reached.
pub const ERR_END_OF_FILE : i32 = 1059;
/// env is a null pointer.
pub const ERR_NULL_ENV : i32 = 1060;
/// task is a null pointer.
pub const ERR_NULL_TASK : i32 = 1061;
/// An invalid stream is referenced.
pub const ERR_INVALID_STREAM : i32 = 1062;
/// Environment is not initialized.
pub const ERR_NO_INIT_ENV : i32 = 1063;
/// The task is invalid.
pub const ERR_INVALID_TASK : i32 = 1064;
/// An argument to a function is unexpectedly a null pointer.
pub const ERR_NULL_POINTER : i32 = 1065;
/// Not all tasks associated with the environment have been deleted.
pub const ERR_LIVING_TASKS : i32 = 1066;
/// Error encountered in GZIP stream.
pub const ERR_READ_GZIP : i32 = 1067;
/// Error encountered in ZSTD stream.
pub const ERR_READ_ZSTD : i32 = 1068;
/// An all blank name has been specified.
pub const ERR_BLANK_NAME : i32 = 1070;
/// Duplicate names specified.
pub const ERR_DUP_NAME : i32 = 1071;
/// The name format string is invalid.
pub const ERR_FORMAT_STRING : i32 = 1072;
/// The sparsity included an index that was out of bounds of the shape.
pub const ERR_SPARSITY_SPECIFICATION : i32 = 1073;
/// Mismatching dimensions specified in arguments
pub const ERR_MISMATCHING_DIMENSION : i32 = 1074;
/// An invalid objective name is specified.
pub const ERR_INVALID_OBJ_NAME : i32 = 1075;
/// An invalid constraint name is used.
pub const ERR_INVALID_CON_NAME : i32 = 1076;
/// An invalid variable name is used.
pub const ERR_INVALID_VAR_NAME : i32 = 1077;
/// An invalid cone name is used.
pub const ERR_INVALID_CONE_NAME : i32 = 1078;
/// An invalid symmetric matrix variable name is used.
pub const ERR_INVALID_BARVAR_NAME : i32 = 1079;
/// MOSEK is leaking memory.
pub const ERR_SPACE_LEAKING : i32 = 1080;
/// No available information about the space usage.
pub const ERR_SPACE_NO_INFO : i32 = 1081;
/// Invalid dimension specification
pub const ERR_DIMENSION_SPECIFICATION : i32 = 1082;
/// Invalid axis names specification
pub const ERR_AXIS_NAME_SPECIFICATION : i32 = 1083;
/// The specified format cannot be read.
pub const ERR_READ_FORMAT : i32 = 1090;
/// An error occurred while reading an MPS file.
pub const ERR_MPS_FILE : i32 = 1100;
/// Invalid field occurred while reading an MPS file.
pub const ERR_MPS_INV_FIELD : i32 = 1101;
/// An invalid marker has been specified in the MPS file.
pub const ERR_MPS_INV_MARKER : i32 = 1102;
/// An empty constraint name is used in an MPS file.
pub const ERR_MPS_NULL_CON_NAME : i32 = 1103;
/// An empty variable name is used in an MPS file.
pub const ERR_MPS_NULL_VAR_NAME : i32 = 1104;
/// An undefined constraint name occurred in an MPS file.
pub const ERR_MPS_UNDEF_CON_NAME : i32 = 1105;
/// An undefined variable name occurred in an MPS file.
pub const ERR_MPS_UNDEF_VAR_NAME : i32 = 1106;
/// An invalid constraint key occurred in an MPS file.
pub const ERR_MPS_INVALID_CON_KEY : i32 = 1107;
/// An invalid bound key occurred in an MPS file.
pub const ERR_MPS_INVALID_BOUND_KEY : i32 = 1108;
/// An invalid section name occurred in an MPS file.
pub const ERR_MPS_INVALID_SEC_NAME : i32 = 1109;
/// No objective is defined in an MPS file.
pub const ERR_MPS_NO_OBJECTIVE : i32 = 1110;
/// The non-zero elements in A corresponding to a variable in an MPS file must be specified consecutively.
pub const ERR_MPS_SPLITTED_VAR : i32 = 1111;
/// A constraint name is specified multiple times in the ROWS section in an MPS file.
pub const ERR_MPS_MUL_CON_NAME : i32 = 1112;
/// Multiple QSECTIONs are specified for a constraint.
pub const ERR_MPS_MUL_QSEC : i32 = 1113;
/// The Q term in the objective is specified multiple times.
pub const ERR_MPS_MUL_QOBJ : i32 = 1114;
/// The sections in an MPS file is not in the correct order.
pub const ERR_MPS_INV_SEC_ORDER : i32 = 1115;
/// Multiple CSECTIONs are given the same name.
pub const ERR_MPS_MUL_CSEC : i32 = 1116;
/// Invalid cone type specified in a CSECTION.
pub const ERR_MPS_CONE_TYPE : i32 = 1117;
/// A variable is specified to be a member of several cones.
pub const ERR_MPS_CONE_OVERLAP : i32 = 1118;
/// A variable is repeated within the CSECTION.
pub const ERR_MPS_CONE_REPEAT : i32 = 1119;
/// A non symmetric matrix has been speciefied.
pub const ERR_MPS_NON_SYMMETRIC_Q : i32 = 1120;
/// Duplicate elements is specified in a Q matrix.
pub const ERR_MPS_DUPLICATE_Q_ELEMENT : i32 = 1121;
/// An invalid objective sense is specified.
pub const ERR_MPS_INVALID_OBJSENSE : i32 = 1122;
/// A tab char occurred in field 2.
pub const ERR_MPS_TAB_IN_FIELD2 : i32 = 1125;
/// A tab char occurred in field 3.
pub const ERR_MPS_TAB_IN_FIELD3 : i32 = 1126;
/// A tab char occurred in field 5.
pub const ERR_MPS_TAB_IN_FIELD5 : i32 = 1127;
/// An invalid objective name is specified.
pub const ERR_MPS_INVALID_OBJ_NAME : i32 = 1128;
/// An invalid indicator key occurred in an MPS file.
pub const ERR_MPS_INVALID_KEY : i32 = 1129;
/// An invalid indicator constraint is used. It must not be a ranged constraint.
pub const ERR_MPS_INVALID_INDICATOR_CONSTRAINT : i32 = 1130;
/// An invalid indicator variable is specfied. It must be a binary variable.
pub const ERR_MPS_INVALID_INDICATOR_VARIABLE : i32 = 1131;
/// An invalid indicator value is specfied. It must be either 0 or 1.
pub const ERR_MPS_INVALID_INDICATOR_VALUE : i32 = 1132;
/// A quadratic constraint can be be an indicator constraint.
pub const ERR_MPS_INVALID_INDICATOR_QUADRATIC_CONSTRAINT : i32 = 1133;
/// Syntax error in an OPF file
pub const ERR_OPF_SYNTAX : i32 = 1134;
/// Premature end of file in an OPF file.
pub const ERR_OPF_PREMATURE_EOF : i32 = 1136;
/// Mismatched end-tag in OPF file
pub const ERR_OPF_MISMATCHED_TAG : i32 = 1137;
/// Either upper or lower bound was specified twice in OPF file
pub const ERR_OPF_DUPLICATE_BOUND : i32 = 1138;
/// Duplicate constraint name in OPF File
pub const ERR_OPF_DUPLICATE_CONSTRAINT_NAME : i32 = 1139;
/// Invalid cone type in OPF File
pub const ERR_OPF_INVALID_CONE_TYPE : i32 = 1140;
/// Invalid number of parameters in start-tag in OPF File
pub const ERR_OPF_INCORRECT_TAG_PARAM : i32 = 1141;
/// Invalid start-tag in OPF File
pub const ERR_OPF_INVALID_TAG : i32 = 1142;
/// Same variable appears in multiple cones in OPF File
pub const ERR_OPF_DUPLICATE_CONE_ENTRY : i32 = 1143;
/// The problem is too large to be correctly loaded
pub const ERR_OPF_TOO_LARGE : i32 = 1144;
/// Dual solution values are not allowed in OPF File
pub const ERR_OPF_DUAL_INTEGER_SOLUTION : i32 = 1146;
/// The problem cannot be written to an LP formatted file.
pub const ERR_LP_EMPTY : i32 = 1151;
/// An invalid name is created while writing an MPS file.
pub const ERR_WRITE_MPS_INVALID_NAME : i32 = 1153;
/// A variable name is invalid when used in an LP formatted file.
pub const ERR_LP_INVALID_VAR_NAME : i32 = 1154;
/// Empty variable names cannot be written to OPF files.
pub const ERR_WRITE_OPF_INVALID_VAR_NAME : i32 = 1156;
/// Syntax error in an LP file.
pub const ERR_LP_FILE_FORMAT : i32 = 1157;
/// Expected a number in LP file
pub const ERR_LP_EXPECTED_NUMBER : i32 = 1158;
/// Syntax error in LP fil. Possibly missing End tag.
pub const ERR_READ_LP_MISSING_END_TAG : i32 = 1159;
/// An indicator variable was not declared binary
pub const ERR_LP_INDICATOR_VAR : i32 = 1160;
/// Expected an objective section in LP file
pub const ERR_LP_EXPECTED_OBJECTIVE : i32 = 1161;
/// Expected constraint relation
pub const ERR_LP_EXPECTED_CONSTRAINT_RELATION : i32 = 1162;
/// Constraint has ambiguous or invalid bound
pub const ERR_LP_AMBIGUOUS_CONSTRAINT_BOUND : i32 = 1163;
/// Duplicate section
pub const ERR_LP_DUPLICATE_SECTION : i32 = 1164;
/// Duplicate section
pub const ERR_READ_LP_DELAYED_ROWS_NOT_SUPPORTED : i32 = 1165;
/// An error occurred while writing file
pub const ERR_WRITING_FILE : i32 = 1166;
/// An invalid name occurred in a solution file.
pub const ERR_INVALID_NAME_IN_SOL_FILE : i32 = 1170;
/// Syntax error in an JSON data
pub const ERR_JSON_SYNTAX : i32 = 1175;
/// Error in JSON string.
pub const ERR_JSON_STRING : i32 = 1176;
/// Invalid number entry - wrong type or value overflow.
pub const ERR_JSON_NUMBER_OVERFLOW : i32 = 1177;
/// Error in an JSON Task file
pub const ERR_JSON_FORMAT : i32 = 1178;
/// Inconsistent data in JSON Task file
pub const ERR_JSON_DATA : i32 = 1179;
/// Missing data section in JSON task file.
pub const ERR_JSON_MISSING_DATA : i32 = 1180;
/// Incompatible item
pub const ERR_PTF_INCOMPATIBILITY : i32 = 1181;
/// Undefined symbol referenced
pub const ERR_PTF_UNDEFINED_ITEM : i32 = 1182;
/// Inconsistent size of item
pub const ERR_PTF_INCONSISTENCY : i32 = 1183;
/// Syntax error in an PTF file
pub const ERR_PTF_FORMAT : i32 = 1184;
/// Incorrect length of arguments.
pub const ERR_ARGUMENT_LENNEQ : i32 = 1197;
/// Incorrect argument type.
pub const ERR_ARGUMENT_TYPE : i32 = 1198;
/// Incorrect number of function arguments.
pub const ERR_NUM_ARGUMENTS : i32 = 1199;
/// A function argument is incorrect.
pub const ERR_IN_ARGUMENT : i32 = 1200;
/// A function argument is of incorrect dimension.
pub const ERR_ARGUMENT_DIMENSION : i32 = 1201;
/// The size of the n-dimensional shape is too large.
pub const ERR_SHAPE_IS_TOO_LARGE : i32 = 1202;
/// An index in an argument is too small.
pub const ERR_INDEX_IS_TOO_SMALL : i32 = 1203;
/// An index in an argument is too large.
pub const ERR_INDEX_IS_TOO_LARGE : i32 = 1204;
/// An index in an argument is is unique.
pub const ERR_INDEX_IS_NOT_UNIQUE : i32 = 1205;
/// A parameter name is not correct.
pub const ERR_PARAM_NAME : i32 = 1206;
/// A parameter name is not correct.
pub const ERR_PARAM_NAME_DOU : i32 = 1207;
/// A parameter name is not correct.
pub const ERR_PARAM_NAME_INT : i32 = 1208;
/// A parameter name is not correct.
pub const ERR_PARAM_NAME_STR : i32 = 1209;
/// Parameter index is out of range.
pub const ERR_PARAM_INDEX : i32 = 1210;
/// A parameter value is too large.
pub const ERR_PARAM_IS_TOO_LARGE : i32 = 1215;
/// A parameter value is too small.
pub const ERR_PARAM_IS_TOO_SMALL : i32 = 1216;
/// A parameter value string is incorrect.
pub const ERR_PARAM_VALUE_STR : i32 = 1217;
/// A parameter type is invalid.
pub const ERR_PARAM_TYPE : i32 = 1218;
/// A double information index is out of range for the specified type.
pub const ERR_INF_DOU_INDEX : i32 = 1219;
/// An integer information index is out of range for the specified type.
pub const ERR_INF_INT_INDEX : i32 = 1220;
/// An index in an array argument is too small.
pub const ERR_INDEX_ARR_IS_TOO_SMALL : i32 = 1221;
/// An index in an array argument is too large.
pub const ERR_INDEX_ARR_IS_TOO_LARGE : i32 = 1222;
/// A long integer information index is out of range for the specified type.
pub const ERR_INF_LINT_INDEX : i32 = 1225;
/// The value of a argument is too small.
pub const ERR_ARG_IS_TOO_SMALL : i32 = 1226;
/// The value of a argument is too large.
pub const ERR_ARG_IS_TOO_LARGE : i32 = 1227;
/// whichsol is invalid.
pub const ERR_INVALID_WHICHSOL : i32 = 1228;
/// A double information name is invalid.
pub const ERR_INF_DOU_NAME : i32 = 1230;
/// An integer information name is invalid.
pub const ERR_INF_INT_NAME : i32 = 1231;
/// The information type is invalid.
pub const ERR_INF_TYPE : i32 = 1232;
/// A long integer information name is invalid.
pub const ERR_INF_LINT_NAME : i32 = 1234;
/// An index is out of range.
pub const ERR_INDEX : i32 = 1235;
/// The solution defined by whichsol does not exists.
pub const ERR_WHICHSOL : i32 = 1236;
/// The solution number solemn does not exists.
pub const ERR_SOLITEM : i32 = 1237;
/// whichitem is unacceptable.
pub const ERR_WHICHITEM_NOT_ALLOWED : i32 = 1238;
/// Invalid maximum number of constraints specified.
pub const ERR_MAXNUMCON : i32 = 1240;
/// The maximum number of variables limit is too small.
pub const ERR_MAXNUMVAR : i32 = 1241;
/// The maximum number of semidefinite variables limit is too small.
pub const ERR_MAXNUMBARVAR : i32 = 1242;
/// Too small maximum number of non-zeros for the Q matrices is specified.
pub const ERR_MAXNUMQNZ : i32 = 1243;
/// The maximum number of non-zeros specified is too small.
pub const ERR_TOO_SMALL_MAX_NUM_NZ : i32 = 1245;
/// A specified index is invalid.
pub const ERR_INVALID_IDX : i32 = 1246;
/// A specified index is invalid.
pub const ERR_INVALID_MAX_NUM : i32 = 1247;
/// The value of whichsol is not allowed.
pub const ERR_UNALLOWED_WHICHSOL : i32 = 1248;
/// Maximum number of constraints limit is exceeded.
pub const ERR_NUMCONLIM : i32 = 1250;
/// Maximum number of variables limit is exceeded.
pub const ERR_NUMVARLIM : i32 = 1251;
/// Too small maximum number of non-zeros in A specified.
pub const ERR_TOO_SMALL_MAXNUMANZ : i32 = 1252;
/// aptre\[j\] is strictly smaller than aptrb\[j\] for some j.
pub const ERR_INV_APTRE : i32 = 1253;
/// An element in A is defined multiple times.
pub const ERR_MUL_A_ELEMENT : i32 = 1254;
/// Invalid bound key.
pub const ERR_INV_BK : i32 = 1255;
/// Invalid bound key is specified for a constraint.
pub const ERR_INV_BKC : i32 = 1256;
/// An invalid bound key is specified for a variable.
pub const ERR_INV_BKX : i32 = 1257;
/// An invalid variable type is specified for a variable.
pub const ERR_INV_VAR_TYPE : i32 = 1258;
/// Problem type does not match the chosen optimizer.
pub const ERR_SOLVER_PROBTYPE : i32 = 1259;
/// Empty objective range.
pub const ERR_OBJECTIVE_RANGE : i32 = 1260;
/// Invalid response code.
pub const ERR_INV_RESCODE : i32 = 1261;
/// Invalid integer information item.
pub const ERR_INV_IINF : i32 = 1262;
/// Invalid long integer information item.
pub const ERR_INV_LIINF : i32 = 1263;
/// Invalid double information item.
pub const ERR_INV_DINF : i32 = 1264;
/// Invalid basis is specified.
pub const ERR_BASIS : i32 = 1266;
/// Invalid value in skc encountered.
pub const ERR_INV_SKC : i32 = 1267;
/// Invalid value in skx encountered.
pub const ERR_INV_SKX : i32 = 1268;
/// Invalid status key string encountered.
pub const ERR_INV_SK_STR : i32 = 1269;
/// Invalid status key code encountered.
pub const ERR_INV_SK : i32 = 1270;
/// Invalid cone type string encountered.
pub const ERR_INV_CONE_TYPE_STR : i32 = 1271;
/// Invalid cone type code encountered.
pub const ERR_INV_CONE_TYPE : i32 = 1272;
/// Invalid value in skn encountered.
pub const ERR_INV_SKN : i32 = 1274;
/// Invalid surplus.
pub const ERR_INVALID_SURPLUS : i32 = 1275;
/// An invalid name item code is used.
pub const ERR_INV_NAME_ITEM : i32 = 1280;
/// An invalid problem item is used.
pub const ERR_PRO_ITEM : i32 = 1281;
/// Invalid format type.
pub const ERR_INVALID_FORMAT_TYPE : i32 = 1283;
/// Invalid firsti.
pub const ERR_FIRSTI : i32 = 1285;
/// Invalid lasti.
pub const ERR_LASTI : i32 = 1286;
/// Invalid firstj.
pub const ERR_FIRSTJ : i32 = 1287;
/// Invalid lastj.
pub const ERR_LASTJ : i32 = 1288;
/// A maximum length that is too small has been specified.
pub const ERR_MAX_LEN_IS_TOO_SMALL : i32 = 1289;
/// The model contains a nonlinear equality.
pub const ERR_NONLINEAR_EQUALITY : i32 = 1290;
/// The optimization problem is nonconvex.
pub const ERR_NONCONVEX : i32 = 1291;
/// The problem contains a nonlinear constraint with inite lower and upper bound.
pub const ERR_NONLINEAR_RANGED : i32 = 1292;
/// The quadratic constraint matrix is not PSD.
pub const ERR_CON_Q_NOT_PSD : i32 = 1293;
/// The quadratic constraint matrix is not NSD.
pub const ERR_CON_Q_NOT_NSD : i32 = 1294;
/// The quadratic coefficient matrix in the objective is not PSD.
pub const ERR_OBJ_Q_NOT_PSD : i32 = 1295;
/// The quadratic coefficient matrix in the objective is not NSD.
pub const ERR_OBJ_Q_NOT_NSD : i32 = 1296;
/// An invalid permutation array is specified.
pub const ERR_ARGUMENT_PERM_ARRAY : i32 = 1299;
/// An index of a non-existing cone has been specified.
pub const ERR_CONE_INDEX : i32 = 1300;
/// A cone with incorrect number of members is specified.
pub const ERR_CONE_SIZE : i32 = 1301;
/// One or more of variables in the cone to be added is already member of another cone.
pub const ERR_CONE_OVERLAP : i32 = 1302;
/// A variable is included multiple times in the cone.
pub const ERR_CONE_REP_VAR : i32 = 1303;
/// The value specified for maxnumcone is too small.
pub const ERR_MAXNUMCONE : i32 = 1304;
/// Invalid cone type specified.
pub const ERR_CONE_TYPE : i32 = 1305;
/// Invalid cone type specified.
pub const ERR_CONE_TYPE_STR : i32 = 1306;
/// The cone to be appended has one variable which is already member of another cone.
pub const ERR_CONE_OVERLAP_APPEND : i32 = 1307;
/// A variable cannot be removed because it will make a cone invalid.
pub const ERR_REMOVE_CONE_VARIABLE : i32 = 1310;
/// Trying to append a too big cone.
pub const ERR_APPENDING_TOO_BIG_CONE : i32 = 1311;
/// An invalid cone parameter.
pub const ERR_CONE_PARAMETER : i32 = 1320;
/// An invalid number is specified in a solution file.
pub const ERR_SOL_FILE_INVALID_NUMBER : i32 = 1350;
/// A huge value in absolute size is specified for an objective coefficient.
pub const ERR_HUGE_C : i32 = 1375;
/// A numerically huge value is specified for an element in A.
pub const ERR_HUGE_AIJ : i32 = 1380;
/// An element in the A matrix is specified twice.
pub const ERR_DUPLICATE_AIJ : i32 = 1385;
/// The lower bound specified is not a number (nan).
pub const ERR_LOWER_BOUND_IS_A_NAN : i32 = 1390;
/// The upper bound specified is not a number (nan).
pub const ERR_UPPER_BOUND_IS_A_NAN : i32 = 1391;
/// A numerically huge bound value is specified.
pub const ERR_INFINITE_BOUND : i32 = 1400;
/// Invalid value %d at qosubi.
pub const ERR_INV_QOBJ_SUBI : i32 = 1401;
/// Invalid value in qosubj.
pub const ERR_INV_QOBJ_SUBJ : i32 = 1402;
/// Invalid value in qoval.
pub const ERR_INV_QOBJ_VAL : i32 = 1403;
/// Invalid value in qcsubk.
pub const ERR_INV_QCON_SUBK : i32 = 1404;
/// Invalid value in qcsubi.
pub const ERR_INV_QCON_SUBI : i32 = 1405;
/// Invalid value in qcsubj.
pub const ERR_INV_QCON_SUBJ : i32 = 1406;
/// Invalid value in qcval.
pub const ERR_INV_QCON_VAL : i32 = 1407;
/// Invalid value in qcsubi.
pub const ERR_QCON_SUBI_TOO_SMALL : i32 = 1408;
/// Invalid value in qcsubi.
pub const ERR_QCON_SUBI_TOO_LARGE : i32 = 1409;
/// An element in the upper triangle of the quadratic term in the objective is specified.
pub const ERR_QOBJ_UPPER_TRIANGLE : i32 = 1415;
/// An element in the upper triangle of the quadratic term in a constraint.
pub const ERR_QCON_UPPER_TRIANGLE : i32 = 1417;
/// A fixed constraint/variable has been specified using the bound keys but the numerical bounds are different.
pub const ERR_FIXED_BOUND_VALUES : i32 = 1420;
/// A too small value for the A trucation value is specified.
pub const ERR_TOO_SMALL_A_TRUNCATION_VALUE : i32 = 1421;
/// An invalid objective sense is specified.
pub const ERR_INVALID_OBJECTIVE_SENSE : i32 = 1445;
/// The objective sense has not been specified before the optimization.
pub const ERR_UNDEFINED_OBJECTIVE_SENSE : i32 = 1446;
/// The solution item y is undefined.
pub const ERR_Y_IS_UNDEFINED : i32 = 1449;
/// An invalid floating value was used in some double data.
pub const ERR_NAN_IN_DOUBLE_DATA : i32 = 1450;
/// An infinite floating value was used in some double data.
pub const ERR_INF_IN_DOUBLE_DATA : i32 = 1451;
/// blc contains an invalid floating point value, i.e. a NaN.
pub const ERR_NAN_IN_BLC : i32 = 1461;
/// buc contains an invalid floating point value, i.e. a NaN.
pub const ERR_NAN_IN_BUC : i32 = 1462;
/// An invalid fixed term in the objective is speficied.
pub const ERR_INVALID_CFIX : i32 = 1469;
/// c contains an invalid floating point value, i.e. a NaN.
pub const ERR_NAN_IN_C : i32 = 1470;
/// blx contains an invalid floating point value, i.e. a NaN.
pub const ERR_NAN_IN_BLX : i32 = 1471;
/// bux contains an invalid floating point value, i.e. a NaN.
pub const ERR_NAN_IN_BUX : i32 = 1472;
/// a\[i,j\] contains an invalid floating point value, i.e. a NaN or an infinite value.
pub const ERR_INVALID_AIJ : i32 = 1473;
/// c\[j\] contains an invalid floating point value, i.e. a NaN or an infinite value.
pub const ERR_INVALID_CJ : i32 = 1474;
/// A symmetric matrix contains an invalid floating point value, i.e. a NaN or an infinite value.
pub const ERR_SYM_MAT_INVALID : i32 = 1480;
/// A numerically huge value is specified for an element in E.
pub const ERR_SYM_MAT_HUGE : i32 = 1482;
/// Invalid problem type.
pub const ERR_INV_PROBLEM : i32 = 1500;
/// The problem contains both conic and nonlinear constraints.
pub const ERR_MIXED_CONIC_AND_NL : i32 = 1501;
/// The global optimizer can only be applied to problems without semidefinite variables.
pub const ERR_GLOBAL_INV_CONIC_PROBLEM : i32 = 1503;
/// An invalid optimizer has been chosen for the problem.
pub const ERR_INV_OPTIMIZER : i32 = 1550;
/// No optimizer is available for the current class of integer optimization problems.
pub const ERR_MIO_NO_OPTIMIZER : i32 = 1551;
/// No optimizer is available for this class of optimization problems.
pub const ERR_NO_OPTIMIZER_VAR_TYPE : i32 = 1552;
/// An error occurred during the solution finalization.
pub const ERR_FINAL_SOLUTION : i32 = 1560;
/// Invalid first.
pub const ERR_FIRST : i32 = 1570;
/// Invalid last.
pub const ERR_LAST : i32 = 1571;
/// Invalid slice size specified.
pub const ERR_SLICE_SIZE : i32 = 1572;
/// Negative surplus.
pub const ERR_NEGATIVE_SURPLUS : i32 = 1573;
/// Cannot append a negative number.
pub const ERR_NEGATIVE_APPEND : i32 = 1578;
/// An error occurred during the postsolve.
pub const ERR_POSTSOLVE : i32 = 1580;
/// A computation produced an overflow.
pub const ERR_OVERFLOW : i32 = 1590;
/// No basic solution is defined.
pub const ERR_NO_BASIS_SOL : i32 = 1600;
/// The factorization of the basis is invalid.
pub const ERR_BASIS_FACTOR : i32 = 1610;
/// The basis is singular.
pub const ERR_BASIS_SINGULAR : i32 = 1615;
/// An error occurred while factorizing a matrix.
pub const ERR_FACTOR : i32 = 1650;
/// An optimization problem cannot be relaxed.
pub const ERR_FEASREPAIR_CANNOT_RELAX : i32 = 1700;
/// The relaxed problem could not be solved to optimality.
pub const ERR_FEASREPAIR_SOLVING_RELAXED : i32 = 1701;
/// The upper bound is less than the lower bound for a variable or a constraint.
pub const ERR_FEASREPAIR_INCONSISTENT_BOUND : i32 = 1702;
/// The feasibility repair does not support the specified problem type.
pub const ERR_REPAIR_INVALID_PROBLEM : i32 = 1710;
/// Computation the optimal relaxation failed.
pub const ERR_REPAIR_OPTIMIZATION_FAILED : i32 = 1711;
/// A name is longer than the buffer that is supposed to hold it.
pub const ERR_NAME_MAX_LEN : i32 = 1750;
/// The name buffer is a null pointer.
pub const ERR_NAME_IS_NULL : i32 = 1760;
/// Invalid compression type.
pub const ERR_INVALID_COMPRESSION : i32 = 1800;
/// Invalid io mode.
pub const ERR_INVALID_IOMODE : i32 = 1801;
/// A certificate of primal infeasibility is not available.
pub const ERR_NO_PRIMAL_INFEAS_CER : i32 = 2000;
/// A certificate of dual infeasibility is not available.
pub const ERR_NO_DUAL_INFEAS_CER : i32 = 2001;
/// The required solution is not available.
pub const ERR_NO_SOLUTION_IN_CALLBACK : i32 = 2500;
/// Invalid value in marki.
pub const ERR_INV_MARKI : i32 = 2501;
/// Invalid value in markj.
pub const ERR_INV_MARKJ : i32 = 2502;
/// Invalid numi.
pub const ERR_INV_NUMI : i32 = 2503;
/// Invalid numj.
pub const ERR_INV_NUMJ : i32 = 2504;
/// The Task file is incompatible with this platform.
pub const ERR_TASK_INCOMPATIBLE : i32 = 2560;
/// The Task file is invalid.
pub const ERR_TASK_INVALID : i32 = 2561;
/// Failed to write the task file.
pub const ERR_TASK_WRITE : i32 = 2562;
/// Could not compute the LU factors of the matrix within the maximum number of allowed tries.
pub const ERR_LU_MAX_NUM_TRIES : i32 = 2800;
/// An invalid UTF8 string is encountered.
pub const ERR_INVALID_UTF8 : i32 = 2900;
/// An invalid wchar string is encountered.
pub const ERR_INVALID_WCHAR : i32 = 2901;
/// No dual information is available for the integer solution.
pub const ERR_NO_DUAL_FOR_ITG_SOL : i32 = 2950;
/// snx is not available for the basis solution.
pub const ERR_NO_SNX_FOR_BAS_SOL : i32 = 2953;
/// An internal error occurred.
pub const ERR_INTERNAL : i32 = 3000;
/// An input array was too short.
pub const ERR_API_ARRAY_TOO_SMALL : i32 = 3001;
/// Failed to connect a callback object.
pub const ERR_API_CB_CONNECT : i32 = 3002;
/// An internal error occurred in the API. Please report this problem.
pub const ERR_API_FATAL_ERROR : i32 = 3005;
/// Syntax error in sensitivity analysis file.
pub const ERR_SEN_FORMAT : i32 = 3050;
/// An undefined name was encountered in the sensitivity analysis file.
pub const ERR_SEN_UNDEF_NAME : i32 = 3051;
/// Index out of range in the sensitivity analysis file.
pub const ERR_SEN_INDEX_RANGE : i32 = 3052;
/// Analysis of upper bound requested for an index, where no upper bound exists.
pub const ERR_SEN_BOUND_INVALID_UP : i32 = 3053;
/// Analysis of lower bound requested for an index, where no lower bound exists.
pub const ERR_SEN_BOUND_INVALID_LO : i32 = 3054;
/// Invalid range given in the sensitivity file.
pub const ERR_SEN_INDEX_INVALID : i32 = 3055;
/// Syntax error in regexp or regexp longer than 1024.
pub const ERR_SEN_INVALID_REGEXP : i32 = 3056;
/// No optimal solution found to the original problem given for sensitivity analysis.
pub const ERR_SEN_SOLUTION_STATUS : i32 = 3057;
/// Numerical difficulties encountered performing the sensitivity analysis.
pub const ERR_SEN_NUMERICAL : i32 = 3058;
/// Sensitivity analysis cannot be performed for the specified problem.
pub const ERR_SEN_UNHANDLED_PROBLEM_TYPE : i32 = 3080;
/// A step-size in an optimizer was unexpectedly unbounded.
pub const ERR_UNB_STEP_SIZE : i32 = 3100;
/// Some tasks related to this function call were identical. Unique tasks were expected.
pub const ERR_IDENTICAL_TASKS : i32 = 3101;
/// The code list data was invalid.
pub const ERR_AD_INVALID_CODELIST : i32 = 3102;
/// An internal unit test function failed.
pub const ERR_INTERNAL_TEST_FAILED : i32 = 3500;
/// The problem type is not supported by the XML format.
pub const ERR_XML_INVALID_PROBLEM_TYPE : i32 = 3600;
/// Invalid AMPL stub.
pub const ERR_INVALID_AMPL_STUB : i32 = 3700;
/// A 64 bit integer could not be cast to a 32 bit integer.
pub const ERR_INT64_TO_INT32_CAST : i32 = 3800;
/// The computer contains more cpu cores than the license allows for.
pub const ERR_SIZE_LICENSE_NUMCORES : i32 = 3900;
/// The requested value is not defined for this solution type.
pub const ERR_INFEAS_UNDEFINED : i32 = 3910;
/// There is no barx available for the solution specified.
pub const ERR_NO_BARX_FOR_SOLUTION : i32 = 3915;
/// There is no bars available for the solution specified.
pub const ERR_NO_BARS_FOR_SOLUTION : i32 = 3916;
/// The dimension of a symmetric matrix variable has to be greater than 0.
pub const ERR_BAR_VAR_DIM : i32 = 3920;
/// A row index specified for sparse symmetric matrix is invalid.
pub const ERR_SYM_MAT_INVALID_ROW_INDEX : i32 = 3940;
/// A column index specified for sparse symmetric matrix is invalid.
pub const ERR_SYM_MAT_INVALID_COL_INDEX : i32 = 3941;
/// Only the lower triangular part of sparse symmetric matrix should be specified.
pub const ERR_SYM_MAT_NOT_LOWER_TRINGULAR : i32 = 3942;
/// The numerical value specified in a sparse symmetric matrix is not a floating point value.
pub const ERR_SYM_MAT_INVALID_VALUE : i32 = 3943;
/// A value in a symmetric matric as been specified more than once.
pub const ERR_SYM_MAT_DUPLICATE : i32 = 3944;
/// A sparse symmetric matrix of invalid dimension is specified.
pub const ERR_INVALID_SYM_MAT_DIM : i32 = 3950;
/// An internal fatal error occurred in an interface function.
pub const ERR_API_INTERNAL : i32 = 3999;
/// The file format does not support a problem with symmetric matrix variables.
pub const ERR_INVALID_FILE_FORMAT_FOR_SYM_MAT : i32 = 4000;
/// The file format does not support a problem with nonzero fixed term in c.
pub const ERR_INVALID_FILE_FORMAT_FOR_CFIX : i32 = 4001;
/// The file format does not support a problem with ranged constraints.
pub const ERR_INVALID_FILE_FORMAT_FOR_RANGED_CONSTRAINTS : i32 = 4002;
/// The file format does not support a problem with free constraints.
pub const ERR_INVALID_FILE_FORMAT_FOR_FREE_CONSTRAINTS : i32 = 4003;
/// The file format does not support a problem with the simple cones (deprecated).
pub const ERR_INVALID_FILE_FORMAT_FOR_CONES : i32 = 4005;
/// The file format does not support a problem with quadratic terms.
pub const ERR_INVALID_FILE_FORMAT_FOR_QUADRATIC_TERMS : i32 = 4006;
/// The file format does not support a problem with nonlinear terms.
pub const ERR_INVALID_FILE_FORMAT_FOR_NONLINEAR : i32 = 4010;
/// The file format does not support a problem with disjunctive constraints.
pub const ERR_INVALID_FILE_FORMAT_FOR_DISJUNCTIVE_CONSTRAINTS : i32 = 4011;
/// The file format does not support a problem with affine conic constraints.
pub const ERR_INVALID_FILE_FORMAT_FOR_AFFINE_CONIC_CONSTRAINTS : i32 = 4012;
/// Two constraint names are identical.
pub const ERR_DUPLICATE_CONSTRAINT_NAMES : i32 = 4500;
/// Two variable names are identical.
pub const ERR_DUPLICATE_VARIABLE_NAMES : i32 = 4501;
/// Two barvariable names are identical.
pub const ERR_DUPLICATE_BARVARIABLE_NAMES : i32 = 4502;
/// Two cone names are identical.
pub const ERR_DUPLICATE_CONE_NAMES : i32 = 4503;
/// Two domain names are identical.
pub const ERR_DUPLICATE_DOMAIN_NAMES : i32 = 4504;
/// Two disjunctive constraint names are identical.
pub const ERR_DUPLICATE_DJC_NAMES : i32 = 4505;
/// An array does not contain unique elements.
pub const ERR_NON_UNIQUE_ARRAY : i32 = 5000;
/// The value of a function argument is too small.
pub const ERR_ARGUMENT_IS_TOO_SMALL : i32 = 5004;
/// The value of a function argument is too large.
pub const ERR_ARGUMENT_IS_TOO_LARGE : i32 = 5005;
/// A fatal error occurred in the mixed integer optimizer. Please contact MOSEK support.
pub const ERR_MIO_INTERNAL : i32 = 5010;
/// An invalid problem type.
pub const ERR_INVALID_PROBLEM_TYPE : i32 = 6000;
/// Unhandled solution status.
pub const ERR_UNHANDLED_SOLUTION_STATUS : i32 = 6010;
/// An element in the upper triangle of a lower triangular matrix is specified.
pub const ERR_UPPER_TRIANGLE : i32 = 6020;
/// A matrix is singular.
pub const ERR_LAU_SINGULAR_MATRIX : i32 = 7000;
/// A matrix is not positive definite.
pub const ERR_LAU_NOT_POSITIVE_DEFINITE : i32 = 7001;
/// An invalid lower triangular matrix.
pub const ERR_LAU_INVALID_LOWER_TRIANGULAR_MATRIX : i32 = 7002;
/// An unknown error.
pub const ERR_LAU_UNKNOWN : i32 = 7005;
/// Invalid argument m.
pub const ERR_LAU_ARG_M : i32 = 7010;
/// Invalid argument n.
pub const ERR_LAU_ARG_N : i32 = 7011;
/// Invalid argument k.
pub const ERR_LAU_ARG_K : i32 = 7012;
/// Invalid argument transa.
pub const ERR_LAU_ARG_TRANSA : i32 = 7015;
/// Invalid argument transb.
pub const ERR_LAU_ARG_TRANSB : i32 = 7016;
/// Invalid argument uplo.
pub const ERR_LAU_ARG_UPLO : i32 = 7017;
/// Invalid argument trans.
pub const ERR_LAU_ARG_TRANS : i32 = 7018;
/// An invalid sparse symmetric matrix is specfified.
pub const ERR_LAU_INVALID_SPARSE_SYMMETRIC_MATRIX : i32 = 7019;
/// An error occurred while parsing an CBF file.
pub const ERR_CBF_PARSE : i32 = 7100;
/// An invalid objective sense is specified.
pub const ERR_CBF_OBJ_SENSE : i32 = 7101;
/// An invalid objective sense is specified.
pub const ERR_CBF_NO_VARIABLES : i32 = 7102;
/// Too many constraints specified.
pub const ERR_CBF_TOO_MANY_CONSTRAINTS : i32 = 7103;
/// Too many variables specified.
pub const ERR_CBF_TOO_MANY_VARIABLES : i32 = 7104;
/// No version specified.
pub const ERR_CBF_NO_VERSION_SPECIFIED : i32 = 7105;
/// Invalid syntax.
pub const ERR_CBF_SYNTAX : i32 = 7106;
/// Duplicate OBJ keyword.
pub const ERR_CBF_DUPLICATE_OBJ : i32 = 7107;
/// Duplicate CON keyword.
pub const ERR_CBF_DUPLICATE_CON : i32 = 7108;
/// Duplicate VAR keyword.
pub const ERR_CBF_DUPLICATE_VAR : i32 = 7110;
/// Duplicate INT keyword.
pub const ERR_CBF_DUPLICATE_INT : i32 = 7111;
/// Invalid variable type.
pub const ERR_CBF_INVALID_VAR_TYPE : i32 = 7112;
/// Invalid constraint type.
pub const ERR_CBF_INVALID_CON_TYPE : i32 = 7113;
/// Invalid domain dimension.
pub const ERR_CBF_INVALID_DOMAIN_DIMENSION : i32 = 7114;
/// Duplicate index in OBJCOORD.
pub const ERR_CBF_DUPLICATE_OBJACOORD : i32 = 7115;
/// Duplicate index in BCOORD.
pub const ERR_CBF_DUPLICATE_BCOORD : i32 = 7116;
/// Duplicate index in ACOORD.
pub const ERR_CBF_DUPLICATE_ACOORD : i32 = 7117;
/// Too few variables defined.
pub const ERR_CBF_TOO_FEW_VARIABLES : i32 = 7118;
/// Too few constraints defined.
pub const ERR_CBF_TOO_FEW_CONSTRAINTS : i32 = 7119;
/// Too ints specified.
pub const ERR_CBF_TOO_FEW_INTS : i32 = 7120;
/// Too ints specified.
pub const ERR_CBF_TOO_MANY_INTS : i32 = 7121;
/// Invalid INT index.
pub const ERR_CBF_INVALID_INT_INDEX : i32 = 7122;
/// Unsupported feature is present.
pub const ERR_CBF_UNSUPPORTED : i32 = 7123;
/// Duplicate PSDVAR keyword.
pub const ERR_CBF_DUPLICATE_PSDVAR : i32 = 7124;
/// Invalid PSDVAR dimension.
pub const ERR_CBF_INVALID_PSDVAR_DIMENSION : i32 = 7125;
/// Too few variables defined.
pub const ERR_CBF_TOO_FEW_PSDVAR : i32 = 7126;
/// Invalid dimension of a exponential cone.
pub const ERR_CBF_INVALID_EXP_DIMENSION : i32 = 7127;
/// Multiple POWCONES specified.
pub const ERR_CBF_DUPLICATE_POW_CONES : i32 = 7130;
/// Multiple POW*CONES specified.
pub const ERR_CBF_DUPLICATE_POW_STAR_CONES : i32 = 7131;
/// Invalid power specified.
pub const ERR_CBF_INVALID_POWER : i32 = 7132;
/// Power cone is too long.
pub const ERR_CBF_POWER_CONE_IS_TOO_LONG : i32 = 7133;
/// Invalid power cone index.
pub const ERR_CBF_INVALID_POWER_CONE_INDEX : i32 = 7134;
/// Invalid power star cone index.
pub const ERR_CBF_INVALID_POWER_STAR_CONE_INDEX : i32 = 7135;
/// An unhandled power cone type.
pub const ERR_CBF_UNHANDLED_POWER_CONE_TYPE : i32 = 7136;
/// An unhandled power star cone type.
pub const ERR_CBF_UNHANDLED_POWER_STAR_CONE_TYPE : i32 = 7137;
/// The power cone does not match with it definition.
pub const ERR_CBF_POWER_CONE_MISMATCH : i32 = 7138;
/// The power star cone does not match with it definition.
pub const ERR_CBF_POWER_STAR_CONE_MISMATCH : i32 = 7139;
/// Invalid number of cones.
pub const ERR_CBF_INVALID_NUMBER_OF_CONES : i32 = 7140;
/// Invalid number of cones.
pub const ERR_CBF_INVALID_DIMENSION_OF_CONES : i32 = 7141;
/// Invalid number of OBJACOORD.
pub const ERR_CBF_INVALID_NUM_OBJACOORD : i32 = 7150;
/// Invalid number of OBJFCOORD.
pub const ERR_CBF_INVALID_NUM_OBJFCOORD : i32 = 7151;
/// Invalid number of ACOORD.
pub const ERR_CBF_INVALID_NUM_ACOORD : i32 = 7152;
/// Invalid number of BCOORD.
pub const ERR_CBF_INVALID_NUM_BCOORD : i32 = 7153;
/// Invalid number of FCOORD.
pub const ERR_CBF_INVALID_NUM_FCOORD : i32 = 7155;
/// Invalid number of HCOORD.
pub const ERR_CBF_INVALID_NUM_HCOORD : i32 = 7156;
/// Invalid number of DCOORD.
pub const ERR_CBF_INVALID_NUM_DCOORD : i32 = 7157;
/// Expected a key word.
pub const ERR_CBF_EXPECTED_A_KEYWORD : i32 = 7158;
/// Invalid number of PSDCON.
pub const ERR_CBF_INVALID_NUM_PSDCON : i32 = 7200;
/// Duplicate CON keyword.
pub const ERR_CBF_DUPLICATE_PSDCON : i32 = 7201;
/// Invalid PSDCON dimension.
pub const ERR_CBF_INVALID_DIMENSION_OF_PSDCON : i32 = 7202;
/// Invalid PSDCON index.
pub const ERR_CBF_INVALID_PSDCON_INDEX : i32 = 7203;
/// Invalid PSDCON index.
pub const ERR_CBF_INVALID_PSDCON_VARIABLE_INDEX : i32 = 7204;
/// Invalid PSDCON index.
pub const ERR_CBF_INVALID_PSDCON_BLOCK_INDEX : i32 = 7205;
/// The CHANGE section is not supported.
pub const ERR_CBF_UNSUPPORTED_CHANGE : i32 = 7210;
/// An invalid root optimizer was selected for the problem type.
pub const ERR_MIO_INVALID_ROOT_OPTIMIZER : i32 = 7700;
/// An invalid node optimizer was selected for the problem type.
pub const ERR_MIO_INVALID_NODE_OPTIMIZER : i32 = 7701;
/// An invalid cone type occurs when writing a CPLEX formatted MPS file.
pub const ERR_MPS_WRITE_CPLEX_INVALID_CONE_TYPE : i32 = 7750;
/// The matrix defining the quadratric part of constraint is not positive semidefinite.
pub const ERR_TOCONIC_CONSTR_Q_NOT_PSD : i32 = 7800;
/// The quadratic constraint is an equality, thus not convex.
pub const ERR_TOCONIC_CONSTRAINT_FX : i32 = 7801;
/// The quadratic constraint has finite lower and upper bound, and therefore it is not convex.
pub const ERR_TOCONIC_CONSTRAINT_RA : i32 = 7802;
/// The constraint is not conic representable.
pub const ERR_TOCONIC_CONSTR_NOT_CONIC : i32 = 7803;
/// The matrix defining the quadratric part of the objective function is not positive semidefinite.
pub const ERR_TOCONIC_OBJECTIVE_NOT_PSD : i32 = 7804;
/// Failed to connect to remote solver server.
pub const ERR_SERVER_CONNECT : i32 = 8000;
/// Unexpected message or data from solver server.
pub const ERR_SERVER_PROTOCOL : i32 = 8001;
/// Server returned non-ok status code
pub const ERR_SERVER_STATUS : i32 = 8002;
/// Invalid job ID
pub const ERR_SERVER_TOKEN : i32 = 8003;
/// Invalid address
pub const ERR_SERVER_ADDRESS : i32 = 8004;
/// Invalid TLS certificate format or path
pub const ERR_SERVER_CERTIFICATE : i32 = 8005;
/// Failed to create TLS client
pub const ERR_SERVER_TLS_CLIENT : i32 = 8006;
/// Invalid access token
pub const ERR_SERVER_ACCESS_TOKEN : i32 = 8007;
/// The problem is too large.
pub const ERR_SERVER_PROBLEM_SIZE : i32 = 8008;
/// An element in a sparse matrix is specified twice.
pub const ERR_DUPLICATE_INDEX_IN_A_SPARSE_MATRIX : i32 = 20050;
/// An index is specified twice in an affine expression list.
pub const ERR_DUPLICATE_INDEX_IN_AFEIDX_LIST : i32 = 20060;
/// An element in the F matrix is specified twice.
pub const ERR_DUPLICATE_FIJ : i32 = 20100;
/// f\[i,j\] contains an invalid floating point value, i.e. a NaN or an infinite value.
pub const ERR_INVALID_FIJ : i32 = 20101;
/// A numerically huge value is specified for an element in F.
pub const ERR_HUGE_FIJ : i32 = 20102;
/// g contains an invalid floating point value, i.e. a NaN or an infinite value.
pub const ERR_INVALID_G : i32 = 20103;
/// b contains an invalid floating point value, i.e. a NaN or an infinite value.
pub const ERR_INVALID_B : i32 = 20150;
/// A domain index is invalid.
pub const ERR_DOMAIN_INVALID_INDEX : i32 = 20400;
/// A domain dimension is invalid.
pub const ERR_DOMAIN_DIMENSION : i32 = 20401;
/// A PSD domain dimension is invalid.
pub const ERR_DOMAIN_DIMENSION_PSD : i32 = 20402;
/// The function is only applicable to primal and dual power cone domains.
pub const ERR_NOT_POWER_DOMAIN : i32 = 20403;
/// Alpha contains an invalid floating point value, i.e. a NaN or an infinite value.
pub const ERR_DOMAIN_POWER_INVALID_ALPHA : i32 = 20404;
/// Alpha contains a negative value or zero.
pub const ERR_DOMAIN_POWER_NEGATIVE_ALPHA : i32 = 20405;
/// The value of nleft is too small or too large.
pub const ERR_DOMAIN_POWER_NLEFT : i32 = 20406;
/// An affine expression index is invalid.
pub const ERR_AFE_INVALID_INDEX : i32 = 20500;
/// A affine conic constraint index is invalid.
pub const ERR_ACC_INVALID_INDEX : i32 = 20600;
/// The index of an element in an affine conic constraint is invalid.
pub const ERR_ACC_INVALID_ENTRY_INDEX : i32 = 20601;
/// There is a mismatch between between the number of affine expressions and total dimension of the domain(s).
pub const ERR_ACC_AFE_DOMAIN_MISMATCH : i32 = 20602;
/// A disjunctive constraint index is invalid.
pub const ERR_DJC_INVALID_INDEX : i32 = 20700;
/// An unsupported domain type has been used in a disjunctive constraint.
pub const ERR_DJC_UNSUPPORTED_DOMAIN_TYPE : i32 = 20701;
/// There is a mismatch between the number of affine expressions and total dimension of the domain(s).
pub const ERR_DJC_AFE_DOMAIN_MISMATCH : i32 = 20702;
/// A termize is invalid.
pub const ERR_DJC_INVALID_TERM_SIZE : i32 = 20703;
/// There is a mismatch between the number of domains and the term sizes.
pub const ERR_DJC_DOMAIN_TERMSIZE_MISMATCH : i32 = 20704;
/// There total number of terms in all domains does not match.
pub const ERR_DJC_TOTAL_NUM_TERMS_MISMATCH : i32 = 20705;
/// The required solution is not defined.
pub const ERR_UNDEF_SOLUTION : i32 = 22000;
/// No doty is available.
pub const ERR_NO_DOTY : i32 = 22010;
/// The optimizer terminated at the maximum number of iterations.
pub const TRM_MAX_ITERATIONS : i32 = 100000;
/// The optimizer terminated at the maximum amount of time.
pub const TRM_MAX_TIME : i32 = 100001;
/// The optimizer terminated with an objective value outside the objective range.
pub const TRM_OBJECTIVE_RANGE : i32 = 100002;
/// The optimizer is terminated due to slow progress.
pub const TRM_STALL : i32 = 100006;
/// The user-defined progress callback function terminated the optimization.
pub const TRM_USER_CALLBACK : i32 = 100007;
/// The mixed-integer optimizer terminated as the maximum number of relaxations was reached.
pub const TRM_MIO_NUM_RELAXS : i32 = 100008;
/// The mixed-integer optimizer terminated as the maximum number of branches was reached.
pub const TRM_MIO_NUM_BRANCHES : i32 = 100009;
/// The mixed-integer optimizer terminated as the maximum number of feasible solutions was reached.
pub const TRM_NUM_MAX_NUM_INT_SOLUTIONS : i32 = 100015;
/// The optimizer terminated as the maximum number of set-backs was reached.
pub const TRM_MAX_NUM_SETBACKS : i32 = 100020;
/// The optimizer terminated due to a numerical problem.
pub const TRM_NUMERICAL_PROBLEM : i32 = 100025;
/// Lost a race.
pub const TRM_LOST_RACE : i32 = 100027;
/// The optimizer terminated due to some internal reason.
pub const TRM_INTERNAL : i32 = 100030;
/// The optimizer terminated for internal reasons.
pub const TRM_INTERNAL_STOP : i32 = 100031;
} // impl Rescode
/// Response code type
#[non_exhaustive]
pub struct Rescodetype;
impl Rescodetype {
/// The response code is OK.
pub const OK : i32 = 0;
/// The response code is a warning.
pub const WRN : i32 = 1;
/// The response code is an optimizer termination status.
pub const TRM : i32 = 2;
/// The response code is an error.
pub const ERR : i32 = 3;
/// The response code does not belong to any class.
pub const UNK : i32 = 4;
} // impl Rescodetype
/// Scaling type
#[non_exhaustive]
pub struct Scalingtype;
impl Scalingtype {
/// The optimizer chooses the scaling heuristic.
pub const FREE : i32 = 0;
/// No scaling is performed.
pub const NONE : i32 = 1;
} // impl Scalingtype
/// Scaling method
#[non_exhaustive]
pub struct Scalingmethod;
impl Scalingmethod {
/// Scales only with power of 2 leaving the mantissa untouched.
pub const POW2 : i32 = 0;
/// The optimizer chooses the scaling heuristic.
pub const FREE : i32 = 1;
} // impl Scalingmethod
/// Sensitivity types
#[non_exhaustive]
pub struct Sensitivitytype;
impl Sensitivitytype {
/// Basis sensitivity analysis is performed.
pub const BASIS : i32 = 0;
} // impl Sensitivitytype
/// Simplex selection strategy
#[non_exhaustive]
pub struct Simseltype;
impl Simseltype {
/// The optimizer chooses the pricing strategy.
pub const FREE : i32 = 0;
/// The optimizer uses full pricing.
pub const FULL : i32 = 1;
/// The optimizer uses approximate steepest-edge pricing.
pub const ASE : i32 = 2;
/// The optimizer uses devex steepest-edge pricing.
pub const DEVEX : i32 = 3;
/// The optimizer uses steepest-edge selection.
pub const SE : i32 = 4;
/// The optimizer uses a partial selection approach.
pub const PARTIAL : i32 = 5;
} // impl Simseltype
/// Solution items
#[non_exhaustive]
pub struct Solitem;
impl Solitem {
/// Solution for the constraints.
pub const XC : i32 = 0;
/// Variable solution.
pub const XX : i32 = 1;
/// Lagrange multipliers for equations.
pub const Y : i32 = 2;
/// Lagrange multipliers for lower bounds on the constraints.
pub const SLC : i32 = 3;
/// Lagrange multipliers for upper bounds on the constraints.
pub const SUC : i32 = 4;
/// Lagrange multipliers for lower bounds on the variables.
pub const SLX : i32 = 5;
/// Lagrange multipliers for upper bounds on the variables.
pub const SUX : i32 = 6;
/// Lagrange multipliers corresponding to the conic constraints on the variables.
pub const SNX : i32 = 7;
} // impl Solitem
/// Solution status keys
#[non_exhaustive]
pub struct Solsta;
impl Solsta {
/// Status of the solution is unknown.
pub const UNKNOWN : i32 = 0;
/// The solution is optimal.
pub const OPTIMAL : i32 = 1;
/// The solution is primal feasible.
pub const PRIM_FEAS : i32 = 2;
/// The solution is dual feasible.
pub const DUAL_FEAS : i32 = 3;
/// The solution is both primal and dual feasible.
pub const PRIM_AND_DUAL_FEAS : i32 = 4;
/// The solution is a certificate of primal infeasibility.
pub const PRIM_INFEAS_CER : i32 = 5;
/// The solution is a certificate of dual infeasibility.
pub const DUAL_INFEAS_CER : i32 = 6;
/// The solution is a certificate that the primal problem is illposed.
pub const PRIM_ILLPOSED_CER : i32 = 7;
/// The solution is a certificate that the dual problem is illposed.
pub const DUAL_ILLPOSED_CER : i32 = 8;
/// The primal solution is integer optimal.
pub const INTEGER_OPTIMAL : i32 = 9;
} // impl Solsta
/// Solution types
#[non_exhaustive]
pub struct Soltype;
impl Soltype {
/// The interior solution.
pub const ITR : i32 = 0;
/// The basic solution.
pub const BAS : i32 = 1;
/// The integer solution.
pub const ITG : i32 = 2;
} // impl Soltype
/// Solve primal or dual form
#[non_exhaustive]
pub struct Solveform;
impl Solveform {
/// The optimizer is free to solve either the primal or the dual problem.
pub const FREE : i32 = 0;
/// The optimizer should solve the primal problem.
pub const PRIMAL : i32 = 1;
/// The optimizer should solve the dual problem.
pub const DUAL : i32 = 2;
} // impl Solveform
/// String parameters
#[non_exhaustive]
pub struct Sparam;
impl Sparam {
/// Name of the bas solution file.
pub const BAS_SOL_FILE_NAME : i32 = 0;
/// Data are read and written to this file.
pub const DATA_FILE_NAME : i32 = 1;
/// MOSEK debug file.
pub const DEBUG_FILE_NAME : i32 = 2;
/// Name of the int solution file.
pub const INT_SOL_FILE_NAME : i32 = 3;
/// Name of the itr solution file.
pub const ITR_SOL_FILE_NAME : i32 = 4;
/// For internal debugging purposes.
pub const MIO_DEBUG_STRING : i32 = 5;
/// Solution file comment character.
pub const PARAM_COMMENT_SIGN : i32 = 6;
/// Modifications to the parameter database is read from this file.
pub const PARAM_READ_FILE_NAME : i32 = 7;
/// The parameter database is written to this file.
pub const PARAM_WRITE_FILE_NAME : i32 = 8;
/// Name of the BOUNDS vector used. An empty name means that the first BOUNDS vector is used.
pub const READ_MPS_BOU_NAME : i32 = 9;
/// Objective name in the MPS file.
pub const READ_MPS_OBJ_NAME : i32 = 10;
/// Name of the RANGE vector used. An empty name means that the first RANGE vector is used.
pub const READ_MPS_RAN_NAME : i32 = 11;
/// Name of the RHS used. An empty name means that the first RHS vector is used.
pub const READ_MPS_RHS_NAME : i32 = 12;
/// URL of the remote optimization server.
pub const REMOTE_OPTSERVER_HOST : i32 = 13;
/// Known server certificates in PEM format
pub const REMOTE_TLS_CERT : i32 = 14;
/// Path to known server certificates in PEM format
pub const REMOTE_TLS_CERT_PATH : i32 = 15;
/// Sensitivity report file name.
pub const SENSITIVITY_FILE_NAME : i32 = 16;
/// Name of the sensitivity report output file.
pub const SENSITIVITY_RES_FILE_NAME : i32 = 17;
/// Solution file filter.
pub const SOL_FILTER_XC_LOW : i32 = 18;
/// Solution file filter.
pub const SOL_FILTER_XC_UPR : i32 = 19;
/// Solution file filter.
pub const SOL_FILTER_XX_LOW : i32 = 20;
/// Solution file filter.
pub const SOL_FILTER_XX_UPR : i32 = 21;
/// Key used when writing the summary file.
pub const STAT_KEY : i32 = 22;
/// Name used when writing the statistics file.
pub const STAT_NAME : i32 = 23;
/// Added variable names in the LP files.
pub const WRITE_LP_GEN_VAR_NAME : i32 = 24;
} // impl Sparam
/// Status keys
#[non_exhaustive]
pub struct Stakey;
impl Stakey {
/// The status for the constraint or variable is unknown.
pub const UNK : i32 = 0;
/// The constraint or variable is in the basis.
pub const BAS : i32 = 1;
/// The constraint or variable is super basic.
pub const SUPBAS : i32 = 2;
/// The constraint or variable is at its lower bound.
pub const LOW : i32 = 3;
/// The constraint or variable is at its upper bound.
pub const UPR : i32 = 4;
/// The constraint or variable is fixed.
pub const FIX : i32 = 5;
/// The constraint or variable is infeasible in the bounds.
pub const INF : i32 = 6;
} // impl Stakey
/// Starting point types
#[non_exhaustive]
pub struct Startpointtype;
impl Startpointtype {
/// The starting point is chosen automatically.
pub const FREE : i32 = 0;
/// The optimizer guesses a starting point.
pub const GUESS : i32 = 1;
/// The optimizer constructs a starting point by assigning a constant value to all primal and dual variables. This starting point is normally robust.
pub const CONSTANT : i32 = 2;
} // impl Startpointtype
/// Stream types
#[non_exhaustive]
pub struct Streamtype;
impl Streamtype {
/// Log stream. Contains the aggregated contents of all other streams. This means that a message written to any other stream will also be written to this stream.
pub const LOG : i32 = 0;
/// Message stream. Log information relating to performance and progress of the optimization is written to this stream.
pub const MSG : i32 = 1;
/// Error stream. Error messages are written to this stream.
pub const ERR : i32 = 2;
/// Warning stream. Warning messages are written to this stream.
pub const WRN : i32 = 3;
} // impl Streamtype
/// Integer values
#[non_exhaustive]
pub struct Value;
impl Value {
/// The length of a license key buffer.
pub const LICENSE_BUFFER_LENGTH : i32 = 21;
/// Maximum string length allowed in MOSEK.
pub const MAX_STR_LEN : i32 = 1024;
} // impl Value
/// Variable types
#[non_exhaustive]
pub struct Variabletype;
impl Variabletype {
/// Is a continuous variable.
pub const TYPE_CONT : i32 = 0;
/// Is an integer variable.
pub const TYPE_INT : i32 = 1;
} // impl Variabletype
#[allow(unused_parens)]
fn handle_res_static(r : i32, funname : &str) -> Result<(),String> {
return
( if r != 0 { Err(format!("Error in call to {}: {}",funname,r)) }
else {
Ok(())
})
}
/// Environment. Defines an environment in which tasks are created. In
/// most cases it is not necessary to create this directly since the
/// tasks can use the default environment.
pub struct Env {
ptr : * const u8
}
/// The Task structure encapsulates a MOSEK Task containing problem
/// data, parameters and other information used to solve the
/// optimization problem, and provides the API for interacting with
/// the task data.
///
/// The Task object does not support callbacks, but can be passed or
/// shared between threads. If callbacks are needed, use the
/// `with_callbacks` metho to convert it into a `TaskCB` object.
pub struct Task {
ptr : * const u8,
}
unsafe impl Send for Task {}
/// The `TaskCB` object has all the same API functions as the `Task`
/// object, plus functions for setting and clearing callbacks. The
/// `TaskCB` is not safe to pass or share between threads.
///
/// A `TaskCB` can be converted back into a `Task` by the member
/// function `without_callbacks()`.
struct TaskCBData {
task : Task,
streamcb : [ Option<Box<Box<dyn Fn(&str)>>>; 4 ],
valuecb : Option<Box<dyn FnMut(i32,&[f64],&[i32],&[i64]) -> bool>>,
codecb : Option<Box<dyn FnMut(i32) -> bool>>,
intsolcb : Option<Box<dyn FnMut(&[f64])>>,
}
pub struct TaskCB {
data : Box<TaskCBData>
}
impl Env {
/// Create a new environment
pub fn new() -> Option<Env> {
let mut env : * const u8 = std::ptr::null();
let res = unsafe { MSK_makeenv(& mut env, std::ptr::null()) };
if res != 0 { return None; }
return Some(Env { ptr : env });
}
/// Create a new environment, specifying an output file used for writing memory debugging information.
pub fn new_mem_debug(dbgfile : &str) -> Option<Env> {
let mut env : * const u8 = std::ptr::null();
let dbgfile_cstr = CString::new(dbgfile).unwrap();
let res = unsafe { MSK_makeenv(& mut env, dbgfile_cstr.as_ptr()) };
if res != 0 { return None; }
return Some(Env { ptr : env });
}
/// Create a new task in this environment
pub fn task(&self) -> Option<Task> { Task::from_env(Some(&self)) }
/// Create a new task in this environment with pre-defined capacities.
pub fn task_with_capacity(&self, numcon : i32, numvar : i32) -> Option<Task> {
return Task::with_capacity(Some(&self),numcon,numvar)
}
fn handle_res(&self, r : i32, funname : &str) -> Result<(),String> {
return handle_res_static(r,funname);
}
/// Computes vector addition and multiplication by a scalar.
///
/// # Arguments
///
/// - `n_` Length of the vectors.
/// - `alpha_` The scalar that multiplies x.
/// - `x_` The x vector.
/// - `y_` The y vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.axpy>
#[allow(unused_parens)]
pub fn axpy(&self,n_ : i32,alpha_ : f64,x_ : &[f64],y_ : &mut[f64]) -> Result<(),String> {
if x_.len() != (n_).try_into().unwrap() {
return Result::Err("axpy: Argument 'x' has the wrong length, expected n_".to_string());
}
if y_.len() != (n_).try_into().unwrap() {
return Result::Err("axpy: Argument 'y' has the wrong length, expected n_".to_string());
}
self.handle_res(unsafe { MSK_axpy(self.ptr,n_,alpha_,x_.as_ptr(),y_.as_mut_ptr()) },"axpy")?;
return Result::Ok(());
} // axpy
/// Check in all unused license features to the license token server.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkinall>
#[allow(unused_parens)]
pub fn check_in_all(&mut self) -> Result<(),String> {
self.handle_res(unsafe { MSK_checkinall(self.ptr) },"check_in_all")?;
return Result::Ok(());
} // checkinall
/// Check in a license feature back to the license server ahead of time.
///
/// # Arguments
///
/// - `feature_` Feature to check in to the license system.
///
/// See [Feature]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkinlicense>
#[allow(unused_parens)]
pub fn check_in_license(&mut self,feature_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_checkinlicense(self.ptr,feature_) },"check_in_license")?;
return Result::Ok(());
} // checkinlicense
/// Check out a license feature from the license server ahead of time.
///
/// # Arguments
///
/// - `feature_` Feature to check out from the license system.
///
/// See [Feature]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkoutlicense>
#[allow(unused_parens)]
pub fn check_out_license(&mut self,feature_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_checkoutlicense(self.ptr,feature_) },"check_out_license")?;
return Result::Ok(());
} // checkoutlicense
/// Compares a version of the MOSEK DLL with a specified version.
///
/// # Arguments
///
/// - `major_` Major version number.
/// - `minor_` Minor version number.
/// - `revision_` Revision number.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkversion>
#[allow(unused_parens)]
pub fn check_version(&self,major_ : i32,minor_ : i32,revision_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_checkversion(self.ptr,major_,minor_,revision_) },"check_version")?;
return Result::Ok(());
} // checkversion
/// Computes a Cholesky factorization of sparse matrix.
///
/// # Arguments
///
/// - `numthreads_` The number threads that can be used to do the computation. 0 means the code makes the choice.
/// - `ordermethod_` If nonzero, then a sparsity preserving ordering will be employed.
/// - `tolsingular_` A positive parameter controlling when a pivot is declared zero.
/// - `anzc_` anzc\[j\] is the number of nonzeros in the jth column of A.
/// - `aptrc_` aptrc\[j\] is a pointer to the first element in column j.
/// - `asubc_` Row indexes for each column stored in increasing order.
/// - `avalc_` The value corresponding to row indexed stored in asubc.
/// - `perm_` Permutation array used to specify the permutation matrix P computed by the function.
/// - `diag_` The diagonal elements of matrix D.
/// - `lnzc_` lnzc\[j\] is the number of non zero elements in column j.
/// - `lptrc_` lptrc\[j\] is a pointer to the first row index and value in column j.
/// - `lensubnval_` Number of elements in lsubc and lvalc.
/// - `lsubc_` Row indexes for each column stored in increasing order.
/// - `lvalc_` The values corresponding to row indexed stored in lsubc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.computesparsecholesky>
#[allow(unused_parens)]
pub fn compute_sparse_cholesky(&self,numthreads_ : i32,ordermethod_ : i32,tolsingular_ : f64,anzc_ : &[i32],aptrc_ : &[i64],asubc_ : &[i32],avalc_ : &[f64],perm_ : &mut Vec<i32>,diag_ : &mut Vec<f64>,lnzc_ : &mut Vec<i32>,lptrc_ : &mut Vec<i64>,lensubnval_ : &mut i64,lsubc_ : &mut Vec<i32>,lvalc_ : &mut Vec<f64>) -> Result<(),String> {
let n_ : i32 = std::cmp::min(anzc_.len(),aptrc_.len()) as i32;
let mut __tmp_0 : * const i32 = std::ptr::null();
let mut __tmp_1 : * const f64 = std::ptr::null();
let mut __tmp_2 : * const i32 = std::ptr::null();
let mut __tmp_3 : * const i64 = std::ptr::null();
let mut __tmp_5 : * const i32 = std::ptr::null();
let mut __tmp_6 : * const f64 = std::ptr::null();
self.handle_res(unsafe { MSK_computesparsecholesky(self.ptr,numthreads_,ordermethod_,tolsingular_,n_,anzc_.as_ptr(),aptrc_.as_ptr(),asubc_.as_ptr(),avalc_.as_ptr(),& mut __tmp_0,& mut __tmp_1,& mut __tmp_2,& mut __tmp_3,lensubnval_,& mut __tmp_5,& mut __tmp_6) },"compute_sparse_cholesky")?;
let len_perm_ : usize = n_.try_into().unwrap_or(0);
perm_.resize(len_perm_,Default::default());
perm_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_0,len_perm_) } );
let _ = unsafe { MSK_freeenv(self.ptr,__tmp_0 as * mut u8); };
let len_diag_ : usize = n_.try_into().unwrap_or(0);
diag_.resize(len_diag_,Default::default());
diag_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_1,len_diag_) } );
let _ = unsafe { MSK_freeenv(self.ptr,__tmp_1 as * mut u8); };
let len_lnzc_ : usize = n_.try_into().unwrap_or(0);
lnzc_.resize(len_lnzc_,Default::default());
lnzc_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_2,len_lnzc_) } );
let _ = unsafe { MSK_freeenv(self.ptr,__tmp_2 as * mut u8); };
let len_lptrc_ : usize = n_.try_into().unwrap_or(0);
lptrc_.resize(len_lptrc_,Default::default());
lptrc_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_3,len_lptrc_) } );
let _ = unsafe { MSK_freeenv(self.ptr,__tmp_3 as * mut u8); };
let len_lsubc_ : usize = (*lensubnval_).try_into().unwrap_or(0);
lsubc_.resize(len_lsubc_,Default::default());
lsubc_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_5,len_lsubc_) } );
let _ = unsafe { MSK_freeenv(self.ptr,__tmp_5 as * mut u8); };
let len_lvalc_ : usize = (*lensubnval_).try_into().unwrap_or(0);
lvalc_.resize(len_lvalc_,Default::default());
lvalc_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_6,len_lvalc_) } );
let _ = unsafe { MSK_freeenv(self.ptr,__tmp_6 as * mut u8); };
return Result::Ok(());
} // computesparsecholesky
/// Computes the inner product of two vectors.
///
/// # Arguments
///
/// - `n_` Length of the vectors.
/// - `x_` The x vector.
/// - `y_` The y vector.
/// - `xty_` The result of the inner product.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.dot>
#[allow(unused_parens)]
pub fn dot(&self,n_ : i32,x_ : &[f64],y_ : &[f64],xty_ : &mut f64) -> Result<(),String> {
if x_.len() != (n_).try_into().unwrap() {
return Result::Err("dot: Argument 'x' has the wrong length, expected n_".to_string());
}
if y_.len() != (n_).try_into().unwrap() {
return Result::Err("dot: Argument 'y' has the wrong length, expected n_".to_string());
}
self.handle_res(unsafe { MSK_dot(self.ptr,n_,x_.as_ptr(),y_.as_ptr(),xty_) },"dot")?;
return Result::Ok(());
} // dot
/// Prints an intro to message stream.
///
/// # Arguments
///
/// - `longver_` If non-zero, then the intro is slightly longer.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.echointro>
#[allow(unused_parens)]
pub fn echo_intro(&self,longver_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_echointro(self.ptr,longver_) },"echo_intro")?;
return Result::Ok(());
} // echointro
/// Enable reference counting for environments.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.enablegarcolenv>
#[allow(unused_parens)]
pub fn enable_gar_col_env(&mut self) -> Result<(),String> {
self.handle_res(unsafe { MSK_enablegarcolenv(self.ptr) },"enable_gar_col_env")?;
return Result::Ok(());
} // enablegarcolenv
/// Reports when the first license feature expires.
///
/// # Arguments
///
/// - `expiry_` If nonnegative, then it is the minimum number days to expiry of any feature that has been checked out.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.expirylicenses>
#[allow(unused_parens)]
pub fn expirylicenses(&mut self,expiry_ : &mut i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_expirylicenses(self.ptr,expiry_) },"expirylicenses")?;
return Result::Ok(());
} // expirylicenses
/// Performs a dense matrix multiplication.
///
/// # Arguments
///
/// - `transa_` Indicates whether the matrix A must be transposed.
///
/// See [Transpose]
/// - `transb_` Indicates whether the matrix B must be transposed.
///
/// See [Transpose]
/// - `m_` Indicates the number of rows of matrix C.
/// - `n_` Indicates the number of columns of matrix C.
/// - `k_` Specifies the common dimension along which op(A) and op(B) are multiplied.
/// - `alpha_` A scalar value multiplying the result of the matrix multiplication.
/// - `a_` The pointer to the array storing matrix A in a column-major format.
/// - `b_` The pointer to the array storing matrix B in a column-major format.
/// - `beta_` A scalar value that multiplies C.
/// - `c_` The pointer to the array storing matrix C in a column-major format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gemm>
#[allow(unused_parens)]
pub fn gemm(&self,transa_ : i32,transb_ : i32,m_ : i32,n_ : i32,k_ : i32,alpha_ : f64,a_ : &[f64],b_ : &[f64],beta_ : f64,c_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((m_*k_)).try_into().unwrap() {
return Result::Err("gemm: Argument 'a' has the wrong length, expected (m_*k_)".to_string());
}
if b_.len() != ((k_*n_)).try_into().unwrap() {
return Result::Err("gemm: Argument 'b' has the wrong length, expected (k_*n_)".to_string());
}
if c_.len() != ((m_*n_)).try_into().unwrap() {
return Result::Err("gemm: Argument 'c' has the wrong length, expected (m_*n_)".to_string());
}
self.handle_res(unsafe { MSK_gemm(self.ptr,transa_,transb_,m_,n_,k_,alpha_,a_.as_ptr(),b_.as_ptr(),beta_,c_.as_mut_ptr()) },"gemm")?;
return Result::Ok(());
} // gemm
/// Computes dense matrix times a dense vector product.
///
/// # Arguments
///
/// - `transa_` Indicates whether the matrix A must be transposed.
///
/// See [Transpose]
/// - `m_` Specifies the number of rows of the matrix A.
/// - `n_` Specifies the number of columns of the matrix A.
/// - `alpha_` A scalar value multiplying the matrix A.
/// - `a_` A pointer to the array storing matrix A in a column-major format.
/// - `x_` A pointer to the array storing the vector x.
/// - `beta_` A scalar value multiplying the vector y.
/// - `y_` A pointer to the array storing the vector y.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gemv>
#[allow(unused_parens)]
pub fn gemv(&self,transa_ : i32,m_ : i32,n_ : i32,alpha_ : f64,a_ : &[f64],x_ : &[f64],beta_ : f64,y_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*m_)).try_into().unwrap() {
return Result::Err("gemv: Argument 'a' has the wrong length, expected (n_*m_)".to_string());
}
let __tmp_0 = if ((transa_==Transpose::NO)) {
n_
}
else {
m_
};
if x_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("gemv: Argument 'x' has the wrong length, expected __tmp_0".to_string());
}
let __tmp_1 = if ((transa_==Transpose::NO)) {
m_
}
else {
n_
};
if y_.len() != (__tmp_1).try_into().unwrap() {
return Result::Err("gemv: Argument 'y' has the wrong length, expected __tmp_1".to_string());
}
self.handle_res(unsafe { MSK_gemv(self.ptr,transa_,m_,n_,alpha_,a_.as_ptr(),x_.as_ptr(),beta_,y_.as_mut_ptr()) },"gemv")?;
return Result::Ok(());
} // gemv
/// Directs all output from a stream to a file.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `filename_` A valid file name.
/// - `append_` If this argument is 0 the file will be overwritten, otherwise it will be appended to.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.linkfiletoenvstream>
#[allow(unused_parens)]
pub fn link_file_to_stream(&mut self,whichstream_ : i32,filename_ : &str,append_ : i32) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_linkfiletoenvstream(self.ptr,whichstream_,__tmp_1.as_ptr(),append_) },"link_file_to_stream")?;
return Result::Ok(());
} // linkfiletoenvstream
/// Optimize a number of tasks in parallel using a specified number of threads.
///
/// # Arguments
///
/// - `israce_` If nonzero, then the function is terminated after the first task has been completed.
/// - `maxtime_` Time limit for the function.
/// - `numthreads_` Number of threads to be employed.
/// - `trmcode_` The termination code for each task.
///
/// See [Rescode]
/// - `rcode_` The response code for each task.
///
/// See [Rescode]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.optimizebatch>
#[allow(unused_parens)]
pub fn optimize_batch(&self,israce_ : bool,maxtime_ : f64,numthreads_ : i32,task_ : &[ & mut Task ],trmcode_ : &mut[i32],rcode_ : &mut[i32]) -> Result<(),String> {
let numtask_ : i64 = task_.len() as i64;
let arrptrs_task : Vec<* const u8> = task_.iter().map(|t| t.ptr).collect();
if trmcode_.len() != (numtask_).try_into().unwrap() {
return Result::Err("optimize_batch: Argument 'trmcode' has the wrong length, expected numtask_".to_string());
}
if rcode_.len() != (numtask_).try_into().unwrap() {
return Result::Err("optimize_batch: Argument 'rcode' has the wrong length, expected numtask_".to_string());
}
self.handle_res(unsafe { MSK_optimizebatch(self.ptr,israce_,maxtime_,numthreads_,numtask_,arrptrs_task.as_ptr(),trmcode_.as_mut_ptr(),rcode_.as_mut_ptr()) },"optimize_batch")?;
return Result::Ok(());
} // optimizebatch
/// Computes a Cholesky factorization of a dense matrix.
///
/// # Arguments
///
/// - `uplo_` Indicates whether the upper or lower triangular part of the matrix is stored.
///
/// See [Uplo]
/// - `n_` Dimension of the symmetric matrix.
/// - `a_` A symmetric matrix stored in column-major order.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.potrf>
#[allow(unused_parens)]
pub fn potrf(&self,uplo_ : i32,n_ : i32,a_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*n_)).try_into().unwrap() {
return Result::Err("potrf: Argument 'a' has the wrong length, expected (n_*n_)".to_string());
}
self.handle_res(unsafe { MSK_potrf(self.ptr,uplo_,n_,a_.as_mut_ptr()) },"potrf")?;
return Result::Ok(());
} // potrf
/// Input a runtime license code.
///
/// # Arguments
///
/// - `code_` A license key string.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putlicensecode>
#[allow(unused_parens)]
pub fn put_license_code(&mut self,code_ : &[i32]) -> Result<(),String> {
if code_.len() > 0 && code_.len() != (Value::LICENSE_BUFFER_LENGTH).try_into().unwrap() {
return Result::Err("put_license_code: Argument 'code' has the wrong length, expected Value::LICENSE_BUFFER_LENGTH".to_string());
}
self.handle_res(unsafe { MSK_putlicensecode(self.ptr,if code_.len() == 0 { std::ptr::null() } else { code_.as_ptr() }) },"put_license_code")?;
return Result::Ok(());
} // putlicensecode
/// Enables debug information for the license system.
///
/// # Arguments
///
/// - `licdebug_` Enable output of license check-out debug information.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putlicensedebug>
#[allow(unused_parens)]
pub fn put_license_debug(&mut self,licdebug_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_putlicensedebug(self.ptr,licdebug_) },"put_license_debug")?;
return Result::Ok(());
} // putlicensedebug
/// Set the path to the license file.
///
/// # Arguments
///
/// - `licensepath_` A path specifying where to search for the license.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putlicensepath>
#[allow(unused_parens)]
pub fn put_license_path(&mut self,licensepath_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(licensepath_).unwrap();
self.handle_res(unsafe { MSK_putlicensepath(self.ptr,__tmp_1.as_ptr()) },"put_license_path")?;
return Result::Ok(());
} // putlicensepath
/// Control whether mosek should wait for an available license if no license is available.
///
/// # Arguments
///
/// - `licwait_` Enable waiting for a license.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putlicensewait>
#[allow(unused_parens)]
pub fn put_license_wait(&mut self,licwait_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_putlicensewait(self.ptr,licwait_) },"put_license_wait")?;
return Result::Ok(());
} // putlicensewait
/// Reset the license expiry reporting startpoint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.resetexpirylicenses>
#[allow(unused_parens)]
pub fn reset_expiry_licenses(&mut self) -> Result<(),String> {
self.handle_res(unsafe { MSK_resetexpirylicenses(self.ptr) },"reset_expiry_licenses")?;
return Result::Ok(());
} // resetexpirylicenses
/// Solves a sparse triangular system of linear equations.
///
/// # Arguments
///
/// - `transposed_` Controls whether the solve is with L or the transposed L.
///
/// See [Transpose]
/// - `lnzc_` lnzc\[j\] is the number of nonzeros in column j.
/// - `lptrc_` lptrc\[j\] is a pointer to the first row index and value in column j.
/// - `lsubc_` Row indexes for each column stored sequentially.
/// - `lvalc_` The value corresponding to row indexed stored lsubc.
/// - `b_` The right-hand side of linear equation system to be solved as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.sparsetriangularsolvedense>
#[allow(unused_parens)]
pub fn sparse_triangular_solve_dense(&self,transposed_ : i32,lnzc_ : &[i32],lptrc_ : &[i64],lsubc_ : &[i32],lvalc_ : &[f64],b_ : &mut[f64]) -> Result<(),String> {
let n_ : i32 = std::cmp::min(std::cmp::min(lnzc_.len(),lptrc_.len()),b_.len()) as i32;
if lnzc_.len() != (n_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'lnzc' has the wrong length, expected n_".to_string());
}
if lptrc_.len() != (n_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'lptrc' has the wrong length, expected n_".to_string());
}
let lensubnval_ : i64 = std::cmp::min(lsubc_.len(),lvalc_.len()) as i64;
if lsubc_.len() != (lensubnval_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'lsubc' has the wrong length, expected lensubnval_".to_string());
}
if lvalc_.len() != (lensubnval_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'lvalc' has the wrong length, expected lensubnval_".to_string());
}
if b_.len() != (n_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'b' has the wrong length, expected n_".to_string());
}
self.handle_res(unsafe { MSK_sparsetriangularsolvedense(self.ptr,transposed_,n_,lnzc_.as_ptr(),lptrc_.as_ptr(),lensubnval_,lsubc_.as_ptr(),lvalc_.as_ptr(),b_.as_mut_ptr()) },"sparse_triangular_solve_dense")?;
return Result::Ok(());
} // sparsetriangularsolvedense
/// Computes all eigenvalues of a symmetric dense matrix.
///
/// # Arguments
///
/// - `uplo_` Indicates whether the upper or lower triangular part is used.
///
/// See [Uplo]
/// - `n_` Dimension of the symmetric input matrix.
/// - `a_` Input matrix A.
/// - `w_` Array of length at least n containing the eigenvalues of A.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.syeig>
#[allow(unused_parens)]
pub fn syeig(&self,uplo_ : i32,n_ : i32,a_ : &[f64],w_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*n_)).try_into().unwrap() {
return Result::Err("syeig: Argument 'a' has the wrong length, expected (n_*n_)".to_string());
}
if w_.len() != (n_).try_into().unwrap() {
return Result::Err("syeig: Argument 'w' has the wrong length, expected n_".to_string());
}
self.handle_res(unsafe { MSK_syeig(self.ptr,uplo_,n_,a_.as_ptr(),w_.as_mut_ptr()) },"syeig")?;
return Result::Ok(());
} // syeig
/// Computes all the eigenvalues and eigenvectors of a symmetric dense matrix, and thus its eigenvalue decomposition.
///
/// # Arguments
///
/// - `uplo_` Indicates whether the upper or lower triangular part is used.
///
/// See [Uplo]
/// - `n_` Dimension of the symmetric input matrix.
/// - `a_` Input matrix A.
/// - `w_` Array of length at least n containing the eigenvalues of A.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.syevd>
#[allow(unused_parens)]
pub fn syevd(&self,uplo_ : i32,n_ : i32,a_ : &mut[f64],w_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*n_)).try_into().unwrap() {
return Result::Err("syevd: Argument 'a' has the wrong length, expected (n_*n_)".to_string());
}
if w_.len() != (n_).try_into().unwrap() {
return Result::Err("syevd: Argument 'w' has the wrong length, expected n_".to_string());
}
self.handle_res(unsafe { MSK_syevd(self.ptr,uplo_,n_,a_.as_mut_ptr(),w_.as_mut_ptr()) },"syevd")?;
return Result::Ok(());
} // syevd
/// Performs a rank-k update of a symmetric matrix.
///
/// # Arguments
///
/// - `uplo_` Indicates whether the upper or lower triangular part of C is used.
///
/// See [Uplo]
/// - `trans_` Indicates whether the matrix A must be transposed.
///
/// See [Transpose]
/// - `n_` Specifies the order of C.
/// - `k_` Indicates the number of rows or columns of A, and its rank.
/// - `alpha_` A scalar value multiplying the result of the matrix multiplication.
/// - `a_` The pointer to the array storing matrix A in a column-major format.
/// - `beta_` A scalar value that multiplies C.
/// - `c_` The pointer to the array storing matrix C in a column-major format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.syrk>
#[allow(unused_parens)]
pub fn syrk(&self,uplo_ : i32,trans_ : i32,n_ : i32,k_ : i32,alpha_ : f64,a_ : &[f64],beta_ : f64,c_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*k_)).try_into().unwrap() {
return Result::Err("syrk: Argument 'a' has the wrong length, expected (n_*k_)".to_string());
}
if c_.len() != ((n_*n_)).try_into().unwrap() {
return Result::Err("syrk: Argument 'c' has the wrong length, expected (n_*n_)".to_string());
}
self.handle_res(unsafe { MSK_syrk(self.ptr,uplo_,trans_,n_,k_,alpha_,a_.as_ptr(),beta_,c_.as_mut_ptr()) },"syrk")?;
return Result::Ok(());
} // syrk
}
//const MSK_GLOBAL_ENV : Env = Env{ ptr : std::ptr::null() };
extern fn stream_callback_proxy(handle : * const libc::c_void, msg : * const libc::c_char) {
let h = handle as * const Box<dyn Fn(&str)>;
unsafe
{
let cstr = CStr::from_ptr(msg);
let cstr_bytes = cstr.to_bytes();
let s = String::from_utf8_lossy(cstr_bytes).into_owned();
(*h)(&s);
}
}
extern fn callback_proxy(_ : * const u8,
handle : * const c_void,
caller : i32,
douinf : * const f64,
intinf : * const i32,
lintinf : * const i64 ) -> i32
{
unsafe {
let task : & mut TaskCBData = &mut (*(handle as * mut TaskCBData));
let mut stop = false;
if let Some(ref mut cb) = task.codecb {
stop = stop && (*cb)(caller);
}
if let Some(ref mut cb) = task.valuecb {
stop = stop && (*cb)(caller,
& std::slice::from_raw_parts(douinf, Dinfitem::END as usize),
& std::slice::from_raw_parts(intinf, Iinfitem::END as usize),
& std::slice::from_raw_parts(lintinf, Liinfitem::END as usize));
}
if caller == Callbackcode::NEW_INT_MIO && task.intsolcb.is_some() {
if let Ok(numvar) = task.task.get_num_var() {
let mut xx = vec![0.0;numvar as usize];
if let Ok(_) = task.task.get_xx(Soltype::ITG,xx.as_mut_slice()) {
if let Some(ref mut cb) = task.intsolcb {
(*cb)(xx.as_slice());
}
}
}
}
if stop { 1 } else { 0 }
}
}
impl TaskCB {
/// Create a new `TaskCB` object from a given `Task`.
pub fn new(task : Task) -> TaskCB {
TaskCB {
data : Box::new(TaskCBData {
task : task,
streamcb : [None,None,None,None],
valuecb : None,
intsolcb : None,
codecb : None
})
}
}
/// Convert a `TaskCB` object into a `Task` object.
pub fn without_callbacks(self) -> Task {
for (whichstream,obj) in self.data.streamcb.iter().enumerate() {
if let Some(ref _f) = *obj {
let _ = unsafe { MSK_unlinkfuncfromtaskstream(self.data.task.ptr, whichstream as i32) };
}
}
let _ = unsafe { MSK_putcallbackfunc_ptr(self.data.task.ptr, std::ptr::null(), std::ptr::null()) };
self.data.task
}
/// Clone a `TaskCB`. Since callbacks are not shaerd between
/// cloned objects, this returns a plain `Task` object.
pub fn clone(&self) -> Option<Task> { self.data.task.clone() }
// NOTE on callback with handles:
// http://aatch.github.io/blog/2015/01/17/unboxed-closures-and-ffi-callbacks/
/// Set a stream callback handler.
///
/// # Arguments
///
/// - `whichstream` defines which stream attach it to, use constants `MSK_STREAM_...`.
/// - `func` is a function that receives a message to be printed.
pub fn put_stream_callback<F>(& mut self,whichstream : i32, func : F) -> Result<(),String>
where F : 'static+Fn(&str) {
if whichstream >= 0 && whichstream < 4 {
self.data.streamcb[whichstream as usize] = Some(Box::new(Box::new(func)));
match self.data.streamcb[whichstream as usize] {
Some(ref bf) => {
let hnd = &(**bf) as * const _ as * mut libc::c_void;
if 0 != unsafe { MSK_linkfunctotaskstream(self.data.task.ptr,whichstream, hnd, stream_callback_proxy) } {
Err("put_stream_callback: Failed to attach stream callback".to_string())
}
else {
Ok(())
}
}
None => {
Err("put_stream_callback: Failed to attach stream callback".to_string())
}
}
}
else {
Err("put_stream_callback: Invalid stream".to_string())
}
}
/// Clear stream callback handler at a given stream.
pub fn clear_stream_callback(&mut self,whichstream : i32) -> Result<(),String> {
match self.data.streamcb[whichstream as usize] {
Some(ref _f) => {
if 0 != unsafe { MSK_unlinkfuncfromtaskstream(self.data.task.ptr, whichstream) } {
Err("clear_stream_callback: Failed to clear stream callback".to_string())
}
else {
self.data.streamcb[whichstream as usize] = None;
Ok(())
}
},
None => Ok(())
}
}
fn update_callback(& mut self) -> Result<(),String> {
if self.data.valuecb.is_some() || self.data.codecb.is_some() || self.data.intsolcb.is_some() {
let hnd = &(*self.data) as * const _ as * mut c_void;
if 0 != unsafe { MSK_putcallbackfunc(self.data.task.ptr, callback_proxy, hnd) } {
Err("put_callback: Failed to attach callback".to_string())
} else {
Ok(())
}
}
else if 0 != unsafe { MSK_putcallbackfunc_ptr(self.data.task.ptr, std::ptr::null(), std::ptr::null()) } {
Err("put_callback: Failed to attach callback".to_string())
} else {
Ok(())
}
}
pub fn clear_callback(& mut self) -> Result<(),String> {
self.data.valuecb = None;
self.data.codecb = None;
self.data.intsolcb = None;
self.update_callback()
}
/// Sets an information callback handler in the task
///
/// # Arguments:
///
/// - `func` A function (caller,dinf,iinf,liinf) -> bool, that
/// returns false to indicate that the solver should terminate as
/// soon as possible, otherwise returns true.
/// - `caller` indicates what the solver is currently doing (see `MSK_CALLBACK_...` constants)
/// - `dinf` is a list of f64 information items (indexed with `MSK_DINF_...`)
/// - `iinf` is a list of i32 information items (indexed with `MSK_IINF_...`)
/// - `liinf` is a list of i64 information items (indexed with `MSK_LIINF_...`)
///
pub fn put_callback<F>(& mut self,func : F) -> Result<(),String>
where F : 'static +FnMut(i32,&[f64],&[i32],&[i64]) -> bool
{
self.data.valuecb = Some(Box::new(func));
self.update_callback()
}
pub fn put_codecallback<F>(& mut self,func : F) -> Result<(),String>
where F : 'static +FnMut(i32) -> bool
{
self.data.codecb = Some(Box::new(func));
self.update_callback()
}
pub fn put_intsolcallback<F>(& mut self,func : F) -> Result<(),String>
where F : 'static +FnMut(&[f64])
{
self.data.intsolcb = Some(Box::new(func));
self.update_callback()
}
/// Analyze the names and issue an error for the first invalid name.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `nametype_` The type of names e.g. valid in MPS or LP files.
///
/// See [Nametype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.analyzenames>
pub fn analyze_names(&self,whichstream_ : i32,nametype_ : i32) -> Result<(),String> { self.data.task.analyze_names(whichstream_,nametype_) }
/// Analyze the data of a task.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.analyzeproblem>
pub fn analyze_problem(&self,whichstream_ : i32) -> Result<(),String> { self.data.task.analyze_problem(whichstream_) }
/// Print information related to the quality of the solution.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.analyzesolution>
pub fn analyze_solution(&self,whichstream_ : i32,whichsol_ : i32) -> Result<(),String> { self.data.task.analyze_solution(whichstream_,whichsol_) }
/// Appends an affine conic constraint to the task.
///
/// # Arguments
///
/// - `domidx_` Domain index.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendacc>
pub fn append_acc(&mut self,domidx_ : i64,afeidxlist_ : &[i64],b_ : &[f64]) -> Result<(),String> { self.data.task.append_acc(domidx_,afeidxlist_,b_) }
/// Appends a number of affine conic constraint to the task.
///
/// # Arguments
///
/// - `domidxs_` Domain indices.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendaccs>
pub fn append_accs(&mut self,domidxs_ : &[i64],afeidxlist_ : &[i64],b_ : &[f64]) -> Result<(),String> { self.data.task.append_accs(domidxs_,afeidxlist_,b_) }
/// Appends an affine conic constraint to the task.
///
/// # Arguments
///
/// - `domidx_` Domain index.
/// - `afeidxfirst_` Index of the first affine expression.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendaccseq>
pub fn append_acc_seq(&mut self,domidx_ : i64,afeidxfirst_ : i64,b_ : &[f64]) -> Result<(),String> { self.data.task.append_acc_seq(domidx_,afeidxfirst_,b_) }
/// Appends a number of affine conic constraint to the task.
///
/// # Arguments
///
/// - `domidxs_` Domain indices.
/// - `numafeidx_` Number of affine expressions in the affine expression list (must equal the sum of dimensions of the domains).
/// - `afeidxfirst_` Index of the first affine expression.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendaccsseq>
pub fn append_accs_seq(&mut self,domidxs_ : &[i64],numafeidx_ : i64,afeidxfirst_ : i64,b_ : &[f64]) -> Result<(),String> { self.data.task.append_accs_seq(domidxs_,numafeidx_,afeidxfirst_,b_) }
/// Appends a number of empty affine expressions to the optimization task.
///
/// # Arguments
///
/// - `num_` Number of empty affine expressions which should be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendafes>
pub fn append_afes(&mut self,num_ : i64) -> Result<(),String> { self.data.task.append_afes(num_) }
/// Appends semidefinite variables to the problem.
///
/// # Arguments
///
/// - `dim_` Dimensions of symmetric matrix variables to be added.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendbarvars>
pub fn append_barvars(&mut self,dim_ : &[i32]) -> Result<(),String> { self.data.task.append_barvars(dim_) }
/// Appends a new conic constraint to the problem.
///
/// # Arguments
///
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `submem_` Variable subscripts of the members in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendcone>
pub fn append_cone(&mut self,ct_ : i32,conepar_ : f64,submem_ : &[i32]) -> Result<(),String> { self.data.task.append_cone(ct_,conepar_,submem_) }
/// Appends a new conic constraint to the problem.
///
/// # Arguments
///
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `nummem_` Number of member variables in the cone.
/// - `j_` Index of the first variable in the conic constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendconeseq>
pub fn append_cone_seq(&mut self,ct_ : i32,conepar_ : f64,nummem_ : i32,j_ : i32) -> Result<(),String> { self.data.task.append_cone_seq(ct_,conepar_,nummem_,j_) }
/// Appends multiple conic constraints to the problem.
///
/// # Arguments
///
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `nummem_` Numbers of member variables in the cones.
/// - `j_` Index of the first variable in the first cone to be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendconesseq>
pub fn append_cones_seq(&mut self,ct_ : &[i32],conepar_ : &[f64],nummem_ : &[i32],j_ : i32) -> Result<(),String> { self.data.task.append_cones_seq(ct_,conepar_,nummem_,j_) }
/// Appends a number of constraints to the optimization task.
///
/// # Arguments
///
/// - `num_` Number of constraints which should be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendcons>
pub fn append_cons(&mut self,num_ : i32) -> Result<(),String> { self.data.task.append_cons(num_) }
/// Appends a number of empty disjunctive constraints to the task.
///
/// # Arguments
///
/// - `num_` Number of empty disjunctive constraints which should be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appenddjcs>
pub fn append_djcs(&mut self,num_ : i64) -> Result<(),String> { self.data.task.append_djcs(num_) }
/// Appends the dual exponential cone domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appenddualexpconedomain>
pub fn append_dual_exp_cone_domain(&mut self) -> Result<i64,String> { self.data.task.append_dual_exp_cone_domain() }
/// Appends the dual geometric mean cone domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appenddualgeomeanconedomain>
pub fn append_dual_geo_mean_cone_domain(&mut self,n_ : i64) -> Result<i64,String> { self.data.task.append_dual_geo_mean_cone_domain(n_) }
/// Appends the dual power cone domain.
///
/// # Arguments
///
/// - `n_` Dimension of the domain.
/// - `alpha_` The sequence proportional to exponents. Must be positive.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appenddualpowerconedomain>
pub fn append_dual_power_cone_domain(&mut self,n_ : i64,alpha_ : &[f64]) -> Result<i64,String> { self.data.task.append_dual_power_cone_domain(n_,alpha_) }
/// Appends the primal exponential cone domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendprimalexpconedomain>
pub fn append_primal_exp_cone_domain(&mut self) -> Result<i64,String> { self.data.task.append_primal_exp_cone_domain() }
/// Appends the primal geometric mean cone domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendprimalgeomeanconedomain>
pub fn append_primal_geo_mean_cone_domain(&mut self,n_ : i64) -> Result<i64,String> { self.data.task.append_primal_geo_mean_cone_domain(n_) }
/// Appends the primal power cone domain.
///
/// # Arguments
///
/// - `n_` Dimension of the domain.
/// - `alpha_` The sequence proportional to exponents. Must be positive.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendprimalpowerconedomain>
pub fn append_primal_power_cone_domain(&mut self,n_ : i64,alpha_ : &[f64]) -> Result<i64,String> { self.data.task.append_primal_power_cone_domain(n_,alpha_) }
/// Appends the n dimensional quadratic cone domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendquadraticconedomain>
pub fn append_quadratic_cone_domain(&mut self,n_ : i64) -> Result<i64,String> { self.data.task.append_quadratic_cone_domain(n_) }
/// Appends the n dimensional real number domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrdomain>
pub fn append_r_domain(&mut self,n_ : i64) -> Result<i64,String> { self.data.task.append_r_domain(n_) }
/// Appends the n dimensional negative orthant to the list of domains.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrminusdomain>
pub fn append_rminus_domain(&mut self,n_ : i64) -> Result<i64,String> { self.data.task.append_rminus_domain(n_) }
/// Appends the n dimensional positive orthant to the list of domains.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrplusdomain>
pub fn append_rplus_domain(&mut self,n_ : i64) -> Result<i64,String> { self.data.task.append_rplus_domain(n_) }
/// Appends the n dimensional rotated quadratic cone domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrquadraticconedomain>
pub fn append_r_quadratic_cone_domain(&mut self,n_ : i64) -> Result<i64,String> { self.data.task.append_r_quadratic_cone_domain(n_) }
/// Appends the n dimensional 0 domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrzerodomain>
pub fn append_rzero_domain(&mut self,n_ : i64) -> Result<i64,String> { self.data.task.append_rzero_domain(n_) }
/// Appends a general sparse symmetric matrix to the storage of symmetric matrices.
///
/// # Arguments
///
/// - `dim_` Dimension of the symmetric matrix that is appended.
/// - `subi_` Row subscript in the triplets.
/// - `subj_` Column subscripts in the triplets.
/// - `valij_` Values of each triplet.
///
/// # Returns
///
/// - `idx` Unique index assigned to the inputted matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendsparsesymmat>
pub fn append_sparse_sym_mat(&mut self,dim_ : i32,subi_ : &[i32],subj_ : &[i32],valij_ : &[f64]) -> Result<i64,String> { self.data.task.append_sparse_sym_mat(dim_,subi_,subj_,valij_) }
/// Appends a general sparse symmetric matrix to the storage of symmetric matrices.
///
/// # Arguments
///
/// - `dims_` Dimensions of the symmetric matrixes.
/// - `nz_` Number of nonzeros for each matrix.
/// - `subi_` Row subscript in the triplets.
/// - `subj_` Column subscripts in the triplets.
/// - `valij_` Values of each triplet.
/// - `idx_` Unique index assigned to the inputted matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendsparsesymmatlist>
pub fn append_sparse_sym_mat_list(&mut self,dims_ : &[i32],nz_ : &[i64],subi_ : &[i32],subj_ : &[i32],valij_ : &[f64],idx_ : &mut[i64]) -> Result<(),String> { self.data.task.append_sparse_sym_mat_list(dims_,nz_,subi_,subj_,valij_,idx_) }
/// Appends the vectorized SVEC PSD cone domain.
///
/// # Arguments
///
/// - `n_` Dimension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendsvecpsdconedomain>
pub fn append_svec_psd_cone_domain(&mut self,n_ : i64) -> Result<i64,String> { self.data.task.append_svec_psd_cone_domain(n_) }
/// Appends a number of variables to the optimization task.
///
/// # Arguments
///
/// - `num_` Number of variables which should be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendvars>
pub fn append_vars(&mut self,num_ : i32) -> Result<(),String> { self.data.task.append_vars(num_) }
/// Get the optimizer log from a remote job.
///
/// # Arguments
///
/// - `addr_` Address of the solver server
/// - `accesstoken_` Access token string.
/// - `token_` Job token
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncgetlog>
pub fn async_get_log(&mut self,addr_ : &str,accesstoken_ : &str,token_ : &str) -> Result<(),String> { self.data.task.async_get_log(addr_,accesstoken_,token_) }
/// Request a solution from a remote job.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
/// - `token_` The task token.
/// - `resp_` Is the response code from the remote solver.
///
/// See [Rescode]
/// - `trm_` Is either OK or a termination response code.
///
/// See [Rescode]
///
/// # Returns
///
/// - `respavailable` Indicates if a remote response is available.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncgetresult>
pub fn async_get_result(&mut self,address_ : &str,accesstoken_ : &str,token_ : &str,resp_ : & mut i32,trm_ : & mut i32) -> Result<bool,String> { self.data.task.async_get_result(address_,accesstoken_,token_,resp_,trm_) }
/// Offload the optimization task to a solver server in asynchronous mode.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
///
/// # Returns
///
/// - `token` Returns the task token.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncoptimize>
pub fn async_optimize(&mut self,address_ : &str,accesstoken_ : &str) -> Result<String,String> { self.data.task.async_optimize(address_,accesstoken_) }
/// Requests information about the status of the remote job.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
/// - `token_` The task token.
/// - `resp_` Is the response code from the remote solver.
///
/// See [Rescode]
/// - `trm_` Is either OK or a termination response code.
///
/// See [Rescode]
///
/// # Returns
///
/// - `respavailable` Indicates if a remote response is available.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncpoll>
pub fn async_poll(&mut self,address_ : &str,accesstoken_ : &str,token_ : &str,resp_ : & mut i32,trm_ : & mut i32) -> Result<bool,String> { self.data.task.async_poll(address_,accesstoken_,token_,resp_,trm_) }
/// Request that the job identified by the token is terminated.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
/// - `token_` The task token.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncstop>
pub fn async_stop(&mut self,address_ : &str,accesstoken_ : &str,token_ : &str) -> Result<(),String> { self.data.task.async_stop(address_,accesstoken_,token_) }
/// Computes conditioning information for the basis matrix.
///
/// # Arguments
///
/// - `nrmbasis_` An estimate for the 1-norm of the basis.
/// - `nrminvbasis_` An estimate for the 1-norm of the inverse of the basis.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.basiscond>
pub fn basis_cond(&mut self,nrmbasis_ : &mut f64,nrminvbasis_ : &mut f64) -> Result<(),String> { self.data.task.basis_cond(nrmbasis_,nrminvbasis_) }
/// Checks the memory allocated by the task.
///
/// # Arguments
///
/// - `file_` File from which the function is called.
/// - `line_` Line in the file from which the function is called.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkmemtask>
pub fn check_mem(&mut self,file_ : &str,line_ : i32) -> Result<(),String> { self.data.task.check_mem(file_,line_) }
/// Changes the bounds for one constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint for which the bounds should be changed.
/// - `lower_` If non-zero, then the lower bound is changed, otherwise the upper bound is changed.
/// - `finite_` If non-zero, then the given value is assumed to be finite.
/// - `value_` New value for the bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.chgconbound>
pub fn chg_con_bound(&mut self,i_ : i32,lower_ : i32,finite_ : i32,value_ : f64) -> Result<(),String> { self.data.task.chg_con_bound(i_,lower_,finite_,value_) }
/// Changes the bounds for one variable.
///
/// # Arguments
///
/// - `j_` Index of the variable for which the bounds should be changed.
/// - `lower_` If non-zero, then the lower bound is changed, otherwise the upper bound is changed.
/// - `finite_` If non-zero, then the given value is assumed to be finite.
/// - `value_` New value for the bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.chgvarbound>
pub fn chg_var_bound(&mut self,j_ : i32,lower_ : i32,finite_ : i32,value_ : f64) -> Result<(),String> { self.data.task.chg_var_bound(j_,lower_,finite_,value_) }
/// Commits all cached problem changes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.commitchanges>
pub fn commit_changes(&mut self) -> Result<(),String> { self.data.task.commit_changes() }
/// Undefine a solution and free the memory it uses.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.deletesolution>
pub fn delete_solution(&mut self,whichsol_ : i32) -> Result<(),String> { self.data.task.delete_solution(whichsol_) }
/// Performs sensitivity analysis on objective coefficients.
///
/// # Arguments
///
/// - `subj_` Indexes of objective coefficients to analyze.
/// - `leftpricej_` Left shadow prices for requested coefficients.
/// - `rightpricej_` Right shadow prices for requested coefficients.
/// - `leftrangej_` Left range for requested coefficients.
/// - `rightrangej_` Right range for requested coefficients.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.dualsensitivity>
pub fn dual_sensitivity(&self,subj_ : &[i32],leftpricej_ : &mut[f64],rightpricej_ : &mut[f64],leftrangej_ : &mut[f64],rightrangej_ : &mut[f64]) -> Result<(),String> { self.data.task.dual_sensitivity(subj_,leftpricej_,rightpricej_,leftrangej_,rightrangej_) }
/// Clears a row in barF
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafebarfrow>
pub fn empty_afe_barf_row(&mut self,afeidx_ : i64) -> Result<(),String> { self.data.task.empty_afe_barf_row(afeidx_) }
/// Clears rows in barF.
///
/// # Arguments
///
/// - `afeidxlist_` Indices of rows in barF to clear.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafebarfrowlist>
pub fn empty_afe_barf_row_list(&mut self,afeidxlist_ : &[i64]) -> Result<(),String> { self.data.task.empty_afe_barf_row_list(afeidxlist_) }
/// Clears a column in F.
///
/// # Arguments
///
/// - `varidx_` Variable index.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafefcol>
pub fn empty_afe_f_col(&mut self,varidx_ : i32) -> Result<(),String> { self.data.task.empty_afe_f_col(varidx_) }
/// Clears columns in F.
///
/// # Arguments
///
/// - `varidx_` Indices of variables in F to clear.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafefcollist>
pub fn empty_afe_f_col_list(&mut self,varidx_ : &[i32]) -> Result<(),String> { self.data.task.empty_afe_f_col_list(varidx_) }
/// Clears a row in F.
///
/// # Arguments
///
/// - `afeidx_` Row index.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafefrow>
pub fn empty_afe_f_row(&mut self,afeidx_ : i64) -> Result<(),String> { self.data.task.empty_afe_f_row(afeidx_) }
/// Clears rows in F.
///
/// # Arguments
///
/// - `afeidx_` Indices of rows in F to clear.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafefrowlist>
pub fn empty_afe_f_row_list(&mut self,afeidx_ : &[i64]) -> Result<(),String> { self.data.task.empty_afe_f_row_list(afeidx_) }
/// Evaluates the activity of an affine conic constraint.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidx_` The index of the affine conic constraint.
/// - `activity_` The activity of the affine conic constraint. The array should have length equal to the dimension of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.evaluateacc>
pub fn evaluate_acc(&self,whichsol_ : i32,accidx_ : i64,activity_ : &mut[f64]) -> Result<(),String> { self.data.task.evaluate_acc(whichsol_,accidx_,activity_) }
/// Evaluates the activities of all affine conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `activity_` The activity of affine conic constraints. The array should have length equal to the sum of dimensions of all affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.evaluateaccs>
pub fn evaluate_accs(&self,whichsol_ : i32,activity_ : &mut[f64]) -> Result<(),String> { self.data.task.evaluate_accs(whichsol_,activity_) }
/// Generates systematic names for affine conic constraints.
///
/// # Arguments
///
/// - `sub_` Indexes of the affine conic constraints.
/// - `fmt_` The variable name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generateaccnames>
pub fn generate_acc_names(&mut self,sub_ : &[i64],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> { self.data.task.generate_acc_names(sub_,fmt_,dims_,sp_,namedaxisidxs_,names_) }
/// Generates systematic names for variables.
///
/// # Arguments
///
/// - `subj_` Indexes of the variables.
/// - `fmt_` The variable name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generatebarvarnames>
pub fn generate_barvar_names(&mut self,subj_ : &[i32],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> { self.data.task.generate_barvar_names(subj_,fmt_,dims_,sp_,namedaxisidxs_,names_) }
/// Generates systematic names for cone.
///
/// # Arguments
///
/// - `subk_` Indexes of the cone.
/// - `fmt_` The cone name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generateconenames>
pub fn generate_cone_names(&mut self,subk_ : &[i32],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> { self.data.task.generate_cone_names(subk_,fmt_,dims_,sp_,namedaxisidxs_,names_) }
/// Generates systematic names for constraints.
///
/// # Arguments
///
/// - `subi_` Indexes of the constraints.
/// - `fmt_` The constraint name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generateconnames>
pub fn generate_con_names(&mut self,subi_ : &[i32],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> { self.data.task.generate_con_names(subi_,fmt_,dims_,sp_,namedaxisidxs_,names_) }
/// Generates systematic names for affine conic constraints.
///
/// # Arguments
///
/// - `sub_` Indexes of the disjunctive constraints.
/// - `fmt_` The variable name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generatedjcnames>
pub fn generate_djc_names(&mut self,sub_ : &[i64],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> { self.data.task.generate_djc_names(sub_,fmt_,dims_,sp_,namedaxisidxs_,names_) }
/// Generates systematic names for variables.
///
/// # Arguments
///
/// - `subj_` Indexes of the variables.
/// - `fmt_` The variable name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generatevarnames>
pub fn generate_var_names(&mut self,subj_ : &[i32],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> { self.data.task.generate_var_names(subj_,fmt_,dims_,sp_,namedaxisidxs_,names_) }
/// Obtains the list of affine expressions appearing in the affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of the affine conic constraint.
/// - `afeidxlist_` List of indexes of affine expressions appearing in the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccafeidxlist>
pub fn get_acc_afe_idx_list(&self,accidx_ : i64,afeidxlist_ : &mut[i64]) -> Result<(),String> { self.data.task.get_acc_afe_idx_list(accidx_,afeidxlist_) }
/// Obtains the additional constant term vector appearing in the affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of the affine conic constraint.
/// - `b_` The vector b appearing in the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccb>
pub fn get_acc_b(&self,accidx_ : i64,b_ : &mut[f64]) -> Result<(),String> { self.data.task.get_acc_b(accidx_,b_) }
/// Obtains barF, implied by the ACCs, in block triplet form.
///
/// # Arguments
///
/// - `acc_afe_` Index of the AFE within the concatenated list of AFEs in ACCs.
/// - `bar_var_` Symmetric matrix variable index.
/// - `blk_row_` Block row index.
/// - `blk_col_` Block column index.
/// - `blk_val_` The numerical value associated with each block triplet.
///
/// # Returns
///
/// - `numtrip` Number of elements in the block triplet form.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccbarfblocktriplet>
pub fn get_acc_barf_block_triplet(&self,acc_afe_ : &mut[i64],bar_var_ : &mut[i32],blk_row_ : &mut[i32],blk_col_ : &mut[i32],blk_val_ : &mut[f64]) -> Result<i64,String> { self.data.task.get_acc_barf_block_triplet(acc_afe_,bar_var_,blk_row_,blk_col_,blk_val_) }
/// Obtains an upper bound on the number of elements in the block triplet form of barf, as used within the ACCs.
///
/// # Returns
///
/// - `numtrip` An upper bound on the number of elements in the block triplet form of barf, as used within the ACCs.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccbarfnumblocktriplets>
pub fn get_acc_barf_num_block_triplets(&self) -> Result<i64,String> { self.data.task.get_acc_barf_num_block_triplets() }
/// Obtains the domain appearing in the affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` The index of the affine conic constraint.
///
/// # Returns
///
/// - `domidx` The index of domain in the affine conic constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccdomain>
pub fn get_acc_domain(&mut self,accidx_ : i64) -> Result<i64,String> { self.data.task.get_acc_domain(accidx_) }
/// Obtains the doty vector for an affine conic constraint.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidx_` The index of the affine conic constraint.
/// - `doty_` The dual values for this affine conic constraint. The array should have length equal to the dimension of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccdoty>
pub fn get_acc_dot_y(&self,whichsol_ : i32,accidx_ : i64,doty_ : &mut[f64]) -> Result<(),String> { self.data.task.get_acc_dot_y(whichsol_,accidx_,doty_) }
/// Obtains the doty vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `doty_` The dual values of affine conic constraints. The array should have length equal to the sum of dimensions of all affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccdotys>
pub fn get_acc_dot_y_s(&self,whichsol_ : i32,doty_ : &mut[f64]) -> Result<(),String> { self.data.task.get_acc_dot_y_s(whichsol_,doty_) }
/// Obtains the total number of nonzeros in the ACC implied F matrix.
///
/// # Returns
///
/// - `accfnnz` Number of nonzeros in the F matrix implied by ACCs.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccfnumnz>
pub fn get_acc_f_numnz(&mut self) -> Result<i64,String> { self.data.task.get_acc_f_numnz() }
/// Obtains the F matrix (implied by the AFE ordering within the ACCs) in triplet format.
///
/// # Arguments
///
/// - `frow_` Row indices of nonzeros in the implied F matrix.
/// - `fcol_` Column indices of nonzeros in the implied F matrix.
/// - `fval_` Values of nonzero entries in the implied F matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccftrip>
pub fn get_acc_f_trip(&mut self,frow_ : &mut[i64],fcol_ : &mut[i32],fval_ : &mut[f64]) -> Result<(),String> { self.data.task.get_acc_f_trip(frow_,fcol_,fval_) }
/// The g vector as used within the ACCs.
///
/// # Arguments
///
/// - `g_` The g vector as used within the ACCs.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccgvector>
pub fn get_acc_g_vector(&self,g_ : &mut[f64]) -> Result<(),String> { self.data.task.get_acc_g_vector(g_) }
/// Obtains the dimension of the affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` The index of the affine conic constraint.
///
/// # Returns
///
/// - `n` The dimension of the affine conic constraint (equal to the dimension of its domain).
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccn>
pub fn get_acc_n(&mut self,accidx_ : i64) -> Result<i64,String> { self.data.task.get_acc_n(accidx_) }
/// Obtains the name of an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of an affine conic constraint.
///
/// # Returns
///
/// - `name` Returns the required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccname>
pub fn get_acc_name(&self,accidx_ : i64) -> Result<String,String> { self.data.task.get_acc_name(accidx_) }
/// Obtains the length of the name of an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of an affine conic constraint.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccnamelen>
pub fn get_acc_name_len(&self,accidx_ : i64) -> Result<i32,String> { self.data.task.get_acc_name_len(accidx_) }
/// Obtains the total dimension of all affine conic constraints.
///
/// # Returns
///
/// - `n` The total dimension of all affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccntot>
pub fn get_acc_n_tot(&mut self) -> Result<i64,String> { self.data.task.get_acc_n_tot() }
/// Obtains full data of all affine conic constraints.
///
/// # Arguments
///
/// - `domidxlist_` The list of domains appearing in all affine conic constraints.
/// - `afeidxlist_` The concatenation of index lists of affine expressions appearing in all affine conic constraints.
/// - `b_` The concatenation of vectors b appearing in all affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccs>
pub fn get_accs(&self,domidxlist_ : &mut[i64],afeidxlist_ : &mut[i64],b_ : &mut[f64]) -> Result<(),String> { self.data.task.get_accs(domidxlist_,afeidxlist_,b_) }
/// Obtains one column of the linear constraint matrix.
///
/// # Arguments
///
/// - `j_` Index of the column.
/// - `nzj_` Number of non-zeros in the column obtained.
/// - `subj_` Row indices of the non-zeros in the column obtained.
/// - `valj_` Numerical values in the column obtained.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacol>
pub fn get_a_col(&self,j_ : i32,nzj_ : &mut i32,subj_ : &mut[i32],valj_ : &mut[f64]) -> Result<(),String> { self.data.task.get_a_col(j_,nzj_,subj_,valj_) }
/// Obtains the number of non-zero elements in one column of the linear constraint matrix
///
/// # Arguments
///
/// - `i_` Index of the column.
///
/// # Returns
///
/// - `nzj` Number of non-zeros in the j'th column of (A).
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacolnumnz>
pub fn get_a_col_num_nz(&self,i_ : i32) -> Result<i32,String> { self.data.task.get_a_col_num_nz(i_) }
/// Obtains a sequence of columns from the coefficient matrix.
///
/// # Arguments
///
/// - `first_` Index of the first column in the sequence.
/// - `last_` Index of the last column in the sequence plus one.
/// - `ptrb_` Column start pointers.
/// - `ptre_` Column end pointers.
/// - `sub_` Contains the row subscripts.
/// - `val_` Contains the coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacolslice64>
pub fn get_a_col_slice(&self,first_ : i32,last_ : i32,ptrb_ : &mut[i64],ptre_ : &mut[i64],sub_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> { self.data.task.get_a_col_slice(first_,last_,ptrb_,ptre_,sub_,val_) }
/// Obtains the number of non-zeros in a slice of columns of the coefficient matrix.
///
/// # Arguments
///
/// - `first_` Index of the first column in the sequence.
/// - `last_` Index of the last column plus one in the sequence.
///
/// # Returns
///
/// - `numnz` Number of non-zeros in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacolslicenumnz64>
pub fn get_a_col_slice_num_nz(&self,first_ : i32,last_ : i32) -> Result<i64,String> { self.data.task.get_a_col_slice_num_nz(first_,last_) }
/// Obtains a sequence of columns from the coefficient matrix in triplet format.
///
/// # Arguments
///
/// - `first_` Index of the first column in the sequence.
/// - `last_` Index of the last column in the sequence plus one.
/// - `subi_` Constraint subscripts.
/// - `subj_` Column subscripts.
/// - `val_` Values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacolslicetrip>
pub fn get_a_col_slice_trip(&self,first_ : i32,last_ : i32,subi_ : &mut[i32],subj_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> { self.data.task.get_a_col_slice_trip(first_,last_,subi_,subj_,val_) }
/// Obtains barF in block triplet form.
///
/// # Arguments
///
/// - `afeidx_` Constraint index.
/// - `barvaridx_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valkl_` The numerical value associated with each block triplet.
///
/// # Returns
///
/// - `numtrip` Number of elements in the block triplet form.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfblocktriplet>
pub fn get_afe_barf_block_triplet(&self,afeidx_ : &mut[i64],barvaridx_ : &mut[i32],subk_ : &mut[i32],subl_ : &mut[i32],valkl_ : &mut[f64]) -> Result<i64,String> { self.data.task.get_afe_barf_block_triplet(afeidx_,barvaridx_,subk_,subl_,valkl_) }
/// Obtains an upper bound on the number of elements in the block triplet form of barf.
///
/// # Returns
///
/// - `numtrip` An upper bound on the number of elements in the block triplet form of barf.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfnumblocktriplets>
pub fn get_afe_barf_num_block_triplets(&self) -> Result<i64,String> { self.data.task.get_afe_barf_num_block_triplets() }
/// Obtains the number of nonzero entries in a row of barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
///
/// # Returns
///
/// - `numentr` Number of nonzero entries in a row of barF.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfnumrowentries>
pub fn get_afe_barf_num_row_entries(&mut self,afeidx_ : i64) -> Result<i32,String> { self.data.task.get_afe_barf_num_row_entries(afeidx_) }
/// Obtains nonzero entries in one row of barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
/// - `barvaridx_` Semidefinite variable indices.
/// - `ptrterm_` Pointers to the description of entries.
/// - `numterm_` Number of terms in each entry.
/// - `termidx_` Indices of semidefinite matrices from E.
/// - `termweight_` Weights appearing in the weighted sum representation.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfrow>
pub fn get_afe_barf_row(&mut self,afeidx_ : i64,barvaridx_ : &mut[i32],ptrterm_ : &mut[i64],numterm_ : &mut[i64],termidx_ : &mut[i64],termweight_ : &mut[f64]) -> Result<(),String> { self.data.task.get_afe_barf_row(afeidx_,barvaridx_,ptrterm_,numterm_,termidx_,termweight_) }
/// Obtains information about one row of barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
/// - `numentr_` Number of nonzero entries in a row of barF.
/// - `numterm_` Number of terms in the weighted sums representation of the row of barF.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfrowinfo>
pub fn get_afe_barf_row_info(&mut self,afeidx_ : i64,numentr_ : &mut i32,numterm_ : &mut i64) -> Result<(),String> { self.data.task.get_afe_barf_row_info(afeidx_,numentr_,numterm_) }
/// Obtains the total number of nonzeros in F.
///
/// # Returns
///
/// - `numnz` Number of nonzeros in F.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafefnumnz>
pub fn get_afe_f_num_nz(&mut self) -> Result<i64,String> { self.data.task.get_afe_f_num_nz() }
/// Obtains one row of F in sparse format.
///
/// # Arguments
///
/// - `afeidx_` Row index.
/// - `numnz_` Number of non-zeros in the row obtained.
/// - `varidx_` Column indices of the non-zeros in the row obtained.
/// - `val_` Values of the non-zeros in the row obtained.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafefrow>
pub fn get_afe_f_row(&mut self,afeidx_ : i64,numnz_ : &mut i32,varidx_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> { self.data.task.get_afe_f_row(afeidx_,numnz_,varidx_,val_) }
/// Obtains the number of nonzeros in a row of F.
///
/// # Arguments
///
/// - `afeidx_` Row index.
///
/// # Returns
///
/// - `numnz` Number of non-zeros in the row.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafefrownumnz>
pub fn get_afe_f_row_num_nz(&mut self,afeidx_ : i64) -> Result<i32,String> { self.data.task.get_afe_f_row_num_nz(afeidx_) }
/// Obtains the F matrix in triplet format.
///
/// # Arguments
///
/// - `afeidx_` Row indices of nonzeros.
/// - `varidx_` Column indices of nonzeros.
/// - `val_` Values of nonzero entries.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafeftrip>
pub fn get_afe_f_trip(&mut self,afeidx_ : &mut[i64],varidx_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> { self.data.task.get_afe_f_trip(afeidx_,varidx_,val_) }
/// Obtains a single coefficient in g.
///
/// # Arguments
///
/// - `afeidx_` Element index.
///
/// # Returns
///
/// - `g` The entry in g.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafeg>
pub fn get_afe_g(&mut self,afeidx_ : i64) -> Result<f64,String> { self.data.task.get_afe_g(afeidx_) }
/// Obtains a sequence of coefficients from the vector g.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `g_` The slice of g as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafegslice>
pub fn get_afe_g_slice(&self,first_ : i64,last_ : i64,g_ : &mut[f64]) -> Result<(),String> { self.data.task.get_afe_g_slice(first_,last_,g_) }
/// Obtains a single coefficient in linear constraint matrix.
///
/// # Arguments
///
/// - `i_` Row index of the coefficient to be returned.
/// - `j_` Column index of the coefficient to be returned.
///
/// # Returns
///
/// - `aij` Returns the requested coefficient.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaij>
pub fn get_aij(&self,i_ : i32,j_ : i32) -> Result<f64,String> { self.data.task.get_aij(i_,j_) }
/// Obtains the number non-zeros in a rectangular piece of the linear constraint matrix.
///
/// # Arguments
///
/// - `firsti_` Index of the first row in the rectangular piece.
/// - `lasti_` Index of the last row plus one in the rectangular piece.
/// - `firstj_` Index of the first column in the rectangular piece.
/// - `lastj_` Index of the last column plus one in the rectangular piece.
///
/// # Returns
///
/// - `numnz` Number of non-zero elements in the rectangular piece of the linear constraint matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getapiecenumnz>
pub fn get_a_piece_num_nz(&self,firsti_ : i32,lasti_ : i32,firstj_ : i32,lastj_ : i32) -> Result<i32,String> { self.data.task.get_a_piece_num_nz(firsti_,lasti_,firstj_,lastj_) }
/// Obtains one row of the linear constraint matrix.
///
/// # Arguments
///
/// - `i_` Index of the row.
/// - `nzi_` Number of non-zeros in the row obtained.
/// - `subi_` Column indices of the non-zeros in the row obtained.
/// - `vali_` Numerical values of the row obtained.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarow>
pub fn get_a_row(&self,i_ : i32,nzi_ : &mut i32,subi_ : &mut[i32],vali_ : &mut[f64]) -> Result<(),String> { self.data.task.get_a_row(i_,nzi_,subi_,vali_) }
/// Obtains the number of non-zero elements in one row of the linear constraint matrix
///
/// # Arguments
///
/// - `i_` Index of the row.
///
/// # Returns
///
/// - `nzi` Number of non-zeros in the i'th row of `A`.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarownumnz>
pub fn get_a_row_num_nz(&self,i_ : i32) -> Result<i32,String> { self.data.task.get_a_row_num_nz(i_) }
/// Obtains a sequence of rows from the coefficient matrix.
///
/// # Arguments
///
/// - `first_` Index of the first row in the sequence.
/// - `last_` Index of the last row in the sequence plus one.
/// - `ptrb_` Row start pointers.
/// - `ptre_` Row end pointers.
/// - `sub_` Contains the column subscripts.
/// - `val_` Contains the coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarowslice64>
pub fn get_a_row_slice(&self,first_ : i32,last_ : i32,ptrb_ : &mut[i64],ptre_ : &mut[i64],sub_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> { self.data.task.get_a_row_slice(first_,last_,ptrb_,ptre_,sub_,val_) }
/// Obtains the number of non-zeros in a slice of rows of the coefficient matrix.
///
/// # Arguments
///
/// - `first_` Index of the first row in the sequence.
/// - `last_` Index of the last row plus one in the sequence.
///
/// # Returns
///
/// - `numnz` Number of non-zeros in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarowslicenumnz64>
pub fn get_a_row_slice_num_nz(&self,first_ : i32,last_ : i32) -> Result<i64,String> { self.data.task.get_a_row_slice_num_nz(first_,last_) }
/// Obtains a sequence of rows from the coefficient matrix in sparse triplet format.
///
/// # Arguments
///
/// - `first_` Index of the first row in the sequence.
/// - `last_` Index of the last row in the sequence plus one.
/// - `subi_` Constraint subscripts.
/// - `subj_` Column subscripts.
/// - `val_` Values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarowslicetrip>
pub fn get_a_row_slice_trip(&self,first_ : i32,last_ : i32,subi_ : &mut[i32],subj_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> { self.data.task.get_a_row_slice_trip(first_,last_,subi_,subj_,val_) }
/// Obtains the A matrix in sparse triplet format.
///
/// # Arguments
///
/// - `subi_` Constraint subscripts.
/// - `subj_` Column subscripts.
/// - `val_` Values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getatrip>
pub fn get_a_trip(&self,subi_ : &mut[i32],subj_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> { self.data.task.get_a_trip(subi_,subj_,val_) }
/// Gets the current A matrix truncation threshold.
///
/// # Arguments
///
/// - `tolzero_` Truncation tolerance.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getatruncatetol>
pub fn get_a_truncate_tol(&self,tolzero_ : &mut[f64]) -> Result<(),String> { self.data.task.get_a_truncate_tol(tolzero_) }
/// Obtains barA in block triplet form.
///
/// # Arguments
///
/// - `subi_` Constraint index.
/// - `subj_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valijkl_` The numerical value associated with each block triplet.
///
/// # Returns
///
/// - `num` Number of elements in the block triplet form.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarablocktriplet>
pub fn get_bara_block_triplet(&self,subi_ : &mut[i32],subj_ : &mut[i32],subk_ : &mut[i32],subl_ : &mut[i32],valijkl_ : &mut[f64]) -> Result<i64,String> { self.data.task.get_bara_block_triplet(subi_,subj_,subk_,subl_,valijkl_) }
/// Obtains information about an element in barA.
///
/// # Arguments
///
/// - `idx_` Position of the element in the vectorized form.
/// - `i_` Row index of the element at position idx.
/// - `j_` Column index of the element at position idx.
/// - `sub_` A list indexes of the elements from symmetric matrix storage that appear in the weighted sum.
/// - `weights_` The weights associated with each term in the weighted sum.
///
/// # Returns
///
/// - `num` Number of terms in weighted sum that forms the element.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbaraidx>
pub fn get_bara_idx(&self,idx_ : i64,i_ : &mut i32,j_ : &mut i32,sub_ : &mut[i64],weights_ : &mut[f64]) -> Result<i64,String> { self.data.task.get_bara_idx(idx_,i_,j_,sub_,weights_) }
/// Obtains information about an element in barA.
///
/// # Arguments
///
/// - `idx_` Position of the element in the vectorized form.
/// - `i_` Row index of the element at position idx.
/// - `j_` Column index of the element at position idx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbaraidxij>
pub fn get_bara_idx_i_j(&self,idx_ : i64,i_ : &mut i32,j_ : &mut i32) -> Result<(),String> { self.data.task.get_bara_idx_i_j(idx_,i_,j_) }
/// Obtains the number of terms in the weighted sum that form a particular element in barA.
///
/// # Arguments
///
/// - `idx_` The internal position of the element for which information should be obtained.
///
/// # Returns
///
/// - `num` Number of terms in the weighted sum that form the specified element in barA.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbaraidxinfo>
pub fn get_bara_idx_info(&self,idx_ : i64) -> Result<i64,String> { self.data.task.get_bara_idx_info(idx_) }
/// Obtains the sparsity pattern of the barA matrix.
///
/// # Arguments
///
/// - `numnz_` Number of nonzero elements in barA.
/// - `idxij_` Position of each nonzero element in the vector representation of barA.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarasparsity>
pub fn get_bara_sparsity(&self,numnz_ : &mut i64,idxij_ : &mut[i64]) -> Result<(),String> { self.data.task.get_bara_sparsity(numnz_,idxij_) }
/// Obtains barC in block triplet form.
///
/// # Arguments
///
/// - `subj_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valjkl_` The numerical value associated with each block triplet.
///
/// # Returns
///
/// - `num` Number of elements in the block triplet form.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcblocktriplet>
pub fn get_barc_block_triplet(&self,subj_ : &mut[i32],subk_ : &mut[i32],subl_ : &mut[i32],valjkl_ : &mut[f64]) -> Result<i64,String> { self.data.task.get_barc_block_triplet(subj_,subk_,subl_,valjkl_) }
/// Obtains information about an element in barc.
///
/// # Arguments
///
/// - `idx_` Index of the element for which information should be obtained.
/// - `j_` Row index in barc.
/// - `num_` Number of terms in the weighted sum.
/// - `sub_` Elements appearing the weighted sum.
/// - `weights_` Weights of terms in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcidx>
pub fn get_barc_idx(&self,idx_ : i64,j_ : &mut i32,num_ : &mut i64,sub_ : &mut[i64],weights_ : &mut[f64]) -> Result<(),String> { self.data.task.get_barc_idx(idx_,j_,num_,sub_,weights_) }
/// Obtains information about an element in barc.
///
/// # Arguments
///
/// - `idx_` Index of the element for which information should be obtained. The value is an index of a symmetric sparse variable.
///
/// # Returns
///
/// - `num` Number of terms that appear in the weighted sum that forms the requested element.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcidxinfo>
pub fn get_barc_idx_info(&self,idx_ : i64) -> Result<i64,String> { self.data.task.get_barc_idx_info(idx_) }
/// Obtains the row index of an element in barc.
///
/// # Arguments
///
/// - `idx_` Index of the element for which information should be obtained.
/// - `j_` Row index in barc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcidxj>
pub fn get_barc_idx_j(&self,idx_ : i64,j_ : &mut i32) -> Result<(),String> { self.data.task.get_barc_idx_j(idx_,j_) }
/// Get the positions of the nonzero elements in barc.
///
/// # Arguments
///
/// - `numnz_` Number of nonzero elements in barc.
/// - `idxj_` Internal positions of the nonzeros elements in barc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcsparsity>
pub fn get_barc_sparsity(&self,numnz_ : &mut i64,idxj_ : &mut[i64]) -> Result<(),String> { self.data.task.get_barc_sparsity(numnz_,idxj_) }
/// Obtains the dual solution for a semidefinite variable.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `j_` Index of the semidefinite variable.
/// - `barsj_` Value of the j'th dual variable of barx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarsj>
pub fn get_bars_j(&self,whichsol_ : i32,j_ : i32,barsj_ : &mut[f64]) -> Result<(),String> { self.data.task.get_bars_j(whichsol_,j_,barsj_) }
/// Obtains the dual solution for a sequence of semidefinite variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` Index of the first semidefinite variable in the slice.
/// - `last_` Index of the last semidefinite variable in the slice plus one.
/// - `slicesize_` Denotes the length of the array barsslice.
/// - `barsslice_` Dual solution values of symmetric matrix variables in the slice, stored sequentially.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarsslice>
pub fn get_bars_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,slicesize_ : i64,barsslice_ : &mut[f64]) -> Result<(),String> { self.data.task.get_bars_slice(whichsol_,first_,last_,slicesize_,barsslice_) }
/// Obtains the name of a semidefinite variable.
///
/// # Arguments
///
/// - `i_` Index of the variable.
///
/// # Returns
///
/// - `name` The requested name is copied to this buffer.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarvarname>
pub fn get_barvar_name(&self,i_ : i32) -> Result<String,String> { self.data.task.get_barvar_name(i_) }
/// Obtains the index of semidefinite variable from its name.
///
/// # Arguments
///
/// - `somename_` The name of the variable.
/// - `asgn_` Non-zero if the name somename is assigned to some semidefinite variable.
///
/// # Returns
///
/// - `index` The index of a semidefinite variable with the name somename (if one exists).
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarvarnameindex>
pub fn get_barvar_name_index(&self,somename_ : &str,asgn_ : &mut i32) -> Result<i32,String> { self.data.task.get_barvar_name_index(somename_,asgn_) }
/// Obtains the length of the name of a semidefinite variable.
///
/// # Arguments
///
/// - `i_` Index of the variable.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarvarnamelen>
pub fn get_barvar_name_len(&self,i_ : i32) -> Result<i32,String> { self.data.task.get_barvar_name_len(i_) }
/// Obtains the primal solution for a semidefinite variable.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `j_` Index of the semidefinite variable.
/// - `barxj_` Value of the j'th variable of barx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarxj>
pub fn get_barx_j(&self,whichsol_ : i32,j_ : i32,barxj_ : &mut[f64]) -> Result<(),String> { self.data.task.get_barx_j(whichsol_,j_,barxj_) }
/// Obtains the primal solution for a sequence of semidefinite variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` Index of the first semidefinite variable in the slice.
/// - `last_` Index of the last semidefinite variable in the slice plus one.
/// - `slicesize_` Denotes the length of the array barxslice.
/// - `barxslice_` Solution values of symmetric matrix variables in the slice, stored sequentially.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarxslice>
pub fn get_barx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,slicesize_ : i64,barxslice_ : &mut[f64]) -> Result<(),String> { self.data.task.get_barx_slice(whichsol_,first_,last_,slicesize_,barxslice_) }
/// Obtains all objective coefficients.
///
/// # Arguments
///
/// - `c_` Linear terms of the objective as a dense vector. The length is the number of variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getc>
pub fn get_c(&self,c_ : &mut[f64]) -> Result<(),String> { self.data.task.get_c(c_) }
/// Obtains the fixed term in the objective.
///
/// # Returns
///
/// - `cfix` Fixed term in the objective.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getcfix>
pub fn get_cfix(&self) -> Result<f64,String> { self.data.task.get_cfix() }
/// Obtains one objective coefficient.
///
/// # Arguments
///
/// - `j_` Index of the variable for which the c coefficient should be obtained.
/// - `cj_` The c coefficient value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getcj>
pub fn get_c_j(&self,j_ : i32,cj_ : &mut f64) -> Result<(),String> { self.data.task.get_c_j(j_,cj_) }
/// Obtains a sequence of coefficients from the objective.
///
/// # Arguments
///
/// - `subj_` A list of variable indexes.
/// - `c_` Linear terms of the requested list of the objective as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getclist>
pub fn get_c_list(&self,subj_ : &[i32],c_ : &mut[f64]) -> Result<(),String> { self.data.task.get_c_list(subj_,c_) }
/// Obtains bound information for one constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint for which the bound information should be obtained.
/// - `bk_` Bound keys.
///
/// See [Boundkey]
/// - `bl_` Values for lower bounds.
/// - `bu_` Values for upper bounds.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconbound>
pub fn get_con_bound(&self,i_ : i32,bk_ : & mut i32,bl_ : &mut f64,bu_ : &mut f64) -> Result<(),String> { self.data.task.get_con_bound(i_,bk_,bl_,bu_) }
/// Obtains bounds information for a slice of the constraints.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bk_` Bound keys.
///
/// See [Boundkey]
/// - `bl_` Values for lower bounds.
/// - `bu_` Values for upper bounds.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconboundslice>
pub fn get_con_bound_slice(&self,first_ : i32,last_ : i32,bk_ : &mut[i32],bl_ : &mut[f64],bu_ : &mut[f64]) -> Result<(),String> { self.data.task.get_con_bound_slice(first_,last_,bk_,bl_,bu_) }
/// Obtains a cone.
///
/// # Arguments
///
/// - `k_` Index of the cone.
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `nummem_` Number of member variables in the cone.
/// - `submem_` Variable subscripts of the members in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getcone>
pub fn get_cone(&mut self,k_ : i32,ct_ : & mut i32,conepar_ : &mut f64,nummem_ : &mut i32,submem_ : &mut[i32]) -> Result<(),String> { self.data.task.get_cone(k_,ct_,conepar_,nummem_,submem_) }
/// Obtains information about a cone.
///
/// # Arguments
///
/// - `k_` Index of the cone.
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `nummem_` Number of member variables in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconeinfo>
pub fn get_cone_info(&self,k_ : i32,ct_ : & mut i32,conepar_ : &mut f64,nummem_ : &mut i32) -> Result<(),String> { self.data.task.get_cone_info(k_,ct_,conepar_,nummem_) }
/// Obtains the name of a cone.
///
/// # Arguments
///
/// - `i_` Index of the cone.
///
/// # Returns
///
/// - `name` The required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconename>
pub fn get_cone_name(&self,i_ : i32) -> Result<String,String> { self.data.task.get_cone_name(i_) }
/// Checks whether the name has been assigned to any cone.
///
/// # Arguments
///
/// - `somename_` The name which should be checked.
/// - `asgn_` Is non-zero if the name somename is assigned to some cone.
///
/// # Returns
///
/// - `index` If the name somename is assigned to some cone, this is the index of the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconenameindex>
pub fn get_cone_name_index(&self,somename_ : &str,asgn_ : &mut i32) -> Result<i32,String> { self.data.task.get_cone_name_index(somename_,asgn_) }
/// Obtains the length of the name of a cone.
///
/// # Arguments
///
/// - `i_` Index of the cone.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconenamelen>
pub fn get_cone_name_len(&self,i_ : i32) -> Result<i32,String> { self.data.task.get_cone_name_len(i_) }
/// Obtains the name of a constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
///
/// # Returns
///
/// - `name` The required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconname>
pub fn get_con_name(&self,i_ : i32) -> Result<String,String> { self.data.task.get_con_name(i_) }
/// Checks whether the name has been assigned to any constraint.
///
/// # Arguments
///
/// - `somename_` The name which should be checked.
/// - `asgn_` Is non-zero if the name somename is assigned to some constraint.
///
/// # Returns
///
/// - `index` If the name somename is assigned to a constraint, then return the index of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconnameindex>
pub fn get_con_name_index(&self,somename_ : &str,asgn_ : &mut i32) -> Result<i32,String> { self.data.task.get_con_name_index(somename_,asgn_) }
/// Obtains the length of the name of a constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconnamelen>
pub fn get_con_name_len(&self,i_ : i32) -> Result<i32,String> { self.data.task.get_con_name_len(i_) }
/// Obtains a sequence of coefficients from the objective.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `c_` Linear terms of the requested slice of the objective as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getcslice>
pub fn get_c_slice(&self,first_ : i32,last_ : i32,c_ : &mut[f64]) -> Result<(),String> { self.data.task.get_c_slice(first_,last_,c_) }
/// Obtains the dimension of a symmetric matrix variable.
///
/// # Arguments
///
/// - `j_` Index of the semidefinite variable whose dimension is requested.
///
/// # Returns
///
/// - `dimbarvarj` The dimension of the j'th semidefinite variable.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdimbarvarj>
pub fn get_dim_barvar_j(&self,j_ : i32) -> Result<i32,String> { self.data.task.get_dim_barvar_j(j_) }
/// Obtains the list of affine expression indexes in a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `afeidxlist_` List of affine expression indexes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcafeidxlist>
pub fn get_djc_afe_idx_list(&self,djcidx_ : i64,afeidxlist_ : &mut[i64]) -> Result<(),String> { self.data.task.get_djc_afe_idx_list(djcidx_,afeidxlist_) }
/// Obtains the optional constant term vector of a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `b_` The vector b.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcb>
pub fn get_djc_b(&self,djcidx_ : i64,b_ : &mut[f64]) -> Result<(),String> { self.data.task.get_djc_b(djcidx_,b_) }
/// Obtains the list of domain indexes in a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `domidxlist_` List of term sizes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcdomainidxlist>
pub fn get_djc_domain_idx_list(&self,djcidx_ : i64,domidxlist_ : &mut[i64]) -> Result<(),String> { self.data.task.get_djc_domain_idx_list(djcidx_,domidxlist_) }
/// Obtains the name of a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of a disjunctive constraint.
///
/// # Returns
///
/// - `name` Returns the required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcname>
pub fn get_djc_name(&self,djcidx_ : i64) -> Result<String,String> { self.data.task.get_djc_name(djcidx_) }
/// Obtains the length of the name of a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of a disjunctive constraint.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnamelen>
pub fn get_djc_name_len(&self,djcidx_ : i64) -> Result<i32,String> { self.data.task.get_djc_name_len(djcidx_) }
/// Obtains the number of affine expressions in the disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
///
/// # Returns
///
/// - `numafe` Number of affine expressions in the disjunctive constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumafe>
pub fn get_djc_num_afe(&mut self,djcidx_ : i64) -> Result<i64,String> { self.data.task.get_djc_num_afe(djcidx_) }
/// Obtains the number of affine expressions in all disjunctive constraints.
///
/// # Returns
///
/// - `numafetot` Number of affine expressions in all disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumafetot>
pub fn get_djc_num_afe_tot(&mut self) -> Result<i64,String> { self.data.task.get_djc_num_afe_tot() }
/// Obtains the number of domains in the disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
///
/// # Returns
///
/// - `numdomain` Number of domains in the disjunctive constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumdomain>
pub fn get_djc_num_domain(&mut self,djcidx_ : i64) -> Result<i64,String> { self.data.task.get_djc_num_domain(djcidx_) }
/// Obtains the number of domains in all disjunctive constraints.
///
/// # Returns
///
/// - `numdomaintot` Number of domains in all disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumdomaintot>
pub fn get_djc_num_domain_tot(&mut self) -> Result<i64,String> { self.data.task.get_djc_num_domain_tot() }
/// Obtains the number terms in the disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
///
/// # Returns
///
/// - `numterm` Number of terms in the disjunctive constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumterm>
pub fn get_djc_num_term(&mut self,djcidx_ : i64) -> Result<i64,String> { self.data.task.get_djc_num_term(djcidx_) }
/// Obtains the number of terms in all disjunctive constraints.
///
/// # Returns
///
/// - `numtermtot` Total number of terms in all disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumtermtot>
pub fn get_djc_num_term_tot(&mut self) -> Result<i64,String> { self.data.task.get_djc_num_term_tot() }
/// Obtains full data of all disjunctive constraints.
///
/// # Arguments
///
/// - `domidxlist_` The concatenation of index lists of domains appearing in all disjunctive constraints.
/// - `afeidxlist_` The concatenation of index lists of affine expressions appearing in all disjunctive constraints.
/// - `b_` The concatenation of vectors b appearing in all disjunctive constraints.
/// - `termsizelist_` The concatenation of lists of term sizes appearing in all disjunctive constraints.
/// - `numterms_` The number of terms in each of the disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcs>
pub fn get_djcs(&self,domidxlist_ : &mut[i64],afeidxlist_ : &mut[i64],b_ : &mut[f64],termsizelist_ : &mut[i64],numterms_ : &mut[i64]) -> Result<(),String> { self.data.task.get_djcs(domidxlist_,afeidxlist_,b_,termsizelist_,numterms_) }
/// Obtains the list of term sizes in a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `termsizelist_` List of term sizes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjctermsizelist>
pub fn get_djc_term_size_list(&self,djcidx_ : i64,termsizelist_ : &mut[i64]) -> Result<(),String> { self.data.task.get_djc_term_size_list(djcidx_,termsizelist_) }
/// Obtains the dimension of the domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
///
/// # Returns
///
/// - `n` Dimension of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdomainn>
pub fn get_domain_n(&self,domidx_ : i64) -> Result<i64,String> { self.data.task.get_domain_n(domidx_) }
/// Obtains the name of a domain.
///
/// # Arguments
///
/// - `domidx_` Index of a domain.
///
/// # Returns
///
/// - `name` Returns the required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdomainname>
pub fn get_domain_name(&self,domidx_ : i64) -> Result<String,String> { self.data.task.get_domain_name(domidx_) }
/// Obtains the length of the name of a domain.
///
/// # Arguments
///
/// - `domidx_` Index of a domain.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdomainnamelen>
pub fn get_domain_name_len(&self,domidx_ : i64) -> Result<i32,String> { self.data.task.get_domain_name_len(domidx_) }
/// Returns the type of the domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
///
/// # Returns
///
/// - `domtype` The type of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdomaintype>
pub fn get_domain_type(&self,domidx_ : i64) -> Result<i32,String> { self.data.task.get_domain_type(domidx_) }
/// Obtains a double information item.
///
/// # Arguments
///
/// - `whichdinf_` Specifies a double information item.
///
/// See [Dinfitem]
///
/// # Returns
///
/// - `dvalue` The value of the required double information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdouinf>
pub fn get_dou_inf(&self,whichdinf_ : i32) -> Result<f64,String> { self.data.task.get_dou_inf(whichdinf_) }
/// Obtains a double parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Dparam]
///
/// # Returns
///
/// - `parvalue` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdouparam>
pub fn get_dou_param(&self,param_ : i32) -> Result<f64,String> { self.data.task.get_dou_param(param_) }
/// Computes the dual objective value associated with the solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `dualobj_` Objective value corresponding to the dual solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdualobj>
pub fn get_dual_obj(&self,whichsol_ : i32,dualobj_ : &mut f64) -> Result<(),String> { self.data.task.get_dual_obj(whichsol_,dualobj_) }
/// Compute norms of the dual solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `nrmy_` The norm of the y vector.
/// - `nrmslc_` The norm of the slc vector.
/// - `nrmsuc_` The norm of the suc vector.
/// - `nrmslx_` The norm of the slx vector.
/// - `nrmsux_` The norm of the sux vector.
/// - `nrmsnx_` The norm of the snx vector.
/// - `nrmbars_` The norm of the bars vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdualsolutionnorms>
pub fn get_dual_solution_norms(&self,whichsol_ : i32,nrmy_ : &mut f64,nrmslc_ : &mut f64,nrmsuc_ : &mut f64,nrmslx_ : &mut f64,nrmsux_ : &mut f64,nrmsnx_ : &mut f64,nrmbars_ : &mut f64) -> Result<(),String> { self.data.task.get_dual_solution_norms(whichsol_,nrmy_,nrmslc_,nrmsuc_,nrmslx_,nrmsux_,nrmsnx_,nrmbars_) }
/// Computes the violation of the dual solution for set of affine conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidxlist_` An array of indexes of conic constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolacc>
pub fn get_dviol_acc(&self,whichsol_ : i32,accidxlist_ : &[i64],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_dviol_acc(whichsol_,accidxlist_,viol_) }
/// Computes the violation of dual solution for a set of semidefinite variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of barx variables.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolbarvar>
pub fn get_dviol_barvar(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_dviol_barvar(whichsol_,sub_,viol_) }
/// Computes the violation of a dual solution associated with a set of constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolcon>
pub fn get_dviol_con(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_dviol_con(whichsol_,sub_,viol_) }
/// Computes the violation of a solution for set of dual conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of conic constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolcones>
pub fn get_dviol_cones(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_dviol_cones(whichsol_,sub_,viol_) }
/// Computes the violation of a dual solution associated with a set of scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of x variables.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolvar>
pub fn get_dviol_var(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_dviol_var(whichsol_,sub_,viol_) }
/// Obtains the index of a named information item.
///
/// # Arguments
///
/// - `inftype_` Type of the information item.
///
/// See [Inftype]
/// - `infname_` Name of the information item.
/// - `infindex_` The item index.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getinfindex>
pub fn get_inf_index(&self,inftype_ : i32,infname_ : &str,infindex_ : &mut i32) -> Result<(),String> { self.data.task.get_inf_index(inftype_,infname_,infindex_) }
/// Obtains the maximum index of an information item of a given type.
///
/// # Arguments
///
/// - `inftype_` Type of the information item.
///
/// See [Inftype]
/// - `infmax_` The maximum index (plus 1) requested.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getinfmax>
pub fn get_inf_max(&self,inftype_ : i32,infmax_ : &mut[i32]) -> Result<(),String> { self.data.task.get_inf_max(inftype_,infmax_) }
/// Obtains the name of an information item.
///
/// # Arguments
///
/// - `inftype_` Type of the information item.
///
/// See [Inftype]
/// - `whichinf_` An information item.
///
/// # Returns
///
/// - `infname` Name of the information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getinfname>
pub fn get_inf_name(&self,inftype_ : i32,whichinf_ : i32) -> Result<String,String> { self.data.task.get_inf_name(inftype_,whichinf_) }
/// Obtains an integer information item.
///
/// # Arguments
///
/// - `whichiinf_` Specifies an integer information item.
///
/// See [Iinfitem]
///
/// # Returns
///
/// - `ivalue` The value of the required integer information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getintinf>
pub fn get_int_inf(&self,whichiinf_ : i32) -> Result<i32,String> { self.data.task.get_int_inf(whichiinf_) }
/// Obtains an integer parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Iparam]
///
/// # Returns
///
/// - `parvalue` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getintparam>
pub fn get_int_param(&self,param_ : i32) -> Result<i32,String> { self.data.task.get_int_param(param_) }
/// Obtains the length of one semidefinite variable.
///
/// # Arguments
///
/// - `j_` Index of the semidefinite variable whose length if requested.
///
/// # Returns
///
/// - `lenbarvarj` Number of scalar elements in the lower triangular part of the semidefinite variable.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getlenbarvarj>
pub fn get_len_barvar_j(&self,j_ : i32) -> Result<i64,String> { self.data.task.get_len_barvar_j(j_) }
/// Obtains a long integer information item.
///
/// # Arguments
///
/// - `whichliinf_` Specifies a long information item.
///
/// See [Liinfitem]
///
/// # Returns
///
/// - `ivalue` The value of the required long integer information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getlintinf>
pub fn get_lint_inf(&self,whichliinf_ : i32) -> Result<i64,String> { self.data.task.get_lint_inf(whichliinf_) }
/// Obtains the maximum length (not including terminating zero character) of any objective, constraint, variable, domain or cone name.
///
/// # Arguments
///
/// - `maxlen_` The maximum length of any name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnamelen>
pub fn get_max_name_len(&self,maxlen_ : &mut i32) -> Result<(),String> { self.data.task.get_max_name_len(maxlen_) }
/// Obtains number of preallocated non-zeros in the linear constraint matrix.
///
/// # Returns
///
/// - `maxnumanz` Number of preallocated non-zero linear matrix elements.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumanz64>
pub fn get_max_num_a_nz(&self) -> Result<i64,String> { self.data.task.get_max_num_a_nz() }
/// Obtains maximum number of symmetric matrix variables for which space is currently preallocated.
///
/// # Returns
///
/// - `maxnumbarvar` Maximum number of symmetric matrix variables for which space is currently preallocated.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumbarvar>
pub fn get_max_num_barvar(&self) -> Result<i32,String> { self.data.task.get_max_num_barvar() }
/// Obtains the number of preallocated constraints in the optimization task.
///
/// # Arguments
///
/// - `maxnumcon_` Number of preallocated constraints in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumcon>
pub fn get_max_num_con(&self,maxnumcon_ : &mut i32) -> Result<(),String> { self.data.task.get_max_num_con(maxnumcon_) }
/// Obtains the number of preallocated cones in the optimization task.
///
/// # Arguments
///
/// - `maxnumcone_` Number of preallocated conic constraints in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumcone>
pub fn get_max_num_cone(&self,maxnumcone_ : &mut i32) -> Result<(),String> { self.data.task.get_max_num_cone(maxnumcone_) }
/// Obtains the number of preallocated non-zeros for all quadratic terms in objective and constraints.
///
/// # Arguments
///
/// - `maxnumqnz_` Number of non-zero elements preallocated in quadratic coefficient matrices.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumqnz64>
pub fn get_max_num_q_nz(&self,maxnumqnz_ : &mut i64) -> Result<(),String> { self.data.task.get_max_num_q_nz(maxnumqnz_) }
/// Obtains the maximum number variables allowed.
///
/// # Arguments
///
/// - `maxnumvar_` Number of preallocated variables in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumvar>
pub fn get_max_num_var(&self,maxnumvar_ : &mut i32) -> Result<(),String> { self.data.task.get_max_num_var(maxnumvar_) }
/// Obtains information about the amount of memory used by a task.
///
/// # Arguments
///
/// - `meminuse_` Amount of memory currently used by the task.
/// - `maxmemuse_` Maximum amount of memory used by the task until now.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmemusagetask>
pub fn get_mem_usage(&self,meminuse_ : &mut i64,maxmemuse_ : &mut i64) -> Result<(),String> { self.data.task.get_mem_usage(meminuse_,maxmemuse_) }
/// Obtains the number of threads used by the mixed integer optimizer.
///
/// # Returns
///
/// - `numthreads` The number of threads.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmionumthreads>
pub fn get_mio_num_threads(&self) -> Result<i32,String> { self.data.task.get_mio_num_threads() }
/// Obtains a named double information item.
///
/// # Arguments
///
/// - `infitemname_` The name of a double information item.
/// - `dvalue_` The value of the required double information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnadouinf>
pub fn get_na_dou_inf(&self,infitemname_ : &str,dvalue_ : &mut f64) -> Result<(),String> { self.data.task.get_na_dou_inf(infitemname_,dvalue_) }
/// Obtains a double parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnadouparam>
pub fn get_na_dou_param(&self,paramname_ : &str,parvalue_ : &mut f64) -> Result<(),String> { self.data.task.get_na_dou_param(paramname_,parvalue_) }
/// Obtains a named integer information item.
///
/// # Arguments
///
/// - `infitemname_` The name of an integer information item.
/// - `ivalue_` The value of the required integer information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnaintinf>
pub fn get_na_int_inf(&self,infitemname_ : &str,ivalue_ : &mut i32) -> Result<(),String> { self.data.task.get_na_int_inf(infitemname_,ivalue_) }
/// Obtains an integer parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnaintparam>
pub fn get_na_int_param(&self,paramname_ : &str,parvalue_ : &mut i32) -> Result<(),String> { self.data.task.get_na_int_param(paramname_,parvalue_) }
/// Obtains a string parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `sizeparamname_` Size of the name buffer.
/// - `len_` Returns the length of the parameter value.
///
/// # Returns
///
/// - `parvalue` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnastrparam>
pub fn get_na_str_param(&self,paramname_ : &str,sizeparamname_ : i32,len_ : &mut i32) -> Result<String,String> { self.data.task.get_na_str_param(paramname_,sizeparamname_,len_) }
/// Obtains the number of affine conic constraints.
///
/// # Returns
///
/// - `num` The number of affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumacc>
pub fn get_num_acc(&mut self) -> Result<i64,String> { self.data.task.get_num_acc() }
/// Obtains the number of affine expressions.
///
/// # Returns
///
/// - `numafe` Number of affine expressions.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumafe>
pub fn get_num_afe(&mut self) -> Result<i64,String> { self.data.task.get_num_afe() }
/// Obtains the number of non-zeros in the coefficient matrix.
///
/// # Returns
///
/// - `numanz` Number of non-zero elements in the linear constraint matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumanz>
pub fn get_num_a_nz(&self) -> Result<i32,String> { self.data.task.get_num_a_nz() }
/// Obtains the number of non-zeros in the coefficient matrix.
///
/// # Returns
///
/// - `numanz` Number of non-zero elements in the linear constraint matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumanz64>
pub fn get_num_a_nz_64(&self) -> Result<i64,String> { self.data.task.get_num_a_nz_64() }
/// Obtains an upper bound on the number of scalar elements in the block triplet form of bara.
///
/// # Returns
///
/// - `num` An upper bound on the number of elements in the block triplet form of bara.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbarablocktriplets>
pub fn get_num_bara_block_triplets(&self) -> Result<i64,String> { self.data.task.get_num_bara_block_triplets() }
/// Get the number of nonzero elements in barA.
///
/// # Returns
///
/// - `nz` The number of nonzero block elements in barA.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbaranz>
pub fn get_num_bara_nz(&self) -> Result<i64,String> { self.data.task.get_num_bara_nz() }
/// Obtains an upper bound on the number of elements in the block triplet form of barc.
///
/// # Returns
///
/// - `num` An upper bound on the number of elements in the block triplet form of barc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbarcblocktriplets>
pub fn get_num_barc_block_triplets(&self) -> Result<i64,String> { self.data.task.get_num_barc_block_triplets() }
/// Obtains the number of nonzero elements in barc.
///
/// # Returns
///
/// - `nz` The number of nonzero elements in barc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbarcnz>
pub fn get_num_barc_nz(&self) -> Result<i64,String> { self.data.task.get_num_barc_nz() }
/// Obtains the number of semidefinite variables.
///
/// # Returns
///
/// - `numbarvar` Number of semidefinite variables in the problem.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbarvar>
pub fn get_num_barvar(&self) -> Result<i32,String> { self.data.task.get_num_barvar() }
/// Obtains the number of constraints.
///
/// # Returns
///
/// - `numcon` Number of constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumcon>
pub fn get_num_con(&self) -> Result<i32,String> { self.data.task.get_num_con() }
/// Obtains the number of cones.
///
/// # Returns
///
/// - `numcone` Number of conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumcone>
pub fn get_num_cone(&self) -> Result<i32,String> { self.data.task.get_num_cone() }
/// Obtains the number of members in a cone.
///
/// # Arguments
///
/// - `k_` Index of the cone.
/// - `nummem_` Number of member variables in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumconemem>
pub fn get_num_cone_mem(&self,k_ : i32,nummem_ : &mut i32) -> Result<(),String> { self.data.task.get_num_cone_mem(k_,nummem_) }
/// Obtains the number of disjunctive constraints.
///
/// # Returns
///
/// - `num` The number of disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumdjc>
pub fn get_num_djc(&mut self) -> Result<i64,String> { self.data.task.get_num_djc() }
/// Obtain the number of domains defined.
///
/// # Returns
///
/// - `numdomain` Number of domains in the task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumdomain>
pub fn get_num_domain(&mut self) -> Result<i64,String> { self.data.task.get_num_domain() }
/// Obtains the number of integer-constrained variables.
///
/// # Returns
///
/// - `numintvar` Number of integer variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumintvar>
pub fn get_num_int_var(&self) -> Result<i32,String> { self.data.task.get_num_int_var() }
/// Obtains the number of parameters of a given type.
///
/// # Arguments
///
/// - `partype_` Parameter type.
///
/// See [Parametertype]
/// - `numparam_` Returns the number of parameters of the requested type.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumparam>
pub fn get_num_param(&self,partype_ : i32,numparam_ : &mut i32) -> Result<(),String> { self.data.task.get_num_param(partype_,numparam_) }
/// Obtains the number of non-zero quadratic terms in a constraint.
///
/// # Arguments
///
/// - `k_` Index of the constraint for which the number quadratic terms should be obtained.
///
/// # Returns
///
/// - `numqcnz` Number of quadratic terms.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumqconknz64>
pub fn get_num_q_con_k_nz(&self,k_ : i32) -> Result<i64,String> { self.data.task.get_num_q_con_k_nz(k_) }
/// Obtains the number of non-zero quadratic terms in the objective.
///
/// # Returns
///
/// - `numqonz` Number of non-zero elements in the quadratic objective terms.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumqobjnz64>
pub fn get_num_q_obj_nz(&self) -> Result<i64,String> { self.data.task.get_num_q_obj_nz() }
/// Obtains the number of symmetric matrices stored.
///
/// # Arguments
///
/// - `num_` The number of symmetric sparse matrices.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumsymmat>
pub fn get_num_sym_mat(&self,num_ : &mut i64) -> Result<(),String> { self.data.task.get_num_sym_mat(num_) }
/// Obtains the number of variables.
///
/// # Returns
///
/// - `numvar` Number of variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumvar>
pub fn get_num_var(&self) -> Result<i32,String> { self.data.task.get_num_var() }
/// Obtains the name assigned to the objective function.
///
/// # Returns
///
/// - `objname` Assigned the objective name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getobjname>
pub fn get_obj_name(&self) -> Result<String,String> { self.data.task.get_obj_name() }
/// Obtains the length of the name assigned to the objective function.
///
/// # Returns
///
/// - `len` Assigned the length of the objective name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getobjnamelen>
pub fn get_obj_name_len(&self) -> Result<i32,String> { self.data.task.get_obj_name_len() }
/// Gets the objective sense.
///
/// # Returns
///
/// - `sense` The returned objective sense.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getobjsense>
pub fn get_obj_sense(&self) -> Result<i32,String> { self.data.task.get_obj_sense() }
/// Obtains the maximum index of a parameter of a given type.
///
/// # Arguments
///
/// - `partype_` Parameter type.
///
/// See [Parametertype]
/// - `parammax_` The maximum index (plus 1) of the given parameter type.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getparammax>
pub fn get_param_max(&self,partype_ : i32,parammax_ : &mut i32) -> Result<(),String> { self.data.task.get_param_max(partype_,parammax_) }
/// Obtains the name of a parameter.
///
/// # Arguments
///
/// - `partype_` Parameter type.
///
/// See [Parametertype]
/// - `param_` Which parameter.
///
/// # Returns
///
/// - `parname` Parameter name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getparamname>
pub fn get_param_name(&self,partype_ : i32,param_ : i32) -> Result<String,String> { self.data.task.get_param_name(partype_,param_) }
/// Obtains the exponent vector of a power domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
/// - `alpha_` The exponent vector of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpowerdomainalpha>
pub fn get_power_domain_alpha(&mut self,domidx_ : i64,alpha_ : &mut[f64]) -> Result<(),String> { self.data.task.get_power_domain_alpha(domidx_,alpha_) }
/// Obtains structural information about a power domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
/// - `n_` Dimension of the domain.
/// - `nleft_` Number of variables on the left hand side.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpowerdomaininfo>
pub fn get_power_domain_info(&mut self,domidx_ : i64,n_ : &mut i64,nleft_ : &mut i64) -> Result<(),String> { self.data.task.get_power_domain_info(domidx_,n_,nleft_) }
/// Computes the primal objective value for the desired solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// # Returns
///
/// - `primalobj` Objective value corresponding to the primal solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getprimalobj>
pub fn get_primal_obj(&self,whichsol_ : i32) -> Result<f64,String> { self.data.task.get_primal_obj(whichsol_) }
/// Compute norms of the primal solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `nrmxc_` The norm of the xc vector.
/// - `nrmxx_` The norm of the xx vector.
/// - `nrmbarx_` The norm of the barX vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getprimalsolutionnorms>
pub fn get_primal_solution_norms(&self,whichsol_ : i32,nrmxc_ : &mut f64,nrmxx_ : &mut f64,nrmbarx_ : &mut f64) -> Result<(),String> { self.data.task.get_primal_solution_norms(whichsol_,nrmxc_,nrmxx_,nrmbarx_) }
/// Obtains the problem type.
///
/// # Returns
///
/// - `probtype` The problem type.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getprobtype>
pub fn get_prob_type(&self) -> Result<i32,String> { self.data.task.get_prob_type() }
/// Obtains the problem status.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// # Returns
///
/// - `problemsta` Problem status.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getprosta>
pub fn get_pro_sta(&self,whichsol_ : i32) -> Result<i32,String> { self.data.task.get_pro_sta(whichsol_) }
/// Computes the violation of a solution for set of affine conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidxlist_` An array of indexes of conic constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolacc>
pub fn get_pviol_acc(&self,whichsol_ : i32,accidxlist_ : &[i64],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_pviol_acc(whichsol_,accidxlist_,viol_) }
/// Computes the violation of a primal solution for a list of semidefinite variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of barX variables.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolbarvar>
pub fn get_pviol_barvar(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_pviol_barvar(whichsol_,sub_,viol_) }
/// Computes the violation of a primal solution associated to a constraint.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolcon>
pub fn get_pviol_con(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_pviol_con(whichsol_,sub_,viol_) }
/// Computes the violation of a solution for set of conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of conic constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolcones>
pub fn get_pviol_cones(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_pviol_cones(whichsol_,sub_,viol_) }
/// Computes the violation of a solution for set of disjunctive constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `djcidxlist_` An array of indexes of disjunctive constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpvioldjc>
pub fn get_pviol_djc(&self,whichsol_ : i32,djcidxlist_ : &[i64],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_pviol_djc(whichsol_,djcidxlist_,viol_) }
/// Computes the violation of a primal solution for a list of scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of x variables.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolvar>
pub fn get_pviol_var(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> { self.data.task.get_pviol_var(whichsol_,sub_,viol_) }
/// Obtains all the quadratic terms in a constraint.
///
/// # Arguments
///
/// - `k_` Which constraint.
/// - `qcsubi_` Row subscripts for quadratic constraint matrix.
/// - `qcsubj_` Column subscripts for quadratic constraint matrix.
/// - `qcval_` Quadratic constraint coefficient values.
///
/// # Returns
///
/// - `numqcnz` Number of quadratic terms.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getqconk64>
pub fn get_q_con_k(&self,k_ : i32,qcsubi_ : &mut[i32],qcsubj_ : &mut[i32],qcval_ : &mut[f64]) -> Result<i64,String> { self.data.task.get_q_con_k(k_,qcsubi_,qcsubj_,qcval_) }
/// Obtains all the quadratic terms in the objective.
///
/// # Arguments
///
/// - `numqonz_` Number of non-zero elements in the quadratic objective terms.
/// - `qosubi_` Row subscripts for quadratic objective coefficients.
/// - `qosubj_` Column subscripts for quadratic objective coefficients.
/// - `qoval_` Quadratic objective coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getqobj64>
pub fn get_q_obj(&self,numqonz_ : &mut i64,qosubi_ : &mut[i32],qosubj_ : &mut[i32],qoval_ : &mut[f64]) -> Result<(),String> { self.data.task.get_q_obj(numqonz_,qosubi_,qosubj_,qoval_) }
/// Obtains one coefficient from the quadratic term of the objective
///
/// # Arguments
///
/// - `i_` Row index of the coefficient.
/// - `j_` Column index of coefficient.
/// - `qoij_` The required coefficient.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getqobjij>
pub fn get_q_obj_i_j(&self,i_ : i32,j_ : i32,qoij_ : &mut f64) -> Result<(),String> { self.data.task.get_q_obj_i_j(i_,j_,qoij_) }
/// Obtains the reduced costs for a sequence of variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` The index of the first variable in the sequence.
/// - `last_` The index of the last variable in the sequence plus 1.
/// - `redcosts_` Returns the requested reduced costs.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getreducedcosts>
pub fn get_reduced_costs(&self,whichsol_ : i32,first_ : i32,last_ : i32,redcosts_ : &mut[f64]) -> Result<(),String> { self.data.task.get_reduced_costs(whichsol_,first_,last_,redcosts_) }
/// Obtains the status keys for the constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskc>
pub fn get_skc(&self,whichsol_ : i32,skc_ : &mut[i32]) -> Result<(),String> { self.data.task.get_skc(whichsol_,skc_) }
/// Obtains the status keys for a slice of the constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskcslice>
pub fn get_skc_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,skc_ : &mut[i32]) -> Result<(),String> { self.data.task.get_skc_slice(whichsol_,first_,last_,skc_) }
/// Obtains the status keys for the conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskn>
pub fn get_skn(&self,whichsol_ : i32,skn_ : &mut[i32]) -> Result<(),String> { self.data.task.get_skn(whichsol_,skn_) }
/// Obtains the status keys for the scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskx>
pub fn get_skx(&self,whichsol_ : i32,skx_ : &mut[i32]) -> Result<(),String> { self.data.task.get_skx(whichsol_,skx_) }
/// Obtains the status keys for a slice of the scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskxslice>
pub fn get_skx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,skx_ : &mut[i32]) -> Result<(),String> { self.data.task.get_skx_slice(whichsol_,first_,last_,skx_) }
/// Obtains the slc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getslc>
pub fn get_slc(&self,whichsol_ : i32,slc_ : &mut[f64]) -> Result<(),String> { self.data.task.get_slc(whichsol_,slc_) }
/// Obtains a slice of the slc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getslcslice>
pub fn get_slc_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,slc_ : &mut[f64]) -> Result<(),String> { self.data.task.get_slc_slice(whichsol_,first_,last_,slc_) }
/// Obtains the slx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getslx>
pub fn get_slx(&self,whichsol_ : i32,slx_ : &mut[f64]) -> Result<(),String> { self.data.task.get_slx(whichsol_,slx_) }
/// Obtains a slice of the slx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getslxslice>
pub fn get_slx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,slx_ : &mut[f64]) -> Result<(),String> { self.data.task.get_slx_slice(whichsol_,first_,last_,slx_) }
/// Obtains the snx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsnx>
pub fn get_snx(&self,whichsol_ : i32,snx_ : &mut[f64]) -> Result<(),String> { self.data.task.get_snx(whichsol_,snx_) }
/// Obtains a slice of the snx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsnxslice>
pub fn get_snx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,snx_ : &mut[f64]) -> Result<(),String> { self.data.task.get_snx_slice(whichsol_,first_,last_,snx_) }
/// Obtains the solution status.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// # Returns
///
/// - `solutionsta` Solution status.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolsta>
pub fn get_sol_sta(&self,whichsol_ : i32) -> Result<i32,String> { self.data.task.get_sol_sta(whichsol_) }
/// Obtains the complete solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `problemsta_` Problem status.
///
/// See [Prosta]
/// - `solutionsta_` Solution status.
///
/// See [Solsta]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
/// - `xc_` Primal constraint solution.
/// - `xx_` Primal variable solution.
/// - `y_` Vector of dual variables corresponding to the constraints.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolution>
pub fn get_solution(&self,whichsol_ : i32,problemsta_ : & mut i32,solutionsta_ : & mut i32,skc_ : &mut[i32],skx_ : &mut[i32],skn_ : &mut[i32],xc_ : &mut[f64],xx_ : &mut[f64],y_ : &mut[f64],slc_ : &mut[f64],suc_ : &mut[f64],slx_ : &mut[f64],sux_ : &mut[f64],snx_ : &mut[f64]) -> Result<(),String> { self.data.task.get_solution(whichsol_,problemsta_,solutionsta_,skc_,skx_,skn_,xc_,xx_,y_,slc_,suc_,slx_,sux_,snx_) }
/// Obtains information about of a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `pobj_` The primal objective value.
/// - `pviolcon_` Maximal primal bound violation for a xc variable.
/// - `pviolvar_` Maximal primal bound violation for a xx variable.
/// - `pviolbarvar_` Maximal primal bound violation for a barx variable.
/// - `pviolcone_` Maximal primal violation of the solution with respect to the conic constraints.
/// - `pviolitg_` Maximal violation in the integer constraints.
/// - `dobj_` Dual objective value.
/// - `dviolcon_` Maximal dual bound violation for a xc variable.
/// - `dviolvar_` Maximal dual bound violation for a xx variable.
/// - `dviolbarvar_` Maximal dual bound violation for a bars variable.
/// - `dviolcone_` Maximum violation of the dual solution in the dual conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolutioninfo>
pub fn get_solution_info(&self,whichsol_ : i32,pobj_ : &mut f64,pviolcon_ : &mut f64,pviolvar_ : &mut f64,pviolbarvar_ : &mut f64,pviolcone_ : &mut f64,pviolitg_ : &mut f64,dobj_ : &mut f64,dviolcon_ : &mut f64,dviolvar_ : &mut f64,dviolbarvar_ : &mut f64,dviolcone_ : &mut f64) -> Result<(),String> { self.data.task.get_solution_info(whichsol_,pobj_,pviolcon_,pviolvar_,pviolbarvar_,pviolcone_,pviolitg_,dobj_,dviolcon_,dviolvar_,dviolbarvar_,dviolcone_) }
/// Obtains information about of a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `pobj_` The primal objective value.
/// - `pviolcon_` Maximal primal bound violation for a xc variable.
/// - `pviolvar_` Maximal primal bound violation for a xx variable.
/// - `pviolbarvar_` Maximal primal bound violation for a barx variable.
/// - `pviolcone_` Maximal primal violation of the solution with respect to the conic constraints.
/// - `pviolacc_` Maximal primal violation of the solution with respect to the affine conic constraints.
/// - `pvioldjc_` Maximal primal violation of the solution with respect to the disjunctive constraints.
/// - `pviolitg_` Maximal violation in the integer constraints.
/// - `dobj_` Dual objective value.
/// - `dviolcon_` Maximal dual bound violation for a xc variable.
/// - `dviolvar_` Maximal dual bound violation for a xx variable.
/// - `dviolbarvar_` Maximal dual bound violation for a bars variable.
/// - `dviolcone_` Maximum violation of the dual solution in the dual conic constraints.
/// - `dviolacc_` Maximum violation of the dual solution in the dual affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolutioninfonew>
pub fn get_solution_info_new(&self,whichsol_ : i32,pobj_ : &mut f64,pviolcon_ : &mut f64,pviolvar_ : &mut f64,pviolbarvar_ : &mut f64,pviolcone_ : &mut f64,pviolacc_ : &mut f64,pvioldjc_ : &mut f64,pviolitg_ : &mut f64,dobj_ : &mut f64,dviolcon_ : &mut f64,dviolvar_ : &mut f64,dviolbarvar_ : &mut f64,dviolcone_ : &mut f64,dviolacc_ : &mut f64) -> Result<(),String> { self.data.task.get_solution_info_new(whichsol_,pobj_,pviolcon_,pviolvar_,pviolbarvar_,pviolcone_,pviolacc_,pvioldjc_,pviolitg_,dobj_,dviolcon_,dviolvar_,dviolbarvar_,dviolcone_,dviolacc_) }
/// Obtains the complete solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `problemsta_` Problem status.
///
/// See [Prosta]
/// - `solutionsta_` Solution status.
///
/// See [Solsta]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
/// - `xc_` Primal constraint solution.
/// - `xx_` Primal variable solution.
/// - `y_` Vector of dual variables corresponding to the constraints.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
/// - `doty_` Dual variables corresponding to affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolutionnew>
pub fn get_solution_new(&self,whichsol_ : i32,problemsta_ : & mut i32,solutionsta_ : & mut i32,skc_ : &mut[i32],skx_ : &mut[i32],skn_ : &mut[i32],xc_ : &mut[f64],xx_ : &mut[f64],y_ : &mut[f64],slc_ : &mut[f64],suc_ : &mut[f64],slx_ : &mut[f64],sux_ : &mut[f64],snx_ : &mut[f64],doty_ : &mut[f64]) -> Result<(),String> { self.data.task.get_solution_new(whichsol_,problemsta_,solutionsta_,skc_,skx_,skn_,xc_,xx_,y_,slc_,suc_,slx_,sux_,snx_,doty_) }
/// Obtains a slice of the solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `solitem_` Which part of the solution is required.
///
/// See [Solitem]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `values_` The values of the requested solution elements.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolutionslice>
pub fn get_solution_slice(&self,whichsol_ : i32,solitem_ : i32,first_ : i32,last_ : i32,values_ : &mut[f64]) -> Result<(),String> { self.data.task.get_solution_slice(whichsol_,solitem_,first_,last_,values_) }
/// Gets a single symmetric matrix from the matrix store.
///
/// # Arguments
///
/// - `idx_` Index of the matrix to retrieve.
/// - `subi_` Row subscripts of the matrix non-zero elements.
/// - `subj_` Column subscripts of the matrix non-zero elements.
/// - `valij_` Coefficients of the matrix non-zero elements.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsparsesymmat>
pub fn get_sparse_sym_mat(&self,idx_ : i64,subi_ : &mut[i32],subj_ : &mut[i32],valij_ : &mut[f64]) -> Result<(),String> { self.data.task.get_sparse_sym_mat(idx_,subi_,subj_,valij_) }
/// Obtains the value of a string parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Sparam]
/// - `len_` The length of the parameter value.
///
/// # Returns
///
/// - `parvalue` If this is not a null pointer, the parameter value is stored here.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getstrparam>
pub fn get_str_param(&self,param_ : i32,len_ : &mut i32) -> Result<String,String> { self.data.task.get_str_param(param_,len_) }
/// Obtains the length of a string parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Sparam]
///
/// # Returns
///
/// - `len` The length of the parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getstrparamlen>
pub fn get_str_param_len(&self,param_ : i32) -> Result<i32,String> { self.data.task.get_str_param_len(param_) }
/// Obtains the suc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsuc>
pub fn get_suc(&self,whichsol_ : i32,suc_ : &mut[f64]) -> Result<(),String> { self.data.task.get_suc(whichsol_,suc_) }
/// Obtains a slice of the suc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsucslice>
pub fn get_suc_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,suc_ : &mut[f64]) -> Result<(),String> { self.data.task.get_suc_slice(whichsol_,first_,last_,suc_) }
/// Obtains the sux vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsux>
pub fn get_sux(&self,whichsol_ : i32,sux_ : &mut[f64]) -> Result<(),String> { self.data.task.get_sux(whichsol_,sux_) }
/// Obtains a slice of the sux vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsuxslice>
pub fn get_sux_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,sux_ : &mut[f64]) -> Result<(),String> { self.data.task.get_sux_slice(whichsol_,first_,last_,sux_) }
/// Obtains a cone type string identifier.
///
/// # Arguments
///
/// - `i_` Index.
/// - `value_` The corresponding value.
///
/// # Returns
///
/// - `name` Name of the i'th symbolic constant.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsymbcon>
pub fn get_symb_con(&self,i_ : i32,value_ : &mut i32) -> Result<String,String> { self.data.task.get_symb_con(i_,value_) }
/// Obtains information about a matrix from the symmetric matrix storage.
///
/// # Arguments
///
/// - `idx_` Index of the matrix for which information is requested.
/// - `dim_` Returns the dimension of the requested matrix.
/// - `nz_` Returns the number of non-zeros in the requested matrix.
/// - `mattype_` Returns the type of the requested matrix.
///
/// See [Symmattype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsymmatinfo>
pub fn get_sym_mat_info(&self,idx_ : i64,dim_ : &mut i32,nz_ : &mut i64,mattype_ : & mut i32) -> Result<(),String> { self.data.task.get_sym_mat_info(idx_,dim_,nz_,mattype_) }
/// Obtains the task name.
///
/// # Returns
///
/// - `taskname` Returns the task name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gettaskname>
pub fn get_task_name(&self) -> Result<String,String> { self.data.task.get_task_name() }
/// Obtains the length the task name.
///
/// # Returns
///
/// - `len` Returns the length of the task name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gettasknamelen>
pub fn get_task_name_len(&self) -> Result<i32,String> { self.data.task.get_task_name_len() }
/// Obtains bound information for one variable.
///
/// # Arguments
///
/// - `i_` Index of the variable for which the bound information should be obtained.
/// - `bk_` Bound keys.
///
/// See [Boundkey]
/// - `bl_` Values for lower bounds.
/// - `bu_` Values for upper bounds.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarbound>
pub fn get_var_bound(&self,i_ : i32,bk_ : & mut i32,bl_ : &mut f64,bu_ : &mut f64) -> Result<(),String> { self.data.task.get_var_bound(i_,bk_,bl_,bu_) }
/// Obtains bounds information for a slice of the variables.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bk_` Bound keys.
///
/// See [Boundkey]
/// - `bl_` Values for lower bounds.
/// - `bu_` Values for upper bounds.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarboundslice>
pub fn get_var_bound_slice(&self,first_ : i32,last_ : i32,bk_ : &mut[i32],bl_ : &mut[f64],bu_ : &mut[f64]) -> Result<(),String> { self.data.task.get_var_bound_slice(first_,last_,bk_,bl_,bu_) }
/// Obtains the name of a variable.
///
/// # Arguments
///
/// - `j_` Index of a variable.
///
/// # Returns
///
/// - `name` Returns the required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarname>
pub fn get_var_name(&self,j_ : i32) -> Result<String,String> { self.data.task.get_var_name(j_) }
/// Checks whether the name has been assigned to any variable.
///
/// # Arguments
///
/// - `somename_` The name which should be checked.
/// - `asgn_` Is non-zero if the name somename is assigned to a variable.
///
/// # Returns
///
/// - `index` If the name somename is assigned to a variable, then return the index of the variable.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarnameindex>
pub fn get_var_name_index(&self,somename_ : &str,asgn_ : &mut i32) -> Result<i32,String> { self.data.task.get_var_name_index(somename_,asgn_) }
/// Obtains the length of the name of a variable.
///
/// # Arguments
///
/// - `i_` Index of a variable.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarnamelen>
pub fn get_var_name_len(&self,i_ : i32) -> Result<i32,String> { self.data.task.get_var_name_len(i_) }
/// Gets the variable type of one variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
///
/// # Returns
///
/// - `vartype` Variable type of variable index j.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvartype>
pub fn get_var_type(&self,j_ : i32) -> Result<i32,String> { self.data.task.get_var_type(j_) }
/// Obtains the variable type for one or more variables.
///
/// # Arguments
///
/// - `subj_` A list of variable indexes.
/// - `vartype_` Returns the variables types corresponding the variable indexes requested.
///
/// See [Variabletype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvartypelist>
pub fn get_var_type_list(&self,subj_ : &[i32],vartype_ : &mut[i32]) -> Result<(),String> { self.data.task.get_var_type_list(subj_,vartype_) }
/// Obtains the xc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `xc_` Primal constraint solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getxc>
pub fn get_xc(&self,whichsol_ : i32,xc_ : &mut[f64]) -> Result<(),String> { self.data.task.get_xc(whichsol_,xc_) }
/// Obtains a slice of the xc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `xc_` Primal constraint solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getxcslice>
pub fn get_xc_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,xc_ : &mut[f64]) -> Result<(),String> { self.data.task.get_xc_slice(whichsol_,first_,last_,xc_) }
/// Obtains the xx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `xx_` Primal variable solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getxx>
pub fn get_xx(&self,whichsol_ : i32,xx_ : &mut[f64]) -> Result<(),String> { self.data.task.get_xx(whichsol_,xx_) }
/// Obtains a slice of the xx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `xx_` Primal variable solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getxxslice>
pub fn get_xx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,xx_ : &mut[f64]) -> Result<(),String> { self.data.task.get_xx_slice(whichsol_,first_,last_,xx_) }
/// Obtains the y vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `y_` Vector of dual variables corresponding to the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gety>
pub fn get_y(&self,whichsol_ : i32,y_ : &mut[f64]) -> Result<(),String> { self.data.task.get_y(whichsol_,y_) }
/// Obtains a slice of the y vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `y_` Vector of dual variables corresponding to the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getyslice>
pub fn get_y_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,y_ : &mut[f64]) -> Result<(),String> { self.data.task.get_y_slice(whichsol_,first_,last_,y_) }
/// Prints the infeasibility report to an output stream.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.infeasibilityreport>
pub fn infeasibility_report(&mut self,whichstream_ : i32,whichsol_ : i32) -> Result<(),String> { self.data.task.infeasibility_report(whichstream_,whichsol_) }
/// Prepare a task for basis solver.
///
/// # Arguments
///
/// - `basis_` The array of basis indexes to use.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.initbasissolve>
pub fn init_basis_solve(&mut self,basis_ : &mut[i32]) -> Result<(),String> { self.data.task.init_basis_solve(basis_) }
/// Input the linear part of an optimization task in one function call.
///
/// # Arguments
///
/// - `maxnumcon_` Number of preallocated constraints in the optimization task.
/// - `maxnumvar_` Number of preallocated variables in the optimization task.
/// - `c_` Linear terms of the objective as a dense vector. The length is the number of variables.
/// - `cfix_` Fixed term in the objective.
/// - `aptrb_` Row or column start pointers.
/// - `aptre_` Row or column end pointers.
/// - `asub_` Coefficient subscripts.
/// - `aval_` Coefficient values.
/// - `bkc_` Bound keys for the constraints.
///
/// See [Boundkey]
/// - `blc_` Lower bounds for the constraints.
/// - `buc_` Upper bounds for the constraints.
/// - `bkx_` Bound keys for the variables.
///
/// See [Boundkey]
/// - `blx_` Lower bounds for the variables.
/// - `bux_` Upper bounds for the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.inputdata64>
pub fn input_data(&mut self,maxnumcon_ : i32,maxnumvar_ : i32,c_ : &[f64],cfix_ : f64,aptrb_ : &[i64],aptre_ : &[i64],asub_ : &[i32],aval_ : &[f64],bkc_ : &[i32],blc_ : &[f64],buc_ : &[f64],bkx_ : &[i32],blx_ : &[f64],bux_ : &[f64]) -> Result<(),String> { self.data.task.input_data(maxnumcon_,maxnumvar_,c_,cfix_,aptrb_,aptre_,asub_,aval_,bkc_,blc_,buc_,bkx_,blx_,bux_) }
/// Checks a double parameter name.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `param_` Returns the parameter corresponding to the name, if one exists.
///
/// See [Dparam]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.isdouparname>
pub fn is_dou_par_name(&self,parname_ : &str,param_ : & mut i32) -> Result<(),String> { self.data.task.is_dou_par_name(parname_,param_) }
/// Checks an integer parameter name.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `param_` Returns the parameter corresponding to the name, if one exists.
///
/// See [Iparam]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.isintparname>
pub fn is_int_par_name(&self,parname_ : &str,param_ : & mut i32) -> Result<(),String> { self.data.task.is_int_par_name(parname_,param_) }
/// Checks a string parameter name.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `param_` Returns the parameter corresponding to the name, if one exists.
///
/// See [Sparam]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.isstrparname>
pub fn is_str_par_name(&self,parname_ : &str,param_ : & mut i32) -> Result<(),String> { self.data.task.is_str_par_name(parname_,param_) }
/// Directs all output from a task stream to a file.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `filename_` A valid file name.
/// - `append_` If this argument is 0 the output file will be overwritten, otherwise it will be appended to.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.linkfiletotaskstream>
pub fn link_file_to_stream(&mut self,whichstream_ : i32,filename_ : &str,append_ : i32) -> Result<(),String> { self.data.task.link_file_to_stream(whichstream_,filename_,append_) }
/// Prints a short summary of a specified solution.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.onesolutionsummary>
pub fn one_solution_summary(&self,whichstream_ : i32,whichsol_ : i32) -> Result<(),String> { self.data.task.one_solution_summary(whichstream_,whichsol_) }
/// Offload the optimization task to a solver server and wait for the solution.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
/// - `trmcode_` Is either OK or a termination response code.
///
/// See [Rescode]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.optimizermt>
pub fn optimize_rmt(&mut self,address_ : &str,accesstoken_ : &str,trmcode_ : & mut i32) -> Result<(),String> { self.data.task.optimize_rmt(address_,accesstoken_,trmcode_) }
/// Prints a short summary with optimizer statistics from last optimization.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.optimizersummary>
pub fn optimizer_summary(&self,whichstream_ : i32) -> Result<(),String> { self.data.task.optimizer_summary(whichstream_) }
/// Optimizes the problem.
///
/// # Returns
///
/// - `trmcode` Is either OK or a termination response code.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.optimizetrm>
pub fn optimize(&mut self) -> Result<i32,String> { self.data.task.optimize() }
/// Repairs a primal infeasible optimization problem by adjusting the bounds on the constraints and variables.
///
/// # Arguments
///
/// - `wlc_` Weights associated with relaxing lower bounds on the constraints.
/// - `wuc_` Weights associated with relaxing the upper bound on the constraints.
/// - `wlx_` Weights associated with relaxing the lower bounds of the variables.
/// - `wux_` Weights associated with relaxing the upper bounds of variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.primalrepair>
pub fn primal_repair(&mut self,wlc_ : &[f64],wuc_ : &[f64],wlx_ : &[f64],wux_ : &[f64]) -> Result<(),String> { self.data.task.primal_repair(wlc_,wuc_,wlx_,wux_) }
/// Perform sensitivity analysis on bounds.
///
/// # Arguments
///
/// - `subi_` Indexes of constraints to analyze.
/// - `marki_` Mark which constraint bounds to analyze.
///
/// See [Mark]
/// - `subj_` Indexes of variables to analyze.
/// - `markj_` Mark which variable bounds to analyze.
///
/// See [Mark]
/// - `leftpricei_` Left shadow price for constraints.
/// - `rightpricei_` Right shadow price for constraints.
/// - `leftrangei_` Left range for constraints.
/// - `rightrangei_` Right range for constraints.
/// - `leftpricej_` Left shadow price for variables.
/// - `rightpricej_` Right shadow price for variables.
/// - `leftrangej_` Left range for variables.
/// - `rightrangej_` Right range for variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.primalsensitivity>
pub fn primal_sensitivity(&mut self,subi_ : &[i32],marki_ : &[i32],subj_ : &[i32],markj_ : &[i32],leftpricei_ : &mut[f64],rightpricei_ : &mut[f64],leftrangei_ : &mut[f64],rightrangei_ : &mut[f64],leftpricej_ : &mut[f64],rightpricej_ : &mut[f64],leftrangej_ : &mut[f64],rightrangej_ : &mut[f64]) -> Result<(),String> { self.data.task.primal_sensitivity(subi_,marki_,subj_,markj_,leftpricei_,rightpricei_,leftrangei_,rightrangei_,leftpricej_,rightpricej_,leftrangej_,rightrangej_) }
/// Prints the current parameter settings.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.printparam>
pub fn print_param(&self) -> Result<(),String> { self.data.task.print_param() }
/// Puts an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Affine conic constraint index.
/// - `domidx_` Domain index.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacc>
pub fn put_acc(&mut self,accidx_ : i64,domidx_ : i64,afeidxlist_ : &[i64],b_ : &[f64]) -> Result<(),String> { self.data.task.put_acc(accidx_,domidx_,afeidxlist_,b_) }
/// Puts the constant vector b in an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Affine conic constraint index.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaccb>
pub fn put_acc_b(&mut self,accidx_ : i64,b_ : &[f64]) -> Result<(),String> { self.data.task.put_acc_b(accidx_,b_) }
/// Sets one element in the b vector of an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Affine conic constraint index.
/// - `j_` The index of an element in b to change.
/// - `bj_` The new value of b\[j\].
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaccbj>
pub fn put_acc_b_j(&mut self,accidx_ : i64,j_ : i64,bj_ : f64) -> Result<(),String> { self.data.task.put_acc_b_j(accidx_,j_,bj_) }
/// Puts the doty vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidx_` The index of the affine conic constraint.
/// - `doty_` The dual values for this affine conic constraint. The array should have length equal to the dimension of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaccdoty>
pub fn put_acc_dot_y(&self,whichsol_ : i32,accidx_ : i64,doty_ : &mut[f64]) -> Result<(),String> { self.data.task.put_acc_dot_y(whichsol_,accidx_,doty_) }
/// Puts a number of affine conic constraints.
///
/// # Arguments
///
/// - `accidxs_` Affine conic constraint indices.
/// - `domidxs_` Domain indices.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacclist>
pub fn put_acc_list(&mut self,accidxs_ : &[i64],domidxs_ : &[i64],afeidxlist_ : &[i64],b_ : &[f64]) -> Result<(),String> { self.data.task.put_acc_list(accidxs_,domidxs_,afeidxlist_,b_) }
/// Sets the name of an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of the affine conic constraint.
/// - `name_` The name of the affine conic constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaccname>
pub fn put_acc_name(&mut self,accidx_ : i64,name_ : &str) -> Result<(),String> { self.data.task.put_acc_name(accidx_,name_) }
/// Replaces all elements in one column of the linear constraint matrix.
///
/// # Arguments
///
/// - `j_` Column index.
/// - `subj_` Row indexes of non-zero values in column.
/// - `valj_` New non-zero values of column.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacol>
pub fn put_a_col(&mut self,j_ : i32,subj_ : &[i32],valj_ : &[f64]) -> Result<(),String> { self.data.task.put_a_col(j_,subj_,valj_) }
/// Replaces all elements in several columns the linear constraint matrix.
///
/// # Arguments
///
/// - `sub_` Indexes of columns that should be replaced.
/// - `ptrb_` Array of pointers to the first element in the columns.
/// - `ptre_` Array of pointers to the last element plus one in the columns.
/// - `asub_` Row indexes
/// - `aval_` Coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacollist64>
pub fn put_a_col_list(&mut self,sub_ : &[i32],ptrb_ : &[i64],ptre_ : &[i64],asub_ : &[i32],aval_ : &[f64]) -> Result<(),String> { self.data.task.put_a_col_list(sub_,ptrb_,ptre_,asub_,aval_) }
/// Replaces all elements in a sequence of columns the linear constraint matrix.
///
/// # Arguments
///
/// - `first_` First column in the slice.
/// - `last_` Last column plus one in the slice.
/// - `ptrb_` Array of pointers to the first element in the columns.
/// - `ptre_` Array of pointers to the last element plus one in the columns.
/// - `asub_` Row indexes
/// - `aval_` Coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacolslice64>
pub fn put_a_col_slice(&mut self,first_ : i32,last_ : i32,ptrb_ : &[i64],ptre_ : &[i64],asub_ : &[i32],aval_ : &[f64]) -> Result<(),String> { self.data.task.put_a_col_slice(first_,last_,ptrb_,ptre_,asub_,aval_) }
/// Inputs barF in block triplet form.
///
/// # Arguments
///
/// - `afeidx_` Constraint index.
/// - `barvaridx_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valkl_` The numerical value associated with each block triplet.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafebarfblocktriplet>
pub fn put_afe_barf_block_triplet(&mut self,afeidx_ : &[i64],barvaridx_ : &[i32],subk_ : &[i32],subl_ : &[i32],valkl_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_barf_block_triplet(afeidx_,barvaridx_,subk_,subl_,valkl_) }
/// Inputs one entry in barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
/// - `barvaridx_` Semidefinite variable index.
/// - `termidx_` Element indices in matrix storage.
/// - `termweight_` Weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafebarfentry>
pub fn put_afe_barf_entry(&mut self,afeidx_ : i64,barvaridx_ : i32,termidx_ : &[i64],termweight_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_barf_entry(afeidx_,barvaridx_,termidx_,termweight_) }
/// Inputs a list of entries in barF.
///
/// # Arguments
///
/// - `afeidx_` Row indexes of barF.
/// - `barvaridx_` Semidefinite variable indexes.
/// - `numterm_` Number of terms in the weighted sums.
/// - `ptrterm_` Pointer to the terms forming each entry.
/// - `termidx_` Concatenated element indexes in matrix storage.
/// - `termweight_` Concatenated weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafebarfentrylist>
pub fn put_afe_barf_entry_list(&mut self,afeidx_ : &[i64],barvaridx_ : &[i32],numterm_ : &[i64],ptrterm_ : &[i64],termidx_ : &[i64],termweight_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_barf_entry_list(afeidx_,barvaridx_,numterm_,ptrterm_,termidx_,termweight_) }
/// Inputs a row of barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
/// - `barvaridx_` Semidefinite variable indexes.
/// - `numterm_` Number of terms in the weighted sums.
/// - `ptrterm_` Pointer to the terms forming each entry.
/// - `termidx_` Concatenated element indexes in matrix storage.
/// - `termweight_` Concatenated weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafebarfrow>
pub fn put_afe_barf_row(&mut self,afeidx_ : i64,barvaridx_ : &[i32],numterm_ : &[i64],ptrterm_ : &[i64],termidx_ : &[i64],termweight_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_barf_row(afeidx_,barvaridx_,numterm_,ptrterm_,termidx_,termweight_) }
/// Replaces all elements in one column of the F matrix in the affine expressions.
///
/// # Arguments
///
/// - `varidx_` Column index.
/// - `afeidx_` Row indexes of non-zero values in the column.
/// - `val_` New non-zero values in the column.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefcol>
pub fn put_afe_f_col(&mut self,varidx_ : i32,afeidx_ : &[i64],val_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_f_col(varidx_,afeidx_,val_) }
/// Replaces one entry in F.
///
/// # Arguments
///
/// - `afeidx_` Row index in F.
/// - `varidx_` Column index in F.
/// - `value_` Value of the entry.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefentry>
pub fn put_afe_f_entry(&mut self,afeidx_ : i64,varidx_ : i32,value_ : f64) -> Result<(),String> { self.data.task.put_afe_f_entry(afeidx_,varidx_,value_) }
/// Replaces a list of entries in F.
///
/// # Arguments
///
/// - `afeidx_` Row indices in F.
/// - `varidx_` Column indices in F.
/// - `val_` Values of the entries in F.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefentrylist>
pub fn put_afe_f_entry_list(&mut self,afeidx_ : &[i64],varidx_ : &[i32],val_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_f_entry_list(afeidx_,varidx_,val_) }
/// Replaces all elements in one row of the F matrix in the affine expressions.
///
/// # Arguments
///
/// - `afeidx_` Row index.
/// - `varidx_` Column indexes of non-zero values in the row.
/// - `val_` New non-zero values in the row.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefrow>
pub fn put_afe_f_row(&mut self,afeidx_ : i64,varidx_ : &[i32],val_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_f_row(afeidx_,varidx_,val_) }
/// Replaces all elements in a number of rows of the F matrix in the affine expressions.
///
/// # Arguments
///
/// - `afeidx_` Row indices.
/// - `numnzrow_` Number of non-zeros in each row.
/// - `ptrrow_` Pointer to the first nonzero in each row.
/// - `varidx_` Column indexes of non-zero values.
/// - `val_` New non-zero values in the rows.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefrowlist>
pub fn put_afe_f_row_list(&mut self,afeidx_ : &[i64],numnzrow_ : &[i32],ptrrow_ : &[i64],varidx_ : &[i32],val_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_f_row_list(afeidx_,numnzrow_,ptrrow_,varidx_,val_) }
/// Replaces one element in the g vector in the affine expressions.
///
/// # Arguments
///
/// - `afeidx_` Row index.
/// - `g_` New value for the element of g.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafeg>
pub fn put_afe_g(&mut self,afeidx_ : i64,g_ : f64) -> Result<(),String> { self.data.task.put_afe_g(afeidx_,g_) }
/// Replaces a list of elements in the g vector in the affine expressions.
///
/// # Arguments
///
/// - `afeidx_` Indices of entries in g.
/// - `g_` New values for the elements of g.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafeglist>
pub fn put_afe_g_list(&mut self,afeidx_ : &[i64],g_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_g_list(afeidx_,g_) }
/// Modifies a slice of the vector g.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slice_` The slice of g as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafegslice>
pub fn put_afe_g_slice(&mut self,first_ : i64,last_ : i64,slice_ : &[f64]) -> Result<(),String> { self.data.task.put_afe_g_slice(first_,last_,slice_) }
/// Changes a single value in the linear coefficient matrix.
///
/// # Arguments
///
/// - `i_` Constraint (row) index.
/// - `j_` Variable (column) index.
/// - `aij_` New coefficient.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaij>
pub fn put_aij(&mut self,i_ : i32,j_ : i32,aij_ : f64) -> Result<(),String> { self.data.task.put_aij(i_,j_,aij_) }
/// Changes one or more coefficients in the linear constraint matrix.
///
/// # Arguments
///
/// - `subi_` Constraint (row) indices.
/// - `subj_` Variable (column) indices.
/// - `valij_` New coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaijlist64>
pub fn put_aij_list(&mut self,subi_ : &[i32],subj_ : &[i32],valij_ : &[f64]) -> Result<(),String> { self.data.task.put_aij_list(subi_,subj_,valij_) }
/// Replaces all elements in one row of the linear constraint matrix.
///
/// # Arguments
///
/// - `i_` Row index.
/// - `subi_` Column indexes of non-zero values in row.
/// - `vali_` New non-zero values of row.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putarow>
pub fn put_a_row(&mut self,i_ : i32,subi_ : &[i32],vali_ : &[f64]) -> Result<(),String> { self.data.task.put_a_row(i_,subi_,vali_) }
/// Replaces all elements in several rows of the linear constraint matrix.
///
/// # Arguments
///
/// - `sub_` Indexes of rows or columns that should be replaced.
/// - `ptrb_` Array of pointers to the first element in the rows.
/// - `ptre_` Array of pointers to the last element plus one in the rows.
/// - `asub_` Variable indexes.
/// - `aval_` Coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putarowlist64>
pub fn put_a_row_list(&mut self,sub_ : &[i32],ptrb_ : &[i64],ptre_ : &[i64],asub_ : &[i32],aval_ : &[f64]) -> Result<(),String> { self.data.task.put_a_row_list(sub_,ptrb_,ptre_,asub_,aval_) }
/// Replaces all elements in several rows the linear constraint matrix.
///
/// # Arguments
///
/// - `first_` First row in the slice.
/// - `last_` Last row plus one in the slice.
/// - `ptrb_` Array of pointers to the first element in the rows.
/// - `ptre_` Array of pointers to the last element plus one in the rows.
/// - `asub_` Column indexes of new elements.
/// - `aval_` Coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putarowslice64>
pub fn put_a_row_slice(&mut self,first_ : i32,last_ : i32,ptrb_ : &[i64],ptre_ : &[i64],asub_ : &[i32],aval_ : &[f64]) -> Result<(),String> { self.data.task.put_a_row_slice(first_,last_,ptrb_,ptre_,asub_,aval_) }
/// Truncates all elements in A below a certain tolerance to zero.
///
/// # Arguments
///
/// - `tolzero_` Truncation tolerance.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putatruncatetol>
pub fn put_a_truncate_tol(&mut self,tolzero_ : f64) -> Result<(),String> { self.data.task.put_a_truncate_tol(tolzero_) }
/// Inputs barA in block triplet form.
///
/// # Arguments
///
/// - `subi_` Constraint index.
/// - `subj_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valijkl_` The numerical value associated with each block triplet.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarablocktriplet>
pub fn put_bara_block_triplet(&mut self,subi_ : &[i32],subj_ : &[i32],subk_ : &[i32],subl_ : &[i32],valijkl_ : &[f64]) -> Result<(),String> { self.data.task.put_bara_block_triplet(subi_,subj_,subk_,subl_,valijkl_) }
/// Inputs an element of barA.
///
/// # Arguments
///
/// - `i_` Row index of barA.
/// - `j_` Column index of barA.
/// - `sub_` Element indexes in matrix storage.
/// - `weights_` Weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbaraij>
pub fn put_bara_ij(&mut self,i_ : i32,j_ : i32,sub_ : &[i64],weights_ : &[f64]) -> Result<(),String> { self.data.task.put_bara_ij(i_,j_,sub_,weights_) }
/// Inputs list of elements of barA.
///
/// # Arguments
///
/// - `subi_` Row index of barA.
/// - `subj_` Column index of barA.
/// - `alphaptrb_` Start entries for terms in the weighted sum.
/// - `alphaptre_` End entries for terms in the weighted sum.
/// - `matidx_` Element indexes in matrix storage.
/// - `weights_` Weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbaraijlist>
pub fn put_bara_ij_list(&mut self,subi_ : &[i32],subj_ : &[i32],alphaptrb_ : &[i64],alphaptre_ : &[i64],matidx_ : &[i64],weights_ : &[f64]) -> Result<(),String> { self.data.task.put_bara_ij_list(subi_,subj_,alphaptrb_,alphaptre_,matidx_,weights_) }
/// Replace a set of rows of barA
///
/// # Arguments
///
/// - `subi_` Row indexes of barA.
/// - `ptrb_` Start of rows in barA.
/// - `ptre_` End of rows in barA.
/// - `subj_` Column index of barA.
/// - `nummat_` Number of entries in weighted sum of matrixes.
/// - `matidx_` Matrix indexes for weighted sum of matrixes.
/// - `weights_` Weights for weighted sum of matrixes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbararowlist>
pub fn put_bara_row_list(&mut self,subi_ : &[i32],ptrb_ : &[i64],ptre_ : &[i64],subj_ : &[i32],nummat_ : &[i64],matidx_ : &[i64],weights_ : &[f64]) -> Result<(),String> { self.data.task.put_bara_row_list(subi_,ptrb_,ptre_,subj_,nummat_,matidx_,weights_) }
/// Inputs barC in block triplet form.
///
/// # Arguments
///
/// - `subj_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valjkl_` The numerical value associated with each block triplet.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarcblocktriplet>
pub fn put_barc_block_triplet(&mut self,subj_ : &[i32],subk_ : &[i32],subl_ : &[i32],valjkl_ : &[f64]) -> Result<(),String> { self.data.task.put_barc_block_triplet(subj_,subk_,subl_,valjkl_) }
/// Changes one element in barc.
///
/// # Arguments
///
/// - `j_` Index of the element in barc` that should be changed.
/// - `sub_` sub is list of indexes of those symmetric matrices appearing in sum.
/// - `weights_` The weights of the terms in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarcj>
pub fn put_barc_j(&mut self,j_ : i32,sub_ : &[i64],weights_ : &[f64]) -> Result<(),String> { self.data.task.put_barc_j(j_,sub_,weights_) }
/// Sets the dual solution for a semidefinite variable.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `j_` Index of the semidefinite variable.
/// - `barsj_` Value of the j'th variable of barx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarsj>
pub fn put_bars_j(&mut self,whichsol_ : i32,j_ : i32,barsj_ : &[f64]) -> Result<(),String> { self.data.task.put_bars_j(whichsol_,j_,barsj_) }
/// Sets the name of a semidefinite variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `name_` The variable name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarvarname>
pub fn put_barvar_name(&mut self,j_ : i32,name_ : &str) -> Result<(),String> { self.data.task.put_barvar_name(j_,name_) }
/// Sets the primal solution for a semidefinite variable.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `j_` Index of the semidefinite variable.
/// - `barxj_` Value of the j'th variable of barx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarxj>
pub fn put_barx_j(&mut self,whichsol_ : i32,j_ : i32,barxj_ : &[f64]) -> Result<(),String> { self.data.task.put_barx_j(whichsol_,j_,barxj_) }
/// Replaces the fixed term in the objective.
///
/// # Arguments
///
/// - `cfix_` Fixed term in the objective.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putcfix>
pub fn put_cfix(&mut self,cfix_ : f64) -> Result<(),String> { self.data.task.put_cfix(cfix_) }
/// Modifies one linear coefficient in the objective.
///
/// # Arguments
///
/// - `j_` Index of the variable whose objective coefficient should be changed.
/// - `cj_` New coefficient value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putcj>
pub fn put_c_j(&mut self,j_ : i32,cj_ : f64) -> Result<(),String> { self.data.task.put_c_j(j_,cj_) }
/// Modifies a part of the linear objective coefficients.
///
/// # Arguments
///
/// - `subj_` Indices of variables for which objective coefficients should be changed.
/// - `val_` New numerical values for the objective coefficients that should be modified.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putclist>
pub fn put_c_list(&mut self,subj_ : &[i32],val_ : &[f64]) -> Result<(),String> { self.data.task.put_c_list(subj_,val_) }
/// Changes the bound for one constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
/// - `bkc_` New bound key.
///
/// See [Boundkey]
/// - `blc_` New lower bound.
/// - `buc_` New upper bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconbound>
pub fn put_con_bound(&mut self,i_ : i32,bkc_ : i32,blc_ : f64,buc_ : f64) -> Result<(),String> { self.data.task.put_con_bound(i_,bkc_,blc_,buc_) }
/// Changes the bounds of a list of constraints.
///
/// # Arguments
///
/// - `sub_` List of constraint indexes.
/// - `bkc_` Bound keys for the constraints.
///
/// See [Boundkey]
/// - `blc_` Lower bounds for the constraints.
/// - `buc_` Upper bounds for the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconboundlist>
pub fn put_con_bound_list(&mut self,sub_ : &[i32],bkc_ : &[i32],blc_ : &[f64],buc_ : &[f64]) -> Result<(),String> { self.data.task.put_con_bound_list(sub_,bkc_,blc_,buc_) }
/// Changes the bounds of a list of constraints.
///
/// # Arguments
///
/// - `sub_` List of constraint indexes.
/// - `bkc_` New bound key for all constraints in the list.
///
/// See [Boundkey]
/// - `blc_` New lower bound for all constraints in the list.
/// - `buc_` New upper bound for all constraints in the list.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconboundlistconst>
pub fn put_con_bound_list_const(&mut self,sub_ : &[i32],bkc_ : i32,blc_ : f64,buc_ : f64) -> Result<(),String> { self.data.task.put_con_bound_list_const(sub_,bkc_,blc_,buc_) }
/// Changes the bounds for a slice of the constraints.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bkc_` Bound keys for the constraints.
///
/// See [Boundkey]
/// - `blc_` Lower bounds for the constraints.
/// - `buc_` Upper bounds for the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconboundslice>
pub fn put_con_bound_slice(&mut self,first_ : i32,last_ : i32,bkc_ : &[i32],blc_ : &[f64],buc_ : &[f64]) -> Result<(),String> { self.data.task.put_con_bound_slice(first_,last_,bkc_,blc_,buc_) }
/// Changes the bounds for a slice of the constraints.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bkc_` New bound key for all constraints in the slice.
///
/// See [Boundkey]
/// - `blc_` New lower bound for all constraints in the slice.
/// - `buc_` New upper bound for all constraints in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconboundsliceconst>
pub fn put_con_bound_slice_const(&mut self,first_ : i32,last_ : i32,bkc_ : i32,blc_ : f64,buc_ : f64) -> Result<(),String> { self.data.task.put_con_bound_slice_const(first_,last_,bkc_,blc_,buc_) }
/// Replaces a conic constraint.
///
/// # Arguments
///
/// - `k_` Index of the cone.
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `submem_` Variable subscripts of the members in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putcone>
pub fn put_cone(&mut self,k_ : i32,ct_ : i32,conepar_ : f64,submem_ : &[i32]) -> Result<(),String> { self.data.task.put_cone(k_,ct_,conepar_,submem_) }
/// Sets the name of a cone.
///
/// # Arguments
///
/// - `j_` Index of the cone.
/// - `name_` The name of the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconename>
pub fn put_cone_name(&mut self,j_ : i32,name_ : &str) -> Result<(),String> { self.data.task.put_cone_name(j_,name_) }
/// Sets the name of a constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
/// - `name_` The name of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconname>
pub fn put_con_name(&mut self,i_ : i32,name_ : &str) -> Result<(),String> { self.data.task.put_con_name(i_,name_) }
/// Sets the primal and dual solution information for a single constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sk_` Status key of the constraint.
///
/// See [Stakey]
/// - `x_` Primal solution value of the constraint.
/// - `sl_` Solution value of the dual variable associated with the lower bound.
/// - `su_` Solution value of the dual variable associated with the upper bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconsolutioni>
pub fn put_con_solution_i(&mut self,i_ : i32,whichsol_ : i32,sk_ : i32,x_ : f64,sl_ : f64,su_ : f64) -> Result<(),String> { self.data.task.put_con_solution_i(i_,whichsol_,sk_,x_,sl_,su_) }
/// Modifies a slice of the linear objective coefficients.
///
/// # Arguments
///
/// - `first_` First element in the slice of c.
/// - `last_` Last element plus 1 of the slice in c to be changed.
/// - `slice_` New numerical values for the objective coefficients that should be modified.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putcslice>
pub fn put_c_slice(&mut self,first_ : i32,last_ : i32,slice_ : &[f64]) -> Result<(),String> { self.data.task.put_c_slice(first_,last_,slice_) }
/// Inputs a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `domidxlist_` List of domain indexes.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions.
/// - `termsizelist_` List of term sizes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdjc>
pub fn put_djc(&mut self,djcidx_ : i64,domidxlist_ : &[i64],afeidxlist_ : &[i64],b_ : &[f64],termsizelist_ : &[i64]) -> Result<(),String> { self.data.task.put_djc(djcidx_,domidxlist_,afeidxlist_,b_,termsizelist_) }
/// Sets the name of a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `name_` The name of the disjunctive constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdjcname>
pub fn put_djc_name(&mut self,djcidx_ : i64,name_ : &str) -> Result<(),String> { self.data.task.put_djc_name(djcidx_,name_) }
/// Inputs a slice of disjunctive constraints.
///
/// # Arguments
///
/// - `idxfirst_` Index of the first disjunctive constraint in the slice.
/// - `idxlast_` Index of the last disjunctive constraint in the slice plus 1.
/// - `domidxlist_` List of domain indexes.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
/// - `termsizelist_` List of term sizes.
/// - `termsindjc_` Number of terms in each of the disjunctive constraints in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdjcslice>
pub fn put_djc_slice(&mut self,idxfirst_ : i64,idxlast_ : i64,domidxlist_ : &[i64],afeidxlist_ : &[i64],b_ : &[f64],termsizelist_ : &[i64],termsindjc_ : &[i64]) -> Result<(),String> { self.data.task.put_djc_slice(idxfirst_,idxlast_,domidxlist_,afeidxlist_,b_,termsizelist_,termsindjc_) }
/// Sets the name of a domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
/// - `name_` The name of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdomainname>
pub fn put_domain_name(&mut self,domidx_ : i64,name_ : &str) -> Result<(),String> { self.data.task.put_domain_name(domidx_,name_) }
/// Sets a double parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Dparam]
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdouparam>
pub fn put_dou_param(&mut self,param_ : i32,parvalue_ : f64) -> Result<(),String> { self.data.task.put_dou_param(param_,parvalue_) }
/// Sets an integer parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Iparam]
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putintparam>
pub fn put_int_param(&mut self,param_ : i32,parvalue_ : i32) -> Result<(),String> { self.data.task.put_int_param(param_,parvalue_) }
/// Sets the number of preallocated affine conic constraints.
///
/// # Arguments
///
/// - `maxnumacc_` Number of preallocated affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumacc>
pub fn put_max_num_acc(&mut self,maxnumacc_ : i64) -> Result<(),String> { self.data.task.put_max_num_acc(maxnumacc_) }
/// Sets the number of preallocated affine expressions in the optimization task.
///
/// # Arguments
///
/// - `maxnumafe_` Number of preallocated affine expressions.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumafe>
pub fn put_max_num_afe(&mut self,maxnumafe_ : i64) -> Result<(),String> { self.data.task.put_max_num_afe(maxnumafe_) }
/// Sets the number of preallocated non-zero entries in the linear coefficient matrix.
///
/// # Arguments
///
/// - `maxnumanz_` New size of the storage reserved for storing the linear coefficient matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumanz>
pub fn put_max_num_a_nz(&mut self,maxnumanz_ : i64) -> Result<(),String> { self.data.task.put_max_num_a_nz(maxnumanz_) }
/// Sets the number of preallocated symmetric matrix variables.
///
/// # Arguments
///
/// - `maxnumbarvar_` Number of preallocated symmetric matrix variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumbarvar>
pub fn put_max_num_barvar(&mut self,maxnumbarvar_ : i32) -> Result<(),String> { self.data.task.put_max_num_barvar(maxnumbarvar_) }
/// Sets the number of preallocated constraints in the optimization task.
///
/// # Arguments
///
/// - `maxnumcon_` Number of preallocated constraints in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumcon>
pub fn put_max_num_con(&mut self,maxnumcon_ : i32) -> Result<(),String> { self.data.task.put_max_num_con(maxnumcon_) }
/// Sets the number of preallocated conic constraints in the optimization task.
///
/// # Arguments
///
/// - `maxnumcone_` Number of preallocated conic constraints in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumcone>
pub fn put_max_num_cone(&mut self,maxnumcone_ : i32) -> Result<(),String> { self.data.task.put_max_num_cone(maxnumcone_) }
/// Sets the number of preallocated disjunctive constraints.
///
/// # Arguments
///
/// - `maxnumdjc_` Number of preallocated disjunctive constraints in the task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumdjc>
pub fn put_max_num_djc(&mut self,maxnumdjc_ : i64) -> Result<(),String> { self.data.task.put_max_num_djc(maxnumdjc_) }
/// Sets the number of preallocated domains in the optimization task.
///
/// # Arguments
///
/// - `maxnumdomain_` Number of preallocated domains.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumdomain>
pub fn put_max_num_domain(&mut self,maxnumdomain_ : i64) -> Result<(),String> { self.data.task.put_max_num_domain(maxnumdomain_) }
/// Sets the number of preallocated non-zero entries in quadratic terms.
///
/// # Arguments
///
/// - `maxnumqnz_` Number of non-zero elements preallocated in quadratic coefficient matrices.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumqnz>
pub fn put_max_num_q_nz(&mut self,maxnumqnz_ : i64) -> Result<(),String> { self.data.task.put_max_num_q_nz(maxnumqnz_) }
/// Sets the number of preallocated variables in the optimization task.
///
/// # Arguments
///
/// - `maxnumvar_` Number of preallocated variables in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumvar>
pub fn put_max_num_var(&mut self,maxnumvar_ : i32) -> Result<(),String> { self.data.task.put_max_num_var(maxnumvar_) }
/// Sets a double parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putnadouparam>
pub fn put_na_dou_param(&mut self,paramname_ : &str,parvalue_ : f64) -> Result<(),String> { self.data.task.put_na_dou_param(paramname_,parvalue_) }
/// Sets an integer parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putnaintparam>
pub fn put_na_int_param(&mut self,paramname_ : &str,parvalue_ : i32) -> Result<(),String> { self.data.task.put_na_int_param(paramname_,parvalue_) }
/// Sets a string parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putnastrparam>
pub fn put_na_str_param(&mut self,paramname_ : &str,parvalue_ : &str) -> Result<(),String> { self.data.task.put_na_str_param(paramname_,parvalue_) }
/// Assigns a new name to the objective.
///
/// # Arguments
///
/// - `objname_` Name of the objective.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putobjname>
pub fn put_obj_name(&mut self,objname_ : &str) -> Result<(),String> { self.data.task.put_obj_name(objname_) }
/// Sets the objective sense.
///
/// # Arguments
///
/// - `sense_` The objective sense of the task
///
/// See [Objsense]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putobjsense>
pub fn put_obj_sense(&mut self,sense_ : i32) -> Result<(),String> { self.data.task.put_obj_sense(sense_) }
/// Specify an OptServer for remote calls.
///
/// # Arguments
///
/// - `host_` A URL specifying the optimization server to be used.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putoptserverhost>
pub fn put_optserver_host(&mut self,host_ : &str) -> Result<(),String> { self.data.task.put_optserver_host(host_) }
/// Modifies the value of parameter.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putparam>
pub fn put_param(&mut self,parname_ : &str,parvalue_ : &str) -> Result<(),String> { self.data.task.put_param(parname_,parvalue_) }
/// Replaces all quadratic terms in constraints.
///
/// # Arguments
///
/// - `qcsubk_` Constraint subscripts for quadratic coefficients.
/// - `qcsubi_` Row subscripts for quadratic constraint matrix.
/// - `qcsubj_` Column subscripts for quadratic constraint matrix.
/// - `qcval_` Quadratic constraint coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putqcon>
pub fn put_q_con(&mut self,qcsubk_ : &[i32],qcsubi_ : &[i32],qcsubj_ : &[i32],qcval_ : &[f64]) -> Result<(),String> { self.data.task.put_q_con(qcsubk_,qcsubi_,qcsubj_,qcval_) }
/// Replaces all quadratic terms in a single constraint.
///
/// # Arguments
///
/// - `k_` The constraint in which the new quadratic elements are inserted.
/// - `qcsubi_` Row subscripts for quadratic constraint matrix.
/// - `qcsubj_` Column subscripts for quadratic constraint matrix.
/// - `qcval_` Quadratic constraint coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putqconk>
pub fn put_q_con_k(&mut self,k_ : i32,qcsubi_ : &[i32],qcsubj_ : &[i32],qcval_ : &[f64]) -> Result<(),String> { self.data.task.put_q_con_k(k_,qcsubi_,qcsubj_,qcval_) }
/// Replaces all quadratic terms in the objective.
///
/// # Arguments
///
/// - `qosubi_` Row subscripts for quadratic objective coefficients.
/// - `qosubj_` Column subscripts for quadratic objective coefficients.
/// - `qoval_` Quadratic objective coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putqobj>
pub fn put_q_obj(&mut self,qosubi_ : &[i32],qosubj_ : &[i32],qoval_ : &[f64]) -> Result<(),String> { self.data.task.put_q_obj(qosubi_,qosubj_,qoval_) }
/// Replaces one coefficient in the quadratic term in the objective.
///
/// # Arguments
///
/// - `i_` Row index for the coefficient to be replaced.
/// - `j_` Column index for the coefficient to be replaced.
/// - `qoij_` The new coefficient value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putqobjij>
pub fn put_q_obj_i_j(&mut self,i_ : i32,j_ : i32,qoij_ : f64) -> Result<(),String> { self.data.task.put_q_obj_i_j(i_,j_,qoij_) }
/// Sets the status keys for the constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putskc>
pub fn put_skc(&mut self,whichsol_ : i32,skc_ : &[i32]) -> Result<(),String> { self.data.task.put_skc(whichsol_,skc_) }
/// Sets the status keys for a slice of the constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putskcslice>
pub fn put_skc_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,skc_ : &[i32]) -> Result<(),String> { self.data.task.put_skc_slice(whichsol_,first_,last_,skc_) }
/// Sets the status keys for the scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putskx>
pub fn put_skx(&mut self,whichsol_ : i32,skx_ : &[i32]) -> Result<(),String> { self.data.task.put_skx(whichsol_,skx_) }
/// Sets the status keys for a slice of the variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putskxslice>
pub fn put_skx_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,skx_ : &[i32]) -> Result<(),String> { self.data.task.put_skx_slice(whichsol_,first_,last_,skx_) }
/// Sets the slc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putslc>
pub fn put_slc(&mut self,whichsol_ : i32,slc_ : &[f64]) -> Result<(),String> { self.data.task.put_slc(whichsol_,slc_) }
/// Sets a slice of the slc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putslcslice>
pub fn put_slc_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,slc_ : &[f64]) -> Result<(),String> { self.data.task.put_slc_slice(whichsol_,first_,last_,slc_) }
/// Sets the slx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putslx>
pub fn put_slx(&mut self,whichsol_ : i32,slx_ : &[f64]) -> Result<(),String> { self.data.task.put_slx(whichsol_,slx_) }
/// Sets a slice of the slx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putslxslice>
pub fn put_slx_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,slx_ : &[f64]) -> Result<(),String> { self.data.task.put_slx_slice(whichsol_,first_,last_,slx_) }
/// Sets the snx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsnx>
pub fn put_snx(&mut self,whichsol_ : i32,sux_ : &[f64]) -> Result<(),String> { self.data.task.put_snx(whichsol_,sux_) }
/// Sets a slice of the snx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsnxslice>
pub fn put_snx_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,snx_ : &[f64]) -> Result<(),String> { self.data.task.put_snx_slice(whichsol_,first_,last_,snx_) }
/// Inserts a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
/// - `xc_` Primal constraint solution.
/// - `xx_` Primal variable solution.
/// - `y_` Vector of dual variables corresponding to the constraints.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsolution>
pub fn put_solution(&mut self,whichsol_ : i32,skc_ : &[i32],skx_ : &[i32],skn_ : &[i32],xc_ : &[f64],xx_ : &[f64],y_ : &[f64],slc_ : &[f64],suc_ : &[f64],slx_ : &[f64],sux_ : &[f64],snx_ : &[f64]) -> Result<(),String> { self.data.task.put_solution(whichsol_,skc_,skx_,skn_,xc_,xx_,y_,slc_,suc_,slx_,sux_,snx_) }
/// Inserts a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
/// - `xc_` Primal constraint solution.
/// - `xx_` Primal variable solution.
/// - `y_` Vector of dual variables corresponding to the constraints.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
/// - `doty_` Dual variables corresponding to affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsolutionnew>
pub fn put_solution_new(&mut self,whichsol_ : i32,skc_ : &[i32],skx_ : &[i32],skn_ : &[i32],xc_ : &[f64],xx_ : &[f64],y_ : &[f64],slc_ : &[f64],suc_ : &[f64],slx_ : &[f64],sux_ : &[f64],snx_ : &[f64],doty_ : &[f64]) -> Result<(),String> { self.data.task.put_solution_new(whichsol_,skc_,skx_,skn_,xc_,xx_,y_,slc_,suc_,slx_,sux_,snx_,doty_) }
/// Inputs the dual variable of a solution.
///
/// # Arguments
///
/// - `i_` Index of the dual variable.
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `y_` Solution value of the dual variable.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsolutionyi>
pub fn put_solution_y_i(&mut self,i_ : i32,whichsol_ : i32,y_ : f64) -> Result<(),String> { self.data.task.put_solution_y_i(i_,whichsol_,y_) }
/// Sets a string parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Sparam]
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putstrparam>
pub fn put_str_param(&mut self,param_ : i32,parvalue_ : &str) -> Result<(),String> { self.data.task.put_str_param(param_,parvalue_) }
/// Sets the suc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsuc>
pub fn put_suc(&mut self,whichsol_ : i32,suc_ : &[f64]) -> Result<(),String> { self.data.task.put_suc(whichsol_,suc_) }
/// Sets a slice of the suc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsucslice>
pub fn put_suc_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,suc_ : &[f64]) -> Result<(),String> { self.data.task.put_suc_slice(whichsol_,first_,last_,suc_) }
/// Sets the sux vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsux>
pub fn put_sux(&mut self,whichsol_ : i32,sux_ : &[f64]) -> Result<(),String> { self.data.task.put_sux(whichsol_,sux_) }
/// Sets a slice of the sux vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsuxslice>
pub fn put_sux_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,sux_ : &[f64]) -> Result<(),String> { self.data.task.put_sux_slice(whichsol_,first_,last_,sux_) }
/// Assigns a new name to the task.
///
/// # Arguments
///
/// - `taskname_` Name assigned to the task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.puttaskname>
pub fn put_task_name(&mut self,taskname_ : &str) -> Result<(),String> { self.data.task.put_task_name(taskname_) }
/// Changes the bounds for one variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `bkx_` New bound key.
///
/// See [Boundkey]
/// - `blx_` New lower bound.
/// - `bux_` New upper bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarbound>
pub fn put_var_bound(&mut self,j_ : i32,bkx_ : i32,blx_ : f64,bux_ : f64) -> Result<(),String> { self.data.task.put_var_bound(j_,bkx_,blx_,bux_) }
/// Changes the bounds of a list of variables.
///
/// # Arguments
///
/// - `sub_` List of variable indexes.
/// - `bkx_` Bound keys for the variables.
///
/// See [Boundkey]
/// - `blx_` Lower bounds for the variables.
/// - `bux_` Upper bounds for the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarboundlist>
pub fn put_var_bound_list(&mut self,sub_ : &[i32],bkx_ : &[i32],blx_ : &[f64],bux_ : &[f64]) -> Result<(),String> { self.data.task.put_var_bound_list(sub_,bkx_,blx_,bux_) }
/// Changes the bounds of a list of variables.
///
/// # Arguments
///
/// - `sub_` List of variable indexes.
/// - `bkx_` New bound key for all variables in the list.
///
/// See [Boundkey]
/// - `blx_` New lower bound for all variables in the list.
/// - `bux_` New upper bound for all variables in the list.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarboundlistconst>
pub fn put_var_bound_list_const(&mut self,sub_ : &[i32],bkx_ : i32,blx_ : f64,bux_ : f64) -> Result<(),String> { self.data.task.put_var_bound_list_const(sub_,bkx_,blx_,bux_) }
/// Changes the bounds for a slice of the variables.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bkx_` Bound keys for the variables.
///
/// See [Boundkey]
/// - `blx_` Lower bounds for the variables.
/// - `bux_` Upper bounds for the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarboundslice>
pub fn put_var_bound_slice(&mut self,first_ : i32,last_ : i32,bkx_ : &[i32],blx_ : &[f64],bux_ : &[f64]) -> Result<(),String> { self.data.task.put_var_bound_slice(first_,last_,bkx_,blx_,bux_) }
/// Changes the bounds for a slice of the variables.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bkx_` New bound key for all variables in the slice.
///
/// See [Boundkey]
/// - `blx_` New lower bound for all variables in the slice.
/// - `bux_` New upper bound for all variables in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarboundsliceconst>
pub fn put_var_bound_slice_const(&mut self,first_ : i32,last_ : i32,bkx_ : i32,blx_ : f64,bux_ : f64) -> Result<(),String> { self.data.task.put_var_bound_slice_const(first_,last_,bkx_,blx_,bux_) }
/// Sets the name of a variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `name_` The variable name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarname>
pub fn put_var_name(&mut self,j_ : i32,name_ : &str) -> Result<(),String> { self.data.task.put_var_name(j_,name_) }
/// Sets the primal and dual solution information for a single variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sk_` Status key of the variable.
///
/// See [Stakey]
/// - `x_` Primal solution value of the variable.
/// - `sl_` Solution value of the dual variable associated with the lower bound.
/// - `su_` Solution value of the dual variable associated with the upper bound.
/// - `sn_` Solution value of the dual variable associated with the conic constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarsolutionj>
pub fn put_var_solution_j(&mut self,j_ : i32,whichsol_ : i32,sk_ : i32,x_ : f64,sl_ : f64,su_ : f64,sn_ : f64) -> Result<(),String> { self.data.task.put_var_solution_j(j_,whichsol_,sk_,x_,sl_,su_,sn_) }
/// Sets the variable type of one variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `vartype_` The new variable type.
///
/// See [Variabletype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvartype>
pub fn put_var_type(&mut self,j_ : i32,vartype_ : i32) -> Result<(),String> { self.data.task.put_var_type(j_,vartype_) }
/// Sets the variable type for one or more variables.
///
/// # Arguments
///
/// - `subj_` A list of variable indexes for which the variable type should be changed.
/// - `vartype_` A list of variable types.
///
/// See [Variabletype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvartypelist>
pub fn put_var_type_list(&mut self,subj_ : &[i32],vartype_ : &[i32]) -> Result<(),String> { self.data.task.put_var_type_list(subj_,vartype_) }
/// Sets the xc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `xc_` Primal constraint solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putxc>
pub fn put_xc(&mut self,whichsol_ : i32,xc_ : &mut[f64]) -> Result<(),String> { self.data.task.put_xc(whichsol_,xc_) }
/// Sets a slice of the xc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `xc_` Primal constraint solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putxcslice>
pub fn put_xc_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,xc_ : &[f64]) -> Result<(),String> { self.data.task.put_xc_slice(whichsol_,first_,last_,xc_) }
/// Sets the xx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `xx_` Primal variable solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putxx>
pub fn put_xx(&mut self,whichsol_ : i32,xx_ : &[f64]) -> Result<(),String> { self.data.task.put_xx(whichsol_,xx_) }
/// Sets a slice of the xx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `xx_` Primal variable solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putxxslice>
pub fn put_xx_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,xx_ : &[f64]) -> Result<(),String> { self.data.task.put_xx_slice(whichsol_,first_,last_,xx_) }
/// Sets the y vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `y_` Vector of dual variables corresponding to the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.puty>
pub fn put_y(&mut self,whichsol_ : i32,y_ : &[f64]) -> Result<(),String> { self.data.task.put_y(whichsol_,y_) }
/// Sets a slice of the y vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `y_` Vector of dual variables corresponding to the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putyslice>
pub fn put_y_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,y_ : &[f64]) -> Result<(),String> { self.data.task.put_y_slice(whichsol_,first_,last_,y_) }
/// Read a binary dump of the task solution and information items.
///
/// # Arguments
///
/// - `filename_` A valid file name.
/// - `compress_` Data compression type.
///
/// See [Compresstype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readbsolution>
pub fn read_b_solution(&self,filename_ : &str,compress_ : i32) -> Result<(),String> { self.data.task.read_b_solution(filename_,compress_) }
/// Reads problem data from a file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readdataautoformat>
pub fn read_data(&mut self,filename_ : &str) -> Result<(),String> { self.data.task.read_data(filename_) }
/// Reads problem data from a file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
/// - `format_` File data format.
///
/// See [Dataformat]
/// - `compress_` File compression type.
///
/// See [Compresstype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readdataformat>
pub fn read_data_format(&mut self,filename_ : &str,format_ : i32,compress_ : i32) -> Result<(),String> { self.data.task.read_data_format(filename_,format_,compress_) }
/// Reads a solution from a JSOL file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readjsonsol>
pub fn read_json_sol(&mut self,filename_ : &str) -> Result<(),String> { self.data.task.read_json_sol(filename_) }
/// Load task data from a string in JSON format.
///
/// # Arguments
///
/// - `data_` Problem data in text format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readjsonstring>
pub fn read_json_string(&mut self,data_ : &str) -> Result<(),String> { self.data.task.read_json_string(data_) }
/// Load task data from a string in LP format.
///
/// # Arguments
///
/// - `data_` Problem data in text format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readlpstring>
pub fn read_lp_string(&mut self,data_ : &str) -> Result<(),String> { self.data.task.read_lp_string(data_) }
/// Load task data from a string in OPF format.
///
/// # Arguments
///
/// - `data_` Problem data in text format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readopfstring>
pub fn read_opf_string(&mut self,data_ : &str) -> Result<(),String> { self.data.task.read_opf_string(data_) }
/// Reads a parameter file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readparamfile>
pub fn read_param_file(&mut self,filename_ : &str) -> Result<(),String> { self.data.task.read_param_file(filename_) }
/// Load task data from a string in PTF format.
///
/// # Arguments
///
/// - `data_` Problem data in text format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readptfstring>
pub fn read_ptf_string(&mut self,data_ : &str) -> Result<(),String> { self.data.task.read_ptf_string(data_) }
/// Reads a solution from a file.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readsolution>
pub fn read_solution(&mut self,whichsol_ : i32,filename_ : &str) -> Result<(),String> { self.data.task.read_solution(whichsol_,filename_) }
/// Read solution file in format determined by the filename
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readsolutionfile>
pub fn read_solution_file(&self,filename_ : &str) -> Result<(),String> { self.data.task.read_solution_file(filename_) }
/// Prints information about last file read.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readsummary>
pub fn read_summary(&mut self,whichstream_ : i32) -> Result<(),String> { self.data.task.read_summary(whichstream_) }
/// Load task data from a file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readtask>
pub fn read_task(&mut self,filename_ : &str) -> Result<(),String> { self.data.task.read_task(filename_) }
/// Removes a number of symmetric matrices.
///
/// # Arguments
///
/// - `subset_` Indexes of symmetric matrices which should be removed.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.removebarvars>
pub fn remove_barvars(&mut self,subset_ : &[i32]) -> Result<(),String> { self.data.task.remove_barvars(subset_) }
/// Removes a number of conic constraints from the problem.
///
/// # Arguments
///
/// - `subset_` Indexes of cones which should be removed.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.removecones>
pub fn remove_cones(&mut self,subset_ : &[i32]) -> Result<(),String> { self.data.task.remove_cones(subset_) }
/// Removes a number of constraints.
///
/// # Arguments
///
/// - `subset_` Indexes of constraints which should be removed.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.removecons>
pub fn remove_cons(&mut self,subset_ : &[i32]) -> Result<(),String> { self.data.task.remove_cons(subset_) }
/// Removes a number of variables.
///
/// # Arguments
///
/// - `subset_` Indexes of variables which should be removed.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.removevars>
pub fn remove_vars(&mut self,subset_ : &[i32]) -> Result<(),String> { self.data.task.remove_vars(subset_) }
/// Resizes an optimization task.
///
/// # Arguments
///
/// - `maxnumcon_` New maximum number of constraints.
/// - `maxnumvar_` New maximum number of variables.
/// - `maxnumcone_` New maximum number of cones.
/// - `maxnumanz_` New maximum number of linear non-zero elements.
/// - `maxnumqnz_` New maximum number of quadratic non-zeros elements.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.resizetask>
pub fn resize_task(&mut self,maxnumcon_ : i32,maxnumvar_ : i32,maxnumcone_ : i32,maxnumanz_ : i64,maxnumqnz_ : i64) -> Result<(),String> { self.data.task.resize_task(maxnumcon_,maxnumvar_,maxnumcone_,maxnumanz_,maxnumqnz_) }
/// Creates a sensitivity report.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.sensitivityreport>
pub fn sensitivity_report(&self,whichstream_ : i32) -> Result<(),String> { self.data.task.sensitivity_report(whichstream_) }
/// Resets all parameter values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.setdefaults>
pub fn set_defaults(&mut self) -> Result<(),String> { self.data.task.set_defaults() }
/// Checks whether a solution is defined.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// # Returns
///
/// - `isdef` Is non-zero if the requested solution is defined.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.solutiondef>
pub fn solution_def(&self,whichsol_ : i32) -> Result<bool,String> { self.data.task.solution_def(whichsol_) }
/// Prints a short summary of the current solutions.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.solutionsummary>
pub fn solution_summary(&self,whichstream_ : i32) -> Result<(),String> { self.data.task.solution_summary(whichstream_) }
/// Solve a linear equation system involving a basis matrix.
///
/// # Arguments
///
/// - `transp_` Controls which problem formulation is solved.
/// - `numnz_` Input (number of non-zeros in right-hand side).
/// - `sub_` Input (indexes of non-zeros in right-hand side) and output (indexes of non-zeros in solution vector).
/// - `val_` Input (right-hand side values) and output (solution vector values).
///
/// # Returns
///
/// - `numnzout` Output (number of non-zeros in solution vector).
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.solvewithbasis>
pub fn solve_with_basis(&mut self,transp_ : bool,numnz_ : i32,sub_ : &mut[i32],val_ : &mut[f64]) -> Result<i32,String> { self.data.task.solve_with_basis(transp_,numnz_,sub_,val_) }
/// Obtains a cone type code.
///
/// # Arguments
///
/// - `str_` String corresponding to the cone type code.
/// - `conetype_` The cone type corresponding to str.
///
/// See [Conetype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.strtoconetype>
pub fn str_to_cone_type(&self,str_ : &str,conetype_ : & mut i32) -> Result<(),String> { self.data.task.str_to_cone_type(str_,conetype_) }
/// Obtains a status key.
///
/// # Arguments
///
/// - `str_` A status key abbreviation string.
/// - `sk_` Status key corresponding to the string.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.strtosk>
pub fn str_to_sk(&self,str_ : &str,sk_ : & mut i32) -> Result<(),String> { self.data.task.str_to_sk(str_,sk_) }
/// In-place reformulation of a QCQO to a conic quadratic problem.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.toconic>
pub fn toconic(&mut self) -> Result<(),String> { self.data.task.toconic() }
/// Disconnects a user-defined function from a task stream.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.unlinkfuncfromtaskstream>
pub fn unlink_func_from_stream(&mut self,whichstream_ : i32) -> Result<(),String> { self.data.task.unlink_func_from_stream(whichstream_) }
/// Update the information items related to the solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.updatesolutioninfo>
pub fn update_solution_info(&mut self,whichsol_ : i32) -> Result<(),String> { self.data.task.update_solution_info(whichsol_) }
/// Checks a parameter name.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `partype_` Parameter type.
///
/// See [Parametertype]
/// - `param_` Which parameter.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.whichparam>
pub fn which_param(&self,parname_ : &str,partype_ : & mut i32,param_ : &mut i32) -> Result<(),String> { self.data.task.which_param(parname_,partype_,param_) }
/// Write a binary dump of the task solution and information items.
///
/// # Arguments
///
/// - `filename_` A valid file name.
/// - `compress_` Data compression type.
///
/// See [Compresstype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writebsolution>
pub fn write_b_solution(&self,filename_ : &str,compress_ : i32) -> Result<(),String> { self.data.task.write_b_solution(filename_,compress_) }
/// Writes problem data to a file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writedata>
pub fn write_data(&self,filename_ : &str) -> Result<(),String> { self.data.task.write_data(filename_) }
/// Writes a solution to a JSON file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writejsonsol>
pub fn write_json_sol(&self,filename_ : &str) -> Result<(),String> { self.data.task.write_json_sol(filename_) }
/// Writes all the parameters to a parameter file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writeparamfile>
pub fn write_param_file(&self,filename_ : &str) -> Result<(),String> { self.data.task.write_param_file(filename_) }
/// Write a solution to a file.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writesolution>
pub fn write_solution(&self,whichsol_ : i32,filename_ : &str) -> Result<(),String> { self.data.task.write_solution(whichsol_,filename_) }
/// Write solution file in format determined by the filename
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writesolutionfile>
pub fn write_solution_file(&self,filename_ : &str) -> Result<(),String> { self.data.task.write_solution_file(filename_) }
/// Appends a record to the statistics file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writestat>
pub fn write_stat(&mut self,filename_ : &str) -> Result<(),String> { self.data.task.write_stat(filename_) }
/// Write a complete binary dump of the task data.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writetask>
pub fn write_task(&self,filename_ : &str) -> Result<(),String> { self.data.task.write_task(filename_) }
/// Internal
///
/// # Arguments
///
/// - `filename_` A valid file name.
/// - `compress_` Data compression type.
///
/// See [Compresstype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writetasksolverresult_file>
pub fn write_task_solver_result_file(&self,filename_ : &str,compress_ : i32) -> Result<(),String> { self.data.task.write_task_solver_result_file(filename_,compress_) }
}
extern fn wrap_data_write_handle(handle : * const libc::c_void,
src : * const u8,
count : usize) -> usize {
let h = handle as * mut Box<dyn FnMut(&[u8]) -> usize>;
unsafe {
(*h)(std::slice::from_raw_parts(src,count))
}
}
struct CallbackHandle {
codecb : Option<* mut c_void>,
infocb : Option<* mut c_void>,
intsolcb : Option<* mut c_void>,
}
impl CallbackHandle {
extern fn proxy(
task : * const u8,
handle : * const c_void,
caller : i32,
dinf : * const f64,
iinf : * const i32,
liinf : * const i64) -> i32
{
let cbdata = handle as * mut CallbackHandle;
let r0 = if let Some(cb) = unsafe { (*cbdata).codecb } {
let cb : * mut c_void = cb;
let cb = cb as * mut Box<& mut dyn FnMut(i32) -> bool>;
unsafe { (*cb)(caller) }
} else {
false
};
let r1 = if let Some(cb) = unsafe { (*cbdata).infocb } {
let cb : * mut c_void = cb;
let cb = cb as * mut Box<& mut dyn FnMut(i32,&[f64],&[i32],&[i64]) -> bool>;
unsafe {
(*cb)(caller,
& std::slice::from_raw_parts(dinf, Dinfitem::END as usize),
& std::slice::from_raw_parts(iinf, Iinfitem::END as usize),
& std::slice::from_raw_parts(liinf, Liinfitem::END as usize))
}
} else {
false
};
let r2 = if let Some(cb) = unsafe { (*cbdata).intsolcb } {
let cb : * mut c_void = cb;
let cb = cb as * mut Box<& mut dyn FnMut(&[f64]) -> bool>;
if caller == Callbackcode::NEW_INT_MIO {
let mut numvar : i32 = 0;
if 0 == unsafe { MSK_getnumvar(task,& mut numvar) } {
let mut xx : Vec<f64> = vec![0.0; numvar as usize];
if 0 == unsafe { MSK_getxx(task,Soltype::ITG,xx.as_mut_ptr()) } {
unsafe {(*cb)(xx.as_slice()) }
} else {
false
}
} else {
false
}
} else {
false
}
} else {
false
};
if r0 || r1 || r2 { 1 } else { 0 }
}
}
impl Task {
/// Create a new task in the given environment or with the default environment with a given capacity
pub fn with_capacity(env : Option<&Env>, numcon : i32, numvar : i32) -> Option<Task> {
let mut task : * const u8 = std::ptr::null();
if 0 != unsafe { MSK_maketask(if let Some(e) = env {(*e).ptr} else {std::ptr::null()},
numcon,
numvar,
& mut task) } {
None
}
else {
Some(Task { ptr : task })
}
}
/// Create a new task in the given environment or with the default environment
pub fn from_env(env : Option<&Env>) -> Option<Task> { Task::with_capacity(env,0,0) }
/// Create a new task in the given environment or with the default environment
pub fn clone(&self) -> Option<Task> {
let mut task : * const u8 = std::ptr::null();
if 0 != unsafe { MSK_clonetask(self.ptr,& mut task) } {
None
}
else {
Some(Task{ptr : task})
}
}
/// Create a new task in the default environment
pub fn new() -> Option<Task> { Task::with_capacity(None,0,0) }
extern fn stream_callback_proxy<F>(handle : * const c_void, msg : * const libc::c_char)
where F : Fn(&str)
{
let func = handle as * mut F;
unsafe {
let cstr = CStr::from_ptr(msg);
let cstr_bytes = cstr.to_bytes();
let s = String::from_utf8_lossy(cstr_bytes).into_owned();
(*func)(&s);
}
}
/// Temporarily attach a stream printer function to the task.
///
/// # Arguments
/// - `whichstream` Which stream to attach to (See Streamtype)
/// - `streamfunc` The callback function
/// - `func` The function to call with the updated task. The stream callback will be attached
/// for the duration of this call.
pub fn with_stream_callback<F,G,R>(& mut self,
whichstream : i32,
streamfunc : &F,
mut func : G) -> R
where G: FnMut(& mut Task) -> R,
F: Fn(&str),
{
unsafe{
let hnd = streamfunc as * const _ as * mut c_void;
_ = MSK_linkfunctotaskstream(self.ptr, whichstream,hnd, Task::stream_callback_proxy::<F>);
}
let res = func(self);
unsafe {
_ = MSK_unlinkfuncfromtaskstream(self.ptr,whichstream);
}
res
}
/// Temporarily attach a code callback to the task.
///
/// For the duration of the call of `body`, the code callback will be set to `cbfunc`.
///
/// # Arguments
/// - `cbfunc` A callback function that may be called repeatedly
/// - `body` A function `(& mut Task) -> R` that is called exactly once.
pub fn with_callback<F,G,R>(& mut self, cbfunc : & mut F, body : G ) -> R
where G : FnOnce(& mut Task) -> R,
F : FnMut(i32) -> bool
{
let mut prev_func : * const u8 = std::ptr::null();
let mut prev_handle : * const c_void = std::ptr::null();
// We create a Box with a dyn function to make sure we pin the dyn function for the
// duration of the scope. We then convert a pointer to the box to a `* mut c_void` to
// subvert Rust's complaints about lifetimes when we pass it to MSK_putcallbackfunc and
// actually store it in unsafe-land.
//
// This work only because we now KNOW that the content of the box will exists for the
// duration of this scope, and we make sure to erase the reference in unsafe-land before
// returning.
let mut new_handle : Box<& mut dyn FnMut(i32) -> bool> = Box::new(cbfunc);
unsafe {
_ = MSK_getcallbackfunc(self.ptr,&mut prev_func,&mut prev_handle);
}
let mut cbdata = CallbackHandle {
codecb : Some(&mut new_handle as * mut _ as * mut c_void),
infocb : None,
intsolcb : None,
};
if ! prev_handle.is_null() {
cbdata.infocb = unsafe { (*(prev_handle as *const CallbackHandle)).infocb };
cbdata.intsolcb = unsafe { (*(prev_handle as *const CallbackHandle)).intsolcb };
}
// Set the new callback handle and function
unsafe {
let hnd : * mut c_void = &cbdata as * const _ as * mut c_void;
_ = MSK_putcallbackfunc(self.ptr, CallbackHandle::proxy,hnd);
}
let res = body(self);
// Reset to the old handle and function. This removes the reference to new_handle in
// unsafe-land.
// TODO: Do some kind of unwind protect to ensure that this is called, even in event of a
// panic. See: std::panic::{catch_unwind, resume_unwind}
unsafe {
_ = MSK_putcallbackfunc_ptr(self.ptr, prev_func, prev_handle);
}
res
}
/// Temporarily attach an info callback to the task.
///
/// For the duration of the call of `body`, the code callback will be set to `cbfunc`.
///
/// # Arguments
/// - `cbfunc` A callback function that may be called repeatedly
/// - `body` A function `(& mut Task) -> R` that is called exactly once.
pub fn with_info_callback<F,G,R>(& mut self, cbfunc : & mut F, body : G ) -> R
where G : FnOnce(& mut Task) -> R,
F : FnMut(i32,&[f64],&[i32],&[i64]) -> bool
{
let mut prev_func : * const u8 = std::ptr::null();
let mut prev_handle : * const c_void = std::ptr::null();
let mut new_handle : Box<& mut dyn FnMut(i32,&[f64],&[i32],&[i64]) -> bool> = Box::new(cbfunc);
unsafe {
_ = MSK_getcallbackfunc(self.ptr,&mut prev_func,&mut prev_handle);
}
let mut cbdata = CallbackHandle {
codecb : None,
infocb : Some(&mut new_handle as * mut _ as * mut c_void),
intsolcb : None,
};
if ! prev_handle.is_null() {
cbdata.codecb = unsafe { (*(prev_handle as *const CallbackHandle)).codecb };
cbdata.intsolcb = unsafe { (*(prev_handle as *const CallbackHandle)).intsolcb };
}
// Set the new callback handle and function
unsafe {
let hnd : * mut c_void = &cbdata as * const _ as * mut c_void;
_ = MSK_putcallbackfunc(self.ptr, CallbackHandle::proxy,hnd);
}
let res = body(self);
// Reset to the old handle and function. This removes the reference to new_handle in
// unsafe-land.
// TODO: Do some kind of unwind protect to ensure that this is called, even in event of a
// panic. See: std::panic::{catch_unwind, resume_unwind}
unsafe {
_ = MSK_putcallbackfunc_ptr(self.ptr, prev_func, prev_handle);
}
res
}
/// Temporarily attach an info callback to the task.
///
/// For the duration of the call of `body`, the code callback will be set to `cbfunc`.
///
/// # Arguments
/// - `cbfunc` A callback function that may be called repeatedly
/// - `body` A function `(& mut Task) -> R` that is called exactly once.
pub fn with_itg_sol_callback<F,G,R>(& mut self, cbfunc : & mut F, body : G ) -> R
where G : FnOnce(& mut Task) -> R,
F : FnMut(&[f64]) -> bool
{
let mut prev_func : * const u8 = std::ptr::null();
let mut prev_handle : * const c_void = std::ptr::null();
let mut new_handle : Box<& mut dyn FnMut(&[f64]) -> bool> = Box::new(cbfunc);
unsafe {
_ = MSK_getcallbackfunc(self.ptr,&mut prev_func,&mut prev_handle);
}
let mut cbdata = CallbackHandle {
codecb : None,
infocb : None,
intsolcb : Some(&mut new_handle as * mut _ as * mut c_void),
};
if ! prev_handle.is_null() {
cbdata.codecb = unsafe { (*(prev_handle as *const CallbackHandle)).codecb };
cbdata.infocb = unsafe { (*(prev_handle as *const CallbackHandle)).infocb };
}
// Set the new callback handle and function
unsafe {
let hnd : * mut c_void = &cbdata as * const _ as * mut c_void;
_ = MSK_putcallbackfunc(self.ptr, CallbackHandle::proxy,hnd);
}
let res = body(self);
// Reset to the old handle and function. This removes the reference to new_handle in
// unsafe-land.
// TODO: Do some kind of unwind protect to ensure that this is called, even in event of a
// panic. See: std::panic::{catch_unwind, resume_unwind}
unsafe {
_ = MSK_putcallbackfunc_ptr(self.ptr, prev_func, prev_handle);
}
res
}
/// This converts the Task object into a TaskCB object. The main
/// difference is the the TaskCB enables attaching callback
/// functions (message printing and information callbacks), and
/// that it due to the callbacks cannot be shared between multiple
/// threads.
pub fn with_callbacks(self) -> TaskCB { TaskCB::new(self) }
#[allow(unused_parens)]
fn handle_res(&self, r : i32, funname : &str) -> Result<(),String> {
return (
if 0 != r {
let mut lastsz : i64 = 0;
let mut lastcode : i32 = 0;
if 0 == unsafe{ MSK_getlasterror64(self.ptr,& mut lastcode,0,& mut lastsz,std::ptr::null_mut()) } {
let mut lastmsg : Vec<u8> = vec![0; (lastsz+1) as usize];
unsafe{ MSK_getlasterror64(self.ptr,& mut lastcode,lastsz+1,& mut lastsz,lastmsg.as_mut_ptr()) };
let lastmsgstr = String::from_utf8_lossy(&lastmsg[0..lastsz as usize]);
Result::Err(format!("Error in call to {}: ({}) {:?}",funname,r,lastmsgstr))
}
else {
handle_res_static(r,funname)
}
}
else {
Ok(())
}
);
}
pub fn write_data_stream<F>(&self, func : F, format : i32, compress : i32) -> Result<(),String>
where F : FnMut(&[u8]) -> usize {
let boxfunc : Box<dyn FnMut(&[u8]) -> usize> = Box::new(func);
let hnd = (&boxfunc) as * const _ as * mut libc::c_void;
self.handle_res(unsafe { MSK_writedatahandle(self.ptr, wrap_data_write_handle, hnd, format,compress ) }, "write_data_stream")
}
/// Analyze the names and issue an error for the first invalid name.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `nametype_` The type of names e.g. valid in MPS or LP files.
///
/// See [Nametype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.analyzenames>
#[allow(unused_parens)]
pub fn analyze_names(&self,whichstream_ : i32,nametype_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_analyzenames(self.ptr,whichstream_,nametype_) },"analyze_names")?;
return Result::Ok(());
} // analyzenames
/// Analyze the data of a task.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.analyzeproblem>
#[allow(unused_parens)]
pub fn analyze_problem(&self,whichstream_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_analyzeproblem(self.ptr,whichstream_) },"analyze_problem")?;
return Result::Ok(());
} // analyzeproblem
/// Print information related to the quality of the solution.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.analyzesolution>
#[allow(unused_parens)]
pub fn analyze_solution(&self,whichstream_ : i32,whichsol_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_analyzesolution(self.ptr,whichstream_,whichsol_) },"analyze_solution")?;
return Result::Ok(());
} // analyzesolution
/// Appends an affine conic constraint to the task.
///
/// # Arguments
///
/// - `domidx_` Domain index.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendacc>
#[allow(unused_parens)]
pub fn append_acc(&mut self,domidx_ : i64,afeidxlist_ : &[i64],b_ : &[f64]) -> Result<(),String> {
let numafeidx_ : i64 = afeidxlist_.len() as i64;
if b_.len() > 0 && b_.len() != (numafeidx_).try_into().unwrap() {
return Result::Err("append_acc: Argument 'b' has the wrong length, expected numafeidx_".to_string());
}
self.handle_res(unsafe { MSK_appendacc(self.ptr,domidx_,numafeidx_,afeidxlist_.as_ptr(),if b_.len() == 0 { std::ptr::null() } else { b_.as_ptr() }) },"append_acc")?;
return Result::Ok(());
} // appendacc
/// Appends a number of affine conic constraint to the task.
///
/// # Arguments
///
/// - `domidxs_` Domain indices.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendaccs>
#[allow(unused_parens)]
pub fn append_accs(&mut self,domidxs_ : &[i64],afeidxlist_ : &[i64],b_ : &[f64]) -> Result<(),String> {
let numaccs_ : i64 = domidxs_.len() as i64;
let numafeidx_ : i64 = afeidxlist_.len() as i64;
if b_.len() > 0 && b_.len() != (numafeidx_).try_into().unwrap() {
return Result::Err("append_accs: Argument 'b' has the wrong length, expected numafeidx_".to_string());
}
self.handle_res(unsafe { MSK_appendaccs(self.ptr,numaccs_,domidxs_.as_ptr(),numafeidx_,afeidxlist_.as_ptr(),if b_.len() == 0 { std::ptr::null() } else { b_.as_ptr() }) },"append_accs")?;
return Result::Ok(());
} // appendaccs
/// Appends an affine conic constraint to the task.
///
/// # Arguments
///
/// - `domidx_` Domain index.
/// - `afeidxfirst_` Index of the first affine expression.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendaccseq>
#[allow(unused_parens)]
pub fn append_acc_seq(&mut self,domidx_ : i64,afeidxfirst_ : i64,b_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getdomainn(self.ptr,domidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getdomainn")?;
let numafeidx_ : i64 = __tmp_0;
if b_.len() > 0 && b_.len() != (numafeidx_).try_into().unwrap() {
return Result::Err("append_acc_seq: Argument 'b' has the wrong length, expected numafeidx_".to_string());
}
self.handle_res(unsafe { MSK_appendaccseq(self.ptr,domidx_,numafeidx_,afeidxfirst_,if b_.len() == 0 { std::ptr::null() } else { b_.as_ptr() }) },"append_acc_seq")?;
return Result::Ok(());
} // appendaccseq
/// Appends a number of affine conic constraint to the task.
///
/// # Arguments
///
/// - `domidxs_` Domain indices.
/// - `numafeidx_` Number of affine expressions in the affine expression list (must equal the sum of dimensions of the domains).
/// - `afeidxfirst_` Index of the first affine expression.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendaccsseq>
#[allow(unused_parens)]
pub fn append_accs_seq(&mut self,domidxs_ : &[i64],numafeidx_ : i64,afeidxfirst_ : i64,b_ : &[f64]) -> Result<(),String> {
let numaccs_ : i64 = domidxs_.len() as i64;
if b_.len() > 0 && b_.len() != (numafeidx_).try_into().unwrap() {
return Result::Err("append_accs_seq: Argument 'b' has the wrong length, expected numafeidx_".to_string());
}
self.handle_res(unsafe { MSK_appendaccsseq(self.ptr,numaccs_,domidxs_.as_ptr(),numafeidx_,afeidxfirst_,if b_.len() == 0 { std::ptr::null() } else { b_.as_ptr() }) },"append_accs_seq")?;
return Result::Ok(());
} // appendaccsseq
/// Appends a number of empty affine expressions to the optimization task.
///
/// # Arguments
///
/// - `num_` Number of empty affine expressions which should be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendafes>
#[allow(unused_parens)]
pub fn append_afes(&mut self,num_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_appendafes(self.ptr,num_) },"append_afes")?;
return Result::Ok(());
} // appendafes
/// Appends semidefinite variables to the problem.
///
/// # Arguments
///
/// - `dim_` Dimensions of symmetric matrix variables to be added.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendbarvars>
#[allow(unused_parens)]
pub fn append_barvars(&mut self,dim_ : &[i32]) -> Result<(),String> {
let num_ : i32 = dim_.len() as i32;
self.handle_res(unsafe { MSK_appendbarvars(self.ptr,num_,dim_.as_ptr()) },"append_barvars")?;
return Result::Ok(());
} // appendbarvars
/// Appends a new conic constraint to the problem.
///
/// # Arguments
///
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `submem_` Variable subscripts of the members in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendcone>
#[allow(unused_parens)]
pub fn append_cone(&mut self,ct_ : i32,conepar_ : f64,submem_ : &[i32]) -> Result<(),String> {
let nummem_ : i32 = submem_.len() as i32;
self.handle_res(unsafe { MSK_appendcone(self.ptr,ct_,conepar_,nummem_,submem_.as_ptr()) },"append_cone")?;
return Result::Ok(());
} // appendcone
/// Appends a new conic constraint to the problem.
///
/// # Arguments
///
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `nummem_` Number of member variables in the cone.
/// - `j_` Index of the first variable in the conic constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendconeseq>
#[allow(unused_parens)]
pub fn append_cone_seq(&mut self,ct_ : i32,conepar_ : f64,nummem_ : i32,j_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_appendconeseq(self.ptr,ct_,conepar_,nummem_,j_) },"append_cone_seq")?;
return Result::Ok(());
} // appendconeseq
/// Appends multiple conic constraints to the problem.
///
/// # Arguments
///
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `nummem_` Numbers of member variables in the cones.
/// - `j_` Index of the first variable in the first cone to be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendconesseq>
#[allow(unused_parens)]
pub fn append_cones_seq(&mut self,ct_ : &[i32],conepar_ : &[f64],nummem_ : &[i32],j_ : i32) -> Result<(),String> {
let num_ : i32 = std::cmp::min(std::cmp::min(ct_.len(),conepar_.len()),nummem_.len()) as i32;
self.handle_res(unsafe { MSK_appendconesseq(self.ptr,num_,ct_.as_ptr(),conepar_.as_ptr(),nummem_.as_ptr(),j_) },"append_cones_seq")?;
return Result::Ok(());
} // appendconesseq
/// Appends a number of constraints to the optimization task.
///
/// # Arguments
///
/// - `num_` Number of constraints which should be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendcons>
#[allow(unused_parens)]
pub fn append_cons(&mut self,num_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_appendcons(self.ptr,num_) },"append_cons")?;
return Result::Ok(());
} // appendcons
/// Appends a number of empty disjunctive constraints to the task.
///
/// # Arguments
///
/// - `num_` Number of empty disjunctive constraints which should be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appenddjcs>
#[allow(unused_parens)]
pub fn append_djcs(&mut self,num_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_appenddjcs(self.ptr,num_) },"append_djcs")?;
return Result::Ok(());
} // appenddjcs
/// Appends the dual exponential cone domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appenddualexpconedomain>
#[allow(unused_parens)]
pub fn append_dual_exp_cone_domain(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appenddualexpconedomain(self.ptr,&mut __tmp_0) },"append_dual_exp_cone_domain")?;
return Result::Ok(__tmp_0);
} // appenddualexpconedomain
/// Appends the dual geometric mean cone domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appenddualgeomeanconedomain>
#[allow(unused_parens)]
pub fn append_dual_geo_mean_cone_domain(&mut self,n_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appenddualgeomeanconedomain(self.ptr,n_,&mut __tmp_0) },"append_dual_geo_mean_cone_domain")?;
return Result::Ok(__tmp_0);
} // appenddualgeomeanconedomain
/// Appends the dual power cone domain.
///
/// # Arguments
///
/// - `n_` Dimension of the domain.
/// - `alpha_` The sequence proportional to exponents. Must be positive.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appenddualpowerconedomain>
#[allow(unused_parens)]
pub fn append_dual_power_cone_domain(&mut self,n_ : i64,alpha_ : &[f64]) -> Result<i64,String> {
let nleft_ : i64 = alpha_.len() as i64;
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appenddualpowerconedomain(self.ptr,n_,nleft_,alpha_.as_ptr(),&mut __tmp_0) },"append_dual_power_cone_domain")?;
return Result::Ok(__tmp_0);
} // appenddualpowerconedomain
/// Appends the primal exponential cone domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendprimalexpconedomain>
#[allow(unused_parens)]
pub fn append_primal_exp_cone_domain(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendprimalexpconedomain(self.ptr,&mut __tmp_0) },"append_primal_exp_cone_domain")?;
return Result::Ok(__tmp_0);
} // appendprimalexpconedomain
/// Appends the primal geometric mean cone domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendprimalgeomeanconedomain>
#[allow(unused_parens)]
pub fn append_primal_geo_mean_cone_domain(&mut self,n_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendprimalgeomeanconedomain(self.ptr,n_,&mut __tmp_0) },"append_primal_geo_mean_cone_domain")?;
return Result::Ok(__tmp_0);
} // appendprimalgeomeanconedomain
/// Appends the primal power cone domain.
///
/// # Arguments
///
/// - `n_` Dimension of the domain.
/// - `alpha_` The sequence proportional to exponents. Must be positive.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendprimalpowerconedomain>
#[allow(unused_parens)]
pub fn append_primal_power_cone_domain(&mut self,n_ : i64,alpha_ : &[f64]) -> Result<i64,String> {
let nleft_ : i64 = alpha_.len() as i64;
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendprimalpowerconedomain(self.ptr,n_,nleft_,alpha_.as_ptr(),&mut __tmp_0) },"append_primal_power_cone_domain")?;
return Result::Ok(__tmp_0);
} // appendprimalpowerconedomain
/// Appends the n dimensional quadratic cone domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendquadraticconedomain>
#[allow(unused_parens)]
pub fn append_quadratic_cone_domain(&mut self,n_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendquadraticconedomain(self.ptr,n_,&mut __tmp_0) },"append_quadratic_cone_domain")?;
return Result::Ok(__tmp_0);
} // appendquadraticconedomain
/// Appends the n dimensional real number domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrdomain>
#[allow(unused_parens)]
pub fn append_r_domain(&mut self,n_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendrdomain(self.ptr,n_,&mut __tmp_0) },"append_r_domain")?;
return Result::Ok(__tmp_0);
} // appendrdomain
/// Appends the n dimensional negative orthant to the list of domains.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrminusdomain>
#[allow(unused_parens)]
pub fn append_rminus_domain(&mut self,n_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendrminusdomain(self.ptr,n_,&mut __tmp_0) },"append_rminus_domain")?;
return Result::Ok(__tmp_0);
} // appendrminusdomain
/// Appends the n dimensional positive orthant to the list of domains.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrplusdomain>
#[allow(unused_parens)]
pub fn append_rplus_domain(&mut self,n_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendrplusdomain(self.ptr,n_,&mut __tmp_0) },"append_rplus_domain")?;
return Result::Ok(__tmp_0);
} // appendrplusdomain
/// Appends the n dimensional rotated quadratic cone domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrquadraticconedomain>
#[allow(unused_parens)]
pub fn append_r_quadratic_cone_domain(&mut self,n_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendrquadraticconedomain(self.ptr,n_,&mut __tmp_0) },"append_r_quadratic_cone_domain")?;
return Result::Ok(__tmp_0);
} // appendrquadraticconedomain
/// Appends the n dimensional 0 domain.
///
/// # Arguments
///
/// - `n_` Dimmension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendrzerodomain>
#[allow(unused_parens)]
pub fn append_rzero_domain(&mut self,n_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendrzerodomain(self.ptr,n_,&mut __tmp_0) },"append_rzero_domain")?;
return Result::Ok(__tmp_0);
} // appendrzerodomain
/// Appends a general sparse symmetric matrix to the storage of symmetric matrices.
///
/// # Arguments
///
/// - `dim_` Dimension of the symmetric matrix that is appended.
/// - `subi_` Row subscript in the triplets.
/// - `subj_` Column subscripts in the triplets.
/// - `valij_` Values of each triplet.
///
/// # Returns
///
/// - `idx` Unique index assigned to the inputted matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendsparsesymmat>
#[allow(unused_parens)]
pub fn append_sparse_sym_mat(&mut self,dim_ : i32,subi_ : &[i32],subj_ : &[i32],valij_ : &[f64]) -> Result<i64,String> {
let nz_ : i64 = std::cmp::min(std::cmp::min(valij_.len(),subi_.len()),subj_.len()) as i64;
let mut __tmp_0 : i64 = i64::default();
if subi_.len() != subj_.len() || subi_.len() != valij_.len() { return Err("append_sparse_sym_mat: Mismatching lengths if subi, subj and valij".to_string()); }
self.handle_res(unsafe { MSK_appendsparsesymmat(self.ptr,dim_,nz_,subi_.as_ptr(),subj_.as_ptr(),valij_.as_ptr(),&mut __tmp_0) },"append_sparse_sym_mat")?;
return Result::Ok(__tmp_0);
} // appendsparsesymmat
/// Appends a general sparse symmetric matrix to the storage of symmetric matrices.
///
/// # Arguments
///
/// - `dims_` Dimensions of the symmetric matrixes.
/// - `nz_` Number of nonzeros for each matrix.
/// - `subi_` Row subscript in the triplets.
/// - `subj_` Column subscripts in the triplets.
/// - `valij_` Values of each triplet.
/// - `idx_` Unique index assigned to the inputted matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendsparsesymmatlist>
#[allow(unused_parens)]
pub fn append_sparse_sym_mat_list(&mut self,dims_ : &[i32],nz_ : &[i64],subi_ : &[i32],subj_ : &[i32],valij_ : &[f64],idx_ : &mut[i64]) -> Result<(),String> {
let num_ : i32 = std::cmp::min(dims_.len(),nz_.len()) as i32;
let mut __tmp_0 : i64 = i64::default();
for __tmp_1 in nz_ { __tmp_0 += __tmp_1; }
if subi_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("append_sparse_sym_mat_list: Argument 'subi' has the wrong length, expected __tmp_0".to_string());
}
let mut __tmp_2 : i64 = i64::default();
for __tmp_3 in nz_ { __tmp_2 += __tmp_3; }
if subj_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("append_sparse_sym_mat_list: Argument 'subj' has the wrong length, expected __tmp_2".to_string());
}
let mut __tmp_4 : i64 = i64::default();
for __tmp_5 in nz_ { __tmp_4 += __tmp_5; }
if valij_.len() != (__tmp_4).try_into().unwrap() {
return Result::Err("append_sparse_sym_mat_list: Argument 'valij' has the wrong length, expected __tmp_4".to_string());
}
if idx_.len() != (num_).try_into().unwrap() {
return Result::Err("append_sparse_sym_mat_list: Argument 'idx' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_appendsparsesymmatlist(self.ptr,num_,dims_.as_ptr(),nz_.as_ptr(),subi_.as_ptr(),subj_.as_ptr(),valij_.as_ptr(),idx_.as_mut_ptr()) },"append_sparse_sym_mat_list")?;
return Result::Ok(());
} // appendsparsesymmatlist
/// Appends the vectorized SVEC PSD cone domain.
///
/// # Arguments
///
/// - `n_` Dimension of the domain.
///
/// # Returns
///
/// - `domidx` Index of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendsvecpsdconedomain>
#[allow(unused_parens)]
pub fn append_svec_psd_cone_domain(&mut self,n_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_appendsvecpsdconedomain(self.ptr,n_,&mut __tmp_0) },"append_svec_psd_cone_domain")?;
return Result::Ok(__tmp_0);
} // appendsvecpsdconedomain
/// Appends a number of variables to the optimization task.
///
/// # Arguments
///
/// - `num_` Number of variables which should be appended.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.appendvars>
#[allow(unused_parens)]
pub fn append_vars(&mut self,num_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_appendvars(self.ptr,num_) },"append_vars")?;
return Result::Ok(());
} // appendvars
/// Get the optimizer log from a remote job.
///
/// # Arguments
///
/// - `addr_` Address of the solver server
/// - `accesstoken_` Access token string.
/// - `token_` Job token
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncgetlog>
#[allow(unused_parens)]
pub fn async_get_log(&mut self,addr_ : &str,accesstoken_ : &str,token_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(addr_).unwrap();
let __tmp_3 = CString::new(accesstoken_).unwrap();
let __tmp_5 = CString::new(token_).unwrap();
self.handle_res(unsafe { MSK_asyncgetlog(self.ptr,__tmp_1.as_ptr(),__tmp_3.as_ptr(),__tmp_5.as_ptr()) },"async_get_log")?;
return Result::Ok(());
} // asyncgetlog
/// Request a solution from a remote job.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
/// - `token_` The task token.
/// - `resp_` Is the response code from the remote solver.
///
/// See [Rescode]
/// - `trm_` Is either OK or a termination response code.
///
/// See [Rescode]
///
/// # Returns
///
/// - `respavailable` Indicates if a remote response is available.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncgetresult>
#[allow(unused_parens)]
pub fn async_get_result(&mut self,address_ : &str,accesstoken_ : &str,token_ : &str,resp_ : & mut i32,trm_ : & mut i32) -> Result<bool,String> {
let __tmp_1 = CString::new(address_).unwrap();
let __tmp_3 = CString::new(accesstoken_).unwrap();
let __tmp_5 = CString::new(token_).unwrap();
let mut __tmp_6 : i32 = 0;
self.handle_res(unsafe { MSK_asyncgetresult(self.ptr,__tmp_1.as_ptr(),__tmp_3.as_ptr(),__tmp_5.as_ptr(),&mut __tmp_6,resp_,trm_) },"async_get_result")?;
return Result::Ok(__tmp_6 != 0);
} // asyncgetresult
/// Offload the optimization task to a solver server in asynchronous mode.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
///
/// # Returns
///
/// - `token` Returns the task token.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncoptimize>
#[allow(unused_parens)]
pub fn async_optimize(&mut self,address_ : &str,accesstoken_ : &str) -> Result<String,String> {
let __tmp_1 = CString::new(address_).unwrap();
let __tmp_3 = CString::new(accesstoken_).unwrap();
let mut token_ = Vec::new(); token_.resize(65 as usize,0);
self.handle_res(unsafe { MSK_asyncoptimize(self.ptr,__tmp_1.as_ptr(),__tmp_3.as_ptr(),token_.as_mut_ptr()) },"async_optimize")?;
return Result::Ok(String::from_utf8_lossy(&token_[..token_.iter().position(|&c| c == 0).unwrap_or(65 as usize)]).into_owned());
} // asyncoptimize
/// Requests information about the status of the remote job.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
/// - `token_` The task token.
/// - `resp_` Is the response code from the remote solver.
///
/// See [Rescode]
/// - `trm_` Is either OK or a termination response code.
///
/// See [Rescode]
///
/// # Returns
///
/// - `respavailable` Indicates if a remote response is available.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncpoll>
#[allow(unused_parens)]
pub fn async_poll(&mut self,address_ : &str,accesstoken_ : &str,token_ : &str,resp_ : & mut i32,trm_ : & mut i32) -> Result<bool,String> {
let __tmp_1 = CString::new(address_).unwrap();
let __tmp_3 = CString::new(accesstoken_).unwrap();
let __tmp_5 = CString::new(token_).unwrap();
let mut __tmp_6 : i32 = 0;
self.handle_res(unsafe { MSK_asyncpoll(self.ptr,__tmp_1.as_ptr(),__tmp_3.as_ptr(),__tmp_5.as_ptr(),&mut __tmp_6,resp_,trm_) },"async_poll")?;
return Result::Ok(__tmp_6 != 0);
} // asyncpoll
/// Request that the job identified by the token is terminated.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
/// - `token_` The task token.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.asyncstop>
#[allow(unused_parens)]
pub fn async_stop(&mut self,address_ : &str,accesstoken_ : &str,token_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(address_).unwrap();
let __tmp_3 = CString::new(accesstoken_).unwrap();
let __tmp_5 = CString::new(token_).unwrap();
self.handle_res(unsafe { MSK_asyncstop(self.ptr,__tmp_1.as_ptr(),__tmp_3.as_ptr(),__tmp_5.as_ptr()) },"async_stop")?;
return Result::Ok(());
} // asyncstop
/// Computes conditioning information for the basis matrix.
///
/// # Arguments
///
/// - `nrmbasis_` An estimate for the 1-norm of the basis.
/// - `nrminvbasis_` An estimate for the 1-norm of the inverse of the basis.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.basiscond>
#[allow(unused_parens)]
pub fn basis_cond(&mut self,nrmbasis_ : &mut f64,nrminvbasis_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_basiscond(self.ptr,nrmbasis_,nrminvbasis_) },"basis_cond")?;
return Result::Ok(());
} // basiscond
/// Checks the memory allocated by the task.
///
/// # Arguments
///
/// - `file_` File from which the function is called.
/// - `line_` Line in the file from which the function is called.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkmemtask>
#[allow(unused_parens)]
pub fn check_mem(&mut self,file_ : &str,line_ : i32) -> Result<(),String> {
let __tmp_1 = CString::new(file_).unwrap();
self.handle_res(unsafe { MSK_checkmemtask(self.ptr,__tmp_1.as_ptr(),line_) },"check_mem")?;
return Result::Ok(());
} // checkmemtask
/// Changes the bounds for one constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint for which the bounds should be changed.
/// - `lower_` If non-zero, then the lower bound is changed, otherwise the upper bound is changed.
/// - `finite_` If non-zero, then the given value is assumed to be finite.
/// - `value_` New value for the bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.chgconbound>
#[allow(unused_parens)]
pub fn chg_con_bound(&mut self,i_ : i32,lower_ : i32,finite_ : i32,value_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_chgconbound(self.ptr,i_,lower_,finite_,value_) },"chg_con_bound")?;
return Result::Ok(());
} // chgconbound
/// Changes the bounds for one variable.
///
/// # Arguments
///
/// - `j_` Index of the variable for which the bounds should be changed.
/// - `lower_` If non-zero, then the lower bound is changed, otherwise the upper bound is changed.
/// - `finite_` If non-zero, then the given value is assumed to be finite.
/// - `value_` New value for the bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.chgvarbound>
#[allow(unused_parens)]
pub fn chg_var_bound(&mut self,j_ : i32,lower_ : i32,finite_ : i32,value_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_chgvarbound(self.ptr,j_,lower_,finite_,value_) },"chg_var_bound")?;
return Result::Ok(());
} // chgvarbound
/// Commits all cached problem changes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.commitchanges>
#[allow(unused_parens)]
pub fn commit_changes(&mut self) -> Result<(),String> {
self.handle_res(unsafe { MSK_commitchanges(self.ptr) },"commit_changes")?;
return Result::Ok(());
} // commitchanges
/// Undefine a solution and free the memory it uses.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.deletesolution>
#[allow(unused_parens)]
pub fn delete_solution(&mut self,whichsol_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_deletesolution(self.ptr,whichsol_) },"delete_solution")?;
return Result::Ok(());
} // deletesolution
/// Performs sensitivity analysis on objective coefficients.
///
/// # Arguments
///
/// - `subj_` Indexes of objective coefficients to analyze.
/// - `leftpricej_` Left shadow prices for requested coefficients.
/// - `rightpricej_` Right shadow prices for requested coefficients.
/// - `leftrangej_` Left range for requested coefficients.
/// - `rightrangej_` Right range for requested coefficients.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.dualsensitivity>
#[allow(unused_parens)]
pub fn dual_sensitivity(&self,subj_ : &[i32],leftpricej_ : &mut[f64],rightpricej_ : &mut[f64],leftrangej_ : &mut[f64],rightrangej_ : &mut[f64]) -> Result<(),String> {
let numj_ : i32 = subj_.len() as i32;
if leftpricej_.len() > 0 && leftpricej_.len() != (numj_).try_into().unwrap() {
return Result::Err("dual_sensitivity: Argument 'leftpricej' has the wrong length, expected numj_".to_string());
}
if rightpricej_.len() > 0 && rightpricej_.len() != (numj_).try_into().unwrap() {
return Result::Err("dual_sensitivity: Argument 'rightpricej' has the wrong length, expected numj_".to_string());
}
if leftrangej_.len() > 0 && leftrangej_.len() != (numj_).try_into().unwrap() {
return Result::Err("dual_sensitivity: Argument 'leftrangej' has the wrong length, expected numj_".to_string());
}
if rightrangej_.len() > 0 && rightrangej_.len() != (numj_).try_into().unwrap() {
return Result::Err("dual_sensitivity: Argument 'rightrangej' has the wrong length, expected numj_".to_string());
}
self.handle_res(unsafe { MSK_dualsensitivity(self.ptr,numj_,subj_.as_ptr(),if leftpricej_.len() == 0 { std::ptr::null_mut() } else { leftpricej_.as_mut_ptr() },if rightpricej_.len() == 0 { std::ptr::null_mut() } else { rightpricej_.as_mut_ptr() },if leftrangej_.len() == 0 { std::ptr::null_mut() } else { leftrangej_.as_mut_ptr() },if rightrangej_.len() == 0 { std::ptr::null_mut() } else { rightrangej_.as_mut_ptr() }) },"dual_sensitivity")?;
return Result::Ok(());
} // dualsensitivity
/// Clears a row in barF
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafebarfrow>
#[allow(unused_parens)]
pub fn empty_afe_barf_row(&mut self,afeidx_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_emptyafebarfrow(self.ptr,afeidx_) },"empty_afe_barf_row")?;
return Result::Ok(());
} // emptyafebarfrow
/// Clears rows in barF.
///
/// # Arguments
///
/// - `afeidxlist_` Indices of rows in barF to clear.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafebarfrowlist>
#[allow(unused_parens)]
pub fn empty_afe_barf_row_list(&mut self,afeidxlist_ : &[i64]) -> Result<(),String> {
let numafeidx_ : i64 = afeidxlist_.len() as i64;
self.handle_res(unsafe { MSK_emptyafebarfrowlist(self.ptr,numafeidx_,afeidxlist_.as_ptr()) },"empty_afe_barf_row_list")?;
return Result::Ok(());
} // emptyafebarfrowlist
/// Clears a column in F.
///
/// # Arguments
///
/// - `varidx_` Variable index.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafefcol>
#[allow(unused_parens)]
pub fn empty_afe_f_col(&mut self,varidx_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_emptyafefcol(self.ptr,varidx_) },"empty_afe_f_col")?;
return Result::Ok(());
} // emptyafefcol
/// Clears columns in F.
///
/// # Arguments
///
/// - `varidx_` Indices of variables in F to clear.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafefcollist>
#[allow(unused_parens)]
pub fn empty_afe_f_col_list(&mut self,varidx_ : &[i32]) -> Result<(),String> {
let numvaridx_ : i64 = varidx_.len() as i64;
self.handle_res(unsafe { MSK_emptyafefcollist(self.ptr,numvaridx_,varidx_.as_ptr()) },"empty_afe_f_col_list")?;
return Result::Ok(());
} // emptyafefcollist
/// Clears a row in F.
///
/// # Arguments
///
/// - `afeidx_` Row index.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafefrow>
#[allow(unused_parens)]
pub fn empty_afe_f_row(&mut self,afeidx_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_emptyafefrow(self.ptr,afeidx_) },"empty_afe_f_row")?;
return Result::Ok(());
} // emptyafefrow
/// Clears rows in F.
///
/// # Arguments
///
/// - `afeidx_` Indices of rows in F to clear.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.emptyafefrowlist>
#[allow(unused_parens)]
pub fn empty_afe_f_row_list(&mut self,afeidx_ : &[i64]) -> Result<(),String> {
let numafeidx_ : i64 = afeidx_.len() as i64;
self.handle_res(unsafe { MSK_emptyafefrowlist(self.ptr,numafeidx_,afeidx_.as_ptr()) },"empty_afe_f_row_list")?;
return Result::Ok(());
} // emptyafefrowlist
/// Evaluates the activity of an affine conic constraint.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidx_` The index of the affine conic constraint.
/// - `activity_` The activity of the affine conic constraint. The array should have length equal to the dimension of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.evaluateacc>
#[allow(unused_parens)]
pub fn evaluate_acc(&self,whichsol_ : i32,accidx_ : i64,activity_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccn(self.ptr,accidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccn")?;
if activity_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("evaluate_acc: Argument 'activity' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_evaluateacc(self.ptr,whichsol_,accidx_,activity_.as_mut_ptr()) },"evaluate_acc")?;
return Result::Ok(());
} // evaluateacc
/// Evaluates the activities of all affine conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `activity_` The activity of affine conic constraints. The array should have length equal to the sum of dimensions of all affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.evaluateaccs>
#[allow(unused_parens)]
pub fn evaluate_accs(&self,whichsol_ : i32,activity_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccntot(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccntot")?;
if activity_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("evaluate_accs: Argument 'activity' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_evaluateaccs(self.ptr,whichsol_,activity_.as_mut_ptr()) },"evaluate_accs")?;
return Result::Ok(());
} // evaluateaccs
/// Generates systematic names for affine conic constraints.
///
/// # Arguments
///
/// - `sub_` Indexes of the affine conic constraints.
/// - `fmt_` The variable name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generateaccnames>
#[allow(unused_parens)]
pub fn generate_acc_names(&mut self,sub_ : &[i64],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> {
let num_ : i64 = sub_.len() as i64;
let __tmp_1 = CString::new(fmt_).unwrap();
let ndims_ : i32 = dims_.len() as i32;
if sp_.len() > 0 && sp_.len() != (num_).try_into().unwrap() {
return Result::Err("generate_acc_names: Argument 'sp' has the wrong length, expected num_".to_string());
}
let numnamedaxis_ : i32 = namedaxisidxs_.len() as i32;
let numnames_ : i64 = names_.len() as i64;
let cstr_names : Vec<CString> = names_.iter().map(|s| CString::new(s.as_str()).unwrap()).collect();
let cptr_names : Vec<* const libc::c_char> = cstr_names.iter().map(|s| s.as_ptr()).collect();
self.handle_res(unsafe { MSK_generateaccnames(self.ptr,num_,sub_.as_ptr(),__tmp_1.as_ptr(),ndims_,dims_.as_ptr(),if sp_.len() == 0 { std::ptr::null() } else { sp_.as_ptr() },numnamedaxis_,if namedaxisidxs_.len() == 0 { std::ptr::null() } else { namedaxisidxs_.as_ptr() },numnames_,cptr_names.as_ptr()) },"generate_acc_names")?;
return Result::Ok(());
} // generateaccnames
/// Generates systematic names for variables.
///
/// # Arguments
///
/// - `subj_` Indexes of the variables.
/// - `fmt_` The variable name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generatebarvarnames>
#[allow(unused_parens)]
pub fn generate_barvar_names(&mut self,subj_ : &[i32],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> {
let num_ : i32 = subj_.len() as i32;
let __tmp_1 = CString::new(fmt_).unwrap();
let ndims_ : i32 = dims_.len() as i32;
if sp_.len() > 0 && sp_.len() != (num_).try_into().unwrap() {
return Result::Err("generate_barvar_names: Argument 'sp' has the wrong length, expected num_".to_string());
}
let numnamedaxis_ : i32 = namedaxisidxs_.len() as i32;
let numnames_ : i64 = names_.len() as i64;
let cstr_names : Vec<CString> = names_.iter().map(|s| CString::new(s.as_str()).unwrap()).collect();
let cptr_names : Vec<* const libc::c_char> = cstr_names.iter().map(|s| s.as_ptr()).collect();
self.handle_res(unsafe { MSK_generatebarvarnames(self.ptr,num_,subj_.as_ptr(),__tmp_1.as_ptr(),ndims_,dims_.as_ptr(),if sp_.len() == 0 { std::ptr::null() } else { sp_.as_ptr() },numnamedaxis_,if namedaxisidxs_.len() == 0 { std::ptr::null() } else { namedaxisidxs_.as_ptr() },numnames_,cptr_names.as_ptr()) },"generate_barvar_names")?;
return Result::Ok(());
} // generatebarvarnames
/// Generates systematic names for cone.
///
/// # Arguments
///
/// - `subk_` Indexes of the cone.
/// - `fmt_` The cone name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generateconenames>
#[allow(unused_parens)]
pub fn generate_cone_names(&mut self,subk_ : &[i32],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> {
let num_ : i32 = subk_.len() as i32;
let __tmp_1 = CString::new(fmt_).unwrap();
let ndims_ : i32 = dims_.len() as i32;
if sp_.len() > 0 && sp_.len() != (num_).try_into().unwrap() {
return Result::Err("generate_cone_names: Argument 'sp' has the wrong length, expected num_".to_string());
}
let numnamedaxis_ : i32 = namedaxisidxs_.len() as i32;
let numnames_ : i64 = names_.len() as i64;
let cstr_names : Vec<CString> = names_.iter().map(|s| CString::new(s.as_str()).unwrap()).collect();
let cptr_names : Vec<* const libc::c_char> = cstr_names.iter().map(|s| s.as_ptr()).collect();
self.handle_res(unsafe { MSK_generateconenames(self.ptr,num_,subk_.as_ptr(),__tmp_1.as_ptr(),ndims_,dims_.as_ptr(),if sp_.len() == 0 { std::ptr::null() } else { sp_.as_ptr() },numnamedaxis_,if namedaxisidxs_.len() == 0 { std::ptr::null() } else { namedaxisidxs_.as_ptr() },numnames_,cptr_names.as_ptr()) },"generate_cone_names")?;
return Result::Ok(());
} // generateconenames
/// Generates systematic names for constraints.
///
/// # Arguments
///
/// - `subi_` Indexes of the constraints.
/// - `fmt_` The constraint name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generateconnames>
#[allow(unused_parens)]
pub fn generate_con_names(&mut self,subi_ : &[i32],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> {
let num_ : i32 = subi_.len() as i32;
let __tmp_1 = CString::new(fmt_).unwrap();
let ndims_ : i32 = dims_.len() as i32;
if sp_.len() > 0 && sp_.len() != (num_).try_into().unwrap() {
return Result::Err("generate_con_names: Argument 'sp' has the wrong length, expected num_".to_string());
}
let numnamedaxis_ : i32 = namedaxisidxs_.len() as i32;
let numnames_ : i64 = names_.len() as i64;
let cstr_names : Vec<CString> = names_.iter().map(|s| CString::new(s.as_str()).unwrap()).collect();
let cptr_names : Vec<* const libc::c_char> = cstr_names.iter().map(|s| s.as_ptr()).collect();
self.handle_res(unsafe { MSK_generateconnames(self.ptr,num_,subi_.as_ptr(),__tmp_1.as_ptr(),ndims_,dims_.as_ptr(),if sp_.len() == 0 { std::ptr::null() } else { sp_.as_ptr() },numnamedaxis_,if namedaxisidxs_.len() == 0 { std::ptr::null() } else { namedaxisidxs_.as_ptr() },numnames_,cptr_names.as_ptr()) },"generate_con_names")?;
return Result::Ok(());
} // generateconnames
/// Generates systematic names for affine conic constraints.
///
/// # Arguments
///
/// - `sub_` Indexes of the disjunctive constraints.
/// - `fmt_` The variable name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generatedjcnames>
#[allow(unused_parens)]
pub fn generate_djc_names(&mut self,sub_ : &[i64],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> {
let num_ : i64 = sub_.len() as i64;
let __tmp_1 = CString::new(fmt_).unwrap();
let ndims_ : i32 = dims_.len() as i32;
if sp_.len() > 0 && sp_.len() != (num_).try_into().unwrap() {
return Result::Err("generate_djc_names: Argument 'sp' has the wrong length, expected num_".to_string());
}
let numnamedaxis_ : i32 = namedaxisidxs_.len() as i32;
let numnames_ : i64 = names_.len() as i64;
let cstr_names : Vec<CString> = names_.iter().map(|s| CString::new(s.as_str()).unwrap()).collect();
let cptr_names : Vec<* const libc::c_char> = cstr_names.iter().map(|s| s.as_ptr()).collect();
self.handle_res(unsafe { MSK_generatedjcnames(self.ptr,num_,sub_.as_ptr(),__tmp_1.as_ptr(),ndims_,dims_.as_ptr(),if sp_.len() == 0 { std::ptr::null() } else { sp_.as_ptr() },numnamedaxis_,if namedaxisidxs_.len() == 0 { std::ptr::null() } else { namedaxisidxs_.as_ptr() },numnames_,cptr_names.as_ptr()) },"generate_djc_names")?;
return Result::Ok(());
} // generatedjcnames
/// Generates systematic names for variables.
///
/// # Arguments
///
/// - `subj_` Indexes of the variables.
/// - `fmt_` The variable name formatting string.
/// - `dims_` Dimensions in the shape.
/// - `sp_` Items that should be named.
/// - `namedaxisidxs_` List if named index axes
/// - `names_` All axis names.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.generatevarnames>
#[allow(unused_parens)]
pub fn generate_var_names(&mut self,subj_ : &[i32],fmt_ : &str,dims_ : &[i32],sp_ : &[i64],namedaxisidxs_ : &[i32],names_ : &[String]) -> Result<(),String> {
let num_ : i32 = subj_.len() as i32;
let __tmp_1 = CString::new(fmt_).unwrap();
let ndims_ : i32 = dims_.len() as i32;
if sp_.len() > 0 && sp_.len() != (num_).try_into().unwrap() {
return Result::Err("generate_var_names: Argument 'sp' has the wrong length, expected num_".to_string());
}
let numnamedaxis_ : i32 = namedaxisidxs_.len() as i32;
let numnames_ : i64 = names_.len() as i64;
let cstr_names : Vec<CString> = names_.iter().map(|s| CString::new(s.as_str()).unwrap()).collect();
let cptr_names : Vec<* const libc::c_char> = cstr_names.iter().map(|s| s.as_ptr()).collect();
self.handle_res(unsafe { MSK_generatevarnames(self.ptr,num_,subj_.as_ptr(),__tmp_1.as_ptr(),ndims_,dims_.as_ptr(),if sp_.len() == 0 { std::ptr::null() } else { sp_.as_ptr() },numnamedaxis_,if namedaxisidxs_.len() == 0 { std::ptr::null() } else { namedaxisidxs_.as_ptr() },numnames_,cptr_names.as_ptr()) },"generate_var_names")?;
return Result::Ok(());
} // generatevarnames
/// Obtains the list of affine expressions appearing in the affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of the affine conic constraint.
/// - `afeidxlist_` List of indexes of affine expressions appearing in the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccafeidxlist>
#[allow(unused_parens)]
pub fn get_acc_afe_idx_list(&self,accidx_ : i64,afeidxlist_ : &mut[i64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccn(self.ptr,accidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccn")?;
if afeidxlist_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_acc_afe_idx_list: Argument 'afeidxlist' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getaccafeidxlist(self.ptr,accidx_,afeidxlist_.as_mut_ptr()) },"get_acc_afe_idx_list")?;
return Result::Ok(());
} // getaccafeidxlist
/// Obtains the additional constant term vector appearing in the affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of the affine conic constraint.
/// - `b_` The vector b appearing in the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccb>
#[allow(unused_parens)]
pub fn get_acc_b(&self,accidx_ : i64,b_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccn(self.ptr,accidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccn")?;
if b_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_acc_b: Argument 'b' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getaccb(self.ptr,accidx_,b_.as_mut_ptr()) },"get_acc_b")?;
return Result::Ok(());
} // getaccb
/// Obtains barF, implied by the ACCs, in block triplet form.
///
/// # Arguments
///
/// - `acc_afe_` Index of the AFE within the concatenated list of AFEs in ACCs.
/// - `bar_var_` Symmetric matrix variable index.
/// - `blk_row_` Block row index.
/// - `blk_col_` Block column index.
/// - `blk_val_` The numerical value associated with each block triplet.
///
/// # Returns
///
/// - `numtrip` Number of elements in the block triplet form.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccbarfblocktriplet>
#[allow(unused_parens)]
pub fn get_acc_barf_block_triplet(&self,acc_afe_ : &mut[i64],bar_var_ : &mut[i32],blk_row_ : &mut[i32],blk_col_ : &mut[i32],blk_val_ : &mut[f64]) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccbarfnumblocktriplets(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccbarfnumblocktriplets")?;
let maxnumtrip_ : i64 = __tmp_0;
let mut __tmp_2 : i64 = i64::default();
if acc_afe_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_acc_barf_block_triplet: Argument 'acc_afe' has the wrong length, expected maxnumtrip_".to_string());
}
if bar_var_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_acc_barf_block_triplet: Argument 'bar_var' has the wrong length, expected maxnumtrip_".to_string());
}
if blk_row_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_acc_barf_block_triplet: Argument 'blk_row' has the wrong length, expected maxnumtrip_".to_string());
}
if blk_col_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_acc_barf_block_triplet: Argument 'blk_col' has the wrong length, expected maxnumtrip_".to_string());
}
if blk_val_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_acc_barf_block_triplet: Argument 'blk_val' has the wrong length, expected maxnumtrip_".to_string());
}
self.handle_res(unsafe { MSK_getaccbarfblocktriplet(self.ptr,maxnumtrip_,&mut __tmp_2,acc_afe_.as_mut_ptr(),bar_var_.as_mut_ptr(),blk_row_.as_mut_ptr(),blk_col_.as_mut_ptr(),blk_val_.as_mut_ptr()) },"get_acc_barf_block_triplet")?;
return Result::Ok(__tmp_2);
} // getaccbarfblocktriplet
/// Obtains an upper bound on the number of elements in the block triplet form of barf, as used within the ACCs.
///
/// # Returns
///
/// - `numtrip` An upper bound on the number of elements in the block triplet form of barf, as used within the ACCs.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccbarfnumblocktriplets>
#[allow(unused_parens)]
pub fn get_acc_barf_num_block_triplets(&self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getaccbarfnumblocktriplets(self.ptr,&mut __tmp_0) },"get_acc_barf_num_block_triplets")?;
return Result::Ok(__tmp_0);
} // getaccbarfnumblocktriplets
/// Obtains the domain appearing in the affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` The index of the affine conic constraint.
///
/// # Returns
///
/// - `domidx` The index of domain in the affine conic constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccdomain>
#[allow(unused_parens)]
pub fn get_acc_domain(&mut self,accidx_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getaccdomain(self.ptr,accidx_,&mut __tmp_0) },"get_acc_domain")?;
return Result::Ok(__tmp_0);
} // getaccdomain
/// Obtains the doty vector for an affine conic constraint.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidx_` The index of the affine conic constraint.
/// - `doty_` The dual values for this affine conic constraint. The array should have length equal to the dimension of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccdoty>
#[allow(unused_parens)]
pub fn get_acc_dot_y(&self,whichsol_ : i32,accidx_ : i64,doty_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccn(self.ptr,accidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccn")?;
if doty_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_acc_dot_y: Argument 'doty' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getaccdoty(self.ptr,whichsol_,accidx_,doty_.as_mut_ptr()) },"get_acc_dot_y")?;
return Result::Ok(());
} // getaccdoty
/// Obtains the doty vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `doty_` The dual values of affine conic constraints. The array should have length equal to the sum of dimensions of all affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccdotys>
#[allow(unused_parens)]
pub fn get_acc_dot_y_s(&self,whichsol_ : i32,doty_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccntot(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccntot")?;
if doty_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_acc_dot_y_s: Argument 'doty' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getaccdotys(self.ptr,whichsol_,doty_.as_mut_ptr()) },"get_acc_dot_y_s")?;
return Result::Ok(());
} // getaccdotys
/// Obtains the total number of nonzeros in the ACC implied F matrix.
///
/// # Returns
///
/// - `accfnnz` Number of nonzeros in the F matrix implied by ACCs.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccfnumnz>
#[allow(unused_parens)]
pub fn get_acc_f_numnz(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getaccfnumnz(self.ptr,&mut __tmp_0) },"get_acc_f_numnz")?;
return Result::Ok(__tmp_0);
} // getaccfnumnz
/// Obtains the F matrix (implied by the AFE ordering within the ACCs) in triplet format.
///
/// # Arguments
///
/// - `frow_` Row indices of nonzeros in the implied F matrix.
/// - `fcol_` Column indices of nonzeros in the implied F matrix.
/// - `fval_` Values of nonzero entries in the implied F matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccftrip>
#[allow(unused_parens)]
pub fn get_acc_f_trip(&mut self,frow_ : &mut[i64],fcol_ : &mut[i32],fval_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccfnumnz(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccfnumnz")?;
if frow_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_acc_f_trip: Argument 'frow' has the wrong length, expected __tmp_0".to_string());
}
let mut __tmp_2 : i64 = i64::default();
let __tmp_3 = unsafe { MSK_getaccfnumnz(self.ptr,&mut __tmp_2) };let _ = self.handle_res(__tmp_3,"getaccfnumnz")?;
if fcol_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("get_acc_f_trip: Argument 'fcol' has the wrong length, expected __tmp_2".to_string());
}
let mut __tmp_4 : i64 = i64::default();
let __tmp_5 = unsafe { MSK_getaccfnumnz(self.ptr,&mut __tmp_4) };let _ = self.handle_res(__tmp_5,"getaccfnumnz")?;
if fval_.len() != (__tmp_4).try_into().unwrap() {
return Result::Err("get_acc_f_trip: Argument 'fval' has the wrong length, expected __tmp_4".to_string());
}
self.handle_res(unsafe { MSK_getaccftrip(self.ptr,frow_.as_mut_ptr(),fcol_.as_mut_ptr(),fval_.as_mut_ptr()) },"get_acc_f_trip")?;
return Result::Ok(());
} // getaccftrip
/// The g vector as used within the ACCs.
///
/// # Arguments
///
/// - `g_` The g vector as used within the ACCs.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccgvector>
#[allow(unused_parens)]
pub fn get_acc_g_vector(&self,g_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccntot(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccntot")?;
if g_.len() > 0 && g_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_acc_g_vector: Argument 'g' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getaccgvector(self.ptr,if g_.len() == 0 { std::ptr::null_mut() } else { g_.as_mut_ptr() }) },"get_acc_g_vector")?;
return Result::Ok(());
} // getaccgvector
/// Obtains the dimension of the affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` The index of the affine conic constraint.
///
/// # Returns
///
/// - `n` The dimension of the affine conic constraint (equal to the dimension of its domain).
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccn>
#[allow(unused_parens)]
pub fn get_acc_n(&mut self,accidx_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getaccn(self.ptr,accidx_,&mut __tmp_0) },"get_acc_n")?;
return Result::Ok(__tmp_0);
} // getaccn
/// Obtains the name of an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of an affine conic constraint.
///
/// # Returns
///
/// - `name` Returns the required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccname>
#[allow(unused_parens)]
pub fn get_acc_name(&self,accidx_ : i64) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getaccnamelen(self.ptr,accidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccnamelen")?;
let sizename_ : i32 = (1+__tmp_0);
let mut name_ = Vec::new(); name_.resize(sizename_ as usize,0);
self.handle_res(unsafe { MSK_getaccname(self.ptr,accidx_,sizename_,name_.as_mut_ptr()) },"get_acc_name")?;
return Result::Ok(String::from_utf8_lossy(&name_[..name_.iter().position(|&c| c == 0).unwrap_or(sizename_ as usize)]).into_owned());
} // getaccname
/// Obtains the length of the name of an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of an affine conic constraint.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccnamelen>
#[allow(unused_parens)]
pub fn get_acc_name_len(&self,accidx_ : i64) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getaccnamelen(self.ptr,accidx_,&mut __tmp_0) },"get_acc_name_len")?;
return Result::Ok(__tmp_0);
} // getaccnamelen
/// Obtains the total dimension of all affine conic constraints.
///
/// # Returns
///
/// - `n` The total dimension of all affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccntot>
#[allow(unused_parens)]
pub fn get_acc_n_tot(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getaccntot(self.ptr,&mut __tmp_0) },"get_acc_n_tot")?;
return Result::Ok(__tmp_0);
} // getaccntot
/// Obtains full data of all affine conic constraints.
///
/// # Arguments
///
/// - `domidxlist_` The list of domains appearing in all affine conic constraints.
/// - `afeidxlist_` The concatenation of index lists of affine expressions appearing in all affine conic constraints.
/// - `b_` The concatenation of vectors b appearing in all affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaccs>
#[allow(unused_parens)]
pub fn get_accs(&self,domidxlist_ : &mut[i64],afeidxlist_ : &mut[i64],b_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getnumacc(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumacc")?;
if domidxlist_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_accs: Argument 'domidxlist' has the wrong length, expected __tmp_0".to_string());
}
let mut __tmp_2 : i64 = i64::default();
let __tmp_3 = unsafe { MSK_getaccntot(self.ptr,&mut __tmp_2) };let _ = self.handle_res(__tmp_3,"getaccntot")?;
if afeidxlist_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("get_accs: Argument 'afeidxlist' has the wrong length, expected __tmp_2".to_string());
}
let mut __tmp_4 : i64 = i64::default();
let __tmp_5 = unsafe { MSK_getaccntot(self.ptr,&mut __tmp_4) };let _ = self.handle_res(__tmp_5,"getaccntot")?;
if b_.len() != (__tmp_4).try_into().unwrap() {
return Result::Err("get_accs: Argument 'b' has the wrong length, expected __tmp_4".to_string());
}
self.handle_res(unsafe { MSK_getaccs(self.ptr,domidxlist_.as_mut_ptr(),afeidxlist_.as_mut_ptr(),b_.as_mut_ptr()) },"get_accs")?;
return Result::Ok(());
} // getaccs
/// Obtains one column of the linear constraint matrix.
///
/// # Arguments
///
/// - `j_` Index of the column.
/// - `nzj_` Number of non-zeros in the column obtained.
/// - `subj_` Row indices of the non-zeros in the column obtained.
/// - `valj_` Numerical values in the column obtained.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacol>
#[allow(unused_parens)]
pub fn get_a_col(&self,j_ : i32,nzj_ : &mut i32,subj_ : &mut[i32],valj_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_1 : i32 = i32::default();
let __tmp_2 = unsafe { MSK_getacolnumnz(self.ptr,j_,&mut __tmp_1) };let _ = self.handle_res(__tmp_2,"getacolnumnz")?;
if subj_.len() != (__tmp_1).try_into().unwrap() {
return Result::Err("get_a_col: Argument 'subj' has the wrong length, expected __tmp_1".to_string());
}
let mut __tmp_3 : i32 = i32::default();
let __tmp_4 = unsafe { MSK_getacolnumnz(self.ptr,j_,&mut __tmp_3) };let _ = self.handle_res(__tmp_4,"getacolnumnz")?;
if valj_.len() != (__tmp_3).try_into().unwrap() {
return Result::Err("get_a_col: Argument 'valj' has the wrong length, expected __tmp_3".to_string());
}
self.handle_res(unsafe { MSK_getacol(self.ptr,j_,nzj_,subj_.as_mut_ptr(),valj_.as_mut_ptr()) },"get_a_col")?;
return Result::Ok(());
} // getacol
/// Obtains the number of non-zero elements in one column of the linear constraint matrix
///
/// # Arguments
///
/// - `i_` Index of the column.
///
/// # Returns
///
/// - `nzj` Number of non-zeros in the j'th column of (A).
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacolnumnz>
#[allow(unused_parens)]
pub fn get_a_col_num_nz(&self,i_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getacolnumnz(self.ptr,i_,&mut __tmp_0) },"get_a_col_num_nz")?;
return Result::Ok(__tmp_0);
} // getacolnumnz
/// Obtains a sequence of columns from the coefficient matrix.
///
/// # Arguments
///
/// - `first_` Index of the first column in the sequence.
/// - `last_` Index of the last column in the sequence plus one.
/// - `ptrb_` Column start pointers.
/// - `ptre_` Column end pointers.
/// - `sub_` Contains the row subscripts.
/// - `val_` Contains the coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacolslice64>
#[allow(unused_parens)]
pub fn get_a_col_slice(&self,first_ : i32,last_ : i32,ptrb_ : &mut[i64],ptre_ : &mut[i64],sub_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getacolslicenumnz64(self.ptr,first_,last_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getacolslicenumnz64")?;
let maxnumnz_ : i64 = __tmp_0;
if ptrb_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_a_col_slice: Argument 'ptrb' has the wrong length, expected (last_-first_)".to_string());
}
if ptre_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_a_col_slice: Argument 'ptre' has the wrong length, expected (last_-first_)".to_string());
}
if sub_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_col_slice: Argument 'sub' has the wrong length, expected maxnumnz_".to_string());
}
if val_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_col_slice: Argument 'val' has the wrong length, expected maxnumnz_".to_string());
}
self.handle_res(unsafe { MSK_getacolslice64(self.ptr,first_,last_,maxnumnz_,ptrb_.as_mut_ptr(),ptre_.as_mut_ptr(),sub_.as_mut_ptr(),val_.as_mut_ptr()) },"get_a_col_slice")?;
return Result::Ok(());
} // getacolslice64
/// Obtains the number of non-zeros in a slice of columns of the coefficient matrix.
///
/// # Arguments
///
/// - `first_` Index of the first column in the sequence.
/// - `last_` Index of the last column plus one in the sequence.
///
/// # Returns
///
/// - `numnz` Number of non-zeros in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacolslicenumnz64>
#[allow(unused_parens)]
pub fn get_a_col_slice_num_nz(&self,first_ : i32,last_ : i32) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getacolslicenumnz64(self.ptr,first_,last_,&mut __tmp_0) },"get_a_col_slice_num_nz")?;
return Result::Ok(__tmp_0);
} // getacolslicenumnz64
/// Obtains a sequence of columns from the coefficient matrix in triplet format.
///
/// # Arguments
///
/// - `first_` Index of the first column in the sequence.
/// - `last_` Index of the last column in the sequence plus one.
/// - `subi_` Constraint subscripts.
/// - `subj_` Column subscripts.
/// - `val_` Values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getacolslicetrip>
#[allow(unused_parens)]
pub fn get_a_col_slice_trip(&self,first_ : i32,last_ : i32,subi_ : &mut[i32],subj_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getacolslicenumnz64(self.ptr,first_,last_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getacolslicenumnz64")?;
let maxnumnz_ : i64 = __tmp_0;
if subi_.len() > 0 && subi_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_col_slice_trip: Argument 'subi' has the wrong length, expected maxnumnz_".to_string());
}
if subj_.len() > 0 && subj_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_col_slice_trip: Argument 'subj' has the wrong length, expected maxnumnz_".to_string());
}
if val_.len() > 0 && val_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_col_slice_trip: Argument 'val' has the wrong length, expected maxnumnz_".to_string());
}
self.handle_res(unsafe { MSK_getacolslicetrip(self.ptr,first_,last_,maxnumnz_,if subi_.len() == 0 { std::ptr::null_mut() } else { subi_.as_mut_ptr() },if subj_.len() == 0 { std::ptr::null_mut() } else { subj_.as_mut_ptr() },if val_.len() == 0 { std::ptr::null_mut() } else { val_.as_mut_ptr() }) },"get_a_col_slice_trip")?;
return Result::Ok(());
} // getacolslicetrip
/// Obtains barF in block triplet form.
///
/// # Arguments
///
/// - `afeidx_` Constraint index.
/// - `barvaridx_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valkl_` The numerical value associated with each block triplet.
///
/// # Returns
///
/// - `numtrip` Number of elements in the block triplet form.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfblocktriplet>
#[allow(unused_parens)]
pub fn get_afe_barf_block_triplet(&self,afeidx_ : &mut[i64],barvaridx_ : &mut[i32],subk_ : &mut[i32],subl_ : &mut[i32],valkl_ : &mut[f64]) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getafebarfnumblocktriplets(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getafebarfnumblocktriplets")?;
let maxnumtrip_ : i64 = __tmp_0;
let mut __tmp_2 : i64 = i64::default();
if afeidx_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_afe_barf_block_triplet: Argument 'afeidx' has the wrong length, expected maxnumtrip_".to_string());
}
if barvaridx_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_afe_barf_block_triplet: Argument 'barvaridx' has the wrong length, expected maxnumtrip_".to_string());
}
if subk_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_afe_barf_block_triplet: Argument 'subk' has the wrong length, expected maxnumtrip_".to_string());
}
if subl_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_afe_barf_block_triplet: Argument 'subl' has the wrong length, expected maxnumtrip_".to_string());
}
if valkl_.len() != (maxnumtrip_).try_into().unwrap() {
return Result::Err("get_afe_barf_block_triplet: Argument 'valkl' has the wrong length, expected maxnumtrip_".to_string());
}
self.handle_res(unsafe { MSK_getafebarfblocktriplet(self.ptr,maxnumtrip_,&mut __tmp_2,afeidx_.as_mut_ptr(),barvaridx_.as_mut_ptr(),subk_.as_mut_ptr(),subl_.as_mut_ptr(),valkl_.as_mut_ptr()) },"get_afe_barf_block_triplet")?;
return Result::Ok(__tmp_2);
} // getafebarfblocktriplet
/// Obtains an upper bound on the number of elements in the block triplet form of barf.
///
/// # Returns
///
/// - `numtrip` An upper bound on the number of elements in the block triplet form of barf.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfnumblocktriplets>
#[allow(unused_parens)]
pub fn get_afe_barf_num_block_triplets(&self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getafebarfnumblocktriplets(self.ptr,&mut __tmp_0) },"get_afe_barf_num_block_triplets")?;
return Result::Ok(__tmp_0);
} // getafebarfnumblocktriplets
/// Obtains the number of nonzero entries in a row of barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
///
/// # Returns
///
/// - `numentr` Number of nonzero entries in a row of barF.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfnumrowentries>
#[allow(unused_parens)]
pub fn get_afe_barf_num_row_entries(&mut self,afeidx_ : i64) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getafebarfnumrowentries(self.ptr,afeidx_,&mut __tmp_0) },"get_afe_barf_num_row_entries")?;
return Result::Ok(__tmp_0);
} // getafebarfnumrowentries
/// Obtains nonzero entries in one row of barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
/// - `barvaridx_` Semidefinite variable indices.
/// - `ptrterm_` Pointers to the description of entries.
/// - `numterm_` Number of terms in each entry.
/// - `termidx_` Indices of semidefinite matrices from E.
/// - `termweight_` Weights appearing in the weighted sum representation.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfrow>
#[allow(unused_parens)]
pub fn get_afe_barf_row(&mut self,afeidx_ : i64,barvaridx_ : &mut[i32],ptrterm_ : &mut[i64],numterm_ : &mut[i64],termidx_ : &mut[i64],termweight_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let mut __tmp_1 : i64 = i64::default();
let __tmp_2 = unsafe { MSK_getafebarfrowinfo(self.ptr,afeidx_,&mut __tmp_0,&mut __tmp_1) };let _ = self.handle_res(__tmp_2,"getafebarfrowinfo")?;
if barvaridx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_afe_barf_row: Argument 'barvaridx' has the wrong length, expected __tmp_0".to_string());
}
let mut __tmp_3 : i32 = i32::default();
let mut __tmp_4 : i64 = i64::default();
let __tmp_5 = unsafe { MSK_getafebarfrowinfo(self.ptr,afeidx_,&mut __tmp_3,&mut __tmp_4) };let _ = self.handle_res(__tmp_5,"getafebarfrowinfo")?;
if ptrterm_.len() != (__tmp_3).try_into().unwrap() {
return Result::Err("get_afe_barf_row: Argument 'ptrterm' has the wrong length, expected __tmp_3".to_string());
}
let mut __tmp_6 : i32 = i32::default();
let mut __tmp_7 : i64 = i64::default();
let __tmp_8 = unsafe { MSK_getafebarfrowinfo(self.ptr,afeidx_,&mut __tmp_6,&mut __tmp_7) };let _ = self.handle_res(__tmp_8,"getafebarfrowinfo")?;
if numterm_.len() != (__tmp_6).try_into().unwrap() {
return Result::Err("get_afe_barf_row: Argument 'numterm' has the wrong length, expected __tmp_6".to_string());
}
let mut __tmp_9 : i32 = i32::default();
let mut __tmp_10 : i64 = i64::default();
let __tmp_11 = unsafe { MSK_getafebarfrowinfo(self.ptr,afeidx_,&mut __tmp_9,&mut __tmp_10) };let _ = self.handle_res(__tmp_11,"getafebarfrowinfo")?;
if termidx_.len() != (__tmp_10).try_into().unwrap() {
return Result::Err("get_afe_barf_row: Argument 'termidx' has the wrong length, expected __tmp_10".to_string());
}
let mut __tmp_12 : i32 = i32::default();
let mut __tmp_13 : i64 = i64::default();
let __tmp_14 = unsafe { MSK_getafebarfrowinfo(self.ptr,afeidx_,&mut __tmp_12,&mut __tmp_13) };let _ = self.handle_res(__tmp_14,"getafebarfrowinfo")?;
if termweight_.len() != (__tmp_13).try_into().unwrap() {
return Result::Err("get_afe_barf_row: Argument 'termweight' has the wrong length, expected __tmp_13".to_string());
}
self.handle_res(unsafe { MSK_getafebarfrow(self.ptr,afeidx_,barvaridx_.as_mut_ptr(),ptrterm_.as_mut_ptr(),numterm_.as_mut_ptr(),termidx_.as_mut_ptr(),termweight_.as_mut_ptr()) },"get_afe_barf_row")?;
return Result::Ok(());
} // getafebarfrow
/// Obtains information about one row of barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
/// - `numentr_` Number of nonzero entries in a row of barF.
/// - `numterm_` Number of terms in the weighted sums representation of the row of barF.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafebarfrowinfo>
#[allow(unused_parens)]
pub fn get_afe_barf_row_info(&mut self,afeidx_ : i64,numentr_ : &mut i32,numterm_ : &mut i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getafebarfrowinfo(self.ptr,afeidx_,numentr_,numterm_) },"get_afe_barf_row_info")?;
return Result::Ok(());
} // getafebarfrowinfo
/// Obtains the total number of nonzeros in F.
///
/// # Returns
///
/// - `numnz` Number of nonzeros in F.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafefnumnz>
#[allow(unused_parens)]
pub fn get_afe_f_num_nz(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getafefnumnz(self.ptr,&mut __tmp_0) },"get_afe_f_num_nz")?;
return Result::Ok(__tmp_0);
} // getafefnumnz
/// Obtains one row of F in sparse format.
///
/// # Arguments
///
/// - `afeidx_` Row index.
/// - `numnz_` Number of non-zeros in the row obtained.
/// - `varidx_` Column indices of the non-zeros in the row obtained.
/// - `val_` Values of the non-zeros in the row obtained.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafefrow>
#[allow(unused_parens)]
pub fn get_afe_f_row(&mut self,afeidx_ : i64,numnz_ : &mut i32,varidx_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_1 : i32 = i32::default();
let __tmp_2 = unsafe { MSK_getafefrownumnz(self.ptr,afeidx_,&mut __tmp_1) };let _ = self.handle_res(__tmp_2,"getafefrownumnz")?;
if varidx_.len() > 0 && varidx_.len() != (__tmp_1).try_into().unwrap() {
return Result::Err("get_afe_f_row: Argument 'varidx' has the wrong length, expected __tmp_1".to_string());
}
let mut __tmp_3 : i32 = i32::default();
let __tmp_4 = unsafe { MSK_getafefrownumnz(self.ptr,afeidx_,&mut __tmp_3) };let _ = self.handle_res(__tmp_4,"getafefrownumnz")?;
if val_.len() > 0 && val_.len() != (__tmp_3).try_into().unwrap() {
return Result::Err("get_afe_f_row: Argument 'val' has the wrong length, expected __tmp_3".to_string());
}
self.handle_res(unsafe { MSK_getafefrow(self.ptr,afeidx_,numnz_,if varidx_.len() == 0 { std::ptr::null_mut() } else { varidx_.as_mut_ptr() },if val_.len() == 0 { std::ptr::null_mut() } else { val_.as_mut_ptr() }) },"get_afe_f_row")?;
return Result::Ok(());
} // getafefrow
/// Obtains the number of nonzeros in a row of F.
///
/// # Arguments
///
/// - `afeidx_` Row index.
///
/// # Returns
///
/// - `numnz` Number of non-zeros in the row.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafefrownumnz>
#[allow(unused_parens)]
pub fn get_afe_f_row_num_nz(&mut self,afeidx_ : i64) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getafefrownumnz(self.ptr,afeidx_,&mut __tmp_0) },"get_afe_f_row_num_nz")?;
return Result::Ok(__tmp_0);
} // getafefrownumnz
/// Obtains the F matrix in triplet format.
///
/// # Arguments
///
/// - `afeidx_` Row indices of nonzeros.
/// - `varidx_` Column indices of nonzeros.
/// - `val_` Values of nonzero entries.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafeftrip>
#[allow(unused_parens)]
pub fn get_afe_f_trip(&mut self,afeidx_ : &mut[i64],varidx_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getafefnumnz(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getafefnumnz")?;
if afeidx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_afe_f_trip: Argument 'afeidx' has the wrong length, expected __tmp_0".to_string());
}
let mut __tmp_2 : i64 = i64::default();
let __tmp_3 = unsafe { MSK_getafefnumnz(self.ptr,&mut __tmp_2) };let _ = self.handle_res(__tmp_3,"getafefnumnz")?;
if varidx_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("get_afe_f_trip: Argument 'varidx' has the wrong length, expected __tmp_2".to_string());
}
let mut __tmp_4 : i64 = i64::default();
let __tmp_5 = unsafe { MSK_getafefnumnz(self.ptr,&mut __tmp_4) };let _ = self.handle_res(__tmp_5,"getafefnumnz")?;
if val_.len() != (__tmp_4).try_into().unwrap() {
return Result::Err("get_afe_f_trip: Argument 'val' has the wrong length, expected __tmp_4".to_string());
}
self.handle_res(unsafe { MSK_getafeftrip(self.ptr,afeidx_.as_mut_ptr(),varidx_.as_mut_ptr(),val_.as_mut_ptr()) },"get_afe_f_trip")?;
return Result::Ok(());
} // getafeftrip
/// Obtains a single coefficient in g.
///
/// # Arguments
///
/// - `afeidx_` Element index.
///
/// # Returns
///
/// - `g` The entry in g.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafeg>
#[allow(unused_parens)]
pub fn get_afe_g(&mut self,afeidx_ : i64) -> Result<f64,String> {
let mut __tmp_0 : f64 = f64::default();
self.handle_res(unsafe { MSK_getafeg(self.ptr,afeidx_,&mut __tmp_0) },"get_afe_g")?;
return Result::Ok(__tmp_0);
} // getafeg
/// Obtains a sequence of coefficients from the vector g.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `g_` The slice of g as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getafegslice>
#[allow(unused_parens)]
pub fn get_afe_g_slice(&self,first_ : i64,last_ : i64,g_ : &mut[f64]) -> Result<(),String> {
if g_.len() > 0 && g_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_afe_g_slice: Argument 'g' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getafegslice(self.ptr,first_,last_,if g_.len() == 0 { std::ptr::null_mut() } else { g_.as_mut_ptr() }) },"get_afe_g_slice")?;
return Result::Ok(());
} // getafegslice
/// Obtains a single coefficient in linear constraint matrix.
///
/// # Arguments
///
/// - `i_` Row index of the coefficient to be returned.
/// - `j_` Column index of the coefficient to be returned.
///
/// # Returns
///
/// - `aij` Returns the requested coefficient.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getaij>
#[allow(unused_parens)]
pub fn get_aij(&self,i_ : i32,j_ : i32) -> Result<f64,String> {
let mut __tmp_0 : f64 = f64::default();
self.handle_res(unsafe { MSK_getaij(self.ptr,i_,j_,&mut __tmp_0) },"get_aij")?;
return Result::Ok(__tmp_0);
} // getaij
/// Obtains the number non-zeros in a rectangular piece of the linear constraint matrix.
///
/// # Arguments
///
/// - `firsti_` Index of the first row in the rectangular piece.
/// - `lasti_` Index of the last row plus one in the rectangular piece.
/// - `firstj_` Index of the first column in the rectangular piece.
/// - `lastj_` Index of the last column plus one in the rectangular piece.
///
/// # Returns
///
/// - `numnz` Number of non-zero elements in the rectangular piece of the linear constraint matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getapiecenumnz>
#[allow(unused_parens)]
pub fn get_a_piece_num_nz(&self,firsti_ : i32,lasti_ : i32,firstj_ : i32,lastj_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getapiecenumnz(self.ptr,firsti_,lasti_,firstj_,lastj_,&mut __tmp_0) },"get_a_piece_num_nz")?;
return Result::Ok(__tmp_0);
} // getapiecenumnz
/// Obtains one row of the linear constraint matrix.
///
/// # Arguments
///
/// - `i_` Index of the row.
/// - `nzi_` Number of non-zeros in the row obtained.
/// - `subi_` Column indices of the non-zeros in the row obtained.
/// - `vali_` Numerical values of the row obtained.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarow>
#[allow(unused_parens)]
pub fn get_a_row(&self,i_ : i32,nzi_ : &mut i32,subi_ : &mut[i32],vali_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_1 : i32 = i32::default();
let __tmp_2 = unsafe { MSK_getarownumnz(self.ptr,i_,&mut __tmp_1) };let _ = self.handle_res(__tmp_2,"getarownumnz")?;
if subi_.len() != (__tmp_1).try_into().unwrap() {
return Result::Err("get_a_row: Argument 'subi' has the wrong length, expected __tmp_1".to_string());
}
let mut __tmp_3 : i32 = i32::default();
let __tmp_4 = unsafe { MSK_getarownumnz(self.ptr,i_,&mut __tmp_3) };let _ = self.handle_res(__tmp_4,"getarownumnz")?;
if vali_.len() != (__tmp_3).try_into().unwrap() {
return Result::Err("get_a_row: Argument 'vali' has the wrong length, expected __tmp_3".to_string());
}
self.handle_res(unsafe { MSK_getarow(self.ptr,i_,nzi_,subi_.as_mut_ptr(),vali_.as_mut_ptr()) },"get_a_row")?;
return Result::Ok(());
} // getarow
/// Obtains the number of non-zero elements in one row of the linear constraint matrix
///
/// # Arguments
///
/// - `i_` Index of the row.
///
/// # Returns
///
/// - `nzi` Number of non-zeros in the i'th row of `A`.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarownumnz>
#[allow(unused_parens)]
pub fn get_a_row_num_nz(&self,i_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getarownumnz(self.ptr,i_,&mut __tmp_0) },"get_a_row_num_nz")?;
return Result::Ok(__tmp_0);
} // getarownumnz
/// Obtains a sequence of rows from the coefficient matrix.
///
/// # Arguments
///
/// - `first_` Index of the first row in the sequence.
/// - `last_` Index of the last row in the sequence plus one.
/// - `ptrb_` Row start pointers.
/// - `ptre_` Row end pointers.
/// - `sub_` Contains the column subscripts.
/// - `val_` Contains the coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarowslice64>
#[allow(unused_parens)]
pub fn get_a_row_slice(&self,first_ : i32,last_ : i32,ptrb_ : &mut[i64],ptre_ : &mut[i64],sub_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getarowslicenumnz64(self.ptr,first_,last_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getarowslicenumnz64")?;
let maxnumnz_ : i64 = __tmp_0;
if ptrb_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_a_row_slice: Argument 'ptrb' has the wrong length, expected (last_-first_)".to_string());
}
if ptre_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_a_row_slice: Argument 'ptre' has the wrong length, expected (last_-first_)".to_string());
}
if sub_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_row_slice: Argument 'sub' has the wrong length, expected maxnumnz_".to_string());
}
if val_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_row_slice: Argument 'val' has the wrong length, expected maxnumnz_".to_string());
}
self.handle_res(unsafe { MSK_getarowslice64(self.ptr,first_,last_,maxnumnz_,ptrb_.as_mut_ptr(),ptre_.as_mut_ptr(),sub_.as_mut_ptr(),val_.as_mut_ptr()) },"get_a_row_slice")?;
return Result::Ok(());
} // getarowslice64
/// Obtains the number of non-zeros in a slice of rows of the coefficient matrix.
///
/// # Arguments
///
/// - `first_` Index of the first row in the sequence.
/// - `last_` Index of the last row plus one in the sequence.
///
/// # Returns
///
/// - `numnz` Number of non-zeros in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarowslicenumnz64>
#[allow(unused_parens)]
pub fn get_a_row_slice_num_nz(&self,first_ : i32,last_ : i32) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getarowslicenumnz64(self.ptr,first_,last_,&mut __tmp_0) },"get_a_row_slice_num_nz")?;
return Result::Ok(__tmp_0);
} // getarowslicenumnz64
/// Obtains a sequence of rows from the coefficient matrix in sparse triplet format.
///
/// # Arguments
///
/// - `first_` Index of the first row in the sequence.
/// - `last_` Index of the last row in the sequence plus one.
/// - `subi_` Constraint subscripts.
/// - `subj_` Column subscripts.
/// - `val_` Values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getarowslicetrip>
#[allow(unused_parens)]
pub fn get_a_row_slice_trip(&self,first_ : i32,last_ : i32,subi_ : &mut[i32],subj_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getarowslicenumnz64(self.ptr,first_,last_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getarowslicenumnz64")?;
let maxnumnz_ : i64 = __tmp_0;
if subi_.len() > 0 && subi_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_row_slice_trip: Argument 'subi' has the wrong length, expected maxnumnz_".to_string());
}
if subj_.len() > 0 && subj_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_row_slice_trip: Argument 'subj' has the wrong length, expected maxnumnz_".to_string());
}
if val_.len() > 0 && val_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_row_slice_trip: Argument 'val' has the wrong length, expected maxnumnz_".to_string());
}
self.handle_res(unsafe { MSK_getarowslicetrip(self.ptr,first_,last_,maxnumnz_,if subi_.len() == 0 { std::ptr::null_mut() } else { subi_.as_mut_ptr() },if subj_.len() == 0 { std::ptr::null_mut() } else { subj_.as_mut_ptr() },if val_.len() == 0 { std::ptr::null_mut() } else { val_.as_mut_ptr() }) },"get_a_row_slice_trip")?;
return Result::Ok(());
} // getarowslicetrip
/// Obtains the A matrix in sparse triplet format.
///
/// # Arguments
///
/// - `subi_` Constraint subscripts.
/// - `subj_` Column subscripts.
/// - `val_` Values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getatrip>
#[allow(unused_parens)]
pub fn get_a_trip(&self,subi_ : &mut[i32],subj_ : &mut[i32],val_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getnumanz64(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumanz64")?;
let maxnumnz_ : i64 = __tmp_0;
if subi_.len() > 0 && subi_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_trip: Argument 'subi' has the wrong length, expected maxnumnz_".to_string());
}
if subj_.len() > 0 && subj_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_trip: Argument 'subj' has the wrong length, expected maxnumnz_".to_string());
}
if val_.len() > 0 && val_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_a_trip: Argument 'val' has the wrong length, expected maxnumnz_".to_string());
}
self.handle_res(unsafe { MSK_getatrip(self.ptr,maxnumnz_,if subi_.len() == 0 { std::ptr::null_mut() } else { subi_.as_mut_ptr() },if subj_.len() == 0 { std::ptr::null_mut() } else { subj_.as_mut_ptr() },if val_.len() == 0 { std::ptr::null_mut() } else { val_.as_mut_ptr() }) },"get_a_trip")?;
return Result::Ok(());
} // getatrip
/// Gets the current A matrix truncation threshold.
///
/// # Arguments
///
/// - `tolzero_` Truncation tolerance.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getatruncatetol>
#[allow(unused_parens)]
pub fn get_a_truncate_tol(&self,tolzero_ : &mut[f64]) -> Result<(),String> {
if tolzero_.len() != (1).try_into().unwrap() {
return Result::Err("get_a_truncate_tol: Argument 'tolzero' has the wrong length, expected 1".to_string());
}
self.handle_res(unsafe { MSK_getatruncatetol(self.ptr,tolzero_.as_mut_ptr()) },"get_a_truncate_tol")?;
return Result::Ok(());
} // getatruncatetol
/// Obtains barA in block triplet form.
///
/// # Arguments
///
/// - `subi_` Constraint index.
/// - `subj_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valijkl_` The numerical value associated with each block triplet.
///
/// # Returns
///
/// - `num` Number of elements in the block triplet form.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarablocktriplet>
#[allow(unused_parens)]
pub fn get_bara_block_triplet(&self,subi_ : &mut[i32],subj_ : &mut[i32],subk_ : &mut[i32],subl_ : &mut[i32],valijkl_ : &mut[f64]) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getnumbarablocktriplets(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumbarablocktriplets")?;
let maxnum_ : i64 = __tmp_0;
let mut __tmp_2 : i64 = i64::default();
if subi_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_bara_block_triplet: Argument 'subi' has the wrong length, expected maxnum_".to_string());
}
if subj_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_bara_block_triplet: Argument 'subj' has the wrong length, expected maxnum_".to_string());
}
if subk_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_bara_block_triplet: Argument 'subk' has the wrong length, expected maxnum_".to_string());
}
if subl_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_bara_block_triplet: Argument 'subl' has the wrong length, expected maxnum_".to_string());
}
if valijkl_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_bara_block_triplet: Argument 'valijkl' has the wrong length, expected maxnum_".to_string());
}
self.handle_res(unsafe { MSK_getbarablocktriplet(self.ptr,maxnum_,&mut __tmp_2,subi_.as_mut_ptr(),subj_.as_mut_ptr(),subk_.as_mut_ptr(),subl_.as_mut_ptr(),valijkl_.as_mut_ptr()) },"get_bara_block_triplet")?;
return Result::Ok(__tmp_2);
} // getbarablocktriplet
/// Obtains information about an element in barA.
///
/// # Arguments
///
/// - `idx_` Position of the element in the vectorized form.
/// - `i_` Row index of the element at position idx.
/// - `j_` Column index of the element at position idx.
/// - `sub_` A list indexes of the elements from symmetric matrix storage that appear in the weighted sum.
/// - `weights_` The weights associated with each term in the weighted sum.
///
/// # Returns
///
/// - `num` Number of terms in weighted sum that forms the element.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbaraidx>
#[allow(unused_parens)]
pub fn get_bara_idx(&self,idx_ : i64,i_ : &mut i32,j_ : &mut i32,sub_ : &mut[i64],weights_ : &mut[f64]) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getbaraidxinfo(self.ptr,idx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getbaraidxinfo")?;
let maxnum_ : i64 = __tmp_0;
let mut __tmp_4 : i64 = i64::default();
if sub_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_bara_idx: Argument 'sub' has the wrong length, expected maxnum_".to_string());
}
if weights_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_bara_idx: Argument 'weights' has the wrong length, expected maxnum_".to_string());
}
self.handle_res(unsafe { MSK_getbaraidx(self.ptr,idx_,maxnum_,i_,j_,&mut __tmp_4,sub_.as_mut_ptr(),weights_.as_mut_ptr()) },"get_bara_idx")?;
return Result::Ok(__tmp_4);
} // getbaraidx
/// Obtains information about an element in barA.
///
/// # Arguments
///
/// - `idx_` Position of the element in the vectorized form.
/// - `i_` Row index of the element at position idx.
/// - `j_` Column index of the element at position idx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbaraidxij>
#[allow(unused_parens)]
pub fn get_bara_idx_i_j(&self,idx_ : i64,i_ : &mut i32,j_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getbaraidxij(self.ptr,idx_,i_,j_) },"get_bara_idx_i_j")?;
return Result::Ok(());
} // getbaraidxij
/// Obtains the number of terms in the weighted sum that form a particular element in barA.
///
/// # Arguments
///
/// - `idx_` The internal position of the element for which information should be obtained.
///
/// # Returns
///
/// - `num` Number of terms in the weighted sum that form the specified element in barA.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbaraidxinfo>
#[allow(unused_parens)]
pub fn get_bara_idx_info(&self,idx_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getbaraidxinfo(self.ptr,idx_,&mut __tmp_0) },"get_bara_idx_info")?;
return Result::Ok(__tmp_0);
} // getbaraidxinfo
/// Obtains the sparsity pattern of the barA matrix.
///
/// # Arguments
///
/// - `numnz_` Number of nonzero elements in barA.
/// - `idxij_` Position of each nonzero element in the vector representation of barA.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarasparsity>
#[allow(unused_parens)]
pub fn get_bara_sparsity(&self,numnz_ : &mut i64,idxij_ : &mut[i64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getnumbaranz(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumbaranz")?;
let maxnumnz_ : i64 = __tmp_0;
if idxij_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_bara_sparsity: Argument 'idxij' has the wrong length, expected maxnumnz_".to_string());
}
self.handle_res(unsafe { MSK_getbarasparsity(self.ptr,maxnumnz_,numnz_,idxij_.as_mut_ptr()) },"get_bara_sparsity")?;
return Result::Ok(());
} // getbarasparsity
/// Obtains barC in block triplet form.
///
/// # Arguments
///
/// - `subj_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valjkl_` The numerical value associated with each block triplet.
///
/// # Returns
///
/// - `num` Number of elements in the block triplet form.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcblocktriplet>
#[allow(unused_parens)]
pub fn get_barc_block_triplet(&self,subj_ : &mut[i32],subk_ : &mut[i32],subl_ : &mut[i32],valjkl_ : &mut[f64]) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getnumbarcblocktriplets(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumbarcblocktriplets")?;
let maxnum_ : i64 = __tmp_0;
let mut __tmp_2 : i64 = i64::default();
if subj_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_barc_block_triplet: Argument 'subj' has the wrong length, expected maxnum_".to_string());
}
if subk_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_barc_block_triplet: Argument 'subk' has the wrong length, expected maxnum_".to_string());
}
if subl_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_barc_block_triplet: Argument 'subl' has the wrong length, expected maxnum_".to_string());
}
if valjkl_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_barc_block_triplet: Argument 'valjkl' has the wrong length, expected maxnum_".to_string());
}
self.handle_res(unsafe { MSK_getbarcblocktriplet(self.ptr,maxnum_,&mut __tmp_2,subj_.as_mut_ptr(),subk_.as_mut_ptr(),subl_.as_mut_ptr(),valjkl_.as_mut_ptr()) },"get_barc_block_triplet")?;
return Result::Ok(__tmp_2);
} // getbarcblocktriplet
/// Obtains information about an element in barc.
///
/// # Arguments
///
/// - `idx_` Index of the element for which information should be obtained.
/// - `j_` Row index in barc.
/// - `num_` Number of terms in the weighted sum.
/// - `sub_` Elements appearing the weighted sum.
/// - `weights_` Weights of terms in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcidx>
#[allow(unused_parens)]
pub fn get_barc_idx(&self,idx_ : i64,j_ : &mut i32,num_ : &mut i64,sub_ : &mut[i64],weights_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getbarcidxinfo(self.ptr,idx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getbarcidxinfo")?;
let maxnum_ : i64 = __tmp_0;
if sub_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_barc_idx: Argument 'sub' has the wrong length, expected maxnum_".to_string());
}
if weights_.len() != (maxnum_).try_into().unwrap() {
return Result::Err("get_barc_idx: Argument 'weights' has the wrong length, expected maxnum_".to_string());
}
self.handle_res(unsafe { MSK_getbarcidx(self.ptr,idx_,maxnum_,j_,num_,sub_.as_mut_ptr(),weights_.as_mut_ptr()) },"get_barc_idx")?;
return Result::Ok(());
} // getbarcidx
/// Obtains information about an element in barc.
///
/// # Arguments
///
/// - `idx_` Index of the element for which information should be obtained. The value is an index of a symmetric sparse variable.
///
/// # Returns
///
/// - `num` Number of terms that appear in the weighted sum that forms the requested element.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcidxinfo>
#[allow(unused_parens)]
pub fn get_barc_idx_info(&self,idx_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getbarcidxinfo(self.ptr,idx_,&mut __tmp_0) },"get_barc_idx_info")?;
return Result::Ok(__tmp_0);
} // getbarcidxinfo
/// Obtains the row index of an element in barc.
///
/// # Arguments
///
/// - `idx_` Index of the element for which information should be obtained.
/// - `j_` Row index in barc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcidxj>
#[allow(unused_parens)]
pub fn get_barc_idx_j(&self,idx_ : i64,j_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getbarcidxj(self.ptr,idx_,j_) },"get_barc_idx_j")?;
return Result::Ok(());
} // getbarcidxj
/// Get the positions of the nonzero elements in barc.
///
/// # Arguments
///
/// - `numnz_` Number of nonzero elements in barc.
/// - `idxj_` Internal positions of the nonzeros elements in barc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarcsparsity>
#[allow(unused_parens)]
pub fn get_barc_sparsity(&self,numnz_ : &mut i64,idxj_ : &mut[i64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getnumbarcnz(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumbarcnz")?;
let maxnumnz_ : i64 = __tmp_0;
if idxj_.len() != (maxnumnz_).try_into().unwrap() {
return Result::Err("get_barc_sparsity: Argument 'idxj' has the wrong length, expected maxnumnz_".to_string());
}
self.handle_res(unsafe { MSK_getbarcsparsity(self.ptr,maxnumnz_,numnz_,idxj_.as_mut_ptr()) },"get_barc_sparsity")?;
return Result::Ok(());
} // getbarcsparsity
/// Obtains the dual solution for a semidefinite variable.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `j_` Index of the semidefinite variable.
/// - `barsj_` Value of the j'th dual variable of barx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarsj>
#[allow(unused_parens)]
pub fn get_bars_j(&self,whichsol_ : i32,j_ : i32,barsj_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getlenbarvarj(self.ptr,j_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getlenbarvarj")?;
if barsj_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_bars_j: Argument 'barsj' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getbarsj(self.ptr,whichsol_,j_,barsj_.as_mut_ptr()) },"get_bars_j")?;
return Result::Ok(());
} // getbarsj
/// Obtains the dual solution for a sequence of semidefinite variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` Index of the first semidefinite variable in the slice.
/// - `last_` Index of the last semidefinite variable in the slice plus one.
/// - `slicesize_` Denotes the length of the array barsslice.
/// - `barsslice_` Dual solution values of symmetric matrix variables in the slice, stored sequentially.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarsslice>
#[allow(unused_parens)]
pub fn get_bars_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,slicesize_ : i64,barsslice_ : &mut[f64]) -> Result<(),String> {
if barsslice_.len() != (slicesize_).try_into().unwrap() {
return Result::Err("get_bars_slice: Argument 'barsslice' has the wrong length, expected slicesize_".to_string());
}
self.handle_res(unsafe { MSK_getbarsslice(self.ptr,whichsol_,first_,last_,slicesize_,barsslice_.as_mut_ptr()) },"get_bars_slice")?;
return Result::Ok(());
} // getbarsslice
/// Obtains the name of a semidefinite variable.
///
/// # Arguments
///
/// - `i_` Index of the variable.
///
/// # Returns
///
/// - `name` The requested name is copied to this buffer.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarvarname>
#[allow(unused_parens)]
pub fn get_barvar_name(&self,i_ : i32) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getbarvarnamelen(self.ptr,i_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getbarvarnamelen")?;
let sizename_ : i32 = (1+__tmp_0);
let mut name_ = Vec::new(); name_.resize(sizename_ as usize,0);
self.handle_res(unsafe { MSK_getbarvarname(self.ptr,i_,sizename_,name_.as_mut_ptr()) },"get_barvar_name")?;
return Result::Ok(String::from_utf8_lossy(&name_[..name_.iter().position(|&c| c == 0).unwrap_or(sizename_ as usize)]).into_owned());
} // getbarvarname
/// Obtains the index of semidefinite variable from its name.
///
/// # Arguments
///
/// - `somename_` The name of the variable.
/// - `asgn_` Non-zero if the name somename is assigned to some semidefinite variable.
///
/// # Returns
///
/// - `index` The index of a semidefinite variable with the name somename (if one exists).
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarvarnameindex>
#[allow(unused_parens)]
pub fn get_barvar_name_index(&self,somename_ : &str,asgn_ : &mut i32) -> Result<i32,String> {
let __tmp_1 = CString::new(somename_).unwrap();
let mut __tmp_3 : i32 = i32::default();
self.handle_res(unsafe { MSK_getbarvarnameindex(self.ptr,__tmp_1.as_ptr(),asgn_,&mut __tmp_3) },"get_barvar_name_index")?;
return Result::Ok(__tmp_3);
} // getbarvarnameindex
/// Obtains the length of the name of a semidefinite variable.
///
/// # Arguments
///
/// - `i_` Index of the variable.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarvarnamelen>
#[allow(unused_parens)]
pub fn get_barvar_name_len(&self,i_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getbarvarnamelen(self.ptr,i_,&mut __tmp_0) },"get_barvar_name_len")?;
return Result::Ok(__tmp_0);
} // getbarvarnamelen
/// Obtains the primal solution for a semidefinite variable.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `j_` Index of the semidefinite variable.
/// - `barxj_` Value of the j'th variable of barx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarxj>
#[allow(unused_parens)]
pub fn get_barx_j(&self,whichsol_ : i32,j_ : i32,barxj_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getlenbarvarj(self.ptr,j_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getlenbarvarj")?;
if barxj_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_barx_j: Argument 'barxj' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getbarxj(self.ptr,whichsol_,j_,barxj_.as_mut_ptr()) },"get_barx_j")?;
return Result::Ok(());
} // getbarxj
/// Obtains the primal solution for a sequence of semidefinite variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` Index of the first semidefinite variable in the slice.
/// - `last_` Index of the last semidefinite variable in the slice plus one.
/// - `slicesize_` Denotes the length of the array barxslice.
/// - `barxslice_` Solution values of symmetric matrix variables in the slice, stored sequentially.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbarxslice>
#[allow(unused_parens)]
pub fn get_barx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,slicesize_ : i64,barxslice_ : &mut[f64]) -> Result<(),String> {
if barxslice_.len() != (slicesize_).try_into().unwrap() {
return Result::Err("get_barx_slice: Argument 'barxslice' has the wrong length, expected slicesize_".to_string());
}
self.handle_res(unsafe { MSK_getbarxslice(self.ptr,whichsol_,first_,last_,slicesize_,barxslice_.as_mut_ptr()) },"get_barx_slice")?;
return Result::Ok(());
} // getbarxslice
/// Obtains all objective coefficients.
///
/// # Arguments
///
/// - `c_` Linear terms of the objective as a dense vector. The length is the number of variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getc>
#[allow(unused_parens)]
pub fn get_c(&self,c_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if c_.len() > 0 && c_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_c: Argument 'c' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getc(self.ptr,if c_.len() == 0 { std::ptr::null_mut() } else { c_.as_mut_ptr() }) },"get_c")?;
return Result::Ok(());
} // getc
/// Obtains the fixed term in the objective.
///
/// # Returns
///
/// - `cfix` Fixed term in the objective.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getcfix>
#[allow(unused_parens)]
pub fn get_cfix(&self) -> Result<f64,String> {
let mut __tmp_0 : f64 = f64::default();
self.handle_res(unsafe { MSK_getcfix(self.ptr,&mut __tmp_0) },"get_cfix")?;
return Result::Ok(__tmp_0);
} // getcfix
/// Obtains one objective coefficient.
///
/// # Arguments
///
/// - `j_` Index of the variable for which the c coefficient should be obtained.
/// - `cj_` The c coefficient value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getcj>
#[allow(unused_parens)]
pub fn get_c_j(&self,j_ : i32,cj_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getcj(self.ptr,j_,cj_) },"get_c_j")?;
return Result::Ok(());
} // getcj
/// Obtains a sequence of coefficients from the objective.
///
/// # Arguments
///
/// - `subj_` A list of variable indexes.
/// - `c_` Linear terms of the requested list of the objective as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getclist>
#[allow(unused_parens)]
pub fn get_c_list(&self,subj_ : &[i32],c_ : &mut[f64]) -> Result<(),String> {
let num_ : i32 = subj_.len() as i32;
if c_.len() != (num_).try_into().unwrap() {
return Result::Err("get_c_list: Argument 'c' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getclist(self.ptr,num_,subj_.as_ptr(),c_.as_mut_ptr()) },"get_c_list")?;
return Result::Ok(());
} // getclist
/// Obtains bound information for one constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint for which the bound information should be obtained.
/// - `bk_` Bound keys.
///
/// See [Boundkey]
/// - `bl_` Values for lower bounds.
/// - `bu_` Values for upper bounds.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconbound>
#[allow(unused_parens)]
pub fn get_con_bound(&self,i_ : i32,bk_ : & mut i32,bl_ : &mut f64,bu_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getconbound(self.ptr,i_,bk_,bl_,bu_) },"get_con_bound")?;
return Result::Ok(());
} // getconbound
/// Obtains bounds information for a slice of the constraints.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bk_` Bound keys.
///
/// See [Boundkey]
/// - `bl_` Values for lower bounds.
/// - `bu_` Values for upper bounds.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconboundslice>
#[allow(unused_parens)]
pub fn get_con_bound_slice(&self,first_ : i32,last_ : i32,bk_ : &mut[i32],bl_ : &mut[f64],bu_ : &mut[f64]) -> Result<(),String> {
if bk_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_con_bound_slice: Argument 'bk' has the wrong length, expected (last_-first_)".to_string());
}
if bl_.len() > 0 && bl_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_con_bound_slice: Argument 'bl' has the wrong length, expected (last_-first_)".to_string());
}
if bu_.len() > 0 && bu_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_con_bound_slice: Argument 'bu' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getconboundslice(self.ptr,first_,last_,bk_.as_mut_ptr(),if bl_.len() == 0 { std::ptr::null_mut() } else { bl_.as_mut_ptr() },if bu_.len() == 0 { std::ptr::null_mut() } else { bu_.as_mut_ptr() }) },"get_con_bound_slice")?;
return Result::Ok(());
} // getconboundslice
/// Obtains a cone.
///
/// # Arguments
///
/// - `k_` Index of the cone.
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `nummem_` Number of member variables in the cone.
/// - `submem_` Variable subscripts of the members in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getcone>
#[allow(unused_parens)]
pub fn get_cone(&mut self,k_ : i32,ct_ : & mut i32,conepar_ : &mut f64,nummem_ : &mut i32,submem_ : &mut[i32]) -> Result<(),String> {
let mut __tmp_3 : i32 = i32::default();
let mut __tmp_4 : f64 = f64::default();
let mut __tmp_5 : i32 = i32::default();
let __tmp_6 = unsafe { MSK_getconeinfo(self.ptr,k_,&mut __tmp_3,&mut __tmp_4,&mut __tmp_5) };let _ = self.handle_res(__tmp_6,"getconeinfo")?;
if submem_.len() > 0 && submem_.len() != (__tmp_5).try_into().unwrap() {
return Result::Err("get_cone: Argument 'submem' has the wrong length, expected __tmp_5".to_string());
}
self.handle_res(unsafe { MSK_getcone(self.ptr,k_,ct_,conepar_,nummem_,if submem_.len() == 0 { std::ptr::null_mut() } else { submem_.as_mut_ptr() }) },"get_cone")?;
return Result::Ok(());
} // getcone
/// Obtains information about a cone.
///
/// # Arguments
///
/// - `k_` Index of the cone.
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `nummem_` Number of member variables in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconeinfo>
#[allow(unused_parens)]
pub fn get_cone_info(&self,k_ : i32,ct_ : & mut i32,conepar_ : &mut f64,nummem_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getconeinfo(self.ptr,k_,ct_,conepar_,nummem_) },"get_cone_info")?;
return Result::Ok(());
} // getconeinfo
/// Obtains the name of a cone.
///
/// # Arguments
///
/// - `i_` Index of the cone.
///
/// # Returns
///
/// - `name` The required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconename>
#[allow(unused_parens)]
pub fn get_cone_name(&self,i_ : i32) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getconenamelen(self.ptr,i_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getconenamelen")?;
let sizename_ : i32 = (1+__tmp_0);
let mut name_ = Vec::new(); name_.resize(sizename_ as usize,0);
self.handle_res(unsafe { MSK_getconename(self.ptr,i_,sizename_,name_.as_mut_ptr()) },"get_cone_name")?;
return Result::Ok(String::from_utf8_lossy(&name_[..name_.iter().position(|&c| c == 0).unwrap_or(sizename_ as usize)]).into_owned());
} // getconename
/// Checks whether the name has been assigned to any cone.
///
/// # Arguments
///
/// - `somename_` The name which should be checked.
/// - `asgn_` Is non-zero if the name somename is assigned to some cone.
///
/// # Returns
///
/// - `index` If the name somename is assigned to some cone, this is the index of the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconenameindex>
#[allow(unused_parens)]
pub fn get_cone_name_index(&self,somename_ : &str,asgn_ : &mut i32) -> Result<i32,String> {
let __tmp_1 = CString::new(somename_).unwrap();
let mut __tmp_3 : i32 = i32::default();
self.handle_res(unsafe { MSK_getconenameindex(self.ptr,__tmp_1.as_ptr(),asgn_,&mut __tmp_3) },"get_cone_name_index")?;
return Result::Ok(__tmp_3);
} // getconenameindex
/// Obtains the length of the name of a cone.
///
/// # Arguments
///
/// - `i_` Index of the cone.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconenamelen>
#[allow(unused_parens)]
pub fn get_cone_name_len(&self,i_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getconenamelen(self.ptr,i_,&mut __tmp_0) },"get_cone_name_len")?;
return Result::Ok(__tmp_0);
} // getconenamelen
/// Obtains the name of a constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
///
/// # Returns
///
/// - `name` The required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconname>
#[allow(unused_parens)]
pub fn get_con_name(&self,i_ : i32) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getconnamelen(self.ptr,i_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getconnamelen")?;
let sizename_ : i32 = (1+__tmp_0);
let mut name_ = Vec::new(); name_.resize(sizename_ as usize,0);
self.handle_res(unsafe { MSK_getconname(self.ptr,i_,sizename_,name_.as_mut_ptr()) },"get_con_name")?;
return Result::Ok(String::from_utf8_lossy(&name_[..name_.iter().position(|&c| c == 0).unwrap_or(sizename_ as usize)]).into_owned());
} // getconname
/// Checks whether the name has been assigned to any constraint.
///
/// # Arguments
///
/// - `somename_` The name which should be checked.
/// - `asgn_` Is non-zero if the name somename is assigned to some constraint.
///
/// # Returns
///
/// - `index` If the name somename is assigned to a constraint, then return the index of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconnameindex>
#[allow(unused_parens)]
pub fn get_con_name_index(&self,somename_ : &str,asgn_ : &mut i32) -> Result<i32,String> {
let __tmp_1 = CString::new(somename_).unwrap();
let mut __tmp_3 : i32 = i32::default();
self.handle_res(unsafe { MSK_getconnameindex(self.ptr,__tmp_1.as_ptr(),asgn_,&mut __tmp_3) },"get_con_name_index")?;
return Result::Ok(__tmp_3);
} // getconnameindex
/// Obtains the length of the name of a constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getconnamelen>
#[allow(unused_parens)]
pub fn get_con_name_len(&self,i_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getconnamelen(self.ptr,i_,&mut __tmp_0) },"get_con_name_len")?;
return Result::Ok(__tmp_0);
} // getconnamelen
/// Obtains a sequence of coefficients from the objective.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `c_` Linear terms of the requested slice of the objective as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getcslice>
#[allow(unused_parens)]
pub fn get_c_slice(&self,first_ : i32,last_ : i32,c_ : &mut[f64]) -> Result<(),String> {
if c_.len() > 0 && c_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_c_slice: Argument 'c' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getcslice(self.ptr,first_,last_,if c_.len() == 0 { std::ptr::null_mut() } else { c_.as_mut_ptr() }) },"get_c_slice")?;
return Result::Ok(());
} // getcslice
/// Obtains the dimension of a symmetric matrix variable.
///
/// # Arguments
///
/// - `j_` Index of the semidefinite variable whose dimension is requested.
///
/// # Returns
///
/// - `dimbarvarj` The dimension of the j'th semidefinite variable.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdimbarvarj>
#[allow(unused_parens)]
pub fn get_dim_barvar_j(&self,j_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getdimbarvarj(self.ptr,j_,&mut __tmp_0) },"get_dim_barvar_j")?;
return Result::Ok(__tmp_0);
} // getdimbarvarj
/// Obtains the list of affine expression indexes in a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `afeidxlist_` List of affine expression indexes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcafeidxlist>
#[allow(unused_parens)]
pub fn get_djc_afe_idx_list(&self,djcidx_ : i64,afeidxlist_ : &mut[i64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getdjcnumafe(self.ptr,djcidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getdjcnumafe")?;
if afeidxlist_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_djc_afe_idx_list: Argument 'afeidxlist' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getdjcafeidxlist(self.ptr,djcidx_,afeidxlist_.as_mut_ptr()) },"get_djc_afe_idx_list")?;
return Result::Ok(());
} // getdjcafeidxlist
/// Obtains the optional constant term vector of a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `b_` The vector b.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcb>
#[allow(unused_parens)]
pub fn get_djc_b(&self,djcidx_ : i64,b_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getdjcnumafe(self.ptr,djcidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getdjcnumafe")?;
if b_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_djc_b: Argument 'b' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getdjcb(self.ptr,djcidx_,b_.as_mut_ptr()) },"get_djc_b")?;
return Result::Ok(());
} // getdjcb
/// Obtains the list of domain indexes in a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `domidxlist_` List of term sizes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcdomainidxlist>
#[allow(unused_parens)]
pub fn get_djc_domain_idx_list(&self,djcidx_ : i64,domidxlist_ : &mut[i64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getdjcnumdomain(self.ptr,djcidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getdjcnumdomain")?;
if domidxlist_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_djc_domain_idx_list: Argument 'domidxlist' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getdjcdomainidxlist(self.ptr,djcidx_,domidxlist_.as_mut_ptr()) },"get_djc_domain_idx_list")?;
return Result::Ok(());
} // getdjcdomainidxlist
/// Obtains the name of a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of a disjunctive constraint.
///
/// # Returns
///
/// - `name` Returns the required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcname>
#[allow(unused_parens)]
pub fn get_djc_name(&self,djcidx_ : i64) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getdjcnamelen(self.ptr,djcidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getdjcnamelen")?;
let sizename_ : i32 = (1+__tmp_0);
let mut name_ = Vec::new(); name_.resize(sizename_ as usize,0);
self.handle_res(unsafe { MSK_getdjcname(self.ptr,djcidx_,sizename_,name_.as_mut_ptr()) },"get_djc_name")?;
return Result::Ok(String::from_utf8_lossy(&name_[..name_.iter().position(|&c| c == 0).unwrap_or(sizename_ as usize)]).into_owned());
} // getdjcname
/// Obtains the length of the name of a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of a disjunctive constraint.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnamelen>
#[allow(unused_parens)]
pub fn get_djc_name_len(&self,djcidx_ : i64) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getdjcnamelen(self.ptr,djcidx_,&mut __tmp_0) },"get_djc_name_len")?;
return Result::Ok(__tmp_0);
} // getdjcnamelen
/// Obtains the number of affine expressions in the disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
///
/// # Returns
///
/// - `numafe` Number of affine expressions in the disjunctive constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumafe>
#[allow(unused_parens)]
pub fn get_djc_num_afe(&mut self,djcidx_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getdjcnumafe(self.ptr,djcidx_,&mut __tmp_0) },"get_djc_num_afe")?;
return Result::Ok(__tmp_0);
} // getdjcnumafe
/// Obtains the number of affine expressions in all disjunctive constraints.
///
/// # Returns
///
/// - `numafetot` Number of affine expressions in all disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumafetot>
#[allow(unused_parens)]
pub fn get_djc_num_afe_tot(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getdjcnumafetot(self.ptr,&mut __tmp_0) },"get_djc_num_afe_tot")?;
return Result::Ok(__tmp_0);
} // getdjcnumafetot
/// Obtains the number of domains in the disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
///
/// # Returns
///
/// - `numdomain` Number of domains in the disjunctive constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumdomain>
#[allow(unused_parens)]
pub fn get_djc_num_domain(&mut self,djcidx_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getdjcnumdomain(self.ptr,djcidx_,&mut __tmp_0) },"get_djc_num_domain")?;
return Result::Ok(__tmp_0);
} // getdjcnumdomain
/// Obtains the number of domains in all disjunctive constraints.
///
/// # Returns
///
/// - `numdomaintot` Number of domains in all disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumdomaintot>
#[allow(unused_parens)]
pub fn get_djc_num_domain_tot(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getdjcnumdomaintot(self.ptr,&mut __tmp_0) },"get_djc_num_domain_tot")?;
return Result::Ok(__tmp_0);
} // getdjcnumdomaintot
/// Obtains the number terms in the disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
///
/// # Returns
///
/// - `numterm` Number of terms in the disjunctive constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumterm>
#[allow(unused_parens)]
pub fn get_djc_num_term(&mut self,djcidx_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getdjcnumterm(self.ptr,djcidx_,&mut __tmp_0) },"get_djc_num_term")?;
return Result::Ok(__tmp_0);
} // getdjcnumterm
/// Obtains the number of terms in all disjunctive constraints.
///
/// # Returns
///
/// - `numtermtot` Total number of terms in all disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcnumtermtot>
#[allow(unused_parens)]
pub fn get_djc_num_term_tot(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getdjcnumtermtot(self.ptr,&mut __tmp_0) },"get_djc_num_term_tot")?;
return Result::Ok(__tmp_0);
} // getdjcnumtermtot
/// Obtains full data of all disjunctive constraints.
///
/// # Arguments
///
/// - `domidxlist_` The concatenation of index lists of domains appearing in all disjunctive constraints.
/// - `afeidxlist_` The concatenation of index lists of affine expressions appearing in all disjunctive constraints.
/// - `b_` The concatenation of vectors b appearing in all disjunctive constraints.
/// - `termsizelist_` The concatenation of lists of term sizes appearing in all disjunctive constraints.
/// - `numterms_` The number of terms in each of the disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjcs>
#[allow(unused_parens)]
pub fn get_djcs(&self,domidxlist_ : &mut[i64],afeidxlist_ : &mut[i64],b_ : &mut[f64],termsizelist_ : &mut[i64],numterms_ : &mut[i64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getdjcnumdomaintot(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getdjcnumdomaintot")?;
if domidxlist_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_djcs: Argument 'domidxlist' has the wrong length, expected __tmp_0".to_string());
}
let mut __tmp_2 : i64 = i64::default();
let __tmp_3 = unsafe { MSK_getdjcnumafetot(self.ptr,&mut __tmp_2) };let _ = self.handle_res(__tmp_3,"getdjcnumafetot")?;
if afeidxlist_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("get_djcs: Argument 'afeidxlist' has the wrong length, expected __tmp_2".to_string());
}
let mut __tmp_4 : i64 = i64::default();
let __tmp_5 = unsafe { MSK_getdjcnumafetot(self.ptr,&mut __tmp_4) };let _ = self.handle_res(__tmp_5,"getdjcnumafetot")?;
if b_.len() != (__tmp_4).try_into().unwrap() {
return Result::Err("get_djcs: Argument 'b' has the wrong length, expected __tmp_4".to_string());
}
let mut __tmp_6 : i64 = i64::default();
let __tmp_7 = unsafe { MSK_getdjcnumtermtot(self.ptr,&mut __tmp_6) };let _ = self.handle_res(__tmp_7,"getdjcnumtermtot")?;
if termsizelist_.len() != (__tmp_6).try_into().unwrap() {
return Result::Err("get_djcs: Argument 'termsizelist' has the wrong length, expected __tmp_6".to_string());
}
let mut __tmp_8 : i64 = i64::default();
let __tmp_9 = unsafe { MSK_getnumdjc(self.ptr,&mut __tmp_8) };let _ = self.handle_res(__tmp_9,"getnumdjc")?;
if numterms_.len() != (__tmp_8).try_into().unwrap() {
return Result::Err("get_djcs: Argument 'numterms' has the wrong length, expected __tmp_8".to_string());
}
self.handle_res(unsafe { MSK_getdjcs(self.ptr,domidxlist_.as_mut_ptr(),afeidxlist_.as_mut_ptr(),b_.as_mut_ptr(),termsizelist_.as_mut_ptr(),numterms_.as_mut_ptr()) },"get_djcs")?;
return Result::Ok(());
} // getdjcs
/// Obtains the list of term sizes in a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `termsizelist_` List of term sizes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdjctermsizelist>
#[allow(unused_parens)]
pub fn get_djc_term_size_list(&self,djcidx_ : i64,termsizelist_ : &mut[i64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getdjcnumterm(self.ptr,djcidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getdjcnumterm")?;
if termsizelist_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_djc_term_size_list: Argument 'termsizelist' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getdjctermsizelist(self.ptr,djcidx_,termsizelist_.as_mut_ptr()) },"get_djc_term_size_list")?;
return Result::Ok(());
} // getdjctermsizelist
/// Obtains the dimension of the domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
///
/// # Returns
///
/// - `n` Dimension of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdomainn>
#[allow(unused_parens)]
pub fn get_domain_n(&self,domidx_ : i64) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getdomainn(self.ptr,domidx_,&mut __tmp_0) },"get_domain_n")?;
return Result::Ok(__tmp_0);
} // getdomainn
/// Obtains the name of a domain.
///
/// # Arguments
///
/// - `domidx_` Index of a domain.
///
/// # Returns
///
/// - `name` Returns the required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdomainname>
#[allow(unused_parens)]
pub fn get_domain_name(&self,domidx_ : i64) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getdomainnamelen(self.ptr,domidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getdomainnamelen")?;
let sizename_ : i32 = (1+__tmp_0);
let mut name_ = Vec::new(); name_.resize(sizename_ as usize,0);
self.handle_res(unsafe { MSK_getdomainname(self.ptr,domidx_,sizename_,name_.as_mut_ptr()) },"get_domain_name")?;
return Result::Ok(String::from_utf8_lossy(&name_[..name_.iter().position(|&c| c == 0).unwrap_or(sizename_ as usize)]).into_owned());
} // getdomainname
/// Obtains the length of the name of a domain.
///
/// # Arguments
///
/// - `domidx_` Index of a domain.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdomainnamelen>
#[allow(unused_parens)]
pub fn get_domain_name_len(&self,domidx_ : i64) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getdomainnamelen(self.ptr,domidx_,&mut __tmp_0) },"get_domain_name_len")?;
return Result::Ok(__tmp_0);
} // getdomainnamelen
/// Returns the type of the domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
///
/// # Returns
///
/// - `domtype` The type of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdomaintype>
#[allow(unused_parens)]
pub fn get_domain_type(&self,domidx_ : i64) -> Result<i32,String> {
let mut __tmp_0 : i32 = 0;
self.handle_res(unsafe { MSK_getdomaintype(self.ptr,domidx_,&mut __tmp_0) },"get_domain_type")?;
return Result::Ok(__tmp_0);
} // getdomaintype
/// Obtains a double information item.
///
/// # Arguments
///
/// - `whichdinf_` Specifies a double information item.
///
/// See [Dinfitem]
///
/// # Returns
///
/// - `dvalue` The value of the required double information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdouinf>
#[allow(unused_parens)]
pub fn get_dou_inf(&self,whichdinf_ : i32) -> Result<f64,String> {
let mut __tmp_0 : f64 = f64::default();
self.handle_res(unsafe { MSK_getdouinf(self.ptr,whichdinf_,&mut __tmp_0) },"get_dou_inf")?;
return Result::Ok(__tmp_0);
} // getdouinf
/// Obtains a double parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Dparam]
///
/// # Returns
///
/// - `parvalue` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdouparam>
#[allow(unused_parens)]
pub fn get_dou_param(&self,param_ : i32) -> Result<f64,String> {
let mut __tmp_0 : f64 = f64::default();
self.handle_res(unsafe { MSK_getdouparam(self.ptr,param_,&mut __tmp_0) },"get_dou_param")?;
return Result::Ok(__tmp_0);
} // getdouparam
/// Computes the dual objective value associated with the solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `dualobj_` Objective value corresponding to the dual solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdualobj>
#[allow(unused_parens)]
pub fn get_dual_obj(&self,whichsol_ : i32,dualobj_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getdualobj(self.ptr,whichsol_,dualobj_) },"get_dual_obj")?;
return Result::Ok(());
} // getdualobj
/// Compute norms of the dual solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `nrmy_` The norm of the y vector.
/// - `nrmslc_` The norm of the slc vector.
/// - `nrmsuc_` The norm of the suc vector.
/// - `nrmslx_` The norm of the slx vector.
/// - `nrmsux_` The norm of the sux vector.
/// - `nrmsnx_` The norm of the snx vector.
/// - `nrmbars_` The norm of the bars vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdualsolutionnorms>
#[allow(unused_parens)]
pub fn get_dual_solution_norms(&self,whichsol_ : i32,nrmy_ : &mut f64,nrmslc_ : &mut f64,nrmsuc_ : &mut f64,nrmslx_ : &mut f64,nrmsux_ : &mut f64,nrmsnx_ : &mut f64,nrmbars_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getdualsolutionnorms(self.ptr,whichsol_,nrmy_,nrmslc_,nrmsuc_,nrmslx_,nrmsux_,nrmsnx_,nrmbars_) },"get_dual_solution_norms")?;
return Result::Ok(());
} // getdualsolutionnorms
/// Computes the violation of the dual solution for set of affine conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidxlist_` An array of indexes of conic constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolacc>
#[allow(unused_parens)]
pub fn get_dviol_acc(&self,whichsol_ : i32,accidxlist_ : &[i64],viol_ : &mut[f64]) -> Result<(),String> {
let numaccidx_ : i64 = accidxlist_.len() as i64;
if viol_.len() != (numaccidx_).try_into().unwrap() {
return Result::Err("get_dviol_acc: Argument 'viol' has the wrong length, expected numaccidx_".to_string());
}
self.handle_res(unsafe { MSK_getdviolacc(self.ptr,whichsol_,numaccidx_,accidxlist_.as_ptr(),viol_.as_mut_ptr()) },"get_dviol_acc")?;
return Result::Ok(());
} // getdviolacc
/// Computes the violation of dual solution for a set of semidefinite variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of barx variables.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolbarvar>
#[allow(unused_parens)]
pub fn get_dviol_barvar(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
if viol_.len() != (num_).try_into().unwrap() {
return Result::Err("get_dviol_barvar: Argument 'viol' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getdviolbarvar(self.ptr,whichsol_,num_,sub_.as_ptr(),viol_.as_mut_ptr()) },"get_dviol_barvar")?;
return Result::Ok(());
} // getdviolbarvar
/// Computes the violation of a dual solution associated with a set of constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolcon>
#[allow(unused_parens)]
pub fn get_dviol_con(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
if viol_.len() != (num_).try_into().unwrap() {
return Result::Err("get_dviol_con: Argument 'viol' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getdviolcon(self.ptr,whichsol_,num_,sub_.as_ptr(),viol_.as_mut_ptr()) },"get_dviol_con")?;
return Result::Ok(());
} // getdviolcon
/// Computes the violation of a solution for set of dual conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of conic constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolcones>
#[allow(unused_parens)]
pub fn get_dviol_cones(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
if viol_.len() != (num_).try_into().unwrap() {
return Result::Err("get_dviol_cones: Argument 'viol' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getdviolcones(self.ptr,whichsol_,num_,sub_.as_ptr(),viol_.as_mut_ptr()) },"get_dviol_cones")?;
return Result::Ok(());
} // getdviolcones
/// Computes the violation of a dual solution associated with a set of scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of x variables.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getdviolvar>
#[allow(unused_parens)]
pub fn get_dviol_var(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
if viol_.len() != (num_).try_into().unwrap() {
return Result::Err("get_dviol_var: Argument 'viol' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getdviolvar(self.ptr,whichsol_,num_,sub_.as_ptr(),viol_.as_mut_ptr()) },"get_dviol_var")?;
return Result::Ok(());
} // getdviolvar
/// Obtains the index of a named information item.
///
/// # Arguments
///
/// - `inftype_` Type of the information item.
///
/// See [Inftype]
/// - `infname_` Name of the information item.
/// - `infindex_` The item index.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getinfindex>
#[allow(unused_parens)]
pub fn get_inf_index(&self,inftype_ : i32,infname_ : &str,infindex_ : &mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(infname_).unwrap();
self.handle_res(unsafe { MSK_getinfindex(self.ptr,inftype_,__tmp_1.as_ptr(),infindex_) },"get_inf_index")?;
return Result::Ok(());
} // getinfindex
/// Obtains the maximum index of an information item of a given type.
///
/// # Arguments
///
/// - `inftype_` Type of the information item.
///
/// See [Inftype]
/// - `infmax_` The maximum index (plus 1) requested.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getinfmax>
#[allow(unused_parens)]
pub fn get_inf_max(&self,inftype_ : i32,infmax_ : &mut[i32]) -> Result<(),String> {
if infmax_.len() > 0 && infmax_.len() != (Value::MAX_STR_LEN).try_into().unwrap() {
return Result::Err("get_inf_max: Argument 'infmax' has the wrong length, expected Value::MAX_STR_LEN".to_string());
}
self.handle_res(unsafe { MSK_getinfmax(self.ptr,inftype_,if infmax_.len() == 0 { std::ptr::null_mut() } else { infmax_.as_mut_ptr() }) },"get_inf_max")?;
return Result::Ok(());
} // getinfmax
/// Obtains the name of an information item.
///
/// # Arguments
///
/// - `inftype_` Type of the information item.
///
/// See [Inftype]
/// - `whichinf_` An information item.
///
/// # Returns
///
/// - `infname` Name of the information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getinfname>
#[allow(unused_parens)]
pub fn get_inf_name(&self,inftype_ : i32,whichinf_ : i32) -> Result<String,String> {
let mut infname_ = Vec::new(); infname_.resize(Value::MAX_STR_LEN as usize,0);
self.handle_res(unsafe { MSK_getinfname(self.ptr,inftype_,whichinf_,infname_.as_mut_ptr()) },"get_inf_name")?;
return Result::Ok(String::from_utf8_lossy(&infname_[..infname_.iter().position(|&c| c == 0).unwrap_or(Value::MAX_STR_LEN as usize)]).into_owned());
} // getinfname
/// Obtains an integer information item.
///
/// # Arguments
///
/// - `whichiinf_` Specifies an integer information item.
///
/// See [Iinfitem]
///
/// # Returns
///
/// - `ivalue` The value of the required integer information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getintinf>
#[allow(unused_parens)]
pub fn get_int_inf(&self,whichiinf_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getintinf(self.ptr,whichiinf_,&mut __tmp_0) },"get_int_inf")?;
return Result::Ok(__tmp_0);
} // getintinf
/// Obtains an integer parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Iparam]
///
/// # Returns
///
/// - `parvalue` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getintparam>
#[allow(unused_parens)]
pub fn get_int_param(&self,param_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getintparam(self.ptr,param_,&mut __tmp_0) },"get_int_param")?;
return Result::Ok(__tmp_0);
} // getintparam
/// Obtains the length of one semidefinite variable.
///
/// # Arguments
///
/// - `j_` Index of the semidefinite variable whose length if requested.
///
/// # Returns
///
/// - `lenbarvarj` Number of scalar elements in the lower triangular part of the semidefinite variable.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getlenbarvarj>
#[allow(unused_parens)]
pub fn get_len_barvar_j(&self,j_ : i32) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getlenbarvarj(self.ptr,j_,&mut __tmp_0) },"get_len_barvar_j")?;
return Result::Ok(__tmp_0);
} // getlenbarvarj
/// Obtains a long integer information item.
///
/// # Arguments
///
/// - `whichliinf_` Specifies a long information item.
///
/// See [Liinfitem]
///
/// # Returns
///
/// - `ivalue` The value of the required long integer information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getlintinf>
#[allow(unused_parens)]
pub fn get_lint_inf(&self,whichliinf_ : i32) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getlintinf(self.ptr,whichliinf_,&mut __tmp_0) },"get_lint_inf")?;
return Result::Ok(__tmp_0);
} // getlintinf
/// Obtains the maximum length (not including terminating zero character) of any objective, constraint, variable, domain or cone name.
///
/// # Arguments
///
/// - `maxlen_` The maximum length of any name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnamelen>
#[allow(unused_parens)]
pub fn get_max_name_len(&self,maxlen_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getmaxnamelen(self.ptr,maxlen_) },"get_max_name_len")?;
return Result::Ok(());
} // getmaxnamelen
/// Obtains number of preallocated non-zeros in the linear constraint matrix.
///
/// # Returns
///
/// - `maxnumanz` Number of preallocated non-zero linear matrix elements.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumanz64>
#[allow(unused_parens)]
pub fn get_max_num_a_nz(&self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getmaxnumanz64(self.ptr,&mut __tmp_0) },"get_max_num_a_nz")?;
return Result::Ok(__tmp_0);
} // getmaxnumanz64
/// Obtains maximum number of symmetric matrix variables for which space is currently preallocated.
///
/// # Returns
///
/// - `maxnumbarvar` Maximum number of symmetric matrix variables for which space is currently preallocated.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumbarvar>
#[allow(unused_parens)]
pub fn get_max_num_barvar(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getmaxnumbarvar(self.ptr,&mut __tmp_0) },"get_max_num_barvar")?;
return Result::Ok(__tmp_0);
} // getmaxnumbarvar
/// Obtains the number of preallocated constraints in the optimization task.
///
/// # Arguments
///
/// - `maxnumcon_` Number of preallocated constraints in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumcon>
#[allow(unused_parens)]
pub fn get_max_num_con(&self,maxnumcon_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getmaxnumcon(self.ptr,maxnumcon_) },"get_max_num_con")?;
return Result::Ok(());
} // getmaxnumcon
/// Obtains the number of preallocated cones in the optimization task.
///
/// # Arguments
///
/// - `maxnumcone_` Number of preallocated conic constraints in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumcone>
#[allow(unused_parens)]
pub fn get_max_num_cone(&self,maxnumcone_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getmaxnumcone(self.ptr,maxnumcone_) },"get_max_num_cone")?;
return Result::Ok(());
} // getmaxnumcone
/// Obtains the number of preallocated non-zeros for all quadratic terms in objective and constraints.
///
/// # Arguments
///
/// - `maxnumqnz_` Number of non-zero elements preallocated in quadratic coefficient matrices.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumqnz64>
#[allow(unused_parens)]
pub fn get_max_num_q_nz(&self,maxnumqnz_ : &mut i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getmaxnumqnz64(self.ptr,maxnumqnz_) },"get_max_num_q_nz")?;
return Result::Ok(());
} // getmaxnumqnz64
/// Obtains the maximum number variables allowed.
///
/// # Arguments
///
/// - `maxnumvar_` Number of preallocated variables in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmaxnumvar>
#[allow(unused_parens)]
pub fn get_max_num_var(&self,maxnumvar_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getmaxnumvar(self.ptr,maxnumvar_) },"get_max_num_var")?;
return Result::Ok(());
} // getmaxnumvar
/// Obtains information about the amount of memory used by a task.
///
/// # Arguments
///
/// - `meminuse_` Amount of memory currently used by the task.
/// - `maxmemuse_` Maximum amount of memory used by the task until now.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmemusagetask>
#[allow(unused_parens)]
pub fn get_mem_usage(&self,meminuse_ : &mut i64,maxmemuse_ : &mut i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getmemusagetask(self.ptr,meminuse_,maxmemuse_) },"get_mem_usage")?;
return Result::Ok(());
} // getmemusagetask
/// Obtains the number of threads used by the mixed integer optimizer.
///
/// # Returns
///
/// - `numthreads` The number of threads.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getmionumthreads>
#[allow(unused_parens)]
pub fn get_mio_num_threads(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getmionumthreads(self.ptr,&mut __tmp_0) },"get_mio_num_threads")?;
return Result::Ok(__tmp_0);
} // getmionumthreads
/// Obtains a named double information item.
///
/// # Arguments
///
/// - `infitemname_` The name of a double information item.
/// - `dvalue_` The value of the required double information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnadouinf>
#[allow(unused_parens)]
pub fn get_na_dou_inf(&self,infitemname_ : &str,dvalue_ : &mut f64) -> Result<(),String> {
let __tmp_1 = CString::new(infitemname_).unwrap();
self.handle_res(unsafe { MSK_getnadouinf(self.ptr,__tmp_1.as_ptr(),dvalue_) },"get_na_dou_inf")?;
return Result::Ok(());
} // getnadouinf
/// Obtains a double parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnadouparam>
#[allow(unused_parens)]
pub fn get_na_dou_param(&self,paramname_ : &str,parvalue_ : &mut f64) -> Result<(),String> {
let __tmp_1 = CString::new(paramname_).unwrap();
self.handle_res(unsafe { MSK_getnadouparam(self.ptr,__tmp_1.as_ptr(),parvalue_) },"get_na_dou_param")?;
return Result::Ok(());
} // getnadouparam
/// Obtains a named integer information item.
///
/// # Arguments
///
/// - `infitemname_` The name of an integer information item.
/// - `ivalue_` The value of the required integer information item.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnaintinf>
#[allow(unused_parens)]
pub fn get_na_int_inf(&self,infitemname_ : &str,ivalue_ : &mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(infitemname_).unwrap();
self.handle_res(unsafe { MSK_getnaintinf(self.ptr,__tmp_1.as_ptr(),ivalue_) },"get_na_int_inf")?;
return Result::Ok(());
} // getnaintinf
/// Obtains an integer parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnaintparam>
#[allow(unused_parens)]
pub fn get_na_int_param(&self,paramname_ : &str,parvalue_ : &mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(paramname_).unwrap();
self.handle_res(unsafe { MSK_getnaintparam(self.ptr,__tmp_1.as_ptr(),parvalue_) },"get_na_int_param")?;
return Result::Ok(());
} // getnaintparam
/// Obtains a string parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `sizeparamname_` Size of the name buffer.
/// - `len_` Returns the length of the parameter value.
///
/// # Returns
///
/// - `parvalue` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnastrparam>
#[allow(unused_parens)]
pub fn get_na_str_param(&self,paramname_ : &str,sizeparamname_ : i32,len_ : &mut i32) -> Result<String,String> {
let __tmp_1 = CString::new(paramname_).unwrap();
let mut parvalue_ = Vec::new(); parvalue_.resize(sizeparamname_ as usize,0);
self.handle_res(unsafe { MSK_getnastrparam(self.ptr,__tmp_1.as_ptr(),sizeparamname_,len_,parvalue_.as_mut_ptr()) },"get_na_str_param")?;
return Result::Ok(String::from_utf8_lossy(&parvalue_[..parvalue_.iter().position(|&c| c == 0).unwrap_or(sizeparamname_ as usize)]).into_owned());
} // getnastrparam
/// Obtains the number of affine conic constraints.
///
/// # Returns
///
/// - `num` The number of affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumacc>
#[allow(unused_parens)]
pub fn get_num_acc(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumacc(self.ptr,&mut __tmp_0) },"get_num_acc")?;
return Result::Ok(__tmp_0);
} // getnumacc
/// Obtains the number of affine expressions.
///
/// # Returns
///
/// - `numafe` Number of affine expressions.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumafe>
#[allow(unused_parens)]
pub fn get_num_afe(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumafe(self.ptr,&mut __tmp_0) },"get_num_afe")?;
return Result::Ok(__tmp_0);
} // getnumafe
/// Obtains the number of non-zeros in the coefficient matrix.
///
/// # Returns
///
/// - `numanz` Number of non-zero elements in the linear constraint matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumanz>
#[allow(unused_parens)]
pub fn get_num_a_nz(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getnumanz(self.ptr,&mut __tmp_0) },"get_num_a_nz")?;
return Result::Ok(__tmp_0);
} // getnumanz
/// Obtains the number of non-zeros in the coefficient matrix.
///
/// # Returns
///
/// - `numanz` Number of non-zero elements in the linear constraint matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumanz64>
#[allow(unused_parens)]
pub fn get_num_a_nz_64(&self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumanz64(self.ptr,&mut __tmp_0) },"get_num_a_nz_64")?;
return Result::Ok(__tmp_0);
} // getnumanz64
/// Obtains an upper bound on the number of scalar elements in the block triplet form of bara.
///
/// # Returns
///
/// - `num` An upper bound on the number of elements in the block triplet form of bara.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbarablocktriplets>
#[allow(unused_parens)]
pub fn get_num_bara_block_triplets(&self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumbarablocktriplets(self.ptr,&mut __tmp_0) },"get_num_bara_block_triplets")?;
return Result::Ok(__tmp_0);
} // getnumbarablocktriplets
/// Get the number of nonzero elements in barA.
///
/// # Returns
///
/// - `nz` The number of nonzero block elements in barA.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbaranz>
#[allow(unused_parens)]
pub fn get_num_bara_nz(&self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumbaranz(self.ptr,&mut __tmp_0) },"get_num_bara_nz")?;
return Result::Ok(__tmp_0);
} // getnumbaranz
/// Obtains an upper bound on the number of elements in the block triplet form of barc.
///
/// # Returns
///
/// - `num` An upper bound on the number of elements in the block triplet form of barc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbarcblocktriplets>
#[allow(unused_parens)]
pub fn get_num_barc_block_triplets(&self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumbarcblocktriplets(self.ptr,&mut __tmp_0) },"get_num_barc_block_triplets")?;
return Result::Ok(__tmp_0);
} // getnumbarcblocktriplets
/// Obtains the number of nonzero elements in barc.
///
/// # Returns
///
/// - `nz` The number of nonzero elements in barc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbarcnz>
#[allow(unused_parens)]
pub fn get_num_barc_nz(&self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumbarcnz(self.ptr,&mut __tmp_0) },"get_num_barc_nz")?;
return Result::Ok(__tmp_0);
} // getnumbarcnz
/// Obtains the number of semidefinite variables.
///
/// # Returns
///
/// - `numbarvar` Number of semidefinite variables in the problem.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumbarvar>
#[allow(unused_parens)]
pub fn get_num_barvar(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getnumbarvar(self.ptr,&mut __tmp_0) },"get_num_barvar")?;
return Result::Ok(__tmp_0);
} // getnumbarvar
/// Obtains the number of constraints.
///
/// # Returns
///
/// - `numcon` Number of constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumcon>
#[allow(unused_parens)]
pub fn get_num_con(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) },"get_num_con")?;
return Result::Ok(__tmp_0);
} // getnumcon
/// Obtains the number of cones.
///
/// # Returns
///
/// - `numcone` Number of conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumcone>
#[allow(unused_parens)]
pub fn get_num_cone(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getnumcone(self.ptr,&mut __tmp_0) },"get_num_cone")?;
return Result::Ok(__tmp_0);
} // getnumcone
/// Obtains the number of members in a cone.
///
/// # Arguments
///
/// - `k_` Index of the cone.
/// - `nummem_` Number of member variables in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumconemem>
#[allow(unused_parens)]
pub fn get_num_cone_mem(&self,k_ : i32,nummem_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getnumconemem(self.ptr,k_,nummem_) },"get_num_cone_mem")?;
return Result::Ok(());
} // getnumconemem
/// Obtains the number of disjunctive constraints.
///
/// # Returns
///
/// - `num` The number of disjunctive constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumdjc>
#[allow(unused_parens)]
pub fn get_num_djc(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumdjc(self.ptr,&mut __tmp_0) },"get_num_djc")?;
return Result::Ok(__tmp_0);
} // getnumdjc
/// Obtain the number of domains defined.
///
/// # Returns
///
/// - `numdomain` Number of domains in the task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumdomain>
#[allow(unused_parens)]
pub fn get_num_domain(&mut self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumdomain(self.ptr,&mut __tmp_0) },"get_num_domain")?;
return Result::Ok(__tmp_0);
} // getnumdomain
/// Obtains the number of integer-constrained variables.
///
/// # Returns
///
/// - `numintvar` Number of integer variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumintvar>
#[allow(unused_parens)]
pub fn get_num_int_var(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getnumintvar(self.ptr,&mut __tmp_0) },"get_num_int_var")?;
return Result::Ok(__tmp_0);
} // getnumintvar
/// Obtains the number of parameters of a given type.
///
/// # Arguments
///
/// - `partype_` Parameter type.
///
/// See [Parametertype]
/// - `numparam_` Returns the number of parameters of the requested type.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumparam>
#[allow(unused_parens)]
pub fn get_num_param(&self,partype_ : i32,numparam_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getnumparam(self.ptr,partype_,numparam_) },"get_num_param")?;
return Result::Ok(());
} // getnumparam
/// Obtains the number of non-zero quadratic terms in a constraint.
///
/// # Arguments
///
/// - `k_` Index of the constraint for which the number quadratic terms should be obtained.
///
/// # Returns
///
/// - `numqcnz` Number of quadratic terms.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumqconknz64>
#[allow(unused_parens)]
pub fn get_num_q_con_k_nz(&self,k_ : i32) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumqconknz64(self.ptr,k_,&mut __tmp_0) },"get_num_q_con_k_nz")?;
return Result::Ok(__tmp_0);
} // getnumqconknz64
/// Obtains the number of non-zero quadratic terms in the objective.
///
/// # Returns
///
/// - `numqonz` Number of non-zero elements in the quadratic objective terms.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumqobjnz64>
#[allow(unused_parens)]
pub fn get_num_q_obj_nz(&self) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
self.handle_res(unsafe { MSK_getnumqobjnz64(self.ptr,&mut __tmp_0) },"get_num_q_obj_nz")?;
return Result::Ok(__tmp_0);
} // getnumqobjnz64
/// Obtains the number of symmetric matrices stored.
///
/// # Arguments
///
/// - `num_` The number of symmetric sparse matrices.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumsymmat>
#[allow(unused_parens)]
pub fn get_num_sym_mat(&self,num_ : &mut i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getnumsymmat(self.ptr,num_) },"get_num_sym_mat")?;
return Result::Ok(());
} // getnumsymmat
/// Obtains the number of variables.
///
/// # Returns
///
/// - `numvar` Number of variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getnumvar>
#[allow(unused_parens)]
pub fn get_num_var(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) },"get_num_var")?;
return Result::Ok(__tmp_0);
} // getnumvar
/// Obtains the name assigned to the objective function.
///
/// # Returns
///
/// - `objname` Assigned the objective name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getobjname>
#[allow(unused_parens)]
pub fn get_obj_name(&self) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getobjnamelen(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getobjnamelen")?;
let sizeobjname_ : i32 = (1+__tmp_0);
let mut objname_ = Vec::new(); objname_.resize(sizeobjname_ as usize,0);
self.handle_res(unsafe { MSK_getobjname(self.ptr,sizeobjname_,objname_.as_mut_ptr()) },"get_obj_name")?;
return Result::Ok(String::from_utf8_lossy(&objname_[..objname_.iter().position(|&c| c == 0).unwrap_or(sizeobjname_ as usize)]).into_owned());
} // getobjname
/// Obtains the length of the name assigned to the objective function.
///
/// # Returns
///
/// - `len` Assigned the length of the objective name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getobjnamelen>
#[allow(unused_parens)]
pub fn get_obj_name_len(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getobjnamelen(self.ptr,&mut __tmp_0) },"get_obj_name_len")?;
return Result::Ok(__tmp_0);
} // getobjnamelen
/// Gets the objective sense.
///
/// # Returns
///
/// - `sense` The returned objective sense.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getobjsense>
#[allow(unused_parens)]
pub fn get_obj_sense(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = 0;
self.handle_res(unsafe { MSK_getobjsense(self.ptr,&mut __tmp_0) },"get_obj_sense")?;
return Result::Ok(__tmp_0);
} // getobjsense
/// Obtains the maximum index of a parameter of a given type.
///
/// # Arguments
///
/// - `partype_` Parameter type.
///
/// See [Parametertype]
/// - `parammax_` The maximum index (plus 1) of the given parameter type.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getparammax>
#[allow(unused_parens)]
pub fn get_param_max(&self,partype_ : i32,parammax_ : &mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getparammax(self.ptr,partype_,parammax_) },"get_param_max")?;
return Result::Ok(());
} // getparammax
/// Obtains the name of a parameter.
///
/// # Arguments
///
/// - `partype_` Parameter type.
///
/// See [Parametertype]
/// - `param_` Which parameter.
///
/// # Returns
///
/// - `parname` Parameter name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getparamname>
#[allow(unused_parens)]
pub fn get_param_name(&self,partype_ : i32,param_ : i32) -> Result<String,String> {
let mut parname_ = Vec::new(); parname_.resize(Value::MAX_STR_LEN as usize,0);
self.handle_res(unsafe { MSK_getparamname(self.ptr,partype_,param_,parname_.as_mut_ptr()) },"get_param_name")?;
return Result::Ok(String::from_utf8_lossy(&parname_[..parname_.iter().position(|&c| c == 0).unwrap_or(Value::MAX_STR_LEN as usize)]).into_owned());
} // getparamname
/// Obtains the exponent vector of a power domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
/// - `alpha_` The exponent vector of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpowerdomainalpha>
#[allow(unused_parens)]
pub fn get_power_domain_alpha(&mut self,domidx_ : i64,alpha_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let mut __tmp_1 : i64 = i64::default();
let __tmp_2 = unsafe { MSK_getpowerdomaininfo(self.ptr,domidx_,&mut __tmp_0,&mut __tmp_1) };let _ = self.handle_res(__tmp_2,"getpowerdomaininfo")?;
if alpha_.len() != (__tmp_1).try_into().unwrap() {
return Result::Err("get_power_domain_alpha: Argument 'alpha' has the wrong length, expected __tmp_1".to_string());
}
self.handle_res(unsafe { MSK_getpowerdomainalpha(self.ptr,domidx_,alpha_.as_mut_ptr()) },"get_power_domain_alpha")?;
return Result::Ok(());
} // getpowerdomainalpha
/// Obtains structural information about a power domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
/// - `n_` Dimension of the domain.
/// - `nleft_` Number of variables on the left hand side.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpowerdomaininfo>
#[allow(unused_parens)]
pub fn get_power_domain_info(&mut self,domidx_ : i64,n_ : &mut i64,nleft_ : &mut i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getpowerdomaininfo(self.ptr,domidx_,n_,nleft_) },"get_power_domain_info")?;
return Result::Ok(());
} // getpowerdomaininfo
/// Computes the primal objective value for the desired solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// # Returns
///
/// - `primalobj` Objective value corresponding to the primal solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getprimalobj>
#[allow(unused_parens)]
pub fn get_primal_obj(&self,whichsol_ : i32) -> Result<f64,String> {
let mut __tmp_0 : f64 = f64::default();
self.handle_res(unsafe { MSK_getprimalobj(self.ptr,whichsol_,&mut __tmp_0) },"get_primal_obj")?;
return Result::Ok(__tmp_0);
} // getprimalobj
/// Compute norms of the primal solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `nrmxc_` The norm of the xc vector.
/// - `nrmxx_` The norm of the xx vector.
/// - `nrmbarx_` The norm of the barX vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getprimalsolutionnorms>
#[allow(unused_parens)]
pub fn get_primal_solution_norms(&self,whichsol_ : i32,nrmxc_ : &mut f64,nrmxx_ : &mut f64,nrmbarx_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getprimalsolutionnorms(self.ptr,whichsol_,nrmxc_,nrmxx_,nrmbarx_) },"get_primal_solution_norms")?;
return Result::Ok(());
} // getprimalsolutionnorms
/// Obtains the problem type.
///
/// # Returns
///
/// - `probtype` The problem type.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getprobtype>
#[allow(unused_parens)]
pub fn get_prob_type(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = 0;
self.handle_res(unsafe { MSK_getprobtype(self.ptr,&mut __tmp_0) },"get_prob_type")?;
return Result::Ok(__tmp_0);
} // getprobtype
/// Obtains the problem status.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// # Returns
///
/// - `problemsta` Problem status.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getprosta>
#[allow(unused_parens)]
pub fn get_pro_sta(&self,whichsol_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = 0;
self.handle_res(unsafe { MSK_getprosta(self.ptr,whichsol_,&mut __tmp_0) },"get_pro_sta")?;
return Result::Ok(__tmp_0);
} // getprosta
/// Computes the violation of a solution for set of affine conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidxlist_` An array of indexes of conic constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolacc>
#[allow(unused_parens)]
pub fn get_pviol_acc(&self,whichsol_ : i32,accidxlist_ : &[i64],viol_ : &mut[f64]) -> Result<(),String> {
let numaccidx_ : i64 = accidxlist_.len() as i64;
if viol_.len() != (numaccidx_).try_into().unwrap() {
return Result::Err("get_pviol_acc: Argument 'viol' has the wrong length, expected numaccidx_".to_string());
}
self.handle_res(unsafe { MSK_getpviolacc(self.ptr,whichsol_,numaccidx_,accidxlist_.as_ptr(),viol_.as_mut_ptr()) },"get_pviol_acc")?;
return Result::Ok(());
} // getpviolacc
/// Computes the violation of a primal solution for a list of semidefinite variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of barX variables.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolbarvar>
#[allow(unused_parens)]
pub fn get_pviol_barvar(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
if viol_.len() != (num_).try_into().unwrap() {
return Result::Err("get_pviol_barvar: Argument 'viol' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getpviolbarvar(self.ptr,whichsol_,num_,sub_.as_ptr(),viol_.as_mut_ptr()) },"get_pviol_barvar")?;
return Result::Ok(());
} // getpviolbarvar
/// Computes the violation of a primal solution associated to a constraint.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolcon>
#[allow(unused_parens)]
pub fn get_pviol_con(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
if viol_.len() != (num_).try_into().unwrap() {
return Result::Err("get_pviol_con: Argument 'viol' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getpviolcon(self.ptr,whichsol_,num_,sub_.as_ptr(),viol_.as_mut_ptr()) },"get_pviol_con")?;
return Result::Ok(());
} // getpviolcon
/// Computes the violation of a solution for set of conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of conic constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolcones>
#[allow(unused_parens)]
pub fn get_pviol_cones(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
if viol_.len() != (num_).try_into().unwrap() {
return Result::Err("get_pviol_cones: Argument 'viol' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getpviolcones(self.ptr,whichsol_,num_,sub_.as_ptr(),viol_.as_mut_ptr()) },"get_pviol_cones")?;
return Result::Ok(());
} // getpviolcones
/// Computes the violation of a solution for set of disjunctive constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `djcidxlist_` An array of indexes of disjunctive constraints.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpvioldjc>
#[allow(unused_parens)]
pub fn get_pviol_djc(&self,whichsol_ : i32,djcidxlist_ : &[i64],viol_ : &mut[f64]) -> Result<(),String> {
let numdjcidx_ : i64 = djcidxlist_.len() as i64;
if viol_.len() != (numdjcidx_).try_into().unwrap() {
return Result::Err("get_pviol_djc: Argument 'viol' has the wrong length, expected numdjcidx_".to_string());
}
self.handle_res(unsafe { MSK_getpvioldjc(self.ptr,whichsol_,numdjcidx_,djcidxlist_.as_ptr(),viol_.as_mut_ptr()) },"get_pviol_djc")?;
return Result::Ok(());
} // getpvioldjc
/// Computes the violation of a primal solution for a list of scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sub_` An array of indexes of x variables.
/// - `viol_` List of violations corresponding to sub.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getpviolvar>
#[allow(unused_parens)]
pub fn get_pviol_var(&self,whichsol_ : i32,sub_ : &[i32],viol_ : &mut[f64]) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
if viol_.len() != (num_).try_into().unwrap() {
return Result::Err("get_pviol_var: Argument 'viol' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getpviolvar(self.ptr,whichsol_,num_,sub_.as_ptr(),viol_.as_mut_ptr()) },"get_pviol_var")?;
return Result::Ok(());
} // getpviolvar
/// Obtains all the quadratic terms in a constraint.
///
/// # Arguments
///
/// - `k_` Which constraint.
/// - `qcsubi_` Row subscripts for quadratic constraint matrix.
/// - `qcsubj_` Column subscripts for quadratic constraint matrix.
/// - `qcval_` Quadratic constraint coefficient values.
///
/// # Returns
///
/// - `numqcnz` Number of quadratic terms.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getqconk64>
#[allow(unused_parens)]
pub fn get_q_con_k(&self,k_ : i32,qcsubi_ : &mut[i32],qcsubj_ : &mut[i32],qcval_ : &mut[f64]) -> Result<i64,String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getnumqconknz64(self.ptr,k_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumqconknz64")?;
let maxnumqcnz_ : i64 = __tmp_0;
let mut __tmp_2 : i64 = i64::default();
let mut __tmp_3 : i64 = i64::default();
let __tmp_4 = unsafe { MSK_getnumqconknz64(self.ptr,k_,&mut __tmp_3) };let _ = self.handle_res(__tmp_4,"getnumqconknz64")?;
if qcsubi_.len() != (__tmp_3).try_into().unwrap() {
return Result::Err("get_q_con_k: Argument 'qcsubi' has the wrong length, expected __tmp_3".to_string());
}
let mut __tmp_5 : i64 = i64::default();
let __tmp_6 = unsafe { MSK_getnumqconknz64(self.ptr,k_,&mut __tmp_5) };let _ = self.handle_res(__tmp_6,"getnumqconknz64")?;
if qcsubj_.len() != (__tmp_5).try_into().unwrap() {
return Result::Err("get_q_con_k: Argument 'qcsubj' has the wrong length, expected __tmp_5".to_string());
}
let mut __tmp_7 : i64 = i64::default();
let __tmp_8 = unsafe { MSK_getnumqconknz64(self.ptr,k_,&mut __tmp_7) };let _ = self.handle_res(__tmp_8,"getnumqconknz64")?;
if qcval_.len() != (__tmp_7).try_into().unwrap() {
return Result::Err("get_q_con_k: Argument 'qcval' has the wrong length, expected __tmp_7".to_string());
}
self.handle_res(unsafe { MSK_getqconk64(self.ptr,k_,maxnumqcnz_,&mut __tmp_2,qcsubi_.as_mut_ptr(),qcsubj_.as_mut_ptr(),qcval_.as_mut_ptr()) },"get_q_con_k")?;
return Result::Ok(__tmp_2);
} // getqconk64
/// Obtains all the quadratic terms in the objective.
///
/// # Arguments
///
/// - `numqonz_` Number of non-zero elements in the quadratic objective terms.
/// - `qosubi_` Row subscripts for quadratic objective coefficients.
/// - `qosubj_` Column subscripts for quadratic objective coefficients.
/// - `qoval_` Quadratic objective coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getqobj64>
#[allow(unused_parens)]
pub fn get_q_obj(&self,numqonz_ : &mut i64,qosubi_ : &mut[i32],qosubj_ : &mut[i32],qoval_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getnumqobjnz64(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumqobjnz64")?;
let maxnumqonz_ : i64 = __tmp_0;
if qosubi_.len() != (maxnumqonz_).try_into().unwrap() {
return Result::Err("get_q_obj: Argument 'qosubi' has the wrong length, expected maxnumqonz_".to_string());
}
if qosubj_.len() != (maxnumqonz_).try_into().unwrap() {
return Result::Err("get_q_obj: Argument 'qosubj' has the wrong length, expected maxnumqonz_".to_string());
}
if qoval_.len() != (maxnumqonz_).try_into().unwrap() {
return Result::Err("get_q_obj: Argument 'qoval' has the wrong length, expected maxnumqonz_".to_string());
}
self.handle_res(unsafe { MSK_getqobj64(self.ptr,maxnumqonz_,numqonz_,qosubi_.as_mut_ptr(),qosubj_.as_mut_ptr(),qoval_.as_mut_ptr()) },"get_q_obj")?;
return Result::Ok(());
} // getqobj64
/// Obtains one coefficient from the quadratic term of the objective
///
/// # Arguments
///
/// - `i_` Row index of the coefficient.
/// - `j_` Column index of coefficient.
/// - `qoij_` The required coefficient.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getqobjij>
#[allow(unused_parens)]
pub fn get_q_obj_i_j(&self,i_ : i32,j_ : i32,qoij_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getqobjij(self.ptr,i_,j_,qoij_) },"get_q_obj_i_j")?;
return Result::Ok(());
} // getqobjij
/// Obtains the reduced costs for a sequence of variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` The index of the first variable in the sequence.
/// - `last_` The index of the last variable in the sequence plus 1.
/// - `redcosts_` Returns the requested reduced costs.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getreducedcosts>
#[allow(unused_parens)]
pub fn get_reduced_costs(&self,whichsol_ : i32,first_ : i32,last_ : i32,redcosts_ : &mut[f64]) -> Result<(),String> {
if redcosts_.len() > 0 && redcosts_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_reduced_costs: Argument 'redcosts' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getreducedcosts(self.ptr,whichsol_,first_,last_,if redcosts_.len() == 0 { std::ptr::null_mut() } else { redcosts_.as_mut_ptr() }) },"get_reduced_costs")?;
return Result::Ok(());
} // getreducedcosts
/// Obtains the status keys for the constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskc>
#[allow(unused_parens)]
pub fn get_skc(&self,whichsol_ : i32,skc_ : &mut[i32]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if skc_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_skc: Argument 'skc' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getskc(self.ptr,whichsol_,skc_.as_mut_ptr()) },"get_skc")?;
return Result::Ok(());
} // getskc
/// Obtains the status keys for a slice of the constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskcslice>
#[allow(unused_parens)]
pub fn get_skc_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,skc_ : &mut[i32]) -> Result<(),String> {
if skc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_skc_slice: Argument 'skc' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getskcslice(self.ptr,whichsol_,first_,last_,skc_.as_mut_ptr()) },"get_skc_slice")?;
return Result::Ok(());
} // getskcslice
/// Obtains the status keys for the conic constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskn>
#[allow(unused_parens)]
pub fn get_skn(&self,whichsol_ : i32,skn_ : &mut[i32]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcone(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcone")?;
if skn_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_skn: Argument 'skn' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getskn(self.ptr,whichsol_,skn_.as_mut_ptr()) },"get_skn")?;
return Result::Ok(());
} // getskn
/// Obtains the status keys for the scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskx>
#[allow(unused_parens)]
pub fn get_skx(&self,whichsol_ : i32,skx_ : &mut[i32]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if skx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_skx: Argument 'skx' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getskx(self.ptr,whichsol_,skx_.as_mut_ptr()) },"get_skx")?;
return Result::Ok(());
} // getskx
/// Obtains the status keys for a slice of the scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getskxslice>
#[allow(unused_parens)]
pub fn get_skx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,skx_ : &mut[i32]) -> Result<(),String> {
if skx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_skx_slice: Argument 'skx' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getskxslice(self.ptr,whichsol_,first_,last_,skx_.as_mut_ptr()) },"get_skx_slice")?;
return Result::Ok(());
} // getskxslice
/// Obtains the slc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getslc>
#[allow(unused_parens)]
pub fn get_slc(&self,whichsol_ : i32,slc_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if slc_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_slc: Argument 'slc' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getslc(self.ptr,whichsol_,slc_.as_mut_ptr()) },"get_slc")?;
return Result::Ok(());
} // getslc
/// Obtains a slice of the slc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getslcslice>
#[allow(unused_parens)]
pub fn get_slc_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,slc_ : &mut[f64]) -> Result<(),String> {
if slc_.len() > 0 && slc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_slc_slice: Argument 'slc' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getslcslice(self.ptr,whichsol_,first_,last_,if slc_.len() == 0 { std::ptr::null_mut() } else { slc_.as_mut_ptr() }) },"get_slc_slice")?;
return Result::Ok(());
} // getslcslice
/// Obtains the slx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getslx>
#[allow(unused_parens)]
pub fn get_slx(&self,whichsol_ : i32,slx_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if slx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_slx: Argument 'slx' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getslx(self.ptr,whichsol_,slx_.as_mut_ptr()) },"get_slx")?;
return Result::Ok(());
} // getslx
/// Obtains a slice of the slx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getslxslice>
#[allow(unused_parens)]
pub fn get_slx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,slx_ : &mut[f64]) -> Result<(),String> {
if slx_.len() > 0 && slx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_slx_slice: Argument 'slx' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getslxslice(self.ptr,whichsol_,first_,last_,if slx_.len() == 0 { std::ptr::null_mut() } else { slx_.as_mut_ptr() }) },"get_slx_slice")?;
return Result::Ok(());
} // getslxslice
/// Obtains the snx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsnx>
#[allow(unused_parens)]
pub fn get_snx(&self,whichsol_ : i32,snx_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if snx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_snx: Argument 'snx' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getsnx(self.ptr,whichsol_,snx_.as_mut_ptr()) },"get_snx")?;
return Result::Ok(());
} // getsnx
/// Obtains a slice of the snx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsnxslice>
#[allow(unused_parens)]
pub fn get_snx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,snx_ : &mut[f64]) -> Result<(),String> {
if snx_.len() > 0 && snx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_snx_slice: Argument 'snx' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getsnxslice(self.ptr,whichsol_,first_,last_,if snx_.len() == 0 { std::ptr::null_mut() } else { snx_.as_mut_ptr() }) },"get_snx_slice")?;
return Result::Ok(());
} // getsnxslice
/// Obtains the solution status.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// # Returns
///
/// - `solutionsta` Solution status.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolsta>
#[allow(unused_parens)]
pub fn get_sol_sta(&self,whichsol_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = 0;
self.handle_res(unsafe { MSK_getsolsta(self.ptr,whichsol_,&mut __tmp_0) },"get_sol_sta")?;
return Result::Ok(__tmp_0);
} // getsolsta
/// Obtains the complete solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `problemsta_` Problem status.
///
/// See [Prosta]
/// - `solutionsta_` Solution status.
///
/// See [Solsta]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
/// - `xc_` Primal constraint solution.
/// - `xx_` Primal variable solution.
/// - `y_` Vector of dual variables corresponding to the constraints.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolution>
#[allow(unused_parens)]
pub fn get_solution(&self,whichsol_ : i32,problemsta_ : & mut i32,solutionsta_ : & mut i32,skc_ : &mut[i32],skx_ : &mut[i32],skn_ : &mut[i32],xc_ : &mut[f64],xx_ : &mut[f64],y_ : &mut[f64],slc_ : &mut[f64],suc_ : &mut[f64],slx_ : &mut[f64],sux_ : &mut[f64],snx_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_2 : i32 = i32::default();
let __tmp_3 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_2) };let _ = self.handle_res(__tmp_3,"getnumcon")?;
if skc_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("get_solution: Argument 'skc' has the wrong length, expected __tmp_2".to_string());
}
let mut __tmp_4 : i32 = i32::default();
let __tmp_5 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_4) };let _ = self.handle_res(__tmp_5,"getnumvar")?;
if skx_.len() != (__tmp_4).try_into().unwrap() {
return Result::Err("get_solution: Argument 'skx' has the wrong length, expected __tmp_4".to_string());
}
let mut __tmp_6 : i32 = i32::default();
let __tmp_7 = unsafe { MSK_getnumcone(self.ptr,&mut __tmp_6) };let _ = self.handle_res(__tmp_7,"getnumcone")?;
if skn_.len() != (__tmp_6).try_into().unwrap() {
return Result::Err("get_solution: Argument 'skn' has the wrong length, expected __tmp_6".to_string());
}
let mut __tmp_8 : i32 = i32::default();
let __tmp_9 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_8) };let _ = self.handle_res(__tmp_9,"getnumcon")?;
if xc_.len() > 0 && xc_.len() != (__tmp_8).try_into().unwrap() {
return Result::Err("get_solution: Argument 'xc' has the wrong length, expected __tmp_8".to_string());
}
let mut __tmp_10 : i32 = i32::default();
let __tmp_11 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_10) };let _ = self.handle_res(__tmp_11,"getnumvar")?;
if xx_.len() > 0 && xx_.len() != (__tmp_10).try_into().unwrap() {
return Result::Err("get_solution: Argument 'xx' has the wrong length, expected __tmp_10".to_string());
}
let mut __tmp_12 : i32 = i32::default();
let __tmp_13 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_12) };let _ = self.handle_res(__tmp_13,"getnumcon")?;
if y_.len() > 0 && y_.len() != (__tmp_12).try_into().unwrap() {
return Result::Err("get_solution: Argument 'y' has the wrong length, expected __tmp_12".to_string());
}
let mut __tmp_14 : i32 = i32::default();
let __tmp_15 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_14) };let _ = self.handle_res(__tmp_15,"getnumcon")?;
if slc_.len() > 0 && slc_.len() != (__tmp_14).try_into().unwrap() {
return Result::Err("get_solution: Argument 'slc' has the wrong length, expected __tmp_14".to_string());
}
let mut __tmp_16 : i32 = i32::default();
let __tmp_17 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_16) };let _ = self.handle_res(__tmp_17,"getnumcon")?;
if suc_.len() > 0 && suc_.len() != (__tmp_16).try_into().unwrap() {
return Result::Err("get_solution: Argument 'suc' has the wrong length, expected __tmp_16".to_string());
}
let mut __tmp_18 : i32 = i32::default();
let __tmp_19 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_18) };let _ = self.handle_res(__tmp_19,"getnumvar")?;
if slx_.len() > 0 && slx_.len() != (__tmp_18).try_into().unwrap() {
return Result::Err("get_solution: Argument 'slx' has the wrong length, expected __tmp_18".to_string());
}
let mut __tmp_20 : i32 = i32::default();
let __tmp_21 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_20) };let _ = self.handle_res(__tmp_21,"getnumvar")?;
if sux_.len() > 0 && sux_.len() != (__tmp_20).try_into().unwrap() {
return Result::Err("get_solution: Argument 'sux' has the wrong length, expected __tmp_20".to_string());
}
let mut __tmp_22 : i32 = i32::default();
let __tmp_23 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_22) };let _ = self.handle_res(__tmp_23,"getnumvar")?;
if snx_.len() > 0 && snx_.len() != (__tmp_22).try_into().unwrap() {
return Result::Err("get_solution: Argument 'snx' has the wrong length, expected __tmp_22".to_string());
}
self.handle_res(unsafe { MSK_getsolution(self.ptr,whichsol_,problemsta_,solutionsta_,skc_.as_mut_ptr(),skx_.as_mut_ptr(),skn_.as_mut_ptr(),if xc_.len() == 0 { std::ptr::null_mut() } else { xc_.as_mut_ptr() },if xx_.len() == 0 { std::ptr::null_mut() } else { xx_.as_mut_ptr() },if y_.len() == 0 { std::ptr::null_mut() } else { y_.as_mut_ptr() },if slc_.len() == 0 { std::ptr::null_mut() } else { slc_.as_mut_ptr() },if suc_.len() == 0 { std::ptr::null_mut() } else { suc_.as_mut_ptr() },if slx_.len() == 0 { std::ptr::null_mut() } else { slx_.as_mut_ptr() },if sux_.len() == 0 { std::ptr::null_mut() } else { sux_.as_mut_ptr() },if snx_.len() == 0 { std::ptr::null_mut() } else { snx_.as_mut_ptr() }) },"get_solution")?;
return Result::Ok(());
} // getsolution
/// Obtains information about of a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `pobj_` The primal objective value.
/// - `pviolcon_` Maximal primal bound violation for a xc variable.
/// - `pviolvar_` Maximal primal bound violation for a xx variable.
/// - `pviolbarvar_` Maximal primal bound violation for a barx variable.
/// - `pviolcone_` Maximal primal violation of the solution with respect to the conic constraints.
/// - `pviolitg_` Maximal violation in the integer constraints.
/// - `dobj_` Dual objective value.
/// - `dviolcon_` Maximal dual bound violation for a xc variable.
/// - `dviolvar_` Maximal dual bound violation for a xx variable.
/// - `dviolbarvar_` Maximal dual bound violation for a bars variable.
/// - `dviolcone_` Maximum violation of the dual solution in the dual conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolutioninfo>
#[allow(unused_parens)]
pub fn get_solution_info(&self,whichsol_ : i32,pobj_ : &mut f64,pviolcon_ : &mut f64,pviolvar_ : &mut f64,pviolbarvar_ : &mut f64,pviolcone_ : &mut f64,pviolitg_ : &mut f64,dobj_ : &mut f64,dviolcon_ : &mut f64,dviolvar_ : &mut f64,dviolbarvar_ : &mut f64,dviolcone_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getsolutioninfo(self.ptr,whichsol_,pobj_,pviolcon_,pviolvar_,pviolbarvar_,pviolcone_,pviolitg_,dobj_,dviolcon_,dviolvar_,dviolbarvar_,dviolcone_) },"get_solution_info")?;
return Result::Ok(());
} // getsolutioninfo
/// Obtains information about of a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `pobj_` The primal objective value.
/// - `pviolcon_` Maximal primal bound violation for a xc variable.
/// - `pviolvar_` Maximal primal bound violation for a xx variable.
/// - `pviolbarvar_` Maximal primal bound violation for a barx variable.
/// - `pviolcone_` Maximal primal violation of the solution with respect to the conic constraints.
/// - `pviolacc_` Maximal primal violation of the solution with respect to the affine conic constraints.
/// - `pvioldjc_` Maximal primal violation of the solution with respect to the disjunctive constraints.
/// - `pviolitg_` Maximal violation in the integer constraints.
/// - `dobj_` Dual objective value.
/// - `dviolcon_` Maximal dual bound violation for a xc variable.
/// - `dviolvar_` Maximal dual bound violation for a xx variable.
/// - `dviolbarvar_` Maximal dual bound violation for a bars variable.
/// - `dviolcone_` Maximum violation of the dual solution in the dual conic constraints.
/// - `dviolacc_` Maximum violation of the dual solution in the dual affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolutioninfonew>
#[allow(unused_parens)]
pub fn get_solution_info_new(&self,whichsol_ : i32,pobj_ : &mut f64,pviolcon_ : &mut f64,pviolvar_ : &mut f64,pviolbarvar_ : &mut f64,pviolcone_ : &mut f64,pviolacc_ : &mut f64,pvioldjc_ : &mut f64,pviolitg_ : &mut f64,dobj_ : &mut f64,dviolcon_ : &mut f64,dviolvar_ : &mut f64,dviolbarvar_ : &mut f64,dviolcone_ : &mut f64,dviolacc_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getsolutioninfonew(self.ptr,whichsol_,pobj_,pviolcon_,pviolvar_,pviolbarvar_,pviolcone_,pviolacc_,pvioldjc_,pviolitg_,dobj_,dviolcon_,dviolvar_,dviolbarvar_,dviolcone_,dviolacc_) },"get_solution_info_new")?;
return Result::Ok(());
} // getsolutioninfonew
/// Obtains the complete solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `problemsta_` Problem status.
///
/// See [Prosta]
/// - `solutionsta_` Solution status.
///
/// See [Solsta]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
/// - `xc_` Primal constraint solution.
/// - `xx_` Primal variable solution.
/// - `y_` Vector of dual variables corresponding to the constraints.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
/// - `doty_` Dual variables corresponding to affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolutionnew>
#[allow(unused_parens)]
pub fn get_solution_new(&self,whichsol_ : i32,problemsta_ : & mut i32,solutionsta_ : & mut i32,skc_ : &mut[i32],skx_ : &mut[i32],skn_ : &mut[i32],xc_ : &mut[f64],xx_ : &mut[f64],y_ : &mut[f64],slc_ : &mut[f64],suc_ : &mut[f64],slx_ : &mut[f64],sux_ : &mut[f64],snx_ : &mut[f64],doty_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_2 : i32 = i32::default();
let __tmp_3 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_2) };let _ = self.handle_res(__tmp_3,"getnumcon")?;
if skc_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'skc' has the wrong length, expected __tmp_2".to_string());
}
let mut __tmp_4 : i32 = i32::default();
let __tmp_5 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_4) };let _ = self.handle_res(__tmp_5,"getnumvar")?;
if skx_.len() != (__tmp_4).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'skx' has the wrong length, expected __tmp_4".to_string());
}
let mut __tmp_6 : i32 = i32::default();
let __tmp_7 = unsafe { MSK_getnumcone(self.ptr,&mut __tmp_6) };let _ = self.handle_res(__tmp_7,"getnumcone")?;
if skn_.len() != (__tmp_6).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'skn' has the wrong length, expected __tmp_6".to_string());
}
let mut __tmp_8 : i32 = i32::default();
let __tmp_9 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_8) };let _ = self.handle_res(__tmp_9,"getnumcon")?;
if xc_.len() > 0 && xc_.len() != (__tmp_8).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'xc' has the wrong length, expected __tmp_8".to_string());
}
let mut __tmp_10 : i32 = i32::default();
let __tmp_11 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_10) };let _ = self.handle_res(__tmp_11,"getnumvar")?;
if xx_.len() > 0 && xx_.len() != (__tmp_10).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'xx' has the wrong length, expected __tmp_10".to_string());
}
let mut __tmp_12 : i32 = i32::default();
let __tmp_13 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_12) };let _ = self.handle_res(__tmp_13,"getnumcon")?;
if y_.len() > 0 && y_.len() != (__tmp_12).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'y' has the wrong length, expected __tmp_12".to_string());
}
let mut __tmp_14 : i32 = i32::default();
let __tmp_15 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_14) };let _ = self.handle_res(__tmp_15,"getnumcon")?;
if slc_.len() > 0 && slc_.len() != (__tmp_14).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'slc' has the wrong length, expected __tmp_14".to_string());
}
let mut __tmp_16 : i32 = i32::default();
let __tmp_17 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_16) };let _ = self.handle_res(__tmp_17,"getnumcon")?;
if suc_.len() > 0 && suc_.len() != (__tmp_16).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'suc' has the wrong length, expected __tmp_16".to_string());
}
let mut __tmp_18 : i32 = i32::default();
let __tmp_19 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_18) };let _ = self.handle_res(__tmp_19,"getnumvar")?;
if slx_.len() > 0 && slx_.len() != (__tmp_18).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'slx' has the wrong length, expected __tmp_18".to_string());
}
let mut __tmp_20 : i32 = i32::default();
let __tmp_21 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_20) };let _ = self.handle_res(__tmp_21,"getnumvar")?;
if sux_.len() > 0 && sux_.len() != (__tmp_20).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'sux' has the wrong length, expected __tmp_20".to_string());
}
let mut __tmp_22 : i32 = i32::default();
let __tmp_23 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_22) };let _ = self.handle_res(__tmp_23,"getnumvar")?;
if snx_.len() > 0 && snx_.len() != (__tmp_22).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'snx' has the wrong length, expected __tmp_22".to_string());
}
let mut __tmp_24 : i64 = i64::default();
let __tmp_25 = unsafe { MSK_getaccntot(self.ptr,&mut __tmp_24) };let _ = self.handle_res(__tmp_25,"getaccntot")?;
if doty_.len() > 0 && doty_.len() != (__tmp_24).try_into().unwrap() {
return Result::Err("get_solution_new: Argument 'doty' has the wrong length, expected __tmp_24".to_string());
}
self.handle_res(unsafe { MSK_getsolutionnew(self.ptr,whichsol_,problemsta_,solutionsta_,skc_.as_mut_ptr(),skx_.as_mut_ptr(),skn_.as_mut_ptr(),if xc_.len() == 0 { std::ptr::null_mut() } else { xc_.as_mut_ptr() },if xx_.len() == 0 { std::ptr::null_mut() } else { xx_.as_mut_ptr() },if y_.len() == 0 { std::ptr::null_mut() } else { y_.as_mut_ptr() },if slc_.len() == 0 { std::ptr::null_mut() } else { slc_.as_mut_ptr() },if suc_.len() == 0 { std::ptr::null_mut() } else { suc_.as_mut_ptr() },if slx_.len() == 0 { std::ptr::null_mut() } else { slx_.as_mut_ptr() },if sux_.len() == 0 { std::ptr::null_mut() } else { sux_.as_mut_ptr() },if snx_.len() == 0 { std::ptr::null_mut() } else { snx_.as_mut_ptr() },if doty_.len() == 0 { std::ptr::null_mut() } else { doty_.as_mut_ptr() }) },"get_solution_new")?;
return Result::Ok(());
} // getsolutionnew
/// Obtains a slice of the solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `solitem_` Which part of the solution is required.
///
/// See [Solitem]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `values_` The values of the requested solution elements.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsolutionslice>
#[allow(unused_parens)]
pub fn get_solution_slice(&self,whichsol_ : i32,solitem_ : i32,first_ : i32,last_ : i32,values_ : &mut[f64]) -> Result<(),String> {
if values_.len() > 0 && values_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_solution_slice: Argument 'values' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getsolutionslice(self.ptr,whichsol_,solitem_,first_,last_,if values_.len() == 0 { std::ptr::null_mut() } else { values_.as_mut_ptr() }) },"get_solution_slice")?;
return Result::Ok(());
} // getsolutionslice
/// Gets a single symmetric matrix from the matrix store.
///
/// # Arguments
///
/// - `idx_` Index of the matrix to retrieve.
/// - `subi_` Row subscripts of the matrix non-zero elements.
/// - `subj_` Column subscripts of the matrix non-zero elements.
/// - `valij_` Coefficients of the matrix non-zero elements.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsparsesymmat>
#[allow(unused_parens)]
pub fn get_sparse_sym_mat(&self,idx_ : i64,subi_ : &mut[i32],subj_ : &mut[i32],valij_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let mut __tmp_1 : i64 = i64::default();
let mut __tmp_2 : i32 = i32::default();
let __tmp_3 = unsafe { MSK_getsymmatinfo(self.ptr,idx_,&mut __tmp_0,&mut __tmp_1,&mut __tmp_2) };let _ = self.handle_res(__tmp_3,"getsymmatinfo")?;
let maxlen_ : i64 = __tmp_1;
if subi_.len() > 0 && subi_.len() != (maxlen_).try_into().unwrap() {
return Result::Err("get_sparse_sym_mat: Argument 'subi' has the wrong length, expected maxlen_".to_string());
}
if subj_.len() > 0 && subj_.len() != (maxlen_).try_into().unwrap() {
return Result::Err("get_sparse_sym_mat: Argument 'subj' has the wrong length, expected maxlen_".to_string());
}
if valij_.len() > 0 && valij_.len() != (maxlen_).try_into().unwrap() {
return Result::Err("get_sparse_sym_mat: Argument 'valij' has the wrong length, expected maxlen_".to_string());
}
self.handle_res(unsafe { MSK_getsparsesymmat(self.ptr,idx_,maxlen_,if subi_.len() == 0 { std::ptr::null_mut() } else { subi_.as_mut_ptr() },if subj_.len() == 0 { std::ptr::null_mut() } else { subj_.as_mut_ptr() },if valij_.len() == 0 { std::ptr::null_mut() } else { valij_.as_mut_ptr() }) },"get_sparse_sym_mat")?;
return Result::Ok(());
} // getsparsesymmat
/// Obtains the value of a string parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Sparam]
/// - `len_` The length of the parameter value.
///
/// # Returns
///
/// - `parvalue` If this is not a null pointer, the parameter value is stored here.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getstrparam>
#[allow(unused_parens)]
pub fn get_str_param(&self,param_ : i32,len_ : &mut i32) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getstrparamlen(self.ptr,param_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getstrparamlen")?;
let maxlen_ : i32 = (1+__tmp_0);
let mut parvalue_ = Vec::new(); parvalue_.resize(maxlen_ as usize,0);
self.handle_res(unsafe { MSK_getstrparam(self.ptr,param_,maxlen_,len_,parvalue_.as_mut_ptr()) },"get_str_param")?;
return Result::Ok(String::from_utf8_lossy(&parvalue_[..parvalue_.iter().position(|&c| c == 0).unwrap_or(maxlen_ as usize)]).into_owned());
} // getstrparam
/// Obtains the length of a string parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Sparam]
///
/// # Returns
///
/// - `len` The length of the parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getstrparamlen>
#[allow(unused_parens)]
pub fn get_str_param_len(&self,param_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getstrparamlen(self.ptr,param_,&mut __tmp_0) },"get_str_param_len")?;
return Result::Ok(__tmp_0);
} // getstrparamlen
/// Obtains the suc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsuc>
#[allow(unused_parens)]
pub fn get_suc(&self,whichsol_ : i32,suc_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if suc_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_suc: Argument 'suc' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getsuc(self.ptr,whichsol_,suc_.as_mut_ptr()) },"get_suc")?;
return Result::Ok(());
} // getsuc
/// Obtains a slice of the suc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsucslice>
#[allow(unused_parens)]
pub fn get_suc_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,suc_ : &mut[f64]) -> Result<(),String> {
if suc_.len() > 0 && suc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_suc_slice: Argument 'suc' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getsucslice(self.ptr,whichsol_,first_,last_,if suc_.len() == 0 { std::ptr::null_mut() } else { suc_.as_mut_ptr() }) },"get_suc_slice")?;
return Result::Ok(());
} // getsucslice
/// Obtains the sux vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsux>
#[allow(unused_parens)]
pub fn get_sux(&self,whichsol_ : i32,sux_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if sux_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_sux: Argument 'sux' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getsux(self.ptr,whichsol_,sux_.as_mut_ptr()) },"get_sux")?;
return Result::Ok(());
} // getsux
/// Obtains a slice of the sux vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsuxslice>
#[allow(unused_parens)]
pub fn get_sux_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,sux_ : &mut[f64]) -> Result<(),String> {
if sux_.len() > 0 && sux_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_sux_slice: Argument 'sux' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getsuxslice(self.ptr,whichsol_,first_,last_,if sux_.len() == 0 { std::ptr::null_mut() } else { sux_.as_mut_ptr() }) },"get_sux_slice")?;
return Result::Ok(());
} // getsuxslice
/// Obtains a cone type string identifier.
///
/// # Arguments
///
/// - `i_` Index.
/// - `value_` The corresponding value.
///
/// # Returns
///
/// - `name` Name of the i'th symbolic constant.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsymbcon>
#[allow(unused_parens)]
pub fn get_symb_con(&self,i_ : i32,value_ : &mut i32) -> Result<String,String> {
let sizevalue_ : i32 = Value::MAX_STR_LEN;
let mut name_ = Vec::new(); name_.resize(Value::MAX_STR_LEN as usize,0);
self.handle_res(unsafe { MSK_getsymbcon(self.ptr,i_,sizevalue_,name_.as_mut_ptr(),value_) },"get_symb_con")?;
return Result::Ok(String::from_utf8_lossy(&name_[..name_.iter().position(|&c| c == 0).unwrap_or(Value::MAX_STR_LEN as usize)]).into_owned());
} // getsymbcon
/// Obtains information about a matrix from the symmetric matrix storage.
///
/// # Arguments
///
/// - `idx_` Index of the matrix for which information is requested.
/// - `dim_` Returns the dimension of the requested matrix.
/// - `nz_` Returns the number of non-zeros in the requested matrix.
/// - `mattype_` Returns the type of the requested matrix.
///
/// See [Symmattype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getsymmatinfo>
#[allow(unused_parens)]
pub fn get_sym_mat_info(&self,idx_ : i64,dim_ : &mut i32,nz_ : &mut i64,mattype_ : & mut i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_getsymmatinfo(self.ptr,idx_,dim_,nz_,mattype_) },"get_sym_mat_info")?;
return Result::Ok(());
} // getsymmatinfo
/// Obtains the task name.
///
/// # Returns
///
/// - `taskname` Returns the task name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gettaskname>
#[allow(unused_parens)]
pub fn get_task_name(&self) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_gettasknamelen(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"gettasknamelen")?;
let sizetaskname_ : i32 = (1+__tmp_0);
let mut taskname_ = Vec::new(); taskname_.resize(sizetaskname_ as usize,0);
self.handle_res(unsafe { MSK_gettaskname(self.ptr,sizetaskname_,taskname_.as_mut_ptr()) },"get_task_name")?;
return Result::Ok(String::from_utf8_lossy(&taskname_[..taskname_.iter().position(|&c| c == 0).unwrap_or(sizetaskname_ as usize)]).into_owned());
} // gettaskname
/// Obtains the length the task name.
///
/// # Returns
///
/// - `len` Returns the length of the task name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gettasknamelen>
#[allow(unused_parens)]
pub fn get_task_name_len(&self) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_gettasknamelen(self.ptr,&mut __tmp_0) },"get_task_name_len")?;
return Result::Ok(__tmp_0);
} // gettasknamelen
/// Obtains bound information for one variable.
///
/// # Arguments
///
/// - `i_` Index of the variable for which the bound information should be obtained.
/// - `bk_` Bound keys.
///
/// See [Boundkey]
/// - `bl_` Values for lower bounds.
/// - `bu_` Values for upper bounds.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarbound>
#[allow(unused_parens)]
pub fn get_var_bound(&self,i_ : i32,bk_ : & mut i32,bl_ : &mut f64,bu_ : &mut f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_getvarbound(self.ptr,i_,bk_,bl_,bu_) },"get_var_bound")?;
return Result::Ok(());
} // getvarbound
/// Obtains bounds information for a slice of the variables.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bk_` Bound keys.
///
/// See [Boundkey]
/// - `bl_` Values for lower bounds.
/// - `bu_` Values for upper bounds.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarboundslice>
#[allow(unused_parens)]
pub fn get_var_bound_slice(&self,first_ : i32,last_ : i32,bk_ : &mut[i32],bl_ : &mut[f64],bu_ : &mut[f64]) -> Result<(),String> {
if bk_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_var_bound_slice: Argument 'bk' has the wrong length, expected (last_-first_)".to_string());
}
if bl_.len() > 0 && bl_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_var_bound_slice: Argument 'bl' has the wrong length, expected (last_-first_)".to_string());
}
if bu_.len() > 0 && bu_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_var_bound_slice: Argument 'bu' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getvarboundslice(self.ptr,first_,last_,bk_.as_mut_ptr(),if bl_.len() == 0 { std::ptr::null_mut() } else { bl_.as_mut_ptr() },if bu_.len() == 0 { std::ptr::null_mut() } else { bu_.as_mut_ptr() }) },"get_var_bound_slice")?;
return Result::Ok(());
} // getvarboundslice
/// Obtains the name of a variable.
///
/// # Arguments
///
/// - `j_` Index of a variable.
///
/// # Returns
///
/// - `name` Returns the required name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarname>
#[allow(unused_parens)]
pub fn get_var_name(&self,j_ : i32) -> Result<String,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getvarnamelen(self.ptr,j_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getvarnamelen")?;
let sizename_ : i32 = (1+__tmp_0);
let mut name_ = Vec::new(); name_.resize(sizename_ as usize,0);
self.handle_res(unsafe { MSK_getvarname(self.ptr,j_,sizename_,name_.as_mut_ptr()) },"get_var_name")?;
return Result::Ok(String::from_utf8_lossy(&name_[..name_.iter().position(|&c| c == 0).unwrap_or(sizename_ as usize)]).into_owned());
} // getvarname
/// Checks whether the name has been assigned to any variable.
///
/// # Arguments
///
/// - `somename_` The name which should be checked.
/// - `asgn_` Is non-zero if the name somename is assigned to a variable.
///
/// # Returns
///
/// - `index` If the name somename is assigned to a variable, then return the index of the variable.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarnameindex>
#[allow(unused_parens)]
pub fn get_var_name_index(&self,somename_ : &str,asgn_ : &mut i32) -> Result<i32,String> {
let __tmp_1 = CString::new(somename_).unwrap();
let mut __tmp_3 : i32 = i32::default();
self.handle_res(unsafe { MSK_getvarnameindex(self.ptr,__tmp_1.as_ptr(),asgn_,&mut __tmp_3) },"get_var_name_index")?;
return Result::Ok(__tmp_3);
} // getvarnameindex
/// Obtains the length of the name of a variable.
///
/// # Arguments
///
/// - `i_` Index of a variable.
///
/// # Returns
///
/// - `len` Returns the length of the indicated name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvarnamelen>
#[allow(unused_parens)]
pub fn get_var_name_len(&self,i_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
self.handle_res(unsafe { MSK_getvarnamelen(self.ptr,i_,&mut __tmp_0) },"get_var_name_len")?;
return Result::Ok(__tmp_0);
} // getvarnamelen
/// Gets the variable type of one variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
///
/// # Returns
///
/// - `vartype` Variable type of variable index j.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvartype>
#[allow(unused_parens)]
pub fn get_var_type(&self,j_ : i32) -> Result<i32,String> {
let mut __tmp_0 : i32 = 0;
self.handle_res(unsafe { MSK_getvartype(self.ptr,j_,&mut __tmp_0) },"get_var_type")?;
return Result::Ok(__tmp_0);
} // getvartype
/// Obtains the variable type for one or more variables.
///
/// # Arguments
///
/// - `subj_` A list of variable indexes.
/// - `vartype_` Returns the variables types corresponding the variable indexes requested.
///
/// See [Variabletype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getvartypelist>
#[allow(unused_parens)]
pub fn get_var_type_list(&self,subj_ : &[i32],vartype_ : &mut[i32]) -> Result<(),String> {
let num_ : i32 = subj_.len() as i32;
if vartype_.len() != (num_).try_into().unwrap() {
return Result::Err("get_var_type_list: Argument 'vartype' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_getvartypelist(self.ptr,num_,subj_.as_ptr(),vartype_.as_mut_ptr()) },"get_var_type_list")?;
return Result::Ok(());
} // getvartypelist
/// Obtains the xc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `xc_` Primal constraint solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getxc>
#[allow(unused_parens)]
pub fn get_xc(&self,whichsol_ : i32,xc_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if xc_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_xc: Argument 'xc' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getxc(self.ptr,whichsol_,xc_.as_mut_ptr()) },"get_xc")?;
return Result::Ok(());
} // getxc
/// Obtains a slice of the xc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `xc_` Primal constraint solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getxcslice>
#[allow(unused_parens)]
pub fn get_xc_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,xc_ : &mut[f64]) -> Result<(),String> {
if xc_.len() > 0 && xc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_xc_slice: Argument 'xc' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getxcslice(self.ptr,whichsol_,first_,last_,if xc_.len() == 0 { std::ptr::null_mut() } else { xc_.as_mut_ptr() }) },"get_xc_slice")?;
return Result::Ok(());
} // getxcslice
/// Obtains the xx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `xx_` Primal variable solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getxx>
#[allow(unused_parens)]
pub fn get_xx(&self,whichsol_ : i32,xx_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if xx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_xx: Argument 'xx' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_getxx(self.ptr,whichsol_,xx_.as_mut_ptr()) },"get_xx")?;
return Result::Ok(());
} // getxx
/// Obtains a slice of the xx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `xx_` Primal variable solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getxxslice>
#[allow(unused_parens)]
pub fn get_xx_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,xx_ : &mut[f64]) -> Result<(),String> {
if xx_.len() > 0 && xx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_xx_slice: Argument 'xx' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getxxslice(self.ptr,whichsol_,first_,last_,if xx_.len() == 0 { std::ptr::null_mut() } else { xx_.as_mut_ptr() }) },"get_xx_slice")?;
return Result::Ok(());
} // getxxslice
/// Obtains the y vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `y_` Vector of dual variables corresponding to the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gety>
#[allow(unused_parens)]
pub fn get_y(&self,whichsol_ : i32,y_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if y_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("get_y: Argument 'y' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_gety(self.ptr,whichsol_,y_.as_mut_ptr()) },"get_y")?;
return Result::Ok(());
} // gety
/// Obtains a slice of the y vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `y_` Vector of dual variables corresponding to the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getyslice>
#[allow(unused_parens)]
pub fn get_y_slice(&self,whichsol_ : i32,first_ : i32,last_ : i32,y_ : &mut[f64]) -> Result<(),String> {
if y_.len() > 0 && y_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("get_y_slice: Argument 'y' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_getyslice(self.ptr,whichsol_,first_,last_,if y_.len() == 0 { std::ptr::null_mut() } else { y_.as_mut_ptr() }) },"get_y_slice")?;
return Result::Ok(());
} // getyslice
/// Prints the infeasibility report to an output stream.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.infeasibilityreport>
#[allow(unused_parens)]
pub fn infeasibility_report(&mut self,whichstream_ : i32,whichsol_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_infeasibilityreport(self.ptr,whichstream_,whichsol_) },"infeasibility_report")?;
return Result::Ok(());
} // infeasibilityreport
/// Prepare a task for basis solver.
///
/// # Arguments
///
/// - `basis_` The array of basis indexes to use.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.initbasissolve>
#[allow(unused_parens)]
pub fn init_basis_solve(&mut self,basis_ : &mut[i32]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if basis_.len() > 0 && basis_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("init_basis_solve: Argument 'basis' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_initbasissolve(self.ptr,if basis_.len() == 0 { std::ptr::null_mut() } else { basis_.as_mut_ptr() }) },"init_basis_solve")?;
return Result::Ok(());
} // initbasissolve
/// Input the linear part of an optimization task in one function call.
///
/// # Arguments
///
/// - `maxnumcon_` Number of preallocated constraints in the optimization task.
/// - `maxnumvar_` Number of preallocated variables in the optimization task.
/// - `c_` Linear terms of the objective as a dense vector. The length is the number of variables.
/// - `cfix_` Fixed term in the objective.
/// - `aptrb_` Row or column start pointers.
/// - `aptre_` Row or column end pointers.
/// - `asub_` Coefficient subscripts.
/// - `aval_` Coefficient values.
/// - `bkc_` Bound keys for the constraints.
///
/// See [Boundkey]
/// - `blc_` Lower bounds for the constraints.
/// - `buc_` Upper bounds for the constraints.
/// - `bkx_` Bound keys for the variables.
///
/// See [Boundkey]
/// - `blx_` Lower bounds for the variables.
/// - `bux_` Upper bounds for the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.inputdata64>
#[allow(unused_parens)]
pub fn input_data(&mut self,maxnumcon_ : i32,maxnumvar_ : i32,c_ : &[f64],cfix_ : f64,aptrb_ : &[i64],aptre_ : &[i64],asub_ : &[i32],aval_ : &[f64],bkc_ : &[i32],blc_ : &[f64],buc_ : &[f64],bkx_ : &[i32],blx_ : &[f64],bux_ : &[f64]) -> Result<(),String> {
let numcon_ : i32 = std::cmp::min(std::cmp::min(blc_.len(),buc_.len()),bkc_.len()) as i32;
let numvar_ : i32 = std::cmp::min(std::cmp::min(std::cmp::min(std::cmp::min(std::cmp::min(c_.len(),bkx_.len()),aptre_.len()),bux_.len()),blx_.len()),aptrb_.len()) as i32;
if asub_.len() != aval_.len() { return Err("input_data: Mismatching asub/aval lengths".to_string()); }
if aptrb_.len() != aptre_.len() { return Err("input_data: Mismatching aptrb/aptre lengths".to_string()); }
if ! aptrb_.iter().zip(aptre_.iter()).all(|(a,b)| *a <= *b) { return Err("input_data: Invalid aptrb/aptre construction".to_string()); }
if let Some(v) = aptrb_.iter().min() { if *v < 0 { return Err("input_data: Invalid aptrb construction".to_string()); } }
if let Some(v) = aptre_.iter().max() { if *v as usize > asub_.len() { return Err("input_data: Invalid aptre construction".to_string()); } }
self.handle_res(unsafe { MSK_inputdata64(self.ptr,maxnumcon_,maxnumvar_,numcon_,numvar_,if c_.len() == 0 { std::ptr::null() } else { c_.as_ptr() },cfix_,aptrb_.as_ptr(),aptre_.as_ptr(),asub_.as_ptr(),aval_.as_ptr(),bkc_.as_ptr(),blc_.as_ptr(),buc_.as_ptr(),bkx_.as_ptr(),blx_.as_ptr(),bux_.as_ptr()) },"input_data")?;
return Result::Ok(());
} // inputdata64
/// Checks a double parameter name.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `param_` Returns the parameter corresponding to the name, if one exists.
///
/// See [Dparam]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.isdouparname>
#[allow(unused_parens)]
pub fn is_dou_par_name(&self,parname_ : &str,param_ : & mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(parname_).unwrap();
self.handle_res(unsafe { MSK_isdouparname(self.ptr,__tmp_1.as_ptr(),param_) },"is_dou_par_name")?;
return Result::Ok(());
} // isdouparname
/// Checks an integer parameter name.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `param_` Returns the parameter corresponding to the name, if one exists.
///
/// See [Iparam]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.isintparname>
#[allow(unused_parens)]
pub fn is_int_par_name(&self,parname_ : &str,param_ : & mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(parname_).unwrap();
self.handle_res(unsafe { MSK_isintparname(self.ptr,__tmp_1.as_ptr(),param_) },"is_int_par_name")?;
return Result::Ok(());
} // isintparname
/// Checks a string parameter name.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `param_` Returns the parameter corresponding to the name, if one exists.
///
/// See [Sparam]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.isstrparname>
#[allow(unused_parens)]
pub fn is_str_par_name(&self,parname_ : &str,param_ : & mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(parname_).unwrap();
self.handle_res(unsafe { MSK_isstrparname(self.ptr,__tmp_1.as_ptr(),param_) },"is_str_par_name")?;
return Result::Ok(());
} // isstrparname
/// Directs all output from a task stream to a file.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `filename_` A valid file name.
/// - `append_` If this argument is 0 the output file will be overwritten, otherwise it will be appended to.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.linkfiletotaskstream>
#[allow(unused_parens)]
pub fn link_file_to_stream(&mut self,whichstream_ : i32,filename_ : &str,append_ : i32) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_linkfiletotaskstream(self.ptr,whichstream_,__tmp_1.as_ptr(),append_) },"link_file_to_stream")?;
return Result::Ok(());
} // linkfiletotaskstream
/// Prints a short summary of a specified solution.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.onesolutionsummary>
#[allow(unused_parens)]
pub fn one_solution_summary(&self,whichstream_ : i32,whichsol_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_onesolutionsummary(self.ptr,whichstream_,whichsol_) },"one_solution_summary")?;
return Result::Ok(());
} // onesolutionsummary
/// Offload the optimization task to a solver server and wait for the solution.
///
/// # Arguments
///
/// - `address_` Address of the OptServer.
/// - `accesstoken_` Access token.
/// - `trmcode_` Is either OK or a termination response code.
///
/// See [Rescode]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.optimizermt>
#[allow(unused_parens)]
pub fn optimize_rmt(&mut self,address_ : &str,accesstoken_ : &str,trmcode_ : & mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(address_).unwrap();
let __tmp_3 = CString::new(accesstoken_).unwrap();
self.handle_res(unsafe { MSK_optimizermt(self.ptr,__tmp_1.as_ptr(),__tmp_3.as_ptr(),trmcode_) },"optimize_rmt")?;
return Result::Ok(());
} // optimizermt
/// Prints a short summary with optimizer statistics from last optimization.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.optimizersummary>
#[allow(unused_parens)]
pub fn optimizer_summary(&self,whichstream_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_optimizersummary(self.ptr,whichstream_) },"optimizer_summary")?;
return Result::Ok(());
} // optimizersummary
/// Optimizes the problem.
///
/// # Returns
///
/// - `trmcode` Is either OK or a termination response code.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.optimizetrm>
#[allow(unused_parens)]
pub fn optimize(&mut self) -> Result<i32,String> {
let mut __tmp_0 : i32 = 0;
self.handle_res(unsafe { MSK_optimizetrm(self.ptr,&mut __tmp_0) },"optimize")?;
return Result::Ok(__tmp_0);
} // optimizetrm
/// Repairs a primal infeasible optimization problem by adjusting the bounds on the constraints and variables.
///
/// # Arguments
///
/// - `wlc_` Weights associated with relaxing lower bounds on the constraints.
/// - `wuc_` Weights associated with relaxing the upper bound on the constraints.
/// - `wlx_` Weights associated with relaxing the lower bounds of the variables.
/// - `wux_` Weights associated with relaxing the upper bounds of variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.primalrepair>
#[allow(unused_parens)]
pub fn primal_repair(&mut self,wlc_ : &[f64],wuc_ : &[f64],wlx_ : &[f64],wux_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if wlc_.len() > 0 && wlc_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("primal_repair: Argument 'wlc' has the wrong length, expected __tmp_0".to_string());
}
let mut __tmp_2 : i32 = i32::default();
let __tmp_3 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_2) };let _ = self.handle_res(__tmp_3,"getnumcon")?;
if wuc_.len() > 0 && wuc_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("primal_repair: Argument 'wuc' has the wrong length, expected __tmp_2".to_string());
}
let mut __tmp_4 : i32 = i32::default();
let __tmp_5 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_4) };let _ = self.handle_res(__tmp_5,"getnumvar")?;
if wlx_.len() > 0 && wlx_.len() != (__tmp_4).try_into().unwrap() {
return Result::Err("primal_repair: Argument 'wlx' has the wrong length, expected __tmp_4".to_string());
}
let mut __tmp_6 : i32 = i32::default();
let __tmp_7 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_6) };let _ = self.handle_res(__tmp_7,"getnumvar")?;
if wux_.len() > 0 && wux_.len() != (__tmp_6).try_into().unwrap() {
return Result::Err("primal_repair: Argument 'wux' has the wrong length, expected __tmp_6".to_string());
}
self.handle_res(unsafe { MSK_primalrepair(self.ptr,if wlc_.len() == 0 { std::ptr::null() } else { wlc_.as_ptr() },if wuc_.len() == 0 { std::ptr::null() } else { wuc_.as_ptr() },if wlx_.len() == 0 { std::ptr::null() } else { wlx_.as_ptr() },if wux_.len() == 0 { std::ptr::null() } else { wux_.as_ptr() }) },"primal_repair")?;
return Result::Ok(());
} // primalrepair
/// Perform sensitivity analysis on bounds.
///
/// # Arguments
///
/// - `subi_` Indexes of constraints to analyze.
/// - `marki_` Mark which constraint bounds to analyze.
///
/// See [Mark]
/// - `subj_` Indexes of variables to analyze.
/// - `markj_` Mark which variable bounds to analyze.
///
/// See [Mark]
/// - `leftpricei_` Left shadow price for constraints.
/// - `rightpricei_` Right shadow price for constraints.
/// - `leftrangei_` Left range for constraints.
/// - `rightrangei_` Right range for constraints.
/// - `leftpricej_` Left shadow price for variables.
/// - `rightpricej_` Right shadow price for variables.
/// - `leftrangej_` Left range for variables.
/// - `rightrangej_` Right range for variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.primalsensitivity>
#[allow(unused_parens)]
pub fn primal_sensitivity(&mut self,subi_ : &[i32],marki_ : &[i32],subj_ : &[i32],markj_ : &[i32],leftpricei_ : &mut[f64],rightpricei_ : &mut[f64],leftrangei_ : &mut[f64],rightrangei_ : &mut[f64],leftpricej_ : &mut[f64],rightpricej_ : &mut[f64],leftrangej_ : &mut[f64],rightrangej_ : &mut[f64]) -> Result<(),String> {
let numi_ : i32 = std::cmp::min(marki_.len(),subi_.len()) as i32;
let numj_ : i32 = std::cmp::min(markj_.len(),subj_.len()) as i32;
if leftpricei_.len() > 0 && leftpricei_.len() != (numi_).try_into().unwrap() {
return Result::Err("primal_sensitivity: Argument 'leftpricei' has the wrong length, expected numi_".to_string());
}
if rightpricei_.len() > 0 && rightpricei_.len() != (numi_).try_into().unwrap() {
return Result::Err("primal_sensitivity: Argument 'rightpricei' has the wrong length, expected numi_".to_string());
}
if leftrangei_.len() > 0 && leftrangei_.len() != (numi_).try_into().unwrap() {
return Result::Err("primal_sensitivity: Argument 'leftrangei' has the wrong length, expected numi_".to_string());
}
if rightrangei_.len() > 0 && rightrangei_.len() != (numi_).try_into().unwrap() {
return Result::Err("primal_sensitivity: Argument 'rightrangei' has the wrong length, expected numi_".to_string());
}
if leftpricej_.len() > 0 && leftpricej_.len() != (numj_).try_into().unwrap() {
return Result::Err("primal_sensitivity: Argument 'leftpricej' has the wrong length, expected numj_".to_string());
}
if rightpricej_.len() > 0 && rightpricej_.len() != (numj_).try_into().unwrap() {
return Result::Err("primal_sensitivity: Argument 'rightpricej' has the wrong length, expected numj_".to_string());
}
if leftrangej_.len() > 0 && leftrangej_.len() != (numj_).try_into().unwrap() {
return Result::Err("primal_sensitivity: Argument 'leftrangej' has the wrong length, expected numj_".to_string());
}
if rightrangej_.len() > 0 && rightrangej_.len() != (numj_).try_into().unwrap() {
return Result::Err("primal_sensitivity: Argument 'rightrangej' has the wrong length, expected numj_".to_string());
}
self.handle_res(unsafe { MSK_primalsensitivity(self.ptr,numi_,subi_.as_ptr(),marki_.as_ptr(),numj_,subj_.as_ptr(),markj_.as_ptr(),if leftpricei_.len() == 0 { std::ptr::null_mut() } else { leftpricei_.as_mut_ptr() },if rightpricei_.len() == 0 { std::ptr::null_mut() } else { rightpricei_.as_mut_ptr() },if leftrangei_.len() == 0 { std::ptr::null_mut() } else { leftrangei_.as_mut_ptr() },if rightrangei_.len() == 0 { std::ptr::null_mut() } else { rightrangei_.as_mut_ptr() },if leftpricej_.len() == 0 { std::ptr::null_mut() } else { leftpricej_.as_mut_ptr() },if rightpricej_.len() == 0 { std::ptr::null_mut() } else { rightpricej_.as_mut_ptr() },if leftrangej_.len() == 0 { std::ptr::null_mut() } else { leftrangej_.as_mut_ptr() },if rightrangej_.len() == 0 { std::ptr::null_mut() } else { rightrangej_.as_mut_ptr() }) },"primal_sensitivity")?;
return Result::Ok(());
} // primalsensitivity
/// Prints the current parameter settings.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.printparam>
#[allow(unused_parens)]
pub fn print_param(&self) -> Result<(),String> {
self.handle_res(unsafe { MSK_printparam(self.ptr) },"print_param")?;
return Result::Ok(());
} // printparam
/// Puts an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Affine conic constraint index.
/// - `domidx_` Domain index.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacc>
#[allow(unused_parens)]
pub fn put_acc(&mut self,accidx_ : i64,domidx_ : i64,afeidxlist_ : &[i64],b_ : &[f64]) -> Result<(),String> {
let numafeidx_ : i64 = afeidxlist_.len() as i64;
if b_.len() > 0 && b_.len() != (numafeidx_).try_into().unwrap() {
return Result::Err("put_acc: Argument 'b' has the wrong length, expected numafeidx_".to_string());
}
self.handle_res(unsafe { MSK_putacc(self.ptr,accidx_,domidx_,numafeidx_,afeidxlist_.as_ptr(),if b_.len() == 0 { std::ptr::null() } else { b_.as_ptr() }) },"put_acc")?;
return Result::Ok(());
} // putacc
/// Puts the constant vector b in an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Affine conic constraint index.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaccb>
#[allow(unused_parens)]
pub fn put_acc_b(&mut self,accidx_ : i64,b_ : &[f64]) -> Result<(),String> {
let lengthb_ : i64 = b_.len() as i64;
self.handle_res(unsafe { MSK_putaccb(self.ptr,accidx_,lengthb_,if b_.len() == 0 { std::ptr::null() } else { b_.as_ptr() }) },"put_acc_b")?;
return Result::Ok(());
} // putaccb
/// Sets one element in the b vector of an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Affine conic constraint index.
/// - `j_` The index of an element in b to change.
/// - `bj_` The new value of b\[j\].
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaccbj>
#[allow(unused_parens)]
pub fn put_acc_b_j(&mut self,accidx_ : i64,j_ : i64,bj_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putaccbj(self.ptr,accidx_,j_,bj_) },"put_acc_b_j")?;
return Result::Ok(());
} // putaccbj
/// Puts the doty vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `accidx_` The index of the affine conic constraint.
/// - `doty_` The dual values for this affine conic constraint. The array should have length equal to the dimension of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaccdoty>
#[allow(unused_parens)]
pub fn put_acc_dot_y(&self,whichsol_ : i32,accidx_ : i64,doty_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getaccn(self.ptr,accidx_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getaccn")?;
if doty_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_acc_dot_y: Argument 'doty' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putaccdoty(self.ptr,whichsol_,accidx_,doty_.as_mut_ptr()) },"put_acc_dot_y")?;
return Result::Ok(());
} // putaccdoty
/// Puts a number of affine conic constraints.
///
/// # Arguments
///
/// - `accidxs_` Affine conic constraint indices.
/// - `domidxs_` Domain indices.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacclist>
#[allow(unused_parens)]
pub fn put_acc_list(&mut self,accidxs_ : &[i64],domidxs_ : &[i64],afeidxlist_ : &[i64],b_ : &[f64]) -> Result<(),String> {
let numaccs_ : i64 = std::cmp::min(domidxs_.len(),accidxs_.len()) as i64;
let numafeidx_ : i64 = afeidxlist_.len() as i64;
if b_.len() > 0 && b_.len() != (numafeidx_).try_into().unwrap() {
return Result::Err("put_acc_list: Argument 'b' has the wrong length, expected numafeidx_".to_string());
}
self.handle_res(unsafe { MSK_putacclist(self.ptr,numaccs_,accidxs_.as_ptr(),domidxs_.as_ptr(),numafeidx_,afeidxlist_.as_ptr(),if b_.len() == 0 { std::ptr::null() } else { b_.as_ptr() }) },"put_acc_list")?;
return Result::Ok(());
} // putacclist
/// Sets the name of an affine conic constraint.
///
/// # Arguments
///
/// - `accidx_` Index of the affine conic constraint.
/// - `name_` The name of the affine conic constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaccname>
#[allow(unused_parens)]
pub fn put_acc_name(&mut self,accidx_ : i64,name_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(name_).unwrap();
self.handle_res(unsafe { MSK_putaccname(self.ptr,accidx_,__tmp_1.as_ptr()) },"put_acc_name")?;
return Result::Ok(());
} // putaccname
/// Replaces all elements in one column of the linear constraint matrix.
///
/// # Arguments
///
/// - `j_` Column index.
/// - `subj_` Row indexes of non-zero values in column.
/// - `valj_` New non-zero values of column.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacol>
#[allow(unused_parens)]
pub fn put_a_col(&mut self,j_ : i32,subj_ : &[i32],valj_ : &[f64]) -> Result<(),String> {
let nzj_ : i32 = std::cmp::min(valj_.len(),subj_.len()) as i32;
self.handle_res(unsafe { MSK_putacol(self.ptr,j_,nzj_,subj_.as_ptr(),valj_.as_ptr()) },"put_a_col")?;
return Result::Ok(());
} // putacol
/// Replaces all elements in several columns the linear constraint matrix.
///
/// # Arguments
///
/// - `sub_` Indexes of columns that should be replaced.
/// - `ptrb_` Array of pointers to the first element in the columns.
/// - `ptre_` Array of pointers to the last element plus one in the columns.
/// - `asub_` Row indexes
/// - `aval_` Coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacollist64>
#[allow(unused_parens)]
pub fn put_a_col_list(&mut self,sub_ : &[i32],ptrb_ : &[i64],ptre_ : &[i64],asub_ : &[i32],aval_ : &[f64]) -> Result<(),String> {
let num_ : i32 = std::cmp::min(std::cmp::min(sub_.len(),ptrb_.len()),ptre_.len()) as i32;
if asub_.len() != aval_.len() { return Err("put_a_col_list: Mismatching asub/aval lengths".to_string()); }
if ptrb_.len() != ptre_.len() { return Err("put_a_col_list: Mismatching ptrb/ptre lengths".to_string()); }
if ! ptrb_.iter().zip(ptre_.iter()).all(|(a,b)| *a <= *b) { return Err("put_a_col_list: Invalid ptrb/ptre construction".to_string()); }
if let Some(v) = ptrb_.iter().min() { if *v < 0 { return Err("put_a_col_list: Invalid ptrb construction".to_string()); } }
if let Some(v) = ptre_.iter().max() { if *v as usize > asub_.len() { return Err("put_a_col_list: Invalid ptre construction".to_string()); } }
self.handle_res(unsafe { MSK_putacollist64(self.ptr,num_,sub_.as_ptr(),ptrb_.as_ptr(),ptre_.as_ptr(),asub_.as_ptr(),aval_.as_ptr()) },"put_a_col_list")?;
return Result::Ok(());
} // putacollist64
/// Replaces all elements in a sequence of columns the linear constraint matrix.
///
/// # Arguments
///
/// - `first_` First column in the slice.
/// - `last_` Last column plus one in the slice.
/// - `ptrb_` Array of pointers to the first element in the columns.
/// - `ptre_` Array of pointers to the last element plus one in the columns.
/// - `asub_` Row indexes
/// - `aval_` Coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putacolslice64>
#[allow(unused_parens)]
pub fn put_a_col_slice(&mut self,first_ : i32,last_ : i32,ptrb_ : &[i64],ptre_ : &[i64],asub_ : &[i32],aval_ : &[f64]) -> Result<(),String> {
if asub_.len() != aval_.len() { return Err("put_a_col_slice: Mismatching asub/aval lengths".to_string()); }
if ptrb_.len() != ptre_.len() { return Err("put_a_col_slice: Mismatching ptrb/ptre lengths".to_string()); }
if ! ptrb_.iter().zip(ptre_.iter()).all(|(a,b)| *a <= *b) { return Err("put_a_col_slice: Invalid ptrb/ptre construction".to_string()); }
if let Some(v) = ptrb_.iter().min() { if *v < 0 { return Err("put_a_col_slice: Invalid ptrb construction".to_string()); } }
if let Some(v) = ptre_.iter().max() { if *v as usize > asub_.len() { return Err("put_a_col_slice: Invalid ptre construction".to_string()); } }
self.handle_res(unsafe { MSK_putacolslice64(self.ptr,first_,last_,ptrb_.as_ptr(),ptre_.as_ptr(),asub_.as_ptr(),aval_.as_ptr()) },"put_a_col_slice")?;
return Result::Ok(());
} // putacolslice64
/// Inputs barF in block triplet form.
///
/// # Arguments
///
/// - `afeidx_` Constraint index.
/// - `barvaridx_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valkl_` The numerical value associated with each block triplet.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafebarfblocktriplet>
#[allow(unused_parens)]
pub fn put_afe_barf_block_triplet(&mut self,afeidx_ : &[i64],barvaridx_ : &[i32],subk_ : &[i32],subl_ : &[i32],valkl_ : &[f64]) -> Result<(),String> {
let numtrip_ : i64 = std::cmp::min(std::cmp::min(std::cmp::min(std::cmp::min(valkl_.len(),afeidx_.len()),barvaridx_.len()),subl_.len()),subk_.len()) as i64;
if afeidx_.len() != (numtrip_).try_into().unwrap() {
return Result::Err("put_afe_barf_block_triplet: Argument 'afeidx' has the wrong length, expected numtrip_".to_string());
}
if barvaridx_.len() != (numtrip_).try_into().unwrap() {
return Result::Err("put_afe_barf_block_triplet: Argument 'barvaridx' has the wrong length, expected numtrip_".to_string());
}
if subk_.len() != (numtrip_).try_into().unwrap() {
return Result::Err("put_afe_barf_block_triplet: Argument 'subk' has the wrong length, expected numtrip_".to_string());
}
if subl_.len() != (numtrip_).try_into().unwrap() {
return Result::Err("put_afe_barf_block_triplet: Argument 'subl' has the wrong length, expected numtrip_".to_string());
}
if valkl_.len() != (numtrip_).try_into().unwrap() {
return Result::Err("put_afe_barf_block_triplet: Argument 'valkl' has the wrong length, expected numtrip_".to_string());
}
self.handle_res(unsafe { MSK_putafebarfblocktriplet(self.ptr,numtrip_,afeidx_.as_ptr(),barvaridx_.as_ptr(),subk_.as_ptr(),subl_.as_ptr(),valkl_.as_ptr()) },"put_afe_barf_block_triplet")?;
return Result::Ok(());
} // putafebarfblocktriplet
/// Inputs one entry in barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
/// - `barvaridx_` Semidefinite variable index.
/// - `termidx_` Element indices in matrix storage.
/// - `termweight_` Weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafebarfentry>
#[allow(unused_parens)]
pub fn put_afe_barf_entry(&mut self,afeidx_ : i64,barvaridx_ : i32,termidx_ : &[i64],termweight_ : &[f64]) -> Result<(),String> {
let numterm_ : i64 = std::cmp::min(termidx_.len(),termweight_.len()) as i64;
self.handle_res(unsafe { MSK_putafebarfentry(self.ptr,afeidx_,barvaridx_,numterm_,termidx_.as_ptr(),termweight_.as_ptr()) },"put_afe_barf_entry")?;
return Result::Ok(());
} // putafebarfentry
/// Inputs a list of entries in barF.
///
/// # Arguments
///
/// - `afeidx_` Row indexes of barF.
/// - `barvaridx_` Semidefinite variable indexes.
/// - `numterm_` Number of terms in the weighted sums.
/// - `ptrterm_` Pointer to the terms forming each entry.
/// - `termidx_` Concatenated element indexes in matrix storage.
/// - `termweight_` Concatenated weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafebarfentrylist>
#[allow(unused_parens)]
pub fn put_afe_barf_entry_list(&mut self,afeidx_ : &[i64],barvaridx_ : &[i32],numterm_ : &[i64],ptrterm_ : &[i64],termidx_ : &[i64],termweight_ : &[f64]) -> Result<(),String> {
let numafeidx_ : i64 = std::cmp::min(std::cmp::min(std::cmp::min(ptrterm_.len(),numterm_.len()),afeidx_.len()),barvaridx_.len()) as i64;
let lenterm_ : i64 = std::cmp::min(termidx_.len(),termweight_.len()) as i64;
self.handle_res(unsafe { MSK_putafebarfentrylist(self.ptr,numafeidx_,afeidx_.as_ptr(),barvaridx_.as_ptr(),numterm_.as_ptr(),ptrterm_.as_ptr(),lenterm_,termidx_.as_ptr(),termweight_.as_ptr()) },"put_afe_barf_entry_list")?;
return Result::Ok(());
} // putafebarfentrylist
/// Inputs a row of barF.
///
/// # Arguments
///
/// - `afeidx_` Row index of barF.
/// - `barvaridx_` Semidefinite variable indexes.
/// - `numterm_` Number of terms in the weighted sums.
/// - `ptrterm_` Pointer to the terms forming each entry.
/// - `termidx_` Concatenated element indexes in matrix storage.
/// - `termweight_` Concatenated weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafebarfrow>
#[allow(unused_parens)]
pub fn put_afe_barf_row(&mut self,afeidx_ : i64,barvaridx_ : &[i32],numterm_ : &[i64],ptrterm_ : &[i64],termidx_ : &[i64],termweight_ : &[f64]) -> Result<(),String> {
let numentr_ : i32 = std::cmp::min(std::cmp::min(ptrterm_.len(),numterm_.len()),barvaridx_.len()) as i32;
let lenterm_ : i64 = std::cmp::min(termidx_.len(),termweight_.len()) as i64;
self.handle_res(unsafe { MSK_putafebarfrow(self.ptr,afeidx_,numentr_,barvaridx_.as_ptr(),numterm_.as_ptr(),ptrterm_.as_ptr(),lenterm_,termidx_.as_ptr(),termweight_.as_ptr()) },"put_afe_barf_row")?;
return Result::Ok(());
} // putafebarfrow
/// Replaces all elements in one column of the F matrix in the affine expressions.
///
/// # Arguments
///
/// - `varidx_` Column index.
/// - `afeidx_` Row indexes of non-zero values in the column.
/// - `val_` New non-zero values in the column.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefcol>
#[allow(unused_parens)]
pub fn put_afe_f_col(&mut self,varidx_ : i32,afeidx_ : &[i64],val_ : &[f64]) -> Result<(),String> {
let numnz_ : i64 = std::cmp::min(val_.len(),afeidx_.len()) as i64;
self.handle_res(unsafe { MSK_putafefcol(self.ptr,varidx_,numnz_,afeidx_.as_ptr(),val_.as_ptr()) },"put_afe_f_col")?;
return Result::Ok(());
} // putafefcol
/// Replaces one entry in F.
///
/// # Arguments
///
/// - `afeidx_` Row index in F.
/// - `varidx_` Column index in F.
/// - `value_` Value of the entry.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefentry>
#[allow(unused_parens)]
pub fn put_afe_f_entry(&mut self,afeidx_ : i64,varidx_ : i32,value_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putafefentry(self.ptr,afeidx_,varidx_,value_) },"put_afe_f_entry")?;
return Result::Ok(());
} // putafefentry
/// Replaces a list of entries in F.
///
/// # Arguments
///
/// - `afeidx_` Row indices in F.
/// - `varidx_` Column indices in F.
/// - `val_` Values of the entries in F.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefentrylist>
#[allow(unused_parens)]
pub fn put_afe_f_entry_list(&mut self,afeidx_ : &[i64],varidx_ : &[i32],val_ : &[f64]) -> Result<(),String> {
let numentr_ : i64 = std::cmp::min(std::cmp::min(varidx_.len(),val_.len()),afeidx_.len()) as i64;
self.handle_res(unsafe { MSK_putafefentrylist(self.ptr,numentr_,afeidx_.as_ptr(),varidx_.as_ptr(),val_.as_ptr()) },"put_afe_f_entry_list")?;
return Result::Ok(());
} // putafefentrylist
/// Replaces all elements in one row of the F matrix in the affine expressions.
///
/// # Arguments
///
/// - `afeidx_` Row index.
/// - `varidx_` Column indexes of non-zero values in the row.
/// - `val_` New non-zero values in the row.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefrow>
#[allow(unused_parens)]
pub fn put_afe_f_row(&mut self,afeidx_ : i64,varidx_ : &[i32],val_ : &[f64]) -> Result<(),String> {
let numnz_ : i32 = std::cmp::min(varidx_.len(),val_.len()) as i32;
self.handle_res(unsafe { MSK_putafefrow(self.ptr,afeidx_,numnz_,varidx_.as_ptr(),val_.as_ptr()) },"put_afe_f_row")?;
return Result::Ok(());
} // putafefrow
/// Replaces all elements in a number of rows of the F matrix in the affine expressions.
///
/// # Arguments
///
/// - `afeidx_` Row indices.
/// - `numnzrow_` Number of non-zeros in each row.
/// - `ptrrow_` Pointer to the first nonzero in each row.
/// - `varidx_` Column indexes of non-zero values.
/// - `val_` New non-zero values in the rows.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafefrowlist>
#[allow(unused_parens)]
pub fn put_afe_f_row_list(&mut self,afeidx_ : &[i64],numnzrow_ : &[i32],ptrrow_ : &[i64],varidx_ : &[i32],val_ : &[f64]) -> Result<(),String> {
let numafeidx_ : i64 = std::cmp::min(std::cmp::min(numnzrow_.len(),afeidx_.len()),ptrrow_.len()) as i64;
let lenidxval_ : i64 = std::cmp::min(varidx_.len(),val_.len()) as i64;
if varidx_.len() != val_.len() { return Err("put_afe_f_row_list: Mismatching varidx/val lengths".to_string()); }
if let Some(v) = numnzrow_.iter().min() { if *v < 0 { return Err("put_afe_f_row_list: Invalid numnzrow value".to_string()); } }
if let Some(v) = ptrrow_.iter().min() { if *v < 0 { return Err("put_afe_f_row_list: Invalid ptrrow value".to_string()); } }
if let Some(v) = ptrrow_.iter().zip(numnzrow_.iter()).map(|(a,b)| *a as usize + *b as usize).max() { if v > varidx_.len() { return Err("put_afe_f_row_list: Invalid ptrrow/numnzrow construction".to_string()); } }
self.handle_res(unsafe { MSK_putafefrowlist(self.ptr,numafeidx_,afeidx_.as_ptr(),numnzrow_.as_ptr(),ptrrow_.as_ptr(),lenidxval_,varidx_.as_ptr(),val_.as_ptr()) },"put_afe_f_row_list")?;
return Result::Ok(());
} // putafefrowlist
/// Replaces one element in the g vector in the affine expressions.
///
/// # Arguments
///
/// - `afeidx_` Row index.
/// - `g_` New value for the element of g.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafeg>
#[allow(unused_parens)]
pub fn put_afe_g(&mut self,afeidx_ : i64,g_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putafeg(self.ptr,afeidx_,g_) },"put_afe_g")?;
return Result::Ok(());
} // putafeg
/// Replaces a list of elements in the g vector in the affine expressions.
///
/// # Arguments
///
/// - `afeidx_` Indices of entries in g.
/// - `g_` New values for the elements of g.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafeglist>
#[allow(unused_parens)]
pub fn put_afe_g_list(&mut self,afeidx_ : &[i64],g_ : &[f64]) -> Result<(),String> {
let numafeidx_ : i64 = std::cmp::min(g_.len(),afeidx_.len()) as i64;
self.handle_res(unsafe { MSK_putafeglist(self.ptr,numafeidx_,afeidx_.as_ptr(),g_.as_ptr()) },"put_afe_g_list")?;
return Result::Ok(());
} // putafeglist
/// Modifies a slice of the vector g.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slice_` The slice of g as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putafegslice>
#[allow(unused_parens)]
pub fn put_afe_g_slice(&mut self,first_ : i64,last_ : i64,slice_ : &[f64]) -> Result<(),String> {
if slice_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_afe_g_slice: Argument 'slice' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putafegslice(self.ptr,first_,last_,slice_.as_ptr()) },"put_afe_g_slice")?;
return Result::Ok(());
} // putafegslice
/// Changes a single value in the linear coefficient matrix.
///
/// # Arguments
///
/// - `i_` Constraint (row) index.
/// - `j_` Variable (column) index.
/// - `aij_` New coefficient.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaij>
#[allow(unused_parens)]
pub fn put_aij(&mut self,i_ : i32,j_ : i32,aij_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putaij(self.ptr,i_,j_,aij_) },"put_aij")?;
return Result::Ok(());
} // putaij
/// Changes one or more coefficients in the linear constraint matrix.
///
/// # Arguments
///
/// - `subi_` Constraint (row) indices.
/// - `subj_` Variable (column) indices.
/// - `valij_` New coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putaijlist64>
#[allow(unused_parens)]
pub fn put_aij_list(&mut self,subi_ : &[i32],subj_ : &[i32],valij_ : &[f64]) -> Result<(),String> {
let num_ : i64 = std::cmp::min(std::cmp::min(valij_.len(),subi_.len()),subj_.len()) as i64;
self.handle_res(unsafe { MSK_putaijlist64(self.ptr,num_,subi_.as_ptr(),subj_.as_ptr(),valij_.as_ptr()) },"put_aij_list")?;
return Result::Ok(());
} // putaijlist64
/// Replaces all elements in one row of the linear constraint matrix.
///
/// # Arguments
///
/// - `i_` Row index.
/// - `subi_` Column indexes of non-zero values in row.
/// - `vali_` New non-zero values of row.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putarow>
#[allow(unused_parens)]
pub fn put_a_row(&mut self,i_ : i32,subi_ : &[i32],vali_ : &[f64]) -> Result<(),String> {
let nzi_ : i32 = std::cmp::min(subi_.len(),vali_.len()) as i32;
self.handle_res(unsafe { MSK_putarow(self.ptr,i_,nzi_,subi_.as_ptr(),vali_.as_ptr()) },"put_a_row")?;
return Result::Ok(());
} // putarow
/// Replaces all elements in several rows of the linear constraint matrix.
///
/// # Arguments
///
/// - `sub_` Indexes of rows or columns that should be replaced.
/// - `ptrb_` Array of pointers to the first element in the rows.
/// - `ptre_` Array of pointers to the last element plus one in the rows.
/// - `asub_` Variable indexes.
/// - `aval_` Coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putarowlist64>
#[allow(unused_parens)]
pub fn put_a_row_list(&mut self,sub_ : &[i32],ptrb_ : &[i64],ptre_ : &[i64],asub_ : &[i32],aval_ : &[f64]) -> Result<(),String> {
let num_ : i32 = std::cmp::min(std::cmp::min(sub_.len(),ptrb_.len()),ptre_.len()) as i32;
if asub_.len() != aval_.len() { return Err("put_a_row_list: Mismatching asub/aval lengths".to_string()); }
if ptrb_.len() != ptre_.len() { return Err("put_a_row_list: Mismatching ptrb/ptre lengths".to_string()); }
if ! ptrb_.iter().zip(ptre_.iter()).all(|(a,b)| *a <= *b) { return Err("put_a_row_list: Invalid ptrb/ptre construction".to_string()); }
if let Some(v) = ptrb_.iter().min() { if *v < 0 { return Err("put_a_row_list: Invalid ptrb construction".to_string()); } }
if let Some(v) = ptre_.iter().max() { if *v as usize > asub_.len() { return Err("put_a_row_list: Invalid ptre construction".to_string()); } }
self.handle_res(unsafe { MSK_putarowlist64(self.ptr,num_,sub_.as_ptr(),ptrb_.as_ptr(),ptre_.as_ptr(),asub_.as_ptr(),aval_.as_ptr()) },"put_a_row_list")?;
return Result::Ok(());
} // putarowlist64
/// Replaces all elements in several rows the linear constraint matrix.
///
/// # Arguments
///
/// - `first_` First row in the slice.
/// - `last_` Last row plus one in the slice.
/// - `ptrb_` Array of pointers to the first element in the rows.
/// - `ptre_` Array of pointers to the last element plus one in the rows.
/// - `asub_` Column indexes of new elements.
/// - `aval_` Coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putarowslice64>
#[allow(unused_parens)]
pub fn put_a_row_slice(&mut self,first_ : i32,last_ : i32,ptrb_ : &[i64],ptre_ : &[i64],asub_ : &[i32],aval_ : &[f64]) -> Result<(),String> {
if ptrb_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_a_row_slice: Argument 'ptrb' has the wrong length, expected (last_-first_)".to_string());
}
if ptre_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_a_row_slice: Argument 'ptre' has the wrong length, expected (last_-first_)".to_string());
}
if asub_.len() != aval_.len() { return Err("put_a_row_slice: Mismatching asub/aval lengths".to_string()); }
if ptrb_.len() != ptre_.len() { return Err("put_a_row_slice: Mismatching ptrb/ptre lengths".to_string()); }
if ! ptrb_.iter().zip(ptre_.iter()).all(|(a,b)| *a <= *b) { return Err("put_a_row_slice: Invalid ptrb/ptre construction".to_string()); }
if let Some(v) = ptrb_.iter().min() { if *v < 0 { return Err("put_a_row_slice: Invalid ptrb construction".to_string()); } }
if let Some(v) = ptre_.iter().max() { if *v as usize > asub_.len() { return Err("put_a_row_slice: Invalid ptre construction".to_string()); } }
self.handle_res(unsafe { MSK_putarowslice64(self.ptr,first_,last_,ptrb_.as_ptr(),ptre_.as_ptr(),asub_.as_ptr(),aval_.as_ptr()) },"put_a_row_slice")?;
return Result::Ok(());
} // putarowslice64
/// Truncates all elements in A below a certain tolerance to zero.
///
/// # Arguments
///
/// - `tolzero_` Truncation tolerance.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putatruncatetol>
#[allow(unused_parens)]
pub fn put_a_truncate_tol(&mut self,tolzero_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putatruncatetol(self.ptr,tolzero_) },"put_a_truncate_tol")?;
return Result::Ok(());
} // putatruncatetol
/// Inputs barA in block triplet form.
///
/// # Arguments
///
/// - `subi_` Constraint index.
/// - `subj_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valijkl_` The numerical value associated with each block triplet.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarablocktriplet>
#[allow(unused_parens)]
pub fn put_bara_block_triplet(&mut self,subi_ : &[i32],subj_ : &[i32],subk_ : &[i32],subl_ : &[i32],valijkl_ : &[f64]) -> Result<(),String> {
let num_ : i64 = std::cmp::min(std::cmp::min(std::cmp::min(valijkl_.len(),subl_.len()),subk_.len()),subj_.len()) as i64;
if subi_.len() != (num_).try_into().unwrap() {
return Result::Err("put_bara_block_triplet: Argument 'subi' has the wrong length, expected num_".to_string());
}
if subj_.len() != (num_).try_into().unwrap() {
return Result::Err("put_bara_block_triplet: Argument 'subj' has the wrong length, expected num_".to_string());
}
if subk_.len() != (num_).try_into().unwrap() {
return Result::Err("put_bara_block_triplet: Argument 'subk' has the wrong length, expected num_".to_string());
}
if subl_.len() != (num_).try_into().unwrap() {
return Result::Err("put_bara_block_triplet: Argument 'subl' has the wrong length, expected num_".to_string());
}
if valijkl_.len() != (num_).try_into().unwrap() {
return Result::Err("put_bara_block_triplet: Argument 'valijkl' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_putbarablocktriplet(self.ptr,num_,subi_.as_ptr(),subj_.as_ptr(),subk_.as_ptr(),subl_.as_ptr(),valijkl_.as_ptr()) },"put_bara_block_triplet")?;
return Result::Ok(());
} // putbarablocktriplet
/// Inputs an element of barA.
///
/// # Arguments
///
/// - `i_` Row index of barA.
/// - `j_` Column index of barA.
/// - `sub_` Element indexes in matrix storage.
/// - `weights_` Weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbaraij>
#[allow(unused_parens)]
pub fn put_bara_ij(&mut self,i_ : i32,j_ : i32,sub_ : &[i64],weights_ : &[f64]) -> Result<(),String> {
let num_ : i64 = std::cmp::min(sub_.len(),weights_.len()) as i64;
self.handle_res(unsafe { MSK_putbaraij(self.ptr,i_,j_,num_,sub_.as_ptr(),weights_.as_ptr()) },"put_bara_ij")?;
return Result::Ok(());
} // putbaraij
/// Inputs list of elements of barA.
///
/// # Arguments
///
/// - `subi_` Row index of barA.
/// - `subj_` Column index of barA.
/// - `alphaptrb_` Start entries for terms in the weighted sum.
/// - `alphaptre_` End entries for terms in the weighted sum.
/// - `matidx_` Element indexes in matrix storage.
/// - `weights_` Weights in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbaraijlist>
#[allow(unused_parens)]
pub fn put_bara_ij_list(&mut self,subi_ : &[i32],subj_ : &[i32],alphaptrb_ : &[i64],alphaptre_ : &[i64],matidx_ : &[i64],weights_ : &[f64]) -> Result<(),String> {
let num_ : i32 = std::cmp::min(std::cmp::min(std::cmp::min(alphaptrb_.len(),alphaptre_.len()),subi_.len()),subj_.len()) as i32;
if matidx_.len() != weights_.len() { return Err("put_bara_ij_list: Mismatching matidx/weights lengths".to_string()); }
if alphaptrb_.len() != alphaptre_.len() { return Err("put_bara_ij_list: Mismatching alphaptrb/alphaptre lengths".to_string()); }
if ! alphaptrb_.iter().zip(alphaptre_.iter()).all(|(a,b)| *a <= *b) { return Err("put_bara_ij_list: Invalid alphaptrb/alphaptre construction".to_string()); }
if let Some(v) = alphaptrb_.iter().min() { if *v < 0 { return Err("put_bara_ij_list: Invalid alphaptrb construction".to_string()); } }
if let Some(v) = alphaptre_.iter().max() { if *v as usize > matidx_.len() { return Err("put_bara_ij_list: Invalid alphaptre construction".to_string()); } }
self.handle_res(unsafe { MSK_putbaraijlist(self.ptr,num_,subi_.as_ptr(),subj_.as_ptr(),alphaptrb_.as_ptr(),alphaptre_.as_ptr(),matidx_.as_ptr(),weights_.as_ptr()) },"put_bara_ij_list")?;
return Result::Ok(());
} // putbaraijlist
/// Replace a set of rows of barA
///
/// # Arguments
///
/// - `subi_` Row indexes of barA.
/// - `ptrb_` Start of rows in barA.
/// - `ptre_` End of rows in barA.
/// - `subj_` Column index of barA.
/// - `nummat_` Number of entries in weighted sum of matrixes.
/// - `matidx_` Matrix indexes for weighted sum of matrixes.
/// - `weights_` Weights for weighted sum of matrixes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbararowlist>
#[allow(unused_parens)]
pub fn put_bara_row_list(&mut self,subi_ : &[i32],ptrb_ : &[i64],ptre_ : &[i64],subj_ : &[i32],nummat_ : &[i64],matidx_ : &[i64],weights_ : &[f64]) -> Result<(),String> {
let num_ : i32 = std::cmp::min(std::cmp::min(ptrb_.len(),ptre_.len()),subi_.len()) as i32;
if nummat_.len() != (subj_.len()).try_into().unwrap() {
return Result::Err("put_bara_row_list: Argument 'nummat' has the wrong length, expected subj_.len()".to_string());
}
let mut __tmp_0 : i64 = i64::default();
for __tmp_1 in nummat_ { __tmp_0 += __tmp_1; }
if matidx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_bara_row_list: Argument 'matidx' has the wrong length, expected __tmp_0".to_string());
}
let mut __tmp_2 : i64 = i64::default();
for __tmp_3 in nummat_ { __tmp_2 += __tmp_3; }
if weights_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("put_bara_row_list: Argument 'weights' has the wrong length, expected __tmp_2".to_string());
}
if subj_.len() != nummat_.len() { return Err("put_bara_row_list: Mismatching subj/nummat lengths".to_string()); }
if ptrb_.len() != ptre_.len() { return Err("put_bara_row_list: Mismatching ptrb/ptre lengths".to_string()); }
if ! ptrb_.iter().zip(ptre_.iter()).all(|(a,b)| *a <= *b) { return Err("put_bara_row_list: Invalid ptrb/ptre construction".to_string()); }
if let Some(v) = ptrb_.iter().min() { if *v < 0 { return Err("put_bara_row_list: Invalid ptrb construction".to_string()); } }
if let Some(v) = ptre_.iter().max() { if *v as usize > subj_.len() { return Err("put_bara_row_list: Invalid ptre construction".to_string()); } }
self.handle_res(unsafe { MSK_putbararowlist(self.ptr,num_,subi_.as_ptr(),ptrb_.as_ptr(),ptre_.as_ptr(),subj_.as_ptr(),nummat_.as_ptr(),matidx_.as_ptr(),weights_.as_ptr()) },"put_bara_row_list")?;
return Result::Ok(());
} // putbararowlist
/// Inputs barC in block triplet form.
///
/// # Arguments
///
/// - `subj_` Symmetric matrix variable index.
/// - `subk_` Block row index.
/// - `subl_` Block column index.
/// - `valjkl_` The numerical value associated with each block triplet.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarcblocktriplet>
#[allow(unused_parens)]
pub fn put_barc_block_triplet(&mut self,subj_ : &[i32],subk_ : &[i32],subl_ : &[i32],valjkl_ : &[f64]) -> Result<(),String> {
let num_ : i64 = std::cmp::min(std::cmp::min(std::cmp::min(valjkl_.len(),subl_.len()),subk_.len()),subj_.len()) as i64;
if subj_.len() != (num_).try_into().unwrap() {
return Result::Err("put_barc_block_triplet: Argument 'subj' has the wrong length, expected num_".to_string());
}
if subk_.len() != (num_).try_into().unwrap() {
return Result::Err("put_barc_block_triplet: Argument 'subk' has the wrong length, expected num_".to_string());
}
if subl_.len() != (num_).try_into().unwrap() {
return Result::Err("put_barc_block_triplet: Argument 'subl' has the wrong length, expected num_".to_string());
}
if valjkl_.len() != (num_).try_into().unwrap() {
return Result::Err("put_barc_block_triplet: Argument 'valjkl' has the wrong length, expected num_".to_string());
}
self.handle_res(unsafe { MSK_putbarcblocktriplet(self.ptr,num_,subj_.as_ptr(),subk_.as_ptr(),subl_.as_ptr(),valjkl_.as_ptr()) },"put_barc_block_triplet")?;
return Result::Ok(());
} // putbarcblocktriplet
/// Changes one element in barc.
///
/// # Arguments
///
/// - `j_` Index of the element in barc` that should be changed.
/// - `sub_` sub is list of indexes of those symmetric matrices appearing in sum.
/// - `weights_` The weights of the terms in the weighted sum.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarcj>
#[allow(unused_parens)]
pub fn put_barc_j(&mut self,j_ : i32,sub_ : &[i64],weights_ : &[f64]) -> Result<(),String> {
let num_ : i64 = std::cmp::min(sub_.len(),weights_.len()) as i64;
self.handle_res(unsafe { MSK_putbarcj(self.ptr,j_,num_,sub_.as_ptr(),weights_.as_ptr()) },"put_barc_j")?;
return Result::Ok(());
} // putbarcj
/// Sets the dual solution for a semidefinite variable.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `j_` Index of the semidefinite variable.
/// - `barsj_` Value of the j'th variable of barx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarsj>
#[allow(unused_parens)]
pub fn put_bars_j(&mut self,whichsol_ : i32,j_ : i32,barsj_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getlenbarvarj(self.ptr,j_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getlenbarvarj")?;
if barsj_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_bars_j: Argument 'barsj' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putbarsj(self.ptr,whichsol_,j_,barsj_.as_ptr()) },"put_bars_j")?;
return Result::Ok(());
} // putbarsj
/// Sets the name of a semidefinite variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `name_` The variable name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarvarname>
#[allow(unused_parens)]
pub fn put_barvar_name(&mut self,j_ : i32,name_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(name_).unwrap();
self.handle_res(unsafe { MSK_putbarvarname(self.ptr,j_,__tmp_1.as_ptr()) },"put_barvar_name")?;
return Result::Ok(());
} // putbarvarname
/// Sets the primal solution for a semidefinite variable.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `j_` Index of the semidefinite variable.
/// - `barxj_` Value of the j'th variable of barx.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putbarxj>
#[allow(unused_parens)]
pub fn put_barx_j(&mut self,whichsol_ : i32,j_ : i32,barxj_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i64 = i64::default();
let __tmp_1 = unsafe { MSK_getlenbarvarj(self.ptr,j_,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getlenbarvarj")?;
if barxj_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_barx_j: Argument 'barxj' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putbarxj(self.ptr,whichsol_,j_,barxj_.as_ptr()) },"put_barx_j")?;
return Result::Ok(());
} // putbarxj
/// Replaces the fixed term in the objective.
///
/// # Arguments
///
/// - `cfix_` Fixed term in the objective.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putcfix>
#[allow(unused_parens)]
pub fn put_cfix(&mut self,cfix_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putcfix(self.ptr,cfix_) },"put_cfix")?;
return Result::Ok(());
} // putcfix
/// Modifies one linear coefficient in the objective.
///
/// # Arguments
///
/// - `j_` Index of the variable whose objective coefficient should be changed.
/// - `cj_` New coefficient value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putcj>
#[allow(unused_parens)]
pub fn put_c_j(&mut self,j_ : i32,cj_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putcj(self.ptr,j_,cj_) },"put_c_j")?;
return Result::Ok(());
} // putcj
/// Modifies a part of the linear objective coefficients.
///
/// # Arguments
///
/// - `subj_` Indices of variables for which objective coefficients should be changed.
/// - `val_` New numerical values for the objective coefficients that should be modified.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putclist>
#[allow(unused_parens)]
pub fn put_c_list(&mut self,subj_ : &[i32],val_ : &[f64]) -> Result<(),String> {
let num_ : i32 = std::cmp::min(val_.len(),subj_.len()) as i32;
self.handle_res(unsafe { MSK_putclist(self.ptr,num_,subj_.as_ptr(),val_.as_ptr()) },"put_c_list")?;
return Result::Ok(());
} // putclist
/// Changes the bound for one constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
/// - `bkc_` New bound key.
///
/// See [Boundkey]
/// - `blc_` New lower bound.
/// - `buc_` New upper bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconbound>
#[allow(unused_parens)]
pub fn put_con_bound(&mut self,i_ : i32,bkc_ : i32,blc_ : f64,buc_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putconbound(self.ptr,i_,bkc_,blc_,buc_) },"put_con_bound")?;
return Result::Ok(());
} // putconbound
/// Changes the bounds of a list of constraints.
///
/// # Arguments
///
/// - `sub_` List of constraint indexes.
/// - `bkc_` Bound keys for the constraints.
///
/// See [Boundkey]
/// - `blc_` Lower bounds for the constraints.
/// - `buc_` Upper bounds for the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconboundlist>
#[allow(unused_parens)]
pub fn put_con_bound_list(&mut self,sub_ : &[i32],bkc_ : &[i32],blc_ : &[f64],buc_ : &[f64]) -> Result<(),String> {
let num_ : i32 = std::cmp::min(std::cmp::min(std::cmp::min(sub_.len(),bkc_.len()),blc_.len()),buc_.len()) as i32;
self.handle_res(unsafe { MSK_putconboundlist(self.ptr,num_,sub_.as_ptr(),bkc_.as_ptr(),blc_.as_ptr(),buc_.as_ptr()) },"put_con_bound_list")?;
return Result::Ok(());
} // putconboundlist
/// Changes the bounds of a list of constraints.
///
/// # Arguments
///
/// - `sub_` List of constraint indexes.
/// - `bkc_` New bound key for all constraints in the list.
///
/// See [Boundkey]
/// - `blc_` New lower bound for all constraints in the list.
/// - `buc_` New upper bound for all constraints in the list.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconboundlistconst>
#[allow(unused_parens)]
pub fn put_con_bound_list_const(&mut self,sub_ : &[i32],bkc_ : i32,blc_ : f64,buc_ : f64) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
self.handle_res(unsafe { MSK_putconboundlistconst(self.ptr,num_,sub_.as_ptr(),bkc_,blc_,buc_) },"put_con_bound_list_const")?;
return Result::Ok(());
} // putconboundlistconst
/// Changes the bounds for a slice of the constraints.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bkc_` Bound keys for the constraints.
///
/// See [Boundkey]
/// - `blc_` Lower bounds for the constraints.
/// - `buc_` Upper bounds for the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconboundslice>
#[allow(unused_parens)]
pub fn put_con_bound_slice(&mut self,first_ : i32,last_ : i32,bkc_ : &[i32],blc_ : &[f64],buc_ : &[f64]) -> Result<(),String> {
if bkc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_con_bound_slice: Argument 'bkc' has the wrong length, expected (last_-first_)".to_string());
}
if blc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_con_bound_slice: Argument 'blc' has the wrong length, expected (last_-first_)".to_string());
}
if buc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_con_bound_slice: Argument 'buc' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putconboundslice(self.ptr,first_,last_,bkc_.as_ptr(),blc_.as_ptr(),buc_.as_ptr()) },"put_con_bound_slice")?;
return Result::Ok(());
} // putconboundslice
/// Changes the bounds for a slice of the constraints.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bkc_` New bound key for all constraints in the slice.
///
/// See [Boundkey]
/// - `blc_` New lower bound for all constraints in the slice.
/// - `buc_` New upper bound for all constraints in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconboundsliceconst>
#[allow(unused_parens)]
pub fn put_con_bound_slice_const(&mut self,first_ : i32,last_ : i32,bkc_ : i32,blc_ : f64,buc_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putconboundsliceconst(self.ptr,first_,last_,bkc_,blc_,buc_) },"put_con_bound_slice_const")?;
return Result::Ok(());
} // putconboundsliceconst
/// Replaces a conic constraint.
///
/// # Arguments
///
/// - `k_` Index of the cone.
/// - `ct_` Specifies the type of the cone.
///
/// See [Conetype]
/// - `conepar_` For the power cone it denotes the exponent alpha. For other cone types it is unused and can be set to 0.
/// - `submem_` Variable subscripts of the members in the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putcone>
#[allow(unused_parens)]
pub fn put_cone(&mut self,k_ : i32,ct_ : i32,conepar_ : f64,submem_ : &[i32]) -> Result<(),String> {
let nummem_ : i32 = submem_.len() as i32;
self.handle_res(unsafe { MSK_putcone(self.ptr,k_,ct_,conepar_,nummem_,submem_.as_ptr()) },"put_cone")?;
return Result::Ok(());
} // putcone
/// Sets the name of a cone.
///
/// # Arguments
///
/// - `j_` Index of the cone.
/// - `name_` The name of the cone.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconename>
#[allow(unused_parens)]
pub fn put_cone_name(&mut self,j_ : i32,name_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(name_).unwrap();
self.handle_res(unsafe { MSK_putconename(self.ptr,j_,__tmp_1.as_ptr()) },"put_cone_name")?;
return Result::Ok(());
} // putconename
/// Sets the name of a constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
/// - `name_` The name of the constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconname>
#[allow(unused_parens)]
pub fn put_con_name(&mut self,i_ : i32,name_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(name_).unwrap();
self.handle_res(unsafe { MSK_putconname(self.ptr,i_,__tmp_1.as_ptr()) },"put_con_name")?;
return Result::Ok(());
} // putconname
/// Sets the primal and dual solution information for a single constraint.
///
/// # Arguments
///
/// - `i_` Index of the constraint.
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sk_` Status key of the constraint.
///
/// See [Stakey]
/// - `x_` Primal solution value of the constraint.
/// - `sl_` Solution value of the dual variable associated with the lower bound.
/// - `su_` Solution value of the dual variable associated with the upper bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putconsolutioni>
#[allow(unused_parens)]
pub fn put_con_solution_i(&mut self,i_ : i32,whichsol_ : i32,sk_ : i32,x_ : f64,sl_ : f64,su_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putconsolutioni(self.ptr,i_,whichsol_,sk_,x_,sl_,su_) },"put_con_solution_i")?;
return Result::Ok(());
} // putconsolutioni
/// Modifies a slice of the linear objective coefficients.
///
/// # Arguments
///
/// - `first_` First element in the slice of c.
/// - `last_` Last element plus 1 of the slice in c to be changed.
/// - `slice_` New numerical values for the objective coefficients that should be modified.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putcslice>
#[allow(unused_parens)]
pub fn put_c_slice(&mut self,first_ : i32,last_ : i32,slice_ : &[f64]) -> Result<(),String> {
if slice_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_c_slice: Argument 'slice' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putcslice(self.ptr,first_,last_,slice_.as_ptr()) },"put_c_slice")?;
return Result::Ok(());
} // putcslice
/// Inputs a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `domidxlist_` List of domain indexes.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions.
/// - `termsizelist_` List of term sizes.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdjc>
#[allow(unused_parens)]
pub fn put_djc(&mut self,djcidx_ : i64,domidxlist_ : &[i64],afeidxlist_ : &[i64],b_ : &[f64],termsizelist_ : &[i64]) -> Result<(),String> {
let numdomidx_ : i64 = domidxlist_.len() as i64;
let numafeidx_ : i64 = afeidxlist_.len() as i64;
if b_.len() > 0 && b_.len() != (numafeidx_).try_into().unwrap() {
return Result::Err("put_djc: Argument 'b' has the wrong length, expected numafeidx_".to_string());
}
let numterms_ : i64 = termsizelist_.len() as i64;
self.handle_res(unsafe { MSK_putdjc(self.ptr,djcidx_,numdomidx_,domidxlist_.as_ptr(),numafeidx_,afeidxlist_.as_ptr(),if b_.len() == 0 { std::ptr::null() } else { b_.as_ptr() },numterms_,termsizelist_.as_ptr()) },"put_djc")?;
return Result::Ok(());
} // putdjc
/// Sets the name of a disjunctive constraint.
///
/// # Arguments
///
/// - `djcidx_` Index of the disjunctive constraint.
/// - `name_` The name of the disjunctive constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdjcname>
#[allow(unused_parens)]
pub fn put_djc_name(&mut self,djcidx_ : i64,name_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(name_).unwrap();
self.handle_res(unsafe { MSK_putdjcname(self.ptr,djcidx_,__tmp_1.as_ptr()) },"put_djc_name")?;
return Result::Ok(());
} // putdjcname
/// Inputs a slice of disjunctive constraints.
///
/// # Arguments
///
/// - `idxfirst_` Index of the first disjunctive constraint in the slice.
/// - `idxlast_` Index of the last disjunctive constraint in the slice plus 1.
/// - `domidxlist_` List of domain indexes.
/// - `afeidxlist_` List of affine expression indexes.
/// - `b_` The vector of constant terms modifying affine expressions. Optional.
/// - `termsizelist_` List of term sizes.
/// - `termsindjc_` Number of terms in each of the disjunctive constraints in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdjcslice>
#[allow(unused_parens)]
pub fn put_djc_slice(&mut self,idxfirst_ : i64,idxlast_ : i64,domidxlist_ : &[i64],afeidxlist_ : &[i64],b_ : &[f64],termsizelist_ : &[i64],termsindjc_ : &[i64]) -> Result<(),String> {
let numdomidx_ : i64 = domidxlist_.len() as i64;
let numafeidx_ : i64 = afeidxlist_.len() as i64;
if b_.len() > 0 && b_.len() != (numafeidx_).try_into().unwrap() {
return Result::Err("put_djc_slice: Argument 'b' has the wrong length, expected numafeidx_".to_string());
}
let numterms_ : i64 = termsizelist_.len() as i64;
if termsindjc_.len() != ((idxlast_-idxfirst_)).try_into().unwrap() {
return Result::Err("put_djc_slice: Argument 'termsindjc' has the wrong length, expected (idxlast_-idxfirst_)".to_string());
}
self.handle_res(unsafe { MSK_putdjcslice(self.ptr,idxfirst_,idxlast_,numdomidx_,domidxlist_.as_ptr(),numafeidx_,afeidxlist_.as_ptr(),if b_.len() == 0 { std::ptr::null() } else { b_.as_ptr() },numterms_,termsizelist_.as_ptr(),termsindjc_.as_ptr()) },"put_djc_slice")?;
return Result::Ok(());
} // putdjcslice
/// Sets the name of a domain.
///
/// # Arguments
///
/// - `domidx_` Index of the domain.
/// - `name_` The name of the domain.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdomainname>
#[allow(unused_parens)]
pub fn put_domain_name(&mut self,domidx_ : i64,name_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(name_).unwrap();
self.handle_res(unsafe { MSK_putdomainname(self.ptr,domidx_,__tmp_1.as_ptr()) },"put_domain_name")?;
return Result::Ok(());
} // putdomainname
/// Sets a double parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Dparam]
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putdouparam>
#[allow(unused_parens)]
pub fn put_dou_param(&mut self,param_ : i32,parvalue_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putdouparam(self.ptr,param_,parvalue_) },"put_dou_param")?;
return Result::Ok(());
} // putdouparam
/// Sets an integer parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Iparam]
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putintparam>
#[allow(unused_parens)]
pub fn put_int_param(&mut self,param_ : i32,parvalue_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_putintparam(self.ptr,param_,parvalue_) },"put_int_param")?;
return Result::Ok(());
} // putintparam
/// Sets the number of preallocated affine conic constraints.
///
/// # Arguments
///
/// - `maxnumacc_` Number of preallocated affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumacc>
#[allow(unused_parens)]
pub fn put_max_num_acc(&mut self,maxnumacc_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumacc(self.ptr,maxnumacc_) },"put_max_num_acc")?;
return Result::Ok(());
} // putmaxnumacc
/// Sets the number of preallocated affine expressions in the optimization task.
///
/// # Arguments
///
/// - `maxnumafe_` Number of preallocated affine expressions.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumafe>
#[allow(unused_parens)]
pub fn put_max_num_afe(&mut self,maxnumafe_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumafe(self.ptr,maxnumafe_) },"put_max_num_afe")?;
return Result::Ok(());
} // putmaxnumafe
/// Sets the number of preallocated non-zero entries in the linear coefficient matrix.
///
/// # Arguments
///
/// - `maxnumanz_` New size of the storage reserved for storing the linear coefficient matrix.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumanz>
#[allow(unused_parens)]
pub fn put_max_num_a_nz(&mut self,maxnumanz_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumanz(self.ptr,maxnumanz_) },"put_max_num_a_nz")?;
return Result::Ok(());
} // putmaxnumanz
/// Sets the number of preallocated symmetric matrix variables.
///
/// # Arguments
///
/// - `maxnumbarvar_` Number of preallocated symmetric matrix variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumbarvar>
#[allow(unused_parens)]
pub fn put_max_num_barvar(&mut self,maxnumbarvar_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumbarvar(self.ptr,maxnumbarvar_) },"put_max_num_barvar")?;
return Result::Ok(());
} // putmaxnumbarvar
/// Sets the number of preallocated constraints in the optimization task.
///
/// # Arguments
///
/// - `maxnumcon_` Number of preallocated constraints in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumcon>
#[allow(unused_parens)]
pub fn put_max_num_con(&mut self,maxnumcon_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumcon(self.ptr,maxnumcon_) },"put_max_num_con")?;
return Result::Ok(());
} // putmaxnumcon
/// Sets the number of preallocated conic constraints in the optimization task.
///
/// # Arguments
///
/// - `maxnumcone_` Number of preallocated conic constraints in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumcone>
#[allow(unused_parens)]
pub fn put_max_num_cone(&mut self,maxnumcone_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumcone(self.ptr,maxnumcone_) },"put_max_num_cone")?;
return Result::Ok(());
} // putmaxnumcone
/// Sets the number of preallocated disjunctive constraints.
///
/// # Arguments
///
/// - `maxnumdjc_` Number of preallocated disjunctive constraints in the task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumdjc>
#[allow(unused_parens)]
pub fn put_max_num_djc(&mut self,maxnumdjc_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumdjc(self.ptr,maxnumdjc_) },"put_max_num_djc")?;
return Result::Ok(());
} // putmaxnumdjc
/// Sets the number of preallocated domains in the optimization task.
///
/// # Arguments
///
/// - `maxnumdomain_` Number of preallocated domains.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumdomain>
#[allow(unused_parens)]
pub fn put_max_num_domain(&mut self,maxnumdomain_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumdomain(self.ptr,maxnumdomain_) },"put_max_num_domain")?;
return Result::Ok(());
} // putmaxnumdomain
/// Sets the number of preallocated non-zero entries in quadratic terms.
///
/// # Arguments
///
/// - `maxnumqnz_` Number of non-zero elements preallocated in quadratic coefficient matrices.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumqnz>
#[allow(unused_parens)]
pub fn put_max_num_q_nz(&mut self,maxnumqnz_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumqnz(self.ptr,maxnumqnz_) },"put_max_num_q_nz")?;
return Result::Ok(());
} // putmaxnumqnz
/// Sets the number of preallocated variables in the optimization task.
///
/// # Arguments
///
/// - `maxnumvar_` Number of preallocated variables in the optimization task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putmaxnumvar>
#[allow(unused_parens)]
pub fn put_max_num_var(&mut self,maxnumvar_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_putmaxnumvar(self.ptr,maxnumvar_) },"put_max_num_var")?;
return Result::Ok(());
} // putmaxnumvar
/// Sets a double parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putnadouparam>
#[allow(unused_parens)]
pub fn put_na_dou_param(&mut self,paramname_ : &str,parvalue_ : f64) -> Result<(),String> {
let __tmp_1 = CString::new(paramname_).unwrap();
self.handle_res(unsafe { MSK_putnadouparam(self.ptr,__tmp_1.as_ptr(),parvalue_) },"put_na_dou_param")?;
return Result::Ok(());
} // putnadouparam
/// Sets an integer parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putnaintparam>
#[allow(unused_parens)]
pub fn put_na_int_param(&mut self,paramname_ : &str,parvalue_ : i32) -> Result<(),String> {
let __tmp_1 = CString::new(paramname_).unwrap();
self.handle_res(unsafe { MSK_putnaintparam(self.ptr,__tmp_1.as_ptr(),parvalue_) },"put_na_int_param")?;
return Result::Ok(());
} // putnaintparam
/// Sets a string parameter.
///
/// # Arguments
///
/// - `paramname_` Name of a parameter.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putnastrparam>
#[allow(unused_parens)]
pub fn put_na_str_param(&mut self,paramname_ : &str,parvalue_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(paramname_).unwrap();
let __tmp_3 = CString::new(parvalue_).unwrap();
self.handle_res(unsafe { MSK_putnastrparam(self.ptr,__tmp_1.as_ptr(),__tmp_3.as_ptr()) },"put_na_str_param")?;
return Result::Ok(());
} // putnastrparam
/// Assigns a new name to the objective.
///
/// # Arguments
///
/// - `objname_` Name of the objective.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putobjname>
#[allow(unused_parens)]
pub fn put_obj_name(&mut self,objname_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(objname_).unwrap();
self.handle_res(unsafe { MSK_putobjname(self.ptr,__tmp_1.as_ptr()) },"put_obj_name")?;
return Result::Ok(());
} // putobjname
/// Sets the objective sense.
///
/// # Arguments
///
/// - `sense_` The objective sense of the task
///
/// See [Objsense]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putobjsense>
#[allow(unused_parens)]
pub fn put_obj_sense(&mut self,sense_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_putobjsense(self.ptr,sense_) },"put_obj_sense")?;
return Result::Ok(());
} // putobjsense
/// Specify an OptServer for remote calls.
///
/// # Arguments
///
/// - `host_` A URL specifying the optimization server to be used.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putoptserverhost>
#[allow(unused_parens)]
pub fn put_optserver_host(&mut self,host_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(host_).unwrap();
self.handle_res(unsafe { MSK_putoptserverhost(self.ptr,__tmp_1.as_ptr()) },"put_optserver_host")?;
return Result::Ok(());
} // putoptserverhost
/// Modifies the value of parameter.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putparam>
#[allow(unused_parens)]
pub fn put_param(&mut self,parname_ : &str,parvalue_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(parname_).unwrap();
let __tmp_3 = CString::new(parvalue_).unwrap();
self.handle_res(unsafe { MSK_putparam(self.ptr,__tmp_1.as_ptr(),__tmp_3.as_ptr()) },"put_param")?;
return Result::Ok(());
} // putparam
/// Replaces all quadratic terms in constraints.
///
/// # Arguments
///
/// - `qcsubk_` Constraint subscripts for quadratic coefficients.
/// - `qcsubi_` Row subscripts for quadratic constraint matrix.
/// - `qcsubj_` Column subscripts for quadratic constraint matrix.
/// - `qcval_` Quadratic constraint coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putqcon>
#[allow(unused_parens)]
pub fn put_q_con(&mut self,qcsubk_ : &[i32],qcsubi_ : &[i32],qcsubj_ : &[i32],qcval_ : &[f64]) -> Result<(),String> {
let numqcnz_ : i32 = std::cmp::min(std::cmp::min(qcsubi_.len(),qcval_.len()),qcsubj_.len()) as i32;
self.handle_res(unsafe { MSK_putqcon(self.ptr,numqcnz_,qcsubk_.as_ptr(),qcsubi_.as_ptr(),qcsubj_.as_ptr(),qcval_.as_ptr()) },"put_q_con")?;
return Result::Ok(());
} // putqcon
/// Replaces all quadratic terms in a single constraint.
///
/// # Arguments
///
/// - `k_` The constraint in which the new quadratic elements are inserted.
/// - `qcsubi_` Row subscripts for quadratic constraint matrix.
/// - `qcsubj_` Column subscripts for quadratic constraint matrix.
/// - `qcval_` Quadratic constraint coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putqconk>
#[allow(unused_parens)]
pub fn put_q_con_k(&mut self,k_ : i32,qcsubi_ : &[i32],qcsubj_ : &[i32],qcval_ : &[f64]) -> Result<(),String> {
let numqcnz_ : i32 = std::cmp::min(std::cmp::min(qcsubi_.len(),qcval_.len()),qcsubj_.len()) as i32;
if qcsubi_.len() != qcsubj_.len() || qcsubi_.len() != qcval_.len() { return Err("put_q_con_k: Mismatching lengths if qcsubi, qcsubj and qcval".to_string()); }
self.handle_res(unsafe { MSK_putqconk(self.ptr,k_,numqcnz_,qcsubi_.as_ptr(),qcsubj_.as_ptr(),qcval_.as_ptr()) },"put_q_con_k")?;
return Result::Ok(());
} // putqconk
/// Replaces all quadratic terms in the objective.
///
/// # Arguments
///
/// - `qosubi_` Row subscripts for quadratic objective coefficients.
/// - `qosubj_` Column subscripts for quadratic objective coefficients.
/// - `qoval_` Quadratic objective coefficient values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putqobj>
#[allow(unused_parens)]
pub fn put_q_obj(&mut self,qosubi_ : &[i32],qosubj_ : &[i32],qoval_ : &[f64]) -> Result<(),String> {
let numqonz_ : i32 = std::cmp::min(std::cmp::min(qosubj_.len(),qosubi_.len()),qoval_.len()) as i32;
if qosubi_.len() != qosubj_.len() || qosubi_.len() != qoval_.len() { return Err("put_q_obj: Mismatching lengths if qosubi, qosubj and qoval".to_string()); }
self.handle_res(unsafe { MSK_putqobj(self.ptr,numqonz_,qosubi_.as_ptr(),qosubj_.as_ptr(),qoval_.as_ptr()) },"put_q_obj")?;
return Result::Ok(());
} // putqobj
/// Replaces one coefficient in the quadratic term in the objective.
///
/// # Arguments
///
/// - `i_` Row index for the coefficient to be replaced.
/// - `j_` Column index for the coefficient to be replaced.
/// - `qoij_` The new coefficient value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putqobjij>
#[allow(unused_parens)]
pub fn put_q_obj_i_j(&mut self,i_ : i32,j_ : i32,qoij_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putqobjij(self.ptr,i_,j_,qoij_) },"put_q_obj_i_j")?;
return Result::Ok(());
} // putqobjij
/// Sets the status keys for the constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putskc>
#[allow(unused_parens)]
pub fn put_skc(&mut self,whichsol_ : i32,skc_ : &[i32]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if skc_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_skc: Argument 'skc' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putskc(self.ptr,whichsol_,skc_.as_ptr()) },"put_skc")?;
return Result::Ok(());
} // putskc
/// Sets the status keys for a slice of the constraints.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putskcslice>
#[allow(unused_parens)]
pub fn put_skc_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,skc_ : &[i32]) -> Result<(),String> {
if skc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_skc_slice: Argument 'skc' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putskcslice(self.ptr,whichsol_,first_,last_,skc_.as_ptr()) },"put_skc_slice")?;
return Result::Ok(());
} // putskcslice
/// Sets the status keys for the scalar variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putskx>
#[allow(unused_parens)]
pub fn put_skx(&mut self,whichsol_ : i32,skx_ : &[i32]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if skx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_skx: Argument 'skx' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putskx(self.ptr,whichsol_,skx_.as_ptr()) },"put_skx")?;
return Result::Ok(());
} // putskx
/// Sets the status keys for a slice of the variables.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putskxslice>
#[allow(unused_parens)]
pub fn put_skx_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,skx_ : &[i32]) -> Result<(),String> {
if skx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_skx_slice: Argument 'skx' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putskxslice(self.ptr,whichsol_,first_,last_,skx_.as_ptr()) },"put_skx_slice")?;
return Result::Ok(());
} // putskxslice
/// Sets the slc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putslc>
#[allow(unused_parens)]
pub fn put_slc(&mut self,whichsol_ : i32,slc_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if slc_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_slc: Argument 'slc' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putslc(self.ptr,whichsol_,slc_.as_ptr()) },"put_slc")?;
return Result::Ok(());
} // putslc
/// Sets a slice of the slc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putslcslice>
#[allow(unused_parens)]
pub fn put_slc_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,slc_ : &[f64]) -> Result<(),String> {
if slc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_slc_slice: Argument 'slc' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putslcslice(self.ptr,whichsol_,first_,last_,slc_.as_ptr()) },"put_slc_slice")?;
return Result::Ok(());
} // putslcslice
/// Sets the slx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putslx>
#[allow(unused_parens)]
pub fn put_slx(&mut self,whichsol_ : i32,slx_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if slx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_slx: Argument 'slx' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putslx(self.ptr,whichsol_,slx_.as_ptr()) },"put_slx")?;
return Result::Ok(());
} // putslx
/// Sets a slice of the slx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putslxslice>
#[allow(unused_parens)]
pub fn put_slx_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,slx_ : &[f64]) -> Result<(),String> {
if slx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_slx_slice: Argument 'slx' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putslxslice(self.ptr,whichsol_,first_,last_,slx_.as_ptr()) },"put_slx_slice")?;
return Result::Ok(());
} // putslxslice
/// Sets the snx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsnx>
#[allow(unused_parens)]
pub fn put_snx(&mut self,whichsol_ : i32,sux_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if sux_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_snx: Argument 'sux' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putsnx(self.ptr,whichsol_,sux_.as_ptr()) },"put_snx")?;
return Result::Ok(());
} // putsnx
/// Sets a slice of the snx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsnxslice>
#[allow(unused_parens)]
pub fn put_snx_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,snx_ : &[f64]) -> Result<(),String> {
if snx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_snx_slice: Argument 'snx' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putsnxslice(self.ptr,whichsol_,first_,last_,snx_.as_ptr()) },"put_snx_slice")?;
return Result::Ok(());
} // putsnxslice
/// Inserts a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
/// - `xc_` Primal constraint solution.
/// - `xx_` Primal variable solution.
/// - `y_` Vector of dual variables corresponding to the constraints.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsolution>
#[allow(unused_parens)]
pub fn put_solution(&mut self,whichsol_ : i32,skc_ : &[i32],skx_ : &[i32],skn_ : &[i32],xc_ : &[f64],xx_ : &[f64],y_ : &[f64],slc_ : &[f64],suc_ : &[f64],slx_ : &[f64],sux_ : &[f64],snx_ : &[f64]) -> Result<(),String> {
self.handle_res(unsafe { MSK_putsolution(self.ptr,whichsol_,skc_.as_ptr(),skx_.as_ptr(),skn_.as_ptr(),if xc_.len() == 0 { std::ptr::null() } else { xc_.as_ptr() },if xx_.len() == 0 { std::ptr::null() } else { xx_.as_ptr() },if y_.len() == 0 { std::ptr::null() } else { y_.as_ptr() },if slc_.len() == 0 { std::ptr::null() } else { slc_.as_ptr() },if suc_.len() == 0 { std::ptr::null() } else { suc_.as_ptr() },if slx_.len() == 0 { std::ptr::null() } else { slx_.as_ptr() },if sux_.len() == 0 { std::ptr::null() } else { sux_.as_ptr() },if snx_.len() == 0 { std::ptr::null() } else { snx_.as_ptr() }) },"put_solution")?;
return Result::Ok(());
} // putsolution
/// Inserts a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `skc_` Status keys for the constraints.
///
/// See [Stakey]
/// - `skx_` Status keys for the variables.
///
/// See [Stakey]
/// - `skn_` Status keys for the conic constraints.
///
/// See [Stakey]
/// - `xc_` Primal constraint solution.
/// - `xx_` Primal variable solution.
/// - `y_` Vector of dual variables corresponding to the constraints.
/// - `slc_` Dual variables corresponding to the lower bounds on the constraints.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
/// - `slx_` Dual variables corresponding to the lower bounds on the variables.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
/// - `snx_` Dual variables corresponding to the conic constraints on the variables.
/// - `doty_` Dual variables corresponding to affine conic constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsolutionnew>
#[allow(unused_parens)]
pub fn put_solution_new(&mut self,whichsol_ : i32,skc_ : &[i32],skx_ : &[i32],skn_ : &[i32],xc_ : &[f64],xx_ : &[f64],y_ : &[f64],slc_ : &[f64],suc_ : &[f64],slx_ : &[f64],sux_ : &[f64],snx_ : &[f64],doty_ : &[f64]) -> Result<(),String> {
self.handle_res(unsafe { MSK_putsolutionnew(self.ptr,whichsol_,skc_.as_ptr(),skx_.as_ptr(),skn_.as_ptr(),if xc_.len() == 0 { std::ptr::null() } else { xc_.as_ptr() },if xx_.len() == 0 { std::ptr::null() } else { xx_.as_ptr() },if y_.len() == 0 { std::ptr::null() } else { y_.as_ptr() },if slc_.len() == 0 { std::ptr::null() } else { slc_.as_ptr() },if suc_.len() == 0 { std::ptr::null() } else { suc_.as_ptr() },if slx_.len() == 0 { std::ptr::null() } else { slx_.as_ptr() },if sux_.len() == 0 { std::ptr::null() } else { sux_.as_ptr() },if snx_.len() == 0 { std::ptr::null() } else { snx_.as_ptr() },if doty_.len() == 0 { std::ptr::null() } else { doty_.as_ptr() }) },"put_solution_new")?;
return Result::Ok(());
} // putsolutionnew
/// Inputs the dual variable of a solution.
///
/// # Arguments
///
/// - `i_` Index of the dual variable.
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `y_` Solution value of the dual variable.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsolutionyi>
#[allow(unused_parens)]
pub fn put_solution_y_i(&mut self,i_ : i32,whichsol_ : i32,y_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putsolutionyi(self.ptr,i_,whichsol_,y_) },"put_solution_y_i")?;
return Result::Ok(());
} // putsolutionyi
/// Sets a string parameter.
///
/// # Arguments
///
/// - `param_` Which parameter.
///
/// See [Sparam]
/// - `parvalue_` Parameter value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putstrparam>
#[allow(unused_parens)]
pub fn put_str_param(&mut self,param_ : i32,parvalue_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(parvalue_).unwrap();
self.handle_res(unsafe { MSK_putstrparam(self.ptr,param_,__tmp_1.as_ptr()) },"put_str_param")?;
return Result::Ok(());
} // putstrparam
/// Sets the suc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsuc>
#[allow(unused_parens)]
pub fn put_suc(&mut self,whichsol_ : i32,suc_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if suc_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_suc: Argument 'suc' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putsuc(self.ptr,whichsol_,suc_.as_ptr()) },"put_suc")?;
return Result::Ok(());
} // putsuc
/// Sets a slice of the suc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `suc_` Dual variables corresponding to the upper bounds on the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsucslice>
#[allow(unused_parens)]
pub fn put_suc_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,suc_ : &[f64]) -> Result<(),String> {
if suc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_suc_slice: Argument 'suc' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putsucslice(self.ptr,whichsol_,first_,last_,suc_.as_ptr()) },"put_suc_slice")?;
return Result::Ok(());
} // putsucslice
/// Sets the sux vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsux>
#[allow(unused_parens)]
pub fn put_sux(&mut self,whichsol_ : i32,sux_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if sux_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_sux: Argument 'sux' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putsux(self.ptr,whichsol_,sux_.as_ptr()) },"put_sux")?;
return Result::Ok(());
} // putsux
/// Sets a slice of the sux vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `sux_` Dual variables corresponding to the upper bounds on the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putsuxslice>
#[allow(unused_parens)]
pub fn put_sux_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,sux_ : &[f64]) -> Result<(),String> {
if sux_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_sux_slice: Argument 'sux' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putsuxslice(self.ptr,whichsol_,first_,last_,sux_.as_ptr()) },"put_sux_slice")?;
return Result::Ok(());
} // putsuxslice
/// Assigns a new name to the task.
///
/// # Arguments
///
/// - `taskname_` Name assigned to the task.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.puttaskname>
#[allow(unused_parens)]
pub fn put_task_name(&mut self,taskname_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(taskname_).unwrap();
self.handle_res(unsafe { MSK_puttaskname(self.ptr,__tmp_1.as_ptr()) },"put_task_name")?;
return Result::Ok(());
} // puttaskname
/// Changes the bounds for one variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `bkx_` New bound key.
///
/// See [Boundkey]
/// - `blx_` New lower bound.
/// - `bux_` New upper bound.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarbound>
#[allow(unused_parens)]
pub fn put_var_bound(&mut self,j_ : i32,bkx_ : i32,blx_ : f64,bux_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putvarbound(self.ptr,j_,bkx_,blx_,bux_) },"put_var_bound")?;
return Result::Ok(());
} // putvarbound
/// Changes the bounds of a list of variables.
///
/// # Arguments
///
/// - `sub_` List of variable indexes.
/// - `bkx_` Bound keys for the variables.
///
/// See [Boundkey]
/// - `blx_` Lower bounds for the variables.
/// - `bux_` Upper bounds for the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarboundlist>
#[allow(unused_parens)]
pub fn put_var_bound_list(&mut self,sub_ : &[i32],bkx_ : &[i32],blx_ : &[f64],bux_ : &[f64]) -> Result<(),String> {
let num_ : i32 = std::cmp::min(std::cmp::min(std::cmp::min(sub_.len(),bkx_.len()),bux_.len()),blx_.len()) as i32;
self.handle_res(unsafe { MSK_putvarboundlist(self.ptr,num_,sub_.as_ptr(),bkx_.as_ptr(),blx_.as_ptr(),bux_.as_ptr()) },"put_var_bound_list")?;
return Result::Ok(());
} // putvarboundlist
/// Changes the bounds of a list of variables.
///
/// # Arguments
///
/// - `sub_` List of variable indexes.
/// - `bkx_` New bound key for all variables in the list.
///
/// See [Boundkey]
/// - `blx_` New lower bound for all variables in the list.
/// - `bux_` New upper bound for all variables in the list.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarboundlistconst>
#[allow(unused_parens)]
pub fn put_var_bound_list_const(&mut self,sub_ : &[i32],bkx_ : i32,blx_ : f64,bux_ : f64) -> Result<(),String> {
let num_ : i32 = sub_.len() as i32;
self.handle_res(unsafe { MSK_putvarboundlistconst(self.ptr,num_,sub_.as_ptr(),bkx_,blx_,bux_) },"put_var_bound_list_const")?;
return Result::Ok(());
} // putvarboundlistconst
/// Changes the bounds for a slice of the variables.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bkx_` Bound keys for the variables.
///
/// See [Boundkey]
/// - `blx_` Lower bounds for the variables.
/// - `bux_` Upper bounds for the variables.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarboundslice>
#[allow(unused_parens)]
pub fn put_var_bound_slice(&mut self,first_ : i32,last_ : i32,bkx_ : &[i32],blx_ : &[f64],bux_ : &[f64]) -> Result<(),String> {
if bkx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_var_bound_slice: Argument 'bkx' has the wrong length, expected (last_-first_)".to_string());
}
if blx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_var_bound_slice: Argument 'blx' has the wrong length, expected (last_-first_)".to_string());
}
if bux_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_var_bound_slice: Argument 'bux' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putvarboundslice(self.ptr,first_,last_,bkx_.as_ptr(),blx_.as_ptr(),bux_.as_ptr()) },"put_var_bound_slice")?;
return Result::Ok(());
} // putvarboundslice
/// Changes the bounds for a slice of the variables.
///
/// # Arguments
///
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `bkx_` New bound key for all variables in the slice.
///
/// See [Boundkey]
/// - `blx_` New lower bound for all variables in the slice.
/// - `bux_` New upper bound for all variables in the slice.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarboundsliceconst>
#[allow(unused_parens)]
pub fn put_var_bound_slice_const(&mut self,first_ : i32,last_ : i32,bkx_ : i32,blx_ : f64,bux_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putvarboundsliceconst(self.ptr,first_,last_,bkx_,blx_,bux_) },"put_var_bound_slice_const")?;
return Result::Ok(());
} // putvarboundsliceconst
/// Sets the name of a variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `name_` The variable name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarname>
#[allow(unused_parens)]
pub fn put_var_name(&mut self,j_ : i32,name_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(name_).unwrap();
self.handle_res(unsafe { MSK_putvarname(self.ptr,j_,__tmp_1.as_ptr()) },"put_var_name")?;
return Result::Ok(());
} // putvarname
/// Sets the primal and dual solution information for a single variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `sk_` Status key of the variable.
///
/// See [Stakey]
/// - `x_` Primal solution value of the variable.
/// - `sl_` Solution value of the dual variable associated with the lower bound.
/// - `su_` Solution value of the dual variable associated with the upper bound.
/// - `sn_` Solution value of the dual variable associated with the conic constraint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvarsolutionj>
#[allow(unused_parens)]
pub fn put_var_solution_j(&mut self,j_ : i32,whichsol_ : i32,sk_ : i32,x_ : f64,sl_ : f64,su_ : f64,sn_ : f64) -> Result<(),String> {
self.handle_res(unsafe { MSK_putvarsolutionj(self.ptr,j_,whichsol_,sk_,x_,sl_,su_,sn_) },"put_var_solution_j")?;
return Result::Ok(());
} // putvarsolutionj
/// Sets the variable type of one variable.
///
/// # Arguments
///
/// - `j_` Index of the variable.
/// - `vartype_` The new variable type.
///
/// See [Variabletype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvartype>
#[allow(unused_parens)]
pub fn put_var_type(&mut self,j_ : i32,vartype_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_putvartype(self.ptr,j_,vartype_) },"put_var_type")?;
return Result::Ok(());
} // putvartype
/// Sets the variable type for one or more variables.
///
/// # Arguments
///
/// - `subj_` A list of variable indexes for which the variable type should be changed.
/// - `vartype_` A list of variable types.
///
/// See [Variabletype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putvartypelist>
#[allow(unused_parens)]
pub fn put_var_type_list(&mut self,subj_ : &[i32],vartype_ : &[i32]) -> Result<(),String> {
let num_ : i32 = std::cmp::min(vartype_.len(),subj_.len()) as i32;
self.handle_res(unsafe { MSK_putvartypelist(self.ptr,num_,subj_.as_ptr(),vartype_.as_ptr()) },"put_var_type_list")?;
return Result::Ok(());
} // putvartypelist
/// Sets the xc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `xc_` Primal constraint solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putxc>
#[allow(unused_parens)]
pub fn put_xc(&mut self,whichsol_ : i32,xc_ : &mut[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if xc_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_xc: Argument 'xc' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putxc(self.ptr,whichsol_,xc_.as_mut_ptr()) },"put_xc")?;
return Result::Ok(());
} // putxc
/// Sets a slice of the xc vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `xc_` Primal constraint solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putxcslice>
#[allow(unused_parens)]
pub fn put_xc_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,xc_ : &[f64]) -> Result<(),String> {
if xc_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_xc_slice: Argument 'xc' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putxcslice(self.ptr,whichsol_,first_,last_,xc_.as_ptr()) },"put_xc_slice")?;
return Result::Ok(());
} // putxcslice
/// Sets the xx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `xx_` Primal variable solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putxx>
#[allow(unused_parens)]
pub fn put_xx(&mut self,whichsol_ : i32,xx_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumvar(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumvar")?;
if xx_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_xx: Argument 'xx' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_putxx(self.ptr,whichsol_,xx_.as_ptr()) },"put_xx")?;
return Result::Ok(());
} // putxx
/// Sets a slice of the xx vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `xx_` Primal variable solution.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putxxslice>
#[allow(unused_parens)]
pub fn put_xx_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,xx_ : &[f64]) -> Result<(),String> {
if xx_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_xx_slice: Argument 'xx' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putxxslice(self.ptr,whichsol_,first_,last_,xx_.as_ptr()) },"put_xx_slice")?;
return Result::Ok(());
} // putxxslice
/// Sets the y vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `y_` Vector of dual variables corresponding to the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.puty>
#[allow(unused_parens)]
pub fn put_y(&mut self,whichsol_ : i32,y_ : &[f64]) -> Result<(),String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if y_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("put_y: Argument 'y' has the wrong length, expected __tmp_0".to_string());
}
self.handle_res(unsafe { MSK_puty(self.ptr,whichsol_,y_.as_ptr()) },"put_y")?;
return Result::Ok(());
} // puty
/// Sets a slice of the y vector for a solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `first_` First index in the sequence.
/// - `last_` Last index plus 1 in the sequence.
/// - `y_` Vector of dual variables corresponding to the constraints.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putyslice>
#[allow(unused_parens)]
pub fn put_y_slice(&mut self,whichsol_ : i32,first_ : i32,last_ : i32,y_ : &[f64]) -> Result<(),String> {
if y_.len() != ((last_-first_)).try_into().unwrap() {
return Result::Err("put_y_slice: Argument 'y' has the wrong length, expected (last_-first_)".to_string());
}
self.handle_res(unsafe { MSK_putyslice(self.ptr,whichsol_,first_,last_,y_.as_ptr()) },"put_y_slice")?;
return Result::Ok(());
} // putyslice
/// Read a binary dump of the task solution and information items.
///
/// # Arguments
///
/// - `filename_` A valid file name.
/// - `compress_` Data compression type.
///
/// See [Compresstype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readbsolution>
#[allow(unused_parens)]
pub fn read_b_solution(&self,filename_ : &str,compress_ : i32) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_readbsolution(self.ptr,__tmp_1.as_ptr(),compress_) },"read_b_solution")?;
return Result::Ok(());
} // readbsolution
/// Reads problem data from a file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readdataautoformat>
#[allow(unused_parens)]
pub fn read_data(&mut self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_readdataautoformat(self.ptr,__tmp_1.as_ptr()) },"read_data")?;
return Result::Ok(());
} // readdataautoformat
/// Reads problem data from a file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
/// - `format_` File data format.
///
/// See [Dataformat]
/// - `compress_` File compression type.
///
/// See [Compresstype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readdataformat>
#[allow(unused_parens)]
pub fn read_data_format(&mut self,filename_ : &str,format_ : i32,compress_ : i32) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_readdataformat(self.ptr,__tmp_1.as_ptr(),format_,compress_) },"read_data_format")?;
return Result::Ok(());
} // readdataformat
/// Reads a solution from a JSOL file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readjsonsol>
#[allow(unused_parens)]
pub fn read_json_sol(&mut self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_readjsonsol(self.ptr,__tmp_1.as_ptr()) },"read_json_sol")?;
return Result::Ok(());
} // readjsonsol
/// Load task data from a string in JSON format.
///
/// # Arguments
///
/// - `data_` Problem data in text format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readjsonstring>
#[allow(unused_parens)]
pub fn read_json_string(&mut self,data_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(data_).unwrap();
self.handle_res(unsafe { MSK_readjsonstring(self.ptr,__tmp_1.as_ptr()) },"read_json_string")?;
return Result::Ok(());
} // readjsonstring
/// Load task data from a string in LP format.
///
/// # Arguments
///
/// - `data_` Problem data in text format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readlpstring>
#[allow(unused_parens)]
pub fn read_lp_string(&mut self,data_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(data_).unwrap();
self.handle_res(unsafe { MSK_readlpstring(self.ptr,__tmp_1.as_ptr()) },"read_lp_string")?;
return Result::Ok(());
} // readlpstring
/// Load task data from a string in OPF format.
///
/// # Arguments
///
/// - `data_` Problem data in text format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readopfstring>
#[allow(unused_parens)]
pub fn read_opf_string(&mut self,data_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(data_).unwrap();
self.handle_res(unsafe { MSK_readopfstring(self.ptr,__tmp_1.as_ptr()) },"read_opf_string")?;
return Result::Ok(());
} // readopfstring
/// Reads a parameter file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readparamfile>
#[allow(unused_parens)]
pub fn read_param_file(&mut self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_readparamfile(self.ptr,__tmp_1.as_ptr()) },"read_param_file")?;
return Result::Ok(());
} // readparamfile
/// Load task data from a string in PTF format.
///
/// # Arguments
///
/// - `data_` Problem data in text format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readptfstring>
#[allow(unused_parens)]
pub fn read_ptf_string(&mut self,data_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(data_).unwrap();
self.handle_res(unsafe { MSK_readptfstring(self.ptr,__tmp_1.as_ptr()) },"read_ptf_string")?;
return Result::Ok(());
} // readptfstring
/// Reads a solution from a file.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readsolution>
#[allow(unused_parens)]
pub fn read_solution(&mut self,whichsol_ : i32,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_readsolution(self.ptr,whichsol_,__tmp_1.as_ptr()) },"read_solution")?;
return Result::Ok(());
} // readsolution
/// Read solution file in format determined by the filename
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readsolutionfile>
#[allow(unused_parens)]
pub fn read_solution_file(&self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_readsolutionfile(self.ptr,__tmp_1.as_ptr()) },"read_solution_file")?;
return Result::Ok(());
} // readsolutionfile
/// Prints information about last file read.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readsummary>
#[allow(unused_parens)]
pub fn read_summary(&mut self,whichstream_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_readsummary(self.ptr,whichstream_) },"read_summary")?;
return Result::Ok(());
} // readsummary
/// Load task data from a file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.readtask>
#[allow(unused_parens)]
pub fn read_task(&mut self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_readtask(self.ptr,__tmp_1.as_ptr()) },"read_task")?;
return Result::Ok(());
} // readtask
/// Removes a number of symmetric matrices.
///
/// # Arguments
///
/// - `subset_` Indexes of symmetric matrices which should be removed.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.removebarvars>
#[allow(unused_parens)]
pub fn remove_barvars(&mut self,subset_ : &[i32]) -> Result<(),String> {
let num_ : i32 = subset_.len() as i32;
self.handle_res(unsafe { MSK_removebarvars(self.ptr,num_,subset_.as_ptr()) },"remove_barvars")?;
return Result::Ok(());
} // removebarvars
/// Removes a number of conic constraints from the problem.
///
/// # Arguments
///
/// - `subset_` Indexes of cones which should be removed.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.removecones>
#[allow(unused_parens)]
pub fn remove_cones(&mut self,subset_ : &[i32]) -> Result<(),String> {
let num_ : i32 = subset_.len() as i32;
self.handle_res(unsafe { MSK_removecones(self.ptr,num_,subset_.as_ptr()) },"remove_cones")?;
return Result::Ok(());
} // removecones
/// Removes a number of constraints.
///
/// # Arguments
///
/// - `subset_` Indexes of constraints which should be removed.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.removecons>
#[allow(unused_parens)]
pub fn remove_cons(&mut self,subset_ : &[i32]) -> Result<(),String> {
let num_ : i32 = subset_.len() as i32;
self.handle_res(unsafe { MSK_removecons(self.ptr,num_,subset_.as_ptr()) },"remove_cons")?;
return Result::Ok(());
} // removecons
/// Removes a number of variables.
///
/// # Arguments
///
/// - `subset_` Indexes of variables which should be removed.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.removevars>
#[allow(unused_parens)]
pub fn remove_vars(&mut self,subset_ : &[i32]) -> Result<(),String> {
let num_ : i32 = subset_.len() as i32;
self.handle_res(unsafe { MSK_removevars(self.ptr,num_,subset_.as_ptr()) },"remove_vars")?;
return Result::Ok(());
} // removevars
/// Resizes an optimization task.
///
/// # Arguments
///
/// - `maxnumcon_` New maximum number of constraints.
/// - `maxnumvar_` New maximum number of variables.
/// - `maxnumcone_` New maximum number of cones.
/// - `maxnumanz_` New maximum number of linear non-zero elements.
/// - `maxnumqnz_` New maximum number of quadratic non-zeros elements.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.resizetask>
#[allow(unused_parens)]
pub fn resize_task(&mut self,maxnumcon_ : i32,maxnumvar_ : i32,maxnumcone_ : i32,maxnumanz_ : i64,maxnumqnz_ : i64) -> Result<(),String> {
self.handle_res(unsafe { MSK_resizetask(self.ptr,maxnumcon_,maxnumvar_,maxnumcone_,maxnumanz_,maxnumqnz_) },"resize_task")?;
return Result::Ok(());
} // resizetask
/// Creates a sensitivity report.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.sensitivityreport>
#[allow(unused_parens)]
pub fn sensitivity_report(&self,whichstream_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_sensitivityreport(self.ptr,whichstream_) },"sensitivity_report")?;
return Result::Ok(());
} // sensitivityreport
/// Resets all parameter values.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.setdefaults>
#[allow(unused_parens)]
pub fn set_defaults(&mut self) -> Result<(),String> {
self.handle_res(unsafe { MSK_setdefaults(self.ptr) },"set_defaults")?;
return Result::Ok(());
} // setdefaults
/// Checks whether a solution is defined.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// # Returns
///
/// - `isdef` Is non-zero if the requested solution is defined.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.solutiondef>
#[allow(unused_parens)]
pub fn solution_def(&self,whichsol_ : i32) -> Result<bool,String> {
let mut __tmp_0 : i32 = 0;
self.handle_res(unsafe { MSK_solutiondef(self.ptr,whichsol_,&mut __tmp_0) },"solution_def")?;
return Result::Ok(__tmp_0 != 0);
} // solutiondef
/// Prints a short summary of the current solutions.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.solutionsummary>
#[allow(unused_parens)]
pub fn solution_summary(&self,whichstream_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_solutionsummary(self.ptr,whichstream_) },"solution_summary")?;
return Result::Ok(());
} // solutionsummary
/// Solve a linear equation system involving a basis matrix.
///
/// # Arguments
///
/// - `transp_` Controls which problem formulation is solved.
/// - `numnz_` Input (number of non-zeros in right-hand side).
/// - `sub_` Input (indexes of non-zeros in right-hand side) and output (indexes of non-zeros in solution vector).
/// - `val_` Input (right-hand side values) and output (solution vector values).
///
/// # Returns
///
/// - `numnzout` Output (number of non-zeros in solution vector).
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.solvewithbasis>
#[allow(unused_parens)]
pub fn solve_with_basis(&mut self,transp_ : bool,numnz_ : i32,sub_ : &mut[i32],val_ : &mut[f64]) -> Result<i32,String> {
let mut __tmp_0 : i32 = i32::default();
let __tmp_1 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_0) };let _ = self.handle_res(__tmp_1,"getnumcon")?;
if sub_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("solve_with_basis: Argument 'sub' has the wrong length, expected __tmp_0".to_string());
}
let mut __tmp_2 : i32 = i32::default();
let __tmp_3 = unsafe { MSK_getnumcon(self.ptr,&mut __tmp_2) };let _ = self.handle_res(__tmp_3,"getnumcon")?;
if val_.len() != (__tmp_2).try_into().unwrap() {
return Result::Err("solve_with_basis: Argument 'val' has the wrong length, expected __tmp_2".to_string());
}
let mut __tmp_4 : i32 = i32::default();
self.handle_res(unsafe { MSK_solvewithbasis(self.ptr,transp_,numnz_,sub_.as_mut_ptr(),val_.as_mut_ptr(),&mut __tmp_4) },"solve_with_basis")?;
return Result::Ok(__tmp_4);
} // solvewithbasis
/// Obtains a cone type code.
///
/// # Arguments
///
/// - `str_` String corresponding to the cone type code.
/// - `conetype_` The cone type corresponding to str.
///
/// See [Conetype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.strtoconetype>
#[allow(unused_parens)]
pub fn str_to_cone_type(&self,str_ : &str,conetype_ : & mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(str_).unwrap();
self.handle_res(unsafe { MSK_strtoconetype(self.ptr,__tmp_1.as_ptr(),conetype_) },"str_to_cone_type")?;
return Result::Ok(());
} // strtoconetype
/// Obtains a status key.
///
/// # Arguments
///
/// - `str_` A status key abbreviation string.
/// - `sk_` Status key corresponding to the string.
///
/// See [Stakey]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.strtosk>
#[allow(unused_parens)]
pub fn str_to_sk(&self,str_ : &str,sk_ : & mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(str_).unwrap();
self.handle_res(unsafe { MSK_strtosk(self.ptr,__tmp_1.as_ptr(),sk_) },"str_to_sk")?;
return Result::Ok(());
} // strtosk
/// In-place reformulation of a QCQO to a conic quadratic problem.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.toconic>
#[allow(unused_parens)]
pub fn toconic(&mut self) -> Result<(),String> {
self.handle_res(unsafe { MSK_toconic(self.ptr) },"toconic")?;
return Result::Ok(());
} // toconic
/// Disconnects a user-defined function from a task stream.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.unlinkfuncfromtaskstream>
#[allow(unused_parens)]
pub fn unlink_func_from_stream(&mut self,whichstream_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_unlinkfuncfromtaskstream(self.ptr,whichstream_) },"unlink_func_from_stream")?;
return Result::Ok(());
} // unlinkfuncfromtaskstream
/// Update the information items related to the solution.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.updatesolutioninfo>
#[allow(unused_parens)]
pub fn update_solution_info(&mut self,whichsol_ : i32) -> Result<(),String> {
self.handle_res(unsafe { MSK_updatesolutioninfo(self.ptr,whichsol_) },"update_solution_info")?;
return Result::Ok(());
} // updatesolutioninfo
/// Checks a parameter name.
///
/// # Arguments
///
/// - `parname_` Parameter name.
/// - `partype_` Parameter type.
///
/// See [Parametertype]
/// - `param_` Which parameter.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.whichparam>
#[allow(unused_parens)]
pub fn which_param(&self,parname_ : &str,partype_ : & mut i32,param_ : &mut i32) -> Result<(),String> {
let __tmp_1 = CString::new(parname_).unwrap();
self.handle_res(unsafe { MSK_whichparam(self.ptr,__tmp_1.as_ptr(),partype_,param_) },"which_param")?;
return Result::Ok(());
} // whichparam
/// Write a binary dump of the task solution and information items.
///
/// # Arguments
///
/// - `filename_` A valid file name.
/// - `compress_` Data compression type.
///
/// See [Compresstype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writebsolution>
#[allow(unused_parens)]
pub fn write_b_solution(&self,filename_ : &str,compress_ : i32) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_writebsolution(self.ptr,__tmp_1.as_ptr(),compress_) },"write_b_solution")?;
return Result::Ok(());
} // writebsolution
/// Writes problem data to a file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writedata>
#[allow(unused_parens)]
pub fn write_data(&self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_writedata(self.ptr,__tmp_1.as_ptr()) },"write_data")?;
return Result::Ok(());
} // writedata
/// Writes a solution to a JSON file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writejsonsol>
#[allow(unused_parens)]
pub fn write_json_sol(&self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_writejsonsol(self.ptr,__tmp_1.as_ptr()) },"write_json_sol")?;
return Result::Ok(());
} // writejsonsol
/// Writes all the parameters to a parameter file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writeparamfile>
#[allow(unused_parens)]
pub fn write_param_file(&self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_writeparamfile(self.ptr,__tmp_1.as_ptr()) },"write_param_file")?;
return Result::Ok(());
} // writeparamfile
/// Write a solution to a file.
///
/// # Arguments
///
/// - `whichsol_` Selects a solution.
///
/// See [Soltype]
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writesolution>
#[allow(unused_parens)]
pub fn write_solution(&self,whichsol_ : i32,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_writesolution(self.ptr,whichsol_,__tmp_1.as_ptr()) },"write_solution")?;
return Result::Ok(());
} // writesolution
/// Write solution file in format determined by the filename
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writesolutionfile>
#[allow(unused_parens)]
pub fn write_solution_file(&self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_writesolutionfile(self.ptr,__tmp_1.as_ptr()) },"write_solution_file")?;
return Result::Ok(());
} // writesolutionfile
/// Appends a record to the statistics file.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writestat>
#[allow(unused_parens)]
pub fn write_stat(&mut self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_writestat(self.ptr,__tmp_1.as_ptr()) },"write_stat")?;
return Result::Ok(());
} // writestat
/// Write a complete binary dump of the task data.
///
/// # Arguments
///
/// - `filename_` A valid file name.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writetask>
#[allow(unused_parens)]
pub fn write_task(&self,filename_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_writetask(self.ptr,__tmp_1.as_ptr()) },"write_task")?;
return Result::Ok(());
} // writetask
/// Internal
///
/// # Arguments
///
/// - `filename_` A valid file name.
/// - `compress_` Data compression type.
///
/// See [Compresstype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.writetasksolverresult_file>
#[allow(unused_parens)]
pub fn write_task_solver_result_file(&self,filename_ : &str,compress_ : i32) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
self.handle_res(unsafe { MSK_writetasksolverresult_file(self.ptr,__tmp_1.as_ptr(),compress_) },"write_task_solver_result_file")?;
return Result::Ok(());
} // writetasksolverresult_file
}
impl Drop for Env
{
fn drop( & mut self)
{
let mut env = self.ptr;
unsafe { MSK_deleteenv(& mut env); };
}
}
impl Drop for Task
{
fn drop( & mut self)
{
let mut task = self.ptr;
unsafe { MSK_deletetask(& mut task) };
}
}
/// Computes vector addition and multiplication by a scalar.
///
/// # Arguments
///
/// - `n_` Length of the vectors.
/// - `alpha_` The scalar that multiplies x.
/// - `x_` The x vector.
/// - `y_` The y vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.axpy>
#[allow(unused_parens)]
pub fn axpy(n_ : i32,alpha_ : f64,x_ : &[f64],y_ : &mut[f64]) -> Result<(),String> {
if x_.len() != (n_).try_into().unwrap() {
return Result::Err("axpy: Argument 'x' has the wrong length, expected n_".to_string());
}
if y_.len() != (n_).try_into().unwrap() {
return Result::Err("axpy: Argument 'y' has the wrong length, expected n_".to_string());
}
handle_res_static(unsafe { MSK_axpy(std::ptr::null(),n_,alpha_,x_.as_ptr(),y_.as_mut_ptr()) },"axpy")?;
return Result::Ok(());
} // axpy
/// Check in all unused license features to the license token server.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkinall>
#[allow(unused_parens)]
pub fn check_in_all() -> Result<(),String> {
handle_res_static(unsafe { MSK_checkinall(std::ptr::null()) },"check_in_all")?;
return Result::Ok(());
} // checkinall
/// Check in a license feature back to the license server ahead of time.
///
/// # Arguments
///
/// - `feature_` Feature to check in to the license system.
///
/// See [Feature]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkinlicense>
#[allow(unused_parens)]
pub fn check_in_license(feature_ : i32) -> Result<(),String> {
handle_res_static(unsafe { MSK_checkinlicense(std::ptr::null(),feature_) },"check_in_license")?;
return Result::Ok(());
} // checkinlicense
/// Check out a license feature from the license server ahead of time.
///
/// # Arguments
///
/// - `feature_` Feature to check out from the license system.
///
/// See [Feature]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkoutlicense>
#[allow(unused_parens)]
pub fn check_out_license(feature_ : i32) -> Result<(),String> {
handle_res_static(unsafe { MSK_checkoutlicense(std::ptr::null(),feature_) },"check_out_license")?;
return Result::Ok(());
} // checkoutlicense
/// Compares a version of the MOSEK DLL with a specified version.
///
/// # Arguments
///
/// - `major_` Major version number.
/// - `minor_` Minor version number.
/// - `revision_` Revision number.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.checkversion>
#[allow(unused_parens)]
pub fn check_version(major_ : i32,minor_ : i32,revision_ : i32) -> Result<(),String> {
handle_res_static(unsafe { MSK_checkversion(std::ptr::null(),major_,minor_,revision_) },"check_version")?;
return Result::Ok(());
} // checkversion
/// Computes a Cholesky factorization of sparse matrix.
///
/// # Arguments
///
/// - `numthreads_` The number threads that can be used to do the computation. 0 means the code makes the choice.
/// - `ordermethod_` If nonzero, then a sparsity preserving ordering will be employed.
/// - `tolsingular_` A positive parameter controlling when a pivot is declared zero.
/// - `anzc_` anzc\[j\] is the number of nonzeros in the jth column of A.
/// - `aptrc_` aptrc\[j\] is a pointer to the first element in column j.
/// - `asubc_` Row indexes for each column stored in increasing order.
/// - `avalc_` The value corresponding to row indexed stored in asubc.
/// - `perm_` Permutation array used to specify the permutation matrix P computed by the function.
/// - `diag_` The diagonal elements of matrix D.
/// - `lnzc_` lnzc\[j\] is the number of non zero elements in column j.
/// - `lptrc_` lptrc\[j\] is a pointer to the first row index and value in column j.
/// - `lensubnval_` Number of elements in lsubc and lvalc.
/// - `lsubc_` Row indexes for each column stored in increasing order.
/// - `lvalc_` The values corresponding to row indexed stored in lsubc.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.computesparsecholesky>
#[allow(unused_parens)]
pub fn compute_sparse_cholesky(numthreads_ : i32,ordermethod_ : i32,tolsingular_ : f64,anzc_ : &[i32],aptrc_ : &[i64],asubc_ : &[i32],avalc_ : &[f64],perm_ : &mut Vec<i32>,diag_ : &mut Vec<f64>,lnzc_ : &mut Vec<i32>,lptrc_ : &mut Vec<i64>,lensubnval_ : &mut i64,lsubc_ : &mut Vec<i32>,lvalc_ : &mut Vec<f64>) -> Result<(),String> {
let n_ : i32 = std::cmp::min(anzc_.len(),aptrc_.len()) as i32;
let mut __tmp_0 : * const i32 = std::ptr::null();
let mut __tmp_1 : * const f64 = std::ptr::null();
let mut __tmp_2 : * const i32 = std::ptr::null();
let mut __tmp_3 : * const i64 = std::ptr::null();
let mut __tmp_5 : * const i32 = std::ptr::null();
let mut __tmp_6 : * const f64 = std::ptr::null();
handle_res_static(unsafe { MSK_computesparsecholesky(std::ptr::null(),numthreads_,ordermethod_,tolsingular_,n_,anzc_.as_ptr(),aptrc_.as_ptr(),asubc_.as_ptr(),avalc_.as_ptr(),& mut __tmp_0,& mut __tmp_1,& mut __tmp_2,& mut __tmp_3,lensubnval_,& mut __tmp_5,& mut __tmp_6) },"compute_sparse_cholesky")?;
let len_perm_ : usize = n_.try_into().unwrap_or(0);
perm_.resize(len_perm_,Default::default());
perm_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_0,len_perm_) } );
let _ = unsafe { MSK_freeenv(std::ptr::null(),__tmp_0 as * mut u8); };
let len_diag_ : usize = n_.try_into().unwrap_or(0);
diag_.resize(len_diag_,Default::default());
diag_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_1,len_diag_) } );
let _ = unsafe { MSK_freeenv(std::ptr::null(),__tmp_1 as * mut u8); };
let len_lnzc_ : usize = n_.try_into().unwrap_or(0);
lnzc_.resize(len_lnzc_,Default::default());
lnzc_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_2,len_lnzc_) } );
let _ = unsafe { MSK_freeenv(std::ptr::null(),__tmp_2 as * mut u8); };
let len_lptrc_ : usize = n_.try_into().unwrap_or(0);
lptrc_.resize(len_lptrc_,Default::default());
lptrc_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_3,len_lptrc_) } );
let _ = unsafe { MSK_freeenv(std::ptr::null(),__tmp_3 as * mut u8); };
let len_lsubc_ : usize = (*lensubnval_).try_into().unwrap_or(0);
lsubc_.resize(len_lsubc_,Default::default());
lsubc_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_5,len_lsubc_) } );
let _ = unsafe { MSK_freeenv(std::ptr::null(),__tmp_5 as * mut u8); };
let len_lvalc_ : usize = (*lensubnval_).try_into().unwrap_or(0);
lvalc_.resize(len_lvalc_,Default::default());
lvalc_.clone_from_slice(unsafe { std::slice::from_raw_parts(__tmp_6,len_lvalc_) } );
let _ = unsafe { MSK_freeenv(std::ptr::null(),__tmp_6 as * mut u8); };
return Result::Ok(());
} // computesparsecholesky
/// Computes the inner product of two vectors.
///
/// # Arguments
///
/// - `n_` Length of the vectors.
/// - `x_` The x vector.
/// - `y_` The y vector.
/// - `xty_` The result of the inner product.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.dot>
#[allow(unused_parens)]
pub fn dot(n_ : i32,x_ : &[f64],y_ : &[f64],xty_ : &mut f64) -> Result<(),String> {
if x_.len() != (n_).try_into().unwrap() {
return Result::Err("dot: Argument 'x' has the wrong length, expected n_".to_string());
}
if y_.len() != (n_).try_into().unwrap() {
return Result::Err("dot: Argument 'y' has the wrong length, expected n_".to_string());
}
handle_res_static(unsafe { MSK_dot(std::ptr::null(),n_,x_.as_ptr(),y_.as_ptr(),xty_) },"dot")?;
return Result::Ok(());
} // dot
/// Prints an intro to message stream.
///
/// # Arguments
///
/// - `longver_` If non-zero, then the intro is slightly longer.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.echointro>
#[allow(unused_parens)]
pub fn echo_intro(longver_ : i32) -> Result<(),String> {
handle_res_static(unsafe { MSK_echointro(std::ptr::null(),longver_) },"echo_intro")?;
return Result::Ok(());
} // echointro
/// Enable reference counting for environments.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.enablegarcolenv>
#[allow(unused_parens)]
pub fn enable_gar_col_env() -> Result<(),String> {
handle_res_static(unsafe { MSK_enablegarcolenv(std::ptr::null()) },"enable_gar_col_env")?;
return Result::Ok(());
} // enablegarcolenv
/// Reports when the first license feature expires.
///
/// # Arguments
///
/// - `expiry_` If nonnegative, then it is the minimum number days to expiry of any feature that has been checked out.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.expirylicenses>
#[allow(unused_parens)]
pub fn expirylicenses(expiry_ : &mut i64) -> Result<(),String> {
handle_res_static(unsafe { MSK_expirylicenses(std::ptr::null(),expiry_) },"expirylicenses")?;
return Result::Ok(());
} // expirylicenses
/// Performs a dense matrix multiplication.
///
/// # Arguments
///
/// - `transa_` Indicates whether the matrix A must be transposed.
///
/// See [Transpose]
/// - `transb_` Indicates whether the matrix B must be transposed.
///
/// See [Transpose]
/// - `m_` Indicates the number of rows of matrix C.
/// - `n_` Indicates the number of columns of matrix C.
/// - `k_` Specifies the common dimension along which op(A) and op(B) are multiplied.
/// - `alpha_` A scalar value multiplying the result of the matrix multiplication.
/// - `a_` The pointer to the array storing matrix A in a column-major format.
/// - `b_` The pointer to the array storing matrix B in a column-major format.
/// - `beta_` A scalar value that multiplies C.
/// - `c_` The pointer to the array storing matrix C in a column-major format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gemm>
#[allow(unused_parens)]
pub fn gemm(transa_ : i32,transb_ : i32,m_ : i32,n_ : i32,k_ : i32,alpha_ : f64,a_ : &[f64],b_ : &[f64],beta_ : f64,c_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((m_*k_)).try_into().unwrap() {
return Result::Err("gemm: Argument 'a' has the wrong length, expected (m_*k_)".to_string());
}
if b_.len() != ((k_*n_)).try_into().unwrap() {
return Result::Err("gemm: Argument 'b' has the wrong length, expected (k_*n_)".to_string());
}
if c_.len() != ((m_*n_)).try_into().unwrap() {
return Result::Err("gemm: Argument 'c' has the wrong length, expected (m_*n_)".to_string());
}
handle_res_static(unsafe { MSK_gemm(std::ptr::null(),transa_,transb_,m_,n_,k_,alpha_,a_.as_ptr(),b_.as_ptr(),beta_,c_.as_mut_ptr()) },"gemm")?;
return Result::Ok(());
} // gemm
/// Computes dense matrix times a dense vector product.
///
/// # Arguments
///
/// - `transa_` Indicates whether the matrix A must be transposed.
///
/// See [Transpose]
/// - `m_` Specifies the number of rows of the matrix A.
/// - `n_` Specifies the number of columns of the matrix A.
/// - `alpha_` A scalar value multiplying the matrix A.
/// - `a_` A pointer to the array storing matrix A in a column-major format.
/// - `x_` A pointer to the array storing the vector x.
/// - `beta_` A scalar value multiplying the vector y.
/// - `y_` A pointer to the array storing the vector y.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.gemv>
#[allow(unused_parens)]
pub fn gemv(transa_ : i32,m_ : i32,n_ : i32,alpha_ : f64,a_ : &[f64],x_ : &[f64],beta_ : f64,y_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*m_)).try_into().unwrap() {
return Result::Err("gemv: Argument 'a' has the wrong length, expected (n_*m_)".to_string());
}
let __tmp_0 = if ((transa_==Transpose::NO)) {
n_
}
else {
m_
};
if x_.len() != (__tmp_0).try_into().unwrap() {
return Result::Err("gemv: Argument 'x' has the wrong length, expected __tmp_0".to_string());
}
let __tmp_1 = if ((transa_==Transpose::NO)) {
m_
}
else {
n_
};
if y_.len() != (__tmp_1).try_into().unwrap() {
return Result::Err("gemv: Argument 'y' has the wrong length, expected __tmp_1".to_string());
}
handle_res_static(unsafe { MSK_gemv(std::ptr::null(),transa_,m_,n_,alpha_,a_.as_ptr(),x_.as_ptr(),beta_,y_.as_mut_ptr()) },"gemv")?;
return Result::Ok(());
} // gemv
/// Obtains build information.
///
/// # Returns
///
/// - `buildstate` State of binaries, i.e. a debug, release candidate or final release.
/// - `builddate` Date when the binaries were built.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getbuildinfo>
#[allow(unused_parens)]
pub fn get_build_info() -> Result<(String,String),String> {
let mut buildstate_ = Vec::new(); buildstate_.resize(Value::MAX_STR_LEN as usize,0);
let mut builddate_ = Vec::new(); builddate_.resize(Value::MAX_STR_LEN as usize,0);
handle_res_static(unsafe { MSK_getbuildinfo(buildstate_.as_mut_ptr(),builddate_.as_mut_ptr()) },"get_build_info")?;
return Result::Ok((String::from_utf8_lossy(&buildstate_[..buildstate_.iter().position(|&c| c == 0).unwrap_or(Value::MAX_STR_LEN as usize)]).into_owned(),String::from_utf8_lossy(&builddate_[..builddate_.iter().position(|&c| c == 0).unwrap_or(Value::MAX_STR_LEN as usize)]).into_owned()));
} // getbuildinfo
/// Obtains a short description of a response code.
///
/// # Arguments
///
/// - `code_` A valid response code.
///
/// See [Rescode]
///
/// # Returns
///
/// - `symname` Symbolic name corresponding to the code.
/// - `str` Obtains a short description of a response code.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getcodedesc>
#[allow(unused_parens)]
pub fn get_code_desc(code_ : i32) -> Result<(String,String),String> {
let mut symname_ = Vec::new(); symname_.resize(Value::MAX_STR_LEN as usize,0);
let mut str_ = Vec::new(); str_.resize(Value::MAX_STR_LEN as usize,0);
handle_res_static(unsafe { MSK_getcodedesc(code_,symname_.as_mut_ptr(),str_.as_mut_ptr()) },"get_code_desc")?;
return Result::Ok((String::from_utf8_lossy(&symname_[..symname_.iter().position(|&c| c == 0).unwrap_or(Value::MAX_STR_LEN as usize)]).into_owned(),String::from_utf8_lossy(&str_[..str_.iter().position(|&c| c == 0).unwrap_or(Value::MAX_STR_LEN as usize)]).into_owned()));
} // getcodedesc
/// Obtain the class of a response code.
///
/// # Arguments
///
/// - `r_` A response code indicating the result of function call.
///
/// See [Rescode]
/// - `rc_` The response class.
///
/// See [Rescodetype]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getresponseclass>
#[allow(unused_parens)]
pub fn get_response_class(r_ : i32,rc_ : & mut i32) -> Result<(),String> {
handle_res_static(unsafe { MSK_getresponseclass(r_,rc_) },"get_response_class")?;
return Result::Ok(());
} // getresponseclass
/// Obtains MOSEK version information.
///
/// # Arguments
///
/// - `major_` Major version number.
/// - `minor_` Minor version number.
/// - `revision_` Revision number.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.getversion>
#[allow(unused_parens)]
pub fn get_version(major_ : &mut i32,minor_ : &mut i32,revision_ : &mut i32) -> Result<(),String> {
handle_res_static(unsafe { MSK_getversion(major_,minor_,revision_) },"get_version")?;
return Result::Ok(());
} // getversion
/// Return true if value is considered infinity by MOSEK.
///
/// # Arguments
///
/// - `value_` The value to be checked
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.isinfinity>
#[allow(unused_parens)]
pub fn is_infinity(value_ : f64) -> Result<(),String> {
handle_res_static(unsafe { MSK_isinfinity(value_) },"is_infinity")?;
return Result::Ok(());
} // isinfinity
/// Stops all threads and delete all handles used by the license system.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.licensecleanup>
#[allow(unused_parens)]
pub fn license_cleanup() -> Result<(),String> {
handle_res_static(unsafe { MSK_licensecleanup() },"license_cleanup")?;
return Result::Ok(());
} // licensecleanup
/// Directs all output from a stream to a file.
///
/// # Arguments
///
/// - `whichstream_` Index of the stream.
///
/// See [Streamtype]
/// - `filename_` A valid file name.
/// - `append_` If this argument is 0 the file will be overwritten, otherwise it will be appended to.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.linkfiletoenvstream>
#[allow(unused_parens)]
pub fn link_file_to_stream(whichstream_ : i32,filename_ : &str,append_ : i32) -> Result<(),String> {
let __tmp_1 = CString::new(filename_).unwrap();
handle_res_static(unsafe { MSK_linkfiletoenvstream(std::ptr::null(),whichstream_,__tmp_1.as_ptr(),append_) },"link_file_to_stream")?;
return Result::Ok(());
} // linkfiletoenvstream
/// Optimize a number of tasks in parallel using a specified number of threads.
///
/// # Arguments
///
/// - `israce_` If nonzero, then the function is terminated after the first task has been completed.
/// - `maxtime_` Time limit for the function.
/// - `numthreads_` Number of threads to be employed.
/// - `trmcode_` The termination code for each task.
///
/// See [Rescode]
/// - `rcode_` The response code for each task.
///
/// See [Rescode]
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.optimizebatch>
#[allow(unused_parens)]
pub fn optimize_batch(israce_ : bool,maxtime_ : f64,numthreads_ : i32,task_ : &[ & mut Task ],trmcode_ : &mut[i32],rcode_ : &mut[i32]) -> Result<(),String> {
let numtask_ : i64 = task_.len() as i64;
let arrptrs_task : Vec<* const u8> = task_.iter().map(|t| t.ptr).collect();
if trmcode_.len() != (numtask_).try_into().unwrap() {
return Result::Err("optimize_batch: Argument 'trmcode' has the wrong length, expected numtask_".to_string());
}
if rcode_.len() != (numtask_).try_into().unwrap() {
return Result::Err("optimize_batch: Argument 'rcode' has the wrong length, expected numtask_".to_string());
}
handle_res_static(unsafe { MSK_optimizebatch(std::ptr::null(),israce_,maxtime_,numthreads_,numtask_,arrptrs_task.as_ptr(),trmcode_.as_mut_ptr(),rcode_.as_mut_ptr()) },"optimize_batch")?;
return Result::Ok(());
} // optimizebatch
/// Computes a Cholesky factorization of a dense matrix.
///
/// # Arguments
///
/// - `uplo_` Indicates whether the upper or lower triangular part of the matrix is stored.
///
/// See [Uplo]
/// - `n_` Dimension of the symmetric matrix.
/// - `a_` A symmetric matrix stored in column-major order.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.potrf>
#[allow(unused_parens)]
pub fn potrf(uplo_ : i32,n_ : i32,a_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*n_)).try_into().unwrap() {
return Result::Err("potrf: Argument 'a' has the wrong length, expected (n_*n_)".to_string());
}
handle_res_static(unsafe { MSK_potrf(std::ptr::null(),uplo_,n_,a_.as_mut_ptr()) },"potrf")?;
return Result::Ok(());
} // potrf
/// Input a runtime license code.
///
/// # Arguments
///
/// - `code_` A license key string.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putlicensecode>
#[allow(unused_parens)]
pub fn put_license_code(code_ : &[i32]) -> Result<(),String> {
if code_.len() > 0 && code_.len() != (Value::LICENSE_BUFFER_LENGTH).try_into().unwrap() {
return Result::Err("put_license_code: Argument 'code' has the wrong length, expected Value::LICENSE_BUFFER_LENGTH".to_string());
}
handle_res_static(unsafe { MSK_putlicensecode(std::ptr::null(),if code_.len() == 0 { std::ptr::null() } else { code_.as_ptr() }) },"put_license_code")?;
return Result::Ok(());
} // putlicensecode
/// Enables debug information for the license system.
///
/// # Arguments
///
/// - `licdebug_` Enable output of license check-out debug information.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putlicensedebug>
#[allow(unused_parens)]
pub fn put_license_debug(licdebug_ : i32) -> Result<(),String> {
handle_res_static(unsafe { MSK_putlicensedebug(std::ptr::null(),licdebug_) },"put_license_debug")?;
return Result::Ok(());
} // putlicensedebug
/// Set the path to the license file.
///
/// # Arguments
///
/// - `licensepath_` A path specifying where to search for the license.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putlicensepath>
#[allow(unused_parens)]
pub fn put_license_path(licensepath_ : &str) -> Result<(),String> {
let __tmp_1 = CString::new(licensepath_).unwrap();
handle_res_static(unsafe { MSK_putlicensepath(std::ptr::null(),__tmp_1.as_ptr()) },"put_license_path")?;
return Result::Ok(());
} // putlicensepath
/// Control whether mosek should wait for an available license if no license is available.
///
/// # Arguments
///
/// - `licwait_` Enable waiting for a license.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.putlicensewait>
#[allow(unused_parens)]
pub fn put_license_wait(licwait_ : i32) -> Result<(),String> {
handle_res_static(unsafe { MSK_putlicensewait(std::ptr::null(),licwait_) },"put_license_wait")?;
return Result::Ok(());
} // putlicensewait
/// Reset the license expiry reporting startpoint.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.resetexpirylicenses>
#[allow(unused_parens)]
pub fn reset_expiry_licenses() -> Result<(),String> {
handle_res_static(unsafe { MSK_resetexpirylicenses(std::ptr::null()) },"reset_expiry_licenses")?;
return Result::Ok(());
} // resetexpirylicenses
/// Solves a sparse triangular system of linear equations.
///
/// # Arguments
///
/// - `transposed_` Controls whether the solve is with L or the transposed L.
///
/// See [Transpose]
/// - `lnzc_` lnzc\[j\] is the number of nonzeros in column j.
/// - `lptrc_` lptrc\[j\] is a pointer to the first row index and value in column j.
/// - `lsubc_` Row indexes for each column stored sequentially.
/// - `lvalc_` The value corresponding to row indexed stored lsubc.
/// - `b_` The right-hand side of linear equation system to be solved as a dense vector.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.sparsetriangularsolvedense>
#[allow(unused_parens)]
pub fn sparse_triangular_solve_dense(transposed_ : i32,lnzc_ : &[i32],lptrc_ : &[i64],lsubc_ : &[i32],lvalc_ : &[f64],b_ : &mut[f64]) -> Result<(),String> {
let n_ : i32 = std::cmp::min(std::cmp::min(lnzc_.len(),lptrc_.len()),b_.len()) as i32;
if lnzc_.len() != (n_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'lnzc' has the wrong length, expected n_".to_string());
}
if lptrc_.len() != (n_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'lptrc' has the wrong length, expected n_".to_string());
}
let lensubnval_ : i64 = std::cmp::min(lsubc_.len(),lvalc_.len()) as i64;
if lsubc_.len() != (lensubnval_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'lsubc' has the wrong length, expected lensubnval_".to_string());
}
if lvalc_.len() != (lensubnval_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'lvalc' has the wrong length, expected lensubnval_".to_string());
}
if b_.len() != (n_).try_into().unwrap() {
return Result::Err("sparse_triangular_solve_dense: Argument 'b' has the wrong length, expected n_".to_string());
}
handle_res_static(unsafe { MSK_sparsetriangularsolvedense(std::ptr::null(),transposed_,n_,lnzc_.as_ptr(),lptrc_.as_ptr(),lensubnval_,lsubc_.as_ptr(),lvalc_.as_ptr(),b_.as_mut_ptr()) },"sparse_triangular_solve_dense")?;
return Result::Ok(());
} // sparsetriangularsolvedense
/// Computes all eigenvalues of a symmetric dense matrix.
///
/// # Arguments
///
/// - `uplo_` Indicates whether the upper or lower triangular part is used.
///
/// See [Uplo]
/// - `n_` Dimension of the symmetric input matrix.
/// - `a_` Input matrix A.
/// - `w_` Array of length at least n containing the eigenvalues of A.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.syeig>
#[allow(unused_parens)]
pub fn syeig(uplo_ : i32,n_ : i32,a_ : &[f64],w_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*n_)).try_into().unwrap() {
return Result::Err("syeig: Argument 'a' has the wrong length, expected (n_*n_)".to_string());
}
if w_.len() != (n_).try_into().unwrap() {
return Result::Err("syeig: Argument 'w' has the wrong length, expected n_".to_string());
}
handle_res_static(unsafe { MSK_syeig(std::ptr::null(),uplo_,n_,a_.as_ptr(),w_.as_mut_ptr()) },"syeig")?;
return Result::Ok(());
} // syeig
/// Computes all the eigenvalues and eigenvectors of a symmetric dense matrix, and thus its eigenvalue decomposition.
///
/// # Arguments
///
/// - `uplo_` Indicates whether the upper or lower triangular part is used.
///
/// See [Uplo]
/// - `n_` Dimension of the symmetric input matrix.
/// - `a_` Input matrix A.
/// - `w_` Array of length at least n containing the eigenvalues of A.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.syevd>
#[allow(unused_parens)]
pub fn syevd(uplo_ : i32,n_ : i32,a_ : &mut[f64],w_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*n_)).try_into().unwrap() {
return Result::Err("syevd: Argument 'a' has the wrong length, expected (n_*n_)".to_string());
}
if w_.len() != (n_).try_into().unwrap() {
return Result::Err("syevd: Argument 'w' has the wrong length, expected n_".to_string());
}
handle_res_static(unsafe { MSK_syevd(std::ptr::null(),uplo_,n_,a_.as_mut_ptr(),w_.as_mut_ptr()) },"syevd")?;
return Result::Ok(());
} // syevd
/// Obtains the value corresponding to a symbolic name defined by MOSEK.
///
/// # Arguments
///
/// - `name_` Symbolic name.
///
/// # Returns
///
/// - `value` The corresponding value.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.symnamtovalue>
#[allow(unused_parens)]
pub fn sym_nam_to_value(name_ : &str) -> Result<String,String> {
let __tmp_1 = CString::new(name_).unwrap();
let mut value_ = Vec::new(); value_.resize(Value::MAX_STR_LEN as usize,0);
handle_res_static(unsafe { MSK_symnamtovalue(__tmp_1.as_ptr(),value_.as_mut_ptr()) },"sym_nam_to_value")?;
return Result::Ok(String::from_utf8_lossy(&value_[..value_.iter().position(|&c| c == 0).unwrap_or(Value::MAX_STR_LEN as usize)]).into_owned());
} // symnamtovalue
/// Performs a rank-k update of a symmetric matrix.
///
/// # Arguments
///
/// - `uplo_` Indicates whether the upper or lower triangular part of C is used.
///
/// See [Uplo]
/// - `trans_` Indicates whether the matrix A must be transposed.
///
/// See [Transpose]
/// - `n_` Specifies the order of C.
/// - `k_` Indicates the number of rows or columns of A, and its rank.
/// - `alpha_` A scalar value multiplying the result of the matrix multiplication.
/// - `a_` The pointer to the array storing matrix A in a column-major format.
/// - `beta_` A scalar value that multiplies C.
/// - `c_` The pointer to the array storing matrix C in a column-major format.
///
/// Full documentation: <https://docs.mosek.com/latest/capi/alphabetic-functionalities.html#mosek.env.syrk>
#[allow(unused_parens)]
pub fn syrk(uplo_ : i32,trans_ : i32,n_ : i32,k_ : i32,alpha_ : f64,a_ : &[f64],beta_ : f64,c_ : &mut[f64]) -> Result<(),String> {
if a_.len() != ((n_*k_)).try_into().unwrap() {
return Result::Err("syrk: Argument 'a' has the wrong length, expected (n_*k_)".to_string());
}
if c_.len() != ((n_*n_)).try_into().unwrap() {
return Result::Err("syrk: Argument 'c' has the wrong length, expected (n_*n_)".to_string());
}
handle_res_static(unsafe { MSK_syrk(std::ptr::null(),uplo_,trans_,n_,k_,alpha_,a_.as_ptr(),beta_,c_.as_mut_ptr()) },"syrk")?;
return Result::Ok(());
} // syrk