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 18447 18448 18449 18450 18451 18452 18453 18454 18455 18456 18457 18458 18459 18460 18461 18462 18463 18464 18465 18466 18467 18468 18469 18470 18471 18472 18473 18474 18475 18476 18477 18478 18479 18480 18481 18482 18483 18484 18485 18486 18487 18488 18489 18490 18491 18492 18493 18494 18495 18496 18497 18498 18499 18500 18501 18502 18503 18504 18505 18506 18507 18508 18509 18510 18511 18512 18513 18514 18515 18516 18517 18518 18519 18520 18521 18522 18523 18524 18525 18526 18527 18528 18529 18530 18531 18532 18533 18534 18535 18536 18537 18538 18539 18540 18541 18542 18543 18544 18545 18546 18547 18548 18549 18550 18551 18552 18553 18554 18555 18556 18557 18558 18559 18560 18561 18562 18563 18564 18565 18566 18567 18568 18569 18570 18571 18572 18573 18574 18575 18576 18577 18578 18579 18580 18581 18582 18583 18584 18585 18586 18587 18588 18589 18590 18591 18592 18593 18594 18595 18596 18597 18598 18599 18600 18601 18602 18603 18604 18605 18606 18607 18608 18609 18610 18611 18612 18613 18614 18615 18616 18617 18618 18619 18620 18621 18622 18623 18624 18625 18626 18627 18628 18629 18630 18631 18632 18633 18634 18635 18636 18637 18638 18639 18640 18641 18642 18643 18644 18645 18646 18647 18648 18649 18650 18651 18652 18653 18654 18655 18656 18657 18658 18659 18660 18661 18662 18663 18664 18665 18666 18667 18668 18669 18670 18671 18672 18673 18674 18675 18676 18677 18678 18679 18680 18681 18682 18683 18684 18685 18686 18687 18688 18689 18690 18691 18692 18693 18694 18695 18696 18697 18698 18699 18700 18701 18702 18703 18704 18705 18706 18707 18708 18709 18710 18711 18712 18713 18714 18715 18716 18717 18718 18719 18720 18721 18722 18723 18724 18725 18726 18727 18728 18729 18730 18731 18732 18733 18734 18735 18736 18737 18738 18739 18740 18741 18742 18743 18744 18745 18746 18747 18748 18749 18750 18751 18752 18753 18754 18755 18756 18757 18758 18759 18760 18761 18762 18763 18764 18765 18766 18767 18768 18769 18770 18771 18772 18773 18774 18775 18776 18777 18778 18779 18780 18781 18782 18783 18784 18785 18786 18787 18788 18789 18790 18791 18792 18793 18794 18795 18796 18797 18798 18799 18800 18801 18802 18803 18804 18805 18806 18807 18808 18809 18810 18811 18812 18813 18814 18815 18816 18817 18818 18819 18820 18821 18822 18823 18824 18825 18826 18827 18828 18829 18830 18831 18832 18833 18834 18835 18836 18837 18838 18839 18840 18841 18842 18843 18844 18845 18846 18847 18848 18849 18850 18851 18852 18853 18854 18855 18856 18857 18858 18859 18860 18861 18862 18863 18864 18865 18866 18867 18868 18869 18870 18871 18872 18873 18874 18875 18876 18877 18878 18879 18880 18881 18882 18883 18884 18885 18886 18887 18888 18889 18890 18891 18892 18893 18894 18895 18896 18897 18898 18899 18900 18901 18902 18903 18904 18905 18906 18907 18908 18909 18910 18911 18912 18913 18914 18915 18916 18917 18918 18919 18920 18921 18922 18923 18924 18925 18926 18927 18928 18929 18930 18931 18932 18933 18934 18935 18936 18937 18938 18939 18940 18941 18942 18943 18944 18945 18946 18947 18948 18949 18950 18951 18952 18953 18954 18955 18956 18957 18958 18959 18960 18961 18962 18963 18964 18965 18966 18967 18968 18969 18970 18971 18972 18973 18974 18975 18976 18977 18978 18979 18980 18981 18982 18983 18984 18985 18986 18987 18988 18989 18990 18991 18992 18993 18994 18995 18996 18997 18998 18999 19000 19001 19002 19003 19004 19005 19006 19007 19008 19009 19010 19011 19012 19013 19014 19015 19016 19017 19018 19019 19020 19021 19022 19023 19024 19025 19026 19027 19028 19029 19030 19031 19032 19033 19034 19035 19036 19037 19038 19039 19040 19041 19042 19043 19044 19045 19046 19047 19048 19049 19050 19051 19052 19053 19054 19055 19056 19057 19058 19059 19060 19061 19062 19063 19064 19065 19066 19067 19068 19069 19070 19071 19072 19073 19074 19075 19076 19077 19078 19079 19080 19081 19082 19083 19084 19085 19086 19087 19088 19089 19090 19091 19092 19093 19094 19095 19096 19097 19098 19099 19100 19101 19102 19103 19104 19105 19106 19107 19108 19109 19110 19111 19112 19113 19114 19115 19116 19117 19118 19119 19120 19121 19122 19123 19124 19125 19126 19127 19128 19129 19130 19131 19132 19133 19134 19135 19136 19137 19138 19139 19140 19141 19142 19143 19144 19145 19146 19147 19148 19149 19150 19151 19152 19153 19154 19155 19156 19157 19158 19159 19160 19161 19162 19163 19164 19165 19166 19167 19168 19169 19170 19171 19172 19173 19174 19175 19176 19177 19178 19179 19180 19181 19182 19183 19184 19185 19186 19187 19188 19189 19190 19191 19192 19193 19194 19195 19196 19197 19198 19199 19200 19201 19202 19203 19204 19205 19206 19207 19208 19209 19210 19211 19212 19213 19214 19215 19216 19217 19218 19219 19220 19221 19222 19223 19224 19225 19226 19227 19228 19229 19230 19231 19232 19233 19234 19235 19236 19237 19238 19239 19240 19241 19242 19243 19244 19245 19246 19247 19248 19249 19250 19251 19252 19253 19254 19255 19256 19257 19258 19259 19260 19261 19262 19263 19264 19265 19266 19267 19268 19269 19270 19271 19272 19273 19274 19275 19276 19277 19278 19279 19280 19281 19282 19283 19284 19285 19286 19287 19288 19289 19290 19291 19292 19293 19294 19295 19296 19297 19298 19299 19300 19301 19302 19303 19304 19305 19306 19307 19308 19309 19310 19311 19312 19313 19314 19315 19316 19317 19318 19319 19320 19321 19322 19323 19324 19325 19326 19327 19328 19329 19330 19331 19332 19333 19334 19335 19336 19337 19338 19339 19340 19341 19342 19343 19344 19345 19346 19347 19348 19349 19350 19351 19352 19353 19354 19355 19356 19357 19358 19359 19360 19361 19362 19363 19364 19365 19366 19367 19368 19369 19370 19371 19372 19373 19374 19375 19376 19377 19378 19379 19380 19381 19382 19383 19384 19385 19386 19387 19388 19389 19390 19391 19392 19393 19394 19395 19396 19397 19398 19399 19400 19401 19402 19403 19404 19405 19406 19407 19408 19409 19410 19411 19412 19413 19414 19415 19416 19417 19418 19419 19420 19421 19422 19423 19424 19425 19426 19427 19428 19429 19430 19431 19432 19433 19434 19435 19436 19437 19438 19439 19440 19441 19442 19443 19444 19445 19446 19447 19448 19449 19450 19451 19452 19453 19454 19455 19456 19457 19458 19459 19460 19461 19462 19463 19464 19465 19466 19467 19468 19469 19470 19471 19472 19473 19474 19475 19476 19477 19478 19479 19480 19481 19482 19483 19484 19485 19486 19487 19488 19489 19490 19491 19492 19493 19494 19495 19496 19497 19498 19499 19500 19501 19502 19503 19504 19505 19506 19507 19508 19509 19510 19511 19512 19513 19514 19515 19516 19517 19518 19519 19520 19521 19522 19523 19524 19525 19526 19527 19528 19529 19530 19531 19532 19533 19534 19535 19536 19537 19538 19539 19540 19541 19542 19543 19544 19545 19546 19547 19548 19549 19550 19551 19552 19553 19554 19555 19556 19557 19558 19559 19560 19561 19562 19563 19564 19565 19566 19567 19568 19569 19570 19571 19572 19573 19574 19575 19576 19577 19578 19579 19580 19581 19582 19583 19584 19585 19586 19587 19588 19589 19590 19591 19592 19593 19594 19595 19596 19597 19598 19599 19600 19601 19602 19603 19604 19605 19606 19607 19608 19609 19610 19611 19612 19613 19614 19615 19616 19617 19618 19619 19620 19621 19622 19623 19624 19625 19626 19627 19628 19629 19630 19631 19632 19633 19634 19635 19636 19637 19638 19639 19640 19641 19642 19643 19644 19645 19646 19647 19648 19649 19650 19651 19652 19653 19654 19655 19656 19657 19658 19659 19660 19661 19662 19663 19664 19665 19666 19667 19668 19669 19670 19671 19672 19673 19674 19675 19676 19677 19678 19679 19680 19681 19682 19683 19684 19685 19686 19687 19688 19689 19690 19691 19692 19693 19694 19695 19696 19697 19698 19699 19700 19701 19702 19703 19704 19705 19706 19707 19708 19709 19710 19711 19712 19713 19714 19715 19716 19717 19718 19719 19720 19721 19722 19723 19724 19725 19726 19727 19728 19729 19730 19731 19732 19733 19734 19735 19736 19737 19738 19739 19740 19741 19742 19743 19744 19745 19746 19747 19748 19749 19750 19751 19752 19753 19754 19755 19756 19757 19758 19759 19760 19761 19762 19763 19764 19765 19766 19767 19768 19769 19770 19771 19772 19773 19774 19775 19776 19777 19778 19779 19780 19781 19782 19783 19784 19785 19786 19787 19788 19789 19790 19791 19792 19793 19794 19795 19796 19797 19798 19799 19800 19801 19802 19803 19804 19805 19806 19807 19808 19809 19810 19811 19812 19813 19814 19815 19816 19817 19818 19819 19820 19821 19822 19823 19824 19825 19826 19827 19828 19829 19830 19831 19832 19833 19834 19835 19836 19837 19838 19839 19840 19841 19842 19843 19844 19845 19846 19847 19848 19849 19850 19851 19852 19853 19854 19855 19856 19857 19858 19859 19860 19861 19862 19863 19864 19865 19866 19867 19868 19869 19870 19871 19872 19873 19874 19875 19876 19877 19878 19879 19880 19881 19882 19883 19884 19885 19886 19887 19888 19889 19890 19891 19892 19893 19894 19895 19896 19897 19898 19899 19900 19901 19902 19903 19904 19905 19906 19907 19908 19909 19910 19911 19912 19913 19914 19915 19916 19917 19918 19919 19920 19921 19922 19923 19924 19925 19926 19927 19928 19929 19930 19931 19932 19933 19934 19935 19936 19937 19938 19939 19940 19941 19942 19943 19944 19945 19946 19947 19948 19949 19950 19951 19952 19953 19954 19955 19956 19957 19958 19959 19960 19961 19962 19963 19964 19965 19966 19967 19968 19969 19970 19971 19972 19973 19974 19975 19976 19977 19978 19979 19980 19981 19982 19983 19984 19985 19986 19987 19988 19989 19990 19991 19992 19993 19994 19995 19996 19997 19998 19999 20000 20001 20002 20003 20004 20005 20006 20007 20008 20009 20010 20011 20012 20013 20014 20015 20016 20017 20018 20019 20020 20021 20022 20023 20024 20025 20026 20027 20028 20029 20030 20031 20032 20033 20034 20035 20036 20037 20038 20039 20040 20041 20042 20043 20044 20045 20046 20047 20048 20049 20050 20051 20052 20053 20054 20055 20056 20057 20058 20059 20060 20061 20062 20063 20064 20065 20066 20067 20068 20069 20070 20071 20072 20073 20074 20075 20076 20077 20078 20079 20080 20081 20082 20083 20084 20085 20086 20087 20088 20089 20090 20091 20092 20093 20094 20095 20096 20097 20098 20099 20100 20101 20102 20103 20104 20105 20106 20107 20108 20109 20110 20111 20112 20113 20114 20115 20116 20117 20118 20119 20120 20121 20122 20123 20124 20125 20126 20127 20128 20129 20130 20131 20132 20133 20134 20135 20136 20137 20138 20139 20140 20141 20142 20143 20144 20145 20146 20147 20148 20149 20150 20151 20152 20153 20154 20155 20156 20157 20158 20159 20160 20161 20162 20163 20164 20165 20166 20167 20168 20169 20170 20171 20172 20173 20174 20175 20176 20177 20178 20179 20180 20181 20182 20183 20184 20185 20186 20187 20188 20189 20190 20191 20192 20193 20194 20195 20196 20197 20198 20199 20200 20201 20202 20203 20204 20205 20206 20207 20208 20209 20210 20211 20212 20213 20214 20215 20216 20217 20218 20219 20220 20221 20222 20223 20224 20225 20226 20227 20228 20229 20230 20231 20232 20233 20234 20235 20236 20237 20238 20239 20240 20241 20242 20243 20244 20245 20246 20247 20248 20249 20250 20251 20252 20253 20254 20255 20256 20257 20258 20259 20260 20261 20262 20263 20264 20265 20266 20267 20268 20269 20270 20271 20272 20273 20274 20275 20276 20277 20278 20279 20280 20281 20282 20283 20284 20285 20286 20287 20288 20289 20290 20291 20292 20293 20294 20295 20296 20297 20298 20299 20300 20301 20302 20303 20304 20305 20306 20307 20308 20309 20310 20311 20312 20313 20314 20315 20316 20317 20318 20319 20320 20321 20322 20323 20324 20325 20326 20327 20328 20329 20330 20331 20332 20333 20334 20335 20336 20337 20338 20339 20340 20341 20342 20343 20344 20345 20346 20347 20348 20349 20350 20351 20352 20353 20354 20355 20356 20357 20358 20359 20360 20361 20362 20363 20364 20365 20366 20367 20368 20369 20370 20371 20372 20373 20374 20375 20376 20377 20378 20379 20380 20381 20382 20383 20384 20385 20386 20387 20388 20389 20390 20391 20392 20393 20394 20395 20396 20397 20398 20399 20400 20401 20402 20403 20404 20405 20406 20407 20408 20409 20410 20411 20412 20413 20414 20415 20416 20417 20418 20419 20420 20421 20422 20423 20424 20425 20426 20427 20428 20429 20430 20431 20432 20433 20434 20435 20436 20437 20438 20439 20440 20441 20442 20443 20444 20445 20446 20447 20448 20449 20450 20451 20452 20453 20454 20455 20456 20457 20458 20459 20460 20461 20462 20463 20464 20465 20466 20467 20468 20469 20470 20471 20472 20473 20474 20475 20476 20477 20478 20479 20480 20481 20482 20483 20484 20485 20486 20487 20488 20489 20490 20491 20492 20493 20494 20495 20496 20497 20498 20499 20500 20501 20502 20503 20504 20505 20506 20507 20508 20509 20510 20511 20512 20513 20514 20515 20516 20517 20518 20519 20520 20521 20522 20523 20524 20525 20526 20527 20528 20529 20530 20531 20532 20533 20534 20535 20536 20537 20538 20539 20540 20541 20542 20543 20544 20545 20546 20547 20548 20549 20550 20551 20552 20553 20554 20555 20556 20557 20558 20559 20560 20561 20562 20563 20564 20565 20566 20567 20568 20569 20570 20571 20572 20573 20574 20575 20576 20577 20578 20579 20580 20581 20582 20583 20584 20585 20586 20587 20588 20589 20590 20591 20592 20593 20594 20595 20596 20597 20598 20599 20600 20601 20602 20603 20604 20605 20606 20607 20608 20609 20610 20611 20612 20613 20614 20615 20616 20617 20618 20619 20620 20621 20622 20623 20624 20625 20626 20627 20628 20629 20630 20631 20632 20633 20634 20635 20636 20637 20638 20639 20640 20641 20642 20643 20644 20645 20646 20647 20648 20649 20650 20651 20652 20653 20654 20655 20656 20657 20658 20659 20660 20661 20662 20663 20664 20665 20666 20667 20668 20669 20670 20671 20672 20673 20674 20675 20676 20677 20678 20679 20680 20681 20682 20683 20684 20685 20686 20687 20688 20689 20690 20691 20692 20693 20694 20695 20696 20697 20698 20699 20700 20701 20702 20703 20704 20705 20706 20707 20708 20709 20710 20711 20712 20713 20714 20715 20716 20717 20718 20719 20720 20721 20722 20723 20724 20725 20726 20727 20728 20729 20730 20731 20732 20733 20734 20735 20736 20737 20738 20739 20740 20741 20742 20743 20744 20745 20746 20747 20748 20749 20750 20751 20752 20753 20754 20755 20756 20757 20758 20759 20760 20761 20762 20763 20764 20765 20766 20767 20768 20769 20770 20771 20772 20773 20774 20775 20776 20777 20778 20779 20780 20781 20782 20783 20784 20785 20786 20787 20788 20789 20790 20791 20792 20793 20794 20795 20796 20797 20798 20799 20800 20801 20802 20803 20804 20805 20806 20807 20808 20809 20810 20811 20812 20813 20814 20815 20816 20817 20818 20819 20820 20821 20822 20823 20824 20825 20826 20827 20828 20829 20830 20831 20832 20833 20834 20835 20836 20837 20838 20839 20840 20841 20842 20843 20844 20845 20846 20847 20848 20849 20850 20851 20852 20853 20854 20855 20856 20857 20858 20859 20860 20861 20862 20863 20864 20865 20866 20867 20868 20869 20870 20871 20872 20873 20874 20875 20876 20877 20878 20879 20880 20881 20882 20883 20884 20885 20886 20887 20888 20889 20890 20891 20892 20893 20894 20895 20896 20897 20898 20899 20900 20901 20902 20903 20904 20905 20906 20907 20908 20909 20910 20911 20912 20913 20914 20915 20916 20917 20918 20919 20920 20921 20922 20923 20924 20925 20926 20927 20928 20929 20930 20931 20932 20933 20934 20935 20936 20937 20938 20939 20940 20941 20942 20943 20944 20945 20946 20947 20948 20949 20950 20951 20952 20953 20954 20955 20956 20957 20958 20959 20960 20961 20962 20963 20964 20965 20966 20967 20968 20969 20970 20971 20972 20973 20974 20975 20976 20977 20978 20979 20980 20981 20982 20983 20984 20985 20986 20987 20988 20989 20990 20991 20992 20993 20994 20995 20996 20997 20998 20999 21000 21001 21002 21003 21004 21005 21006 21007 21008 21009 21010 21011 21012 21013 21014 21015 21016 21017 21018 21019 21020 21021 21022 21023 21024 21025 21026 21027 21028 21029 21030 21031 21032 21033 21034 21035 21036 21037 21038 21039 21040 21041 21042 21043 21044 21045 21046 21047 21048 21049 21050 21051 21052 21053 21054 21055 21056 21057 21058 21059 21060 21061 21062 21063 21064 21065 21066 21067 21068 21069 21070 21071 21072 21073 21074 21075 21076 21077 21078 21079 21080 21081 21082 21083 21084 21085 21086 21087 21088 21089 21090 21091 21092 21093 21094 21095 21096 21097 21098 21099 21100 21101 21102 21103 21104 21105 21106 21107 21108 21109 21110 21111 21112 21113 21114 21115 21116 21117 21118 21119 21120 21121 21122 21123 21124 21125 21126 21127 21128 21129 21130 21131 21132 21133 21134 21135 21136 21137 21138 21139 21140 21141 21142 21143 21144 21145 21146 21147 21148 21149 21150 21151 21152 21153 21154 21155 21156 21157 21158 21159 21160 21161 21162 21163 21164 21165 21166 21167 21168 21169 21170 21171 21172 21173 21174 21175 21176 21177 21178 21179 21180 21181 21182 21183 21184 21185 21186 21187 21188 21189 21190 21191 21192 21193 21194 21195 21196 21197 21198 21199 21200 21201 21202 21203 21204 21205 21206 21207 21208 21209 21210 21211 21212 21213 21214 21215 21216 21217 21218 21219 21220 21221 21222 21223 21224 21225 21226 21227 21228 21229 21230 21231 21232 21233 21234 21235 21236 21237 21238 21239 21240 21241 21242 21243 21244 21245 21246 21247 21248 21249 21250 21251 21252 21253 21254 21255 21256 21257 21258 21259 21260 21261 21262 21263 21264 21265 21266 21267 21268 21269 21270 21271 21272 21273 21274 21275 21276 21277 21278 21279 21280 21281 21282 21283 21284 21285 21286 21287 21288 21289 21290 21291 21292 21293 21294 21295 21296 21297 21298 21299 21300 21301 21302 21303 21304 21305 21306 21307 21308 21309 21310 21311 21312 21313 21314 21315 21316 21317 21318 21319 21320 21321 21322 21323 21324 21325 21326 21327 21328 21329 21330 21331 21332 21333 21334 21335 21336 21337 21338 21339 21340 21341 21342 21343 21344 21345 21346 21347 21348 21349 21350 21351 21352 21353 21354 21355 21356 21357 21358 21359 21360 21361 21362 21363 21364 21365 21366 21367 21368 21369 21370 21371 21372 21373 21374 21375 21376 21377 21378 21379 21380 21381 21382 21383 21384 21385 21386 21387 21388 21389 21390 21391 21392 21393 21394 21395 21396 21397 21398 21399 21400 21401 21402 21403 21404 21405 21406 21407 21408 21409 21410 21411 21412 21413 21414 21415 21416 21417 21418 21419 21420 21421 21422 21423 21424 21425 21426 21427 21428 21429 21430 21431 21432 21433 21434 21435 21436 21437 21438 21439 21440 21441 21442 21443 21444 21445 21446 21447 21448 21449 21450 21451 21452 21453 21454 21455 21456 21457 21458 21459 21460 21461 21462 21463 21464 21465 21466 21467 21468 21469 21470 21471 21472 21473 21474 21475 21476 21477 21478 21479 21480 21481 21482 21483 21484 21485 21486 21487 21488 21489 21490 21491 21492 21493 21494 21495 21496 21497 21498 21499 21500 21501 21502 21503 21504 21505 21506 21507 21508 21509 21510 21511 21512 21513 21514 21515 21516 21517 21518 21519 21520 21521 21522 21523 21524 21525 21526 21527 21528 21529 21530 21531 21532 21533 21534 21535 21536 21537 21538 21539 21540 21541 21542 21543 21544 21545 21546 21547 21548 21549 21550 21551 21552 21553 21554 21555 21556 21557 21558 21559 21560 21561 21562 21563 21564 21565 21566 21567 21568 21569 21570 21571 21572 21573 21574 21575 21576 21577 21578 21579 21580 21581 21582 21583 21584 21585 21586 21587 21588 21589 21590 21591 21592 21593 21594 21595 21596 21597 21598 21599 21600 21601 21602 21603 21604 21605 21606 21607 21608 21609 21610 21611 21612 21613 21614 21615 21616 21617 21618 21619 21620 21621 21622 21623 21624 21625 21626 21627 21628 21629 21630 21631 21632 21633 21634 21635 21636 21637 21638 21639 21640 21641 21642 21643 21644 21645 21646 21647 21648 21649 21650 21651 21652 21653 21654 21655 21656 21657 21658 21659 21660 21661 21662 21663 21664 21665 21666 21667 21668 21669 21670 21671 21672 21673 21674 21675 21676 21677 21678 21679 21680 21681 21682 21683 21684 21685 21686 21687 21688 21689 21690 21691 21692 21693 21694 21695 21696 21697 21698 21699 21700 21701 21702 21703 21704 21705 21706 21707 21708 21709 21710 21711 21712 21713 21714 21715 21716 21717 21718 21719 21720 21721 21722 21723 21724 21725 21726 21727 21728 21729 21730 21731 21732 21733 21734 21735 21736 21737 21738 21739 21740 21741 21742 21743 21744 21745 21746 21747 21748 21749 21750 21751 21752 21753 21754 21755 21756 21757 21758 21759 21760 21761 21762 21763 21764 21765 21766 21767 21768 21769 21770 21771 21772 21773 21774 21775 21776 21777 21778 21779 21780 21781 21782 21783 21784 21785 21786 21787 21788 21789 21790 21791 21792 21793 21794 21795 21796 21797 21798 21799 21800 21801 21802 21803 21804 21805 21806 21807 21808 21809 21810 21811 21812 21813 21814 21815 21816 21817 21818 21819 21820 21821 21822 21823 21824 21825 21826 21827 21828 21829 21830 21831 21832 21833 21834 21835 21836 21837 21838 21839 21840 21841 21842 21843 21844 21845 21846 21847 21848 21849 21850 21851 21852 21853 21854 21855 21856 21857 21858 21859 21860 21861 21862 21863 21864 21865 21866 21867 21868 21869 21870 21871 21872 21873 21874 21875 21876 21877 21878 21879 21880 21881 21882 21883 21884 21885 21886 21887 21888 21889 21890 21891 21892 21893 21894 21895 21896 21897 21898 21899 21900 21901 21902 21903 21904 21905 21906 21907 21908 21909 21910 21911 21912 21913 21914 21915 21916 21917 21918 21919 21920 21921 21922 21923 21924 21925 21926 21927 21928 21929 21930 21931 21932 21933 21934 21935 21936 21937 21938 21939 21940 21941 21942 21943 21944 21945 21946 21947 21948 21949 21950 21951 21952 21953 21954 21955 21956 21957 21958 21959 21960 21961 21962 21963 21964 21965 21966 21967 21968 21969 21970 21971 21972 21973 21974 21975 21976 21977 21978 21979 21980 21981 21982 21983 21984 21985 21986 21987 21988 21989 21990 21991 21992 21993 21994 21995 21996 21997 21998 21999 22000 22001 22002 22003 22004 22005 22006 22007 22008 22009 22010 22011 22012 22013 22014 22015 22016 22017 22018 22019 22020 22021 22022 22023 22024 22025 22026 22027 22028 22029 22030 22031 22032 22033 22034 22035 22036 22037 22038 22039 22040 22041 22042 22043 22044 22045 22046 22047 22048 22049 22050 22051 22052 22053 22054 22055 22056 22057 22058 22059 22060 22061 22062 22063 22064 22065 22066 22067 22068 22069 22070 22071 22072 22073 22074 22075 22076 22077 22078 22079 22080 22081 22082 22083 22084 22085 22086 22087 22088 22089 22090 22091 22092 22093 22094 22095 22096 22097 22098 22099 22100 22101 22102 22103 22104 22105 22106 22107 22108 22109 22110 22111 22112 22113 22114 22115 22116 22117 22118 22119 22120 22121 22122 22123 22124 22125 22126 22127 22128 22129 22130 22131 22132 22133 22134 22135 22136 22137 22138 22139 22140 22141 22142 22143 22144 22145 22146 22147 22148 22149 22150 22151 22152 22153 22154 22155 22156 22157 22158 22159 22160 22161 22162 22163 22164 22165 22166 22167 22168 22169 22170 22171 22172 22173 22174 22175 22176 22177 22178 22179 22180 22181 22182 22183 22184 22185 22186 22187 22188 22189 22190 22191 22192 22193 22194 22195 22196 22197 22198 22199 22200 22201 22202 22203 22204 22205 22206 22207 22208 22209 22210 22211 22212 22213 22214 22215 22216 22217 22218 22219 22220 22221 22222 22223 22224 22225 22226 22227 22228 22229 22230 22231 22232 22233 22234 22235 22236 22237 22238 22239 22240 22241 22242 22243 22244 22245 22246 22247 22248 22249 22250 22251 22252 22253 22254 22255 22256 22257 22258 22259 22260 22261 22262 22263 22264 22265 22266 22267 22268 22269 22270 22271 22272 22273 22274 22275 22276 22277 22278 22279 22280 22281 22282 22283 22284 22285 22286 22287 22288 22289 22290 22291 22292 22293 22294 22295 22296 22297 22298 22299 22300 22301 22302 22303 22304 22305 22306 22307 22308 22309 22310 22311 22312 22313 22314 22315 22316 22317 22318 22319 22320 22321 22322 22323 22324 22325 22326 22327 22328 22329 22330 22331 22332 22333 22334 22335 22336 22337 22338 22339 22340 22341 22342 22343 22344 22345 22346 22347 22348 22349 22350 22351 22352 22353 22354 22355 22356 22357 22358 22359 22360 22361 22362 22363 22364 22365 22366 22367 22368 22369 22370 22371 22372 22373 22374 22375 22376 22377 22378 22379 22380 22381 22382 22383 22384 22385 22386 22387 22388 22389 22390 22391 22392 22393 22394 22395 22396 22397 22398 22399 22400 22401 22402 22403 22404 22405 22406 22407 22408 22409 22410 22411 22412 22413 22414 22415 22416 22417 22418 22419 22420 22421 22422 22423 22424 22425 22426 22427 22428 22429 22430 22431 22432 22433 22434 22435 22436 22437 22438 22439 22440 22441 22442 22443 22444 22445 22446 22447 22448 22449 22450 22451 22452 22453 22454 22455 22456 22457 22458 22459 22460 22461 22462 22463 22464 22465 22466 22467 22468 22469 22470 22471 22472 22473 22474 22475 22476 22477 22478 22479 22480 22481 22482 22483 22484 22485 22486 22487 22488 22489 22490 22491 22492 22493 22494 22495 22496 22497 22498 22499 22500 22501 22502 22503 22504 22505 22506 22507 22508 22509 22510 22511 22512 22513 22514 22515 22516 22517 22518 22519 22520 22521 22522 22523 22524 22525 22526 22527 22528 22529 22530 22531 22532 22533 22534 22535 22536 22537 22538 22539 22540 22541 22542 22543 22544 22545 22546 22547 22548 22549 22550 22551 22552 22553 22554 22555 22556 22557 22558 22559 22560 22561 22562 22563 22564 22565 22566 22567 22568 22569 22570 22571 22572 22573 22574 22575 22576 22577 22578 22579 22580 22581 22582 22583 22584 22585 22586 22587 22588 22589 22590 22591 22592 22593 22594 22595 22596 22597 22598 22599 22600 22601 22602 22603 22604 22605 22606 22607 22608 22609 22610 22611 22612 22613 22614 22615 22616 22617 22618 22619 22620 22621 22622 22623 22624 22625 22626 22627 22628 22629 22630 22631 22632 22633 22634 22635 22636 22637 22638 22639 22640 22641 22642 22643 22644 22645 22646 22647 22648 22649 22650 22651 22652 22653 22654 22655 22656 22657 22658 22659 22660 22661 22662 22663 22664 22665 22666 22667 22668 22669 22670 22671 22672 22673 22674 22675 22676 22677 22678 22679 22680 22681 22682 22683 22684 22685 22686 22687 22688 22689 22690 22691 22692 22693 22694 22695 22696 22697 22698 22699 22700 22701 22702 22703 22704 22705 22706 22707 22708 22709 22710 22711 22712 22713 22714 22715 22716 22717 22718 22719 22720 22721 22722 22723 22724 22725 22726 22727 22728 22729 22730 22731 22732 22733 22734 22735 22736 22737 22738 22739 22740 22741 22742 22743 22744 22745 22746 22747 22748 22749 22750 22751 22752 22753 22754 22755 22756 22757 22758 22759 22760 22761 22762 22763 22764 22765 22766 22767 22768 22769 22770 22771 22772 22773 22774 22775 22776 22777 22778 22779 22780 22781 22782 22783 22784 22785 22786 22787 22788 22789 22790 22791 22792 22793 22794 22795 22796 22797 22798 22799 22800 22801 22802 22803 22804 22805 22806 22807 22808 22809 22810 22811 22812 22813 22814 22815 22816 22817 22818 22819 22820 22821 22822 22823 22824 22825 22826 22827 22828 22829 22830 22831 22832 22833 22834 22835 22836 22837 22838 22839 22840 22841 22842 22843 22844 22845 22846 22847 22848 22849 22850 22851 22852 22853 22854 22855 22856 22857 22858 22859 22860 22861 22862 22863 22864 22865 22866 22867 22868 22869 22870 22871 22872 22873 22874 22875 22876 22877 22878 22879 22880 22881 22882 22883 22884 22885 22886 22887 22888 22889 22890 22891 22892 22893 22894 22895 22896 22897 22898 22899 22900 22901 22902 22903 22904 22905 22906 22907 22908 22909 22910 22911 22912 22913 22914 22915 22916 22917 22918 22919 22920 22921 22922 22923 22924 22925 22926 22927 22928 22929 22930 22931 22932 22933 22934 22935 22936 22937 22938 22939 22940 22941 22942 22943 22944 22945 22946 22947 22948 22949 22950 22951 22952 22953 22954 22955 22956 22957 22958 22959 22960 22961 22962 22963 22964 22965 22966 22967 22968 22969 22970 22971 22972 22973 22974 22975 22976 22977 22978 22979 22980 22981 22982 22983 22984 22985 22986 22987 22988 22989 22990 22991 22992 22993 22994 22995 22996 22997 22998 22999 23000 23001 23002 23003 23004 23005 23006 23007 23008 23009 23010 23011 23012 23013 23014 23015 23016 23017 23018 23019 23020 23021 23022 23023 23024 23025 23026 23027 23028 23029 23030 23031 23032 23033 23034 23035 23036 23037 23038 23039 23040 23041 23042 23043 23044 23045 23046 23047 23048 23049 23050 23051 23052 23053 23054 23055 23056 23057 23058 23059 23060 23061 23062 23063 23064 23065 23066 23067 23068 23069 23070 23071 23072 23073 23074 23075 23076 23077 23078 23079 23080 23081 23082 23083 23084 23085 23086 23087 23088 23089 23090 23091 23092 23093 23094 23095 23096 23097 23098 23099 23100 23101 23102 23103 23104 23105 23106 23107 23108 23109 23110 23111 23112 23113 23114 23115 23116 23117 23118 23119 23120 23121 23122 23123 23124 23125 23126 23127 23128 23129 23130 23131 23132 23133 23134 23135 23136 23137 23138 23139 23140 23141 23142 23143 23144 23145 23146 23147 23148 23149 23150 23151 23152 23153 23154 23155 23156 23157 23158 23159 23160 23161 23162 23163 23164 23165 23166 23167 23168 23169 23170 23171 23172 23173 23174 23175 23176 23177 23178 23179 23180 23181 23182 23183 23184 23185 23186 23187 23188 23189 23190 23191 23192 23193 23194 23195 23196 23197 23198 23199 23200 23201 23202 23203 23204 23205 23206 23207 23208 23209 23210 23211 23212 23213 23214 23215 23216 23217 23218 23219 23220 23221 23222 23223 23224 23225 23226 23227 23228 23229 23230 23231 23232 23233 23234 23235 23236 23237 23238 23239 23240 23241 23242 23243 23244 23245 23246 23247 23248 23249 23250 23251 23252 23253 23254 23255 23256 23257 23258 23259 23260 23261 23262 23263 23264 23265 23266 23267 23268 23269 23270 23271 23272 23273 23274 23275 23276 23277 23278 23279 23280 23281 23282 23283 23284 23285 23286 23287 23288 23289 23290 23291 23292 23293 23294 23295 23296 23297 23298 23299 23300 23301 23302 23303 23304 23305 23306 23307 23308 23309 23310 23311 23312 23313 23314 23315 23316 23317 23318 23319 23320 23321 23322 23323 23324 23325 23326 23327 23328 23329 23330 23331 23332 23333 23334 23335 23336 23337 23338 23339 23340 23341 23342 23343 23344 23345 23346 23347 23348 23349 23350 23351 23352 23353 23354 23355 23356 23357 23358 23359 23360 23361 23362 23363 23364 23365 23366 23367 23368 23369 23370 23371 23372 23373 23374 23375 23376 23377 23378 23379 23380 23381 23382 23383 23384 23385 23386 23387 23388 23389 23390 23391 23392 23393 23394 23395 23396 23397 23398 23399 23400 23401 23402 23403 23404 23405 23406 23407 23408 23409 23410 23411 23412 23413 23414 23415 23416 23417 23418 23419 23420 23421 23422 23423 23424 23425 23426 23427 23428 23429 23430 23431 23432 23433 23434 23435 23436 23437 23438 23439 23440 23441 23442 23443 23444 23445 23446 23447 23448 23449 23450 23451 23452 23453 23454 23455 23456 23457 23458 23459 23460 23461 23462 23463 23464 23465 23466 23467 23468 23469 23470 23471 23472 23473 23474 23475 23476 23477 23478 23479 23480 23481 23482 23483 23484 23485 23486 23487 23488 23489 23490 23491 23492 23493 23494 23495 23496 23497 23498 23499 23500 23501 23502 23503 23504 23505 23506 23507 23508 23509 23510 23511 23512 23513 23514 23515 23516 23517 23518 23519 23520 23521 23522 23523 23524 23525 23526 23527 23528 23529 23530 23531 23532 23533 23534 23535 23536 23537 23538 23539 23540 23541 23542 23543 23544 23545 23546 23547 23548 23549 23550 23551 23552 23553 23554 23555 23556 23557 23558 23559 23560 23561 23562 23563 23564 23565 23566 23567 23568 23569 23570 23571 23572 23573 23574 23575 23576 23577 23578 23579 23580 23581 23582 23583 23584 23585 23586 23587 23588 23589 23590 23591 23592 23593 23594 23595 23596 23597 23598 23599 23600 23601 23602 23603 23604 23605 23606 23607 23608 23609 23610 23611 23612 23613 23614 23615 23616 23617 23618 23619 23620 23621 23622 23623 23624 23625 23626 23627 23628 23629 23630 23631 23632 23633 23634 23635 23636 23637 23638 23639 23640 23641 23642 23643 23644 23645 23646 23647 23648 23649 23650 23651 23652 23653 23654 23655 23656 23657 23658 23659 23660 23661 23662 23663 23664 23665 23666 23667 23668 23669 23670 23671 23672 23673 23674 23675 23676 23677 23678 23679 23680 23681 23682 23683 23684 23685 23686 23687 23688 23689 23690 23691 23692 23693 23694 23695 23696 23697 23698 23699 23700 23701 23702 23703 23704 23705 23706 23707 23708 23709 23710 23711 23712 23713 23714 23715 23716 23717 23718 23719 23720 23721 23722 23723 23724 23725 23726 23727 23728 23729 23730 23731 23732 23733 23734 23735 23736 23737 23738 23739 23740 23741 23742 23743 23744 23745 23746 23747 23748 23749 23750 23751 23752 23753 23754 23755 23756 23757 23758 23759 23760 23761 23762 23763 23764 23765 23766 23767 23768 23769 23770 23771 23772 23773 23774 23775 23776 23777 23778 23779 23780 23781 23782 23783 23784 23785 23786 23787 23788 23789 23790 23791 23792 23793 23794 23795 23796 23797 23798 23799 23800 23801 23802 23803 23804 23805 23806 23807 23808 23809 23810 23811 23812 23813 23814 23815 23816 23817 23818 23819 23820 23821 23822 23823 23824 23825 23826 23827 23828 23829 23830 23831 23832 23833 23834 23835 23836 23837 23838 23839 23840 23841 23842 23843 23844 23845 23846 23847 23848 23849 23850 23851 23852 23853 23854 23855 23856 23857 23858 23859 23860 23861 23862 23863 23864 23865 23866 23867 23868 23869 23870 23871 23872 23873 23874 23875 23876 23877 23878 23879 23880 23881 23882 23883 23884 23885 23886 23887 23888 23889 23890 23891 23892 23893 23894 23895 23896 23897 23898 23899 23900 23901 23902 23903 23904 23905 23906 23907 23908 23909 23910 23911 23912 23913 23914 23915 23916 23917 23918 23919 23920 23921 23922 23923 23924 23925 23926 23927 23928 23929 23930 23931 23932 23933 23934 23935 23936 23937 23938 23939 23940 23941 23942 23943 23944 23945 23946 23947 23948 23949 23950 23951 23952 23953 23954 23955 23956 23957 23958 23959 23960 23961 23962 23963 23964 23965 23966 23967 23968 23969 23970 23971 23972 23973 23974 23975 23976 23977 23978 23979 23980 23981 23982 23983 23984 23985 23986 23987 23988 23989 23990 23991 23992 23993 23994 23995 23996 23997 23998 23999 24000 24001 24002 24003 24004 24005 24006 24007 24008 24009 24010 24011 24012 24013 24014 24015 24016 24017 24018 24019 24020 24021 24022 24023 24024 24025 24026 24027 24028 24029 24030 24031 24032 24033 24034 24035 24036 24037 24038 24039 24040 24041 24042 24043 24044 24045 24046 24047 24048 24049 24050 24051 24052 24053 24054 24055 24056 24057 24058 24059 24060 24061 24062 24063 24064 24065 24066 24067 24068 24069 24070 24071 24072 24073 24074 24075 24076 24077 24078 24079 24080 24081 24082 24083 24084 24085 24086 24087 24088 24089 24090 24091 24092 24093 24094 24095 24096 24097 24098 24099 24100 24101 24102 24103 24104 24105 24106 24107 24108 24109 24110 24111 24112 24113 24114 24115 24116 24117 24118 24119 24120 24121 24122 24123 24124 24125 24126 24127 24128 24129 24130 24131 24132 24133 24134 24135 24136 24137 24138 24139 24140 24141 24142 24143 24144 24145 24146 24147 24148 24149 24150 24151 24152 24153 24154 24155 24156 24157 24158 24159 24160 24161 24162 24163 24164 24165 24166 24167 24168 24169 24170 24171 24172 24173 24174 24175 24176 24177 24178 24179 24180 24181 24182 24183 24184 24185 24186 24187 24188 24189 24190 24191 24192 24193 24194 24195 24196 24197 24198 24199 24200 24201 24202 24203 24204 24205 24206 24207 24208 24209 24210 24211 24212 24213 24214 24215 24216 24217 24218 24219 24220 24221 24222 24223 24224 24225 24226 24227 24228 24229 24230 24231 24232 24233 24234 24235 24236 24237 24238 24239 24240 24241 24242 24243 24244 24245 24246 24247 24248 24249 24250 24251 24252 24253 24254 24255 24256 24257 24258 24259 24260 24261 24262 24263 24264 24265 24266 24267 24268 24269 24270 24271 24272 24273 24274 24275 24276 24277 24278 24279 24280 24281 24282 24283 24284 24285 24286 24287 24288 24289 24290 24291 24292 24293 24294 24295 24296 24297 24298 24299 24300 24301 24302 24303 24304 24305 24306 24307 24308 24309 24310 24311 24312 24313 24314 24315 24316 24317 24318 24319 24320 24321 24322 24323 24324 24325 24326 24327 24328 24329 24330 24331 24332 24333 24334 24335 24336 24337 24338 24339 24340 24341 24342 24343 24344 24345 24346 24347 24348 24349 24350 24351 24352 24353 24354 24355 24356 24357 24358 24359 24360 24361 24362 24363 24364 24365 24366 24367 24368 24369 24370 24371 24372 24373 24374 24375 24376 24377 24378 24379 24380 24381 24382 24383 24384 24385 24386 24387 24388 24389 24390 24391 24392 24393 24394 24395 24396 24397 24398 24399 24400 24401 24402 24403 24404 24405 24406 24407 24408 24409 24410 24411 24412 24413 24414 24415 24416 24417 24418 24419 24420 24421 24422 24423 24424 24425 24426 24427 24428 24429 24430 24431 24432 24433 24434 24435 24436 24437 24438 24439 24440 24441 24442 24443 24444 24445 24446 24447 24448 24449 24450 24451 24452 24453 24454 24455 24456 24457 24458 24459 24460 24461 24462 24463 24464 24465 24466 24467 24468 24469 24470 24471 24472 24473 24474 24475 24476 24477 24478 24479 24480 24481 24482 24483 24484 24485 24486 24487 24488 24489 24490 24491 24492 24493 24494 24495 24496 24497 24498 24499 24500 24501 24502 24503 24504 24505 24506 24507 24508 24509 24510 24511 24512 24513 24514 24515 24516 24517 24518 24519 24520 24521 24522 24523 24524 24525 24526 24527 24528 24529 24530 24531 24532 24533 24534 24535 24536 24537 24538 24539 24540 24541 24542 24543 24544 24545 24546 24547 24548 24549 24550 24551 24552 24553 24554 24555 24556 24557 24558 24559 24560 24561 24562 24563 24564 24565 24566 24567 24568 24569 24570 24571 24572 24573 24574 24575 24576 24577 24578 24579 24580 24581 24582 24583 24584 24585 24586 24587 24588 24589 24590 24591 24592 24593 24594 24595 24596 24597 24598 24599 24600 24601 24602 24603 24604 24605 24606 24607 24608 24609 24610 24611 24612 24613 24614 24615 24616
|
/*
*class++
* Name:
* Mapping
* Purpose:
* Inter-relate two coordinate systems.
* Constructor Function:
* None.
* Description:
* This class provides the basic facilities for transforming a set
* of coordinates (representing "input" points) to give a new set
* of coordinates (representing "output" points). It is used to
* describe the relationship which exists between two different
* coordinate systems and to implement operations which make use of
* this (such as transforming coordinates and resampling grids of
* data). However, the Mapping class does not have a constructor
* function of its own, as it is simply a container class for a
* family of specialised Mappings which implement particular types
* of coordinate transformation.
* Inheritance:
* The Mapping class inherits from the Object class.
* Attributes:
* In addition to those attributes common to all Objects, every
* Mapping also has the following attributes:
*
* - Invert: Mapping inversion flag
* - IsLinear: Is the Mapping linear?
* - IsSimple: Has the Mapping been simplified?
* - Nin: Number of input coordinates for a Mapping
* - Nout: Number of output coordinates for a Mapping
* - Report: Report transformed coordinates?
* - TranForward: Forward transformation defined?
* - TranInverse: Inverse transformation defined?
* Functions:
c In addition to those functions applicable to all Objects, the
c following functions may also be applied to all Mappings:
f In addition to those routines applicable to all Objects, the
f following routines may also be applied to all Mappings:
*
c - astDecompose: Decompose a Mapping into two component Mappings
c - astTranGrid: Transform a grid of positions
c - astInvert: Invert a Mapping
c - astLinearApprox: Calculate a linear approximation to a Mapping
c - astMapBox: Find a bounding box for a Mapping
c - astMapSplit: Split a Mapping up into parallel component Mappings
c - astQuadApprox: Calculate a quadratic approximation to a 2D Mapping
c - astRate: Calculate the rate of change of a Mapping output
c - astRebin<X>: Rebin a region of a data grid
c - astRebinSeq<X>: Rebin a region of a sequence of data grids
c - astResample<X>: Resample a region of a data grid
c - astRemoveRegions: Remove any Regions from a Mapping
c - astSimplify: Simplify a Mapping
c - astTran1: Transform 1-dimensional coordinates
c - astTran2: Transform 2-dimensional coordinates
c - astTranN: Transform N-dimensional coordinates
c - astTranP: Transform N-dimensional coordinates held in separate arrays
f - AST_DECOMPOSE: Decompose a Mapping into two component Mappings
f - AST_TRANGRID: Transform a grid of positions
f - AST_INVERT: Invert a Mapping
f - AST_LINEARAPPROX: Calculate a linear approximation to a Mapping
f - AST_QUADAPPROX: Calculate a quadratic approximation to a 2D Mapping
f - AST_MAPBOX: Find a bounding box for a Mapping
f - AST_MAPSPLIT: Split a Mapping up into parallel component Mappings
f - AST_RATE: Calculate the rate of change of a Mapping output
f - AST_REBIN<X>: Rebin a region of a data grid
f - AST_REBINSEQ<X>: Rebin a region of a sequence of data grids
f - AST_REMOVEREGIONS: Remove any Regions from a Mapping
f - AST_RESAMPLE<X>: Resample a region of a data grid
f - AST_SIMPLIFY: Simplify a Mapping
f - AST_TRAN1: Transform 1-dimensional coordinates
f - AST_TRAN2: Transform 2-dimensional coordinates
f - AST_TRANN: Transform N-dimensional coordinates
* Copyright:
* Copyright (C) 1997-2006 Council for the Central Laboratory of the
* Research Councils
* Licence:
* This program is free software: you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation, either
* version 3 of the License, or (at your option) any later
* version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General
* License along with this program. If not, see
* <http://www.gnu.org/licenses/>.
* Authors:
* RFWS: R.F. Warren-Smith (Starlink)
* MBT: Mark Taylor (Starlink)
* DSB: David S. Berry (Starlink)
* History:
* 1-FEB-1996 (RFWS):
* Original version.
* 29-FEB-1996 (RFWS):
* Minor improvements to error messages.
* 15-JUL-1996 (RFWS):
* Support external interface.
* 13-DEC-1996 (RFWS):
* Added the astMapMerge method.
* 13-DEC-1996 (RFWS):
* Added the astSimplify method.
* 27-MAY-1997 (RFWS):
* Improved the astSimplify method to use astMapMerge to
* simplify a single Mapping where possible.
* 29-MAY-1998 (RFWS):
* Added the MapBox method.
* 13-NOV-1998 (RFWS):
* Made default MapBox convergence accuracy larger (i.e. less
* accurate).
* 10-DEC-1998 (RFWS):
* First useful implementation of astResample<X>.
* 16-AUG-1999 (RFWS):
* Fixed bug in SpecialBounds - wrong number of coordinates being used
* when checking for bad output coordinate values.
* 17-AUG-1999 (RFWS):
* Improved the convergence security of MapBox (return to older but
* less efficient setting).
* 24-NOV-2000 (MBT):
* Fixed bug (function being invoked as wrong type) in AST__UINTERP
* scheme, and added new AST__BLOCKAVE scheme, in astResample<X>.
* 9-JAN-2001 (DSB):
* Changed in and out arguments for TranN from type "double (*)[]"
* to "double *".
* 8-JAN-2003 (DSB):
* Changed private InitVtab method to protected astInitMappingVtab
* method.
* 10-JUL-2003 (DSB):
* Added method astRate.
* 2-SEP-2004 (DSB):
* Free resources before leaving astRate.
* 31-AUG-2004 (DSB):
* Make the LinearApprox function protected rather than private,
* rename it to astLinearApprox, and make the bounds parameters of
* type double rather than int. Also, correct the size of the fit
* coefficient array (was "(nin+1)*nout", now is "(nout+1)*nin").
* Also correct the index of the first gradient coefficient from
* "fit+nout" to "fit+nin". These errors have probably never been
* noticed because they make no difference if nin=nout, which is
* usually the case.
* 6-SEP-2004 (DSB):
* Make astRate more robust by adding checks for unusal conditions.
* 20-SEP-2004 (DSB):
* Make the LinearApprox function public and change its interface
* to be more appropriate for public use. This involved swapping the
* direction of the fit (the original astLinearApprox fitted the
* inverse transformation, but the public version now fits the forwrd
* transformation).
* 4-OCT-2004 (DSB):
* Modify astMapList to return flag indicating presence of inverted
* CmpMaps in supplied Mapping.
* 9-NOV-2004 (DSB):
* Override astEqual method.
* 6-DEC-2004 (DSB):
* Remove the second derivative estimate from the astRate function
* since CmpMap has trouble calculating it.
* 17-DEC-2004 (DSB):
* Added astMapSplit
* 22-APR-2005 (DSB):
* Modified SpecialBounds to handle cases where some irrelevant
* output always produces bad values (e.g. a PermMap may do this).
* 30-JUN-2005 (DSB):
* Added astRebin.
* 7-JUL-2005 (DSB):
* Make MapSplit public rather than protected.
* 11-AUG-2005 (DSB):
* Added the AST__CONSERVEFLUX flag (used by astResampleX).
* 17-AUG-2005 (DSB):
* Added the AST__SOMBCOS kernel.
* 31-AUG-2005 (DSB):
* Added astRebinSeq.
* 9-SEP-2005 (DSB):
* Corrected axis indices returned by public interface for astMapSplit.
* 31-JAN-2006 (DSB):
* Added IsSimple attribute.
* 2-FEB-2006 (DSB):
* Corrections to prologue of astLinearApprox.
* 16-FEB-2006 (DSB):
* Some speed optimisations to rebinning code.
* 2-MAR-2006 (DSB):
* Use HAVE_LONG_DOUBLE in place of AST_LONG_DOUBLE
* 7-MAR-2006 (DSB):
* Added astTranGrid.
* 14-MAR-2006 (DSB):
* - The constructor no longer reports an error if the resulting
* Mapping cannot transform points in either direction. This is
* because it may be possible to simplify such a Mapping and the
* simplified Mapping may have defined transformations. E.g. if a
* Mapping which has only a forward transformation is combined in
* series with its own inverse, the combination CmpMap will simplify
* to a UnitMap (usually).
* - Reset the "issimple" flag when the Invert flag is changed.
* 9-MAY-2006 (DSB):
* Correct upper bounds for idim in RebinWithblocking. Also, remove
* the single precision "F" instantiation of the MAKE_REBINSEQ macro.
* Also correct the "nout = astGetNin" line in the MAKE_REBINSEQ
* macro to "nout = astGetNout".
* 12-MAY-2006 (DSB):
* Modify SpecialBounds to include points slightly inside the
* corners. This is because some Mappings may have singularies at
* the the edges.
* 17-MAY-2006 (DSB):
* Correct the "nout = astGetNin" line in the MAKE_RESAMPLE
* and MAKE_REBIN macros to "nout = astGetNout".
* 7-JUL-2006 (DSB):
* Change -CHAR_MAX value (used as a "not set" value for boolean
* attributes) to +CHAR_MAX, since some compilers do not allow
* chars to have negative values.
* 23-AUG-2006 (DSB):
* Change the Equal function so that it reports an error when
* called, rather than using astSimplify to determine if two Mappings
* are equal. All concrete Mapping classes should now provide
* their own implementation of astEqual, avoiding the use of
* astSimplify. This is so that astSimplify can use astEqual safely
* (i.e. without danger of entering an infinite loop).
* 24-NOV-2006 (DSB):
* Allow astRebinSeq to be called with a NULL pointer for the input
* data array.
* 14-MAR-2007 (DSB):
* Modify astRebinSeq to allow input variances to be used as weights.
* 19-MAR-2007 (DSB):
* Fix bug in LINEAR_2D macro that caused bad input pixel values to be
* treated as good.
* 16-APR-2007 (DSB):
* Account for reduction in number of degrees of freedom when
* calculating output variances on the basis of spread of input values in
* astReinSeq.
* 28-APR-2007 (DSB):
* Correct code within Rebin... and Resample... functions that provides
* optimal handling for 1- and 2- dimensional mappings. Previously, the
* check for whether or not to use these optimisations was based only on
* the dimensionality of either input (Rebin) or output (Resample). This
* could cause the optimised code to be used at inappropriate times,
* leading to an incorrect effective Mapping between input and output. The
* checks now check both input and output dimensionality in all cases.
* 3-MAY-2007 (DSB):
* An extra parameter ("nused") has been added to astRebinSeq, and
* all the rebinning stuff has been modified to keep "nused" up to date.
* This is needed to correct a fault in the generation of GENVAR
* variances.
* 12-DEC-2007 (DSB):
* Some rebinning kernels (e.g. SINCSINC) have negative values and
* can result in overall negative output weights. Therefore do not
* set output pixels with negative weights bad.
* 6-MAR-2008 (DSB):
* Add an option for astResample to leave unchanged any output pixels
* for which an interpolated value cannot be obtained. This is
* controlled by the new AST__NOBAD flag.
* 7-MAY-2008 (DSB):
* Clarified meaning of AST__GENVAR, AST__USEVAR and AST__VARWGT flags
* in astRebinSeq.
* 9-MAY-2008 (DSB):
* Prevent memory over-run in RebinSeq<X>.
* 5-MAY-2009 (DSB):
* Added astRemoveRegions.
* 11-NOV-2009 (DSB):
* In astRebinSeq initialise "*nused" to zero (as documented) if the
* AST__REBININIT flag is supplied.
* 17-NOV-2009 (DSB):
* Added AST_DISVAR flag for use with astRebinSeq.
* 15-DEC-2009 (DSB):
* Ensure that all axes span at least one pixel when calling
* astLinearApprox.
* 18-DEC-2009 (DSB):
* When using a 1D spreading kernel (in astRebin(Seq)), if the kernel
* is not contained completely within the output array, reflect the
* section of the kernel that falls outside the output array back into
* the output array so that no flux is lost. Also discovered that the
* n-D code (i.e. the KERNEL_ND macro) incorrectly uses the first
* user-supplied parameter as the full kernel width rather than the
* half-width. This has been fixed.
* 26-FEB-2010 (DSB):
* Add astQuadApprox.
* 27-FEB-2010 (DSB):
* - Make astQuadApprox faster, and fix a bug in the calculation of
* the matrix.
* 7-JUN-2010 (DSB):
* In the KERNEL_<x>D rebinning macros, correct the test for the
* central point being outside the bounds of the output image.
* 13-AUG-2010 (DSB):
* In astRebinSeq<X>, scale WLIM to take account of weighting by
* input variances.
* 13-DEC-2010 (DSB):
* Ensure that astMapSplit returns a Mapping that is independent of
* the supplied Mapping (i.e. return a deep copy). This means that
* subsequent changes to the supplied Mapping cannot affect the returned
* Mapping.
* 10-FEB-2011 (DSB):
* When rebinning (in macros NEAR_1/2/ND, KERNEL_1/2/ND, LINEAR_1/2/ND),
* do not treat a zero variance as bad unless the reciprocals of the
* variances are being used as weights.
* 16-JUN-2011 (DSB):
* Allow a check for NaNs to be performed as a debugging tool after
* every invocation of astTransform. This is controlled by the
* AST_REPLACE_NAN environment variable: if unset, no check is
* performed, if set to "1" NaNs are changed to AST__BAD but no
* error is reported, if set to anything else NaNs are changed to
* AST__BAD and an error is reported.
* 6-JUL-2012 (DSB):
* The astRebinSeq<X> family was normalising the returned data and
* variances values incorrectly, when the AST__REBINEND flag was
* supplied. The exact size of the error depended on the nature of
* the Mapping and the spreading method, and so is hard to predict.
* 20-JUL-2012 (DSB):
* Major re-structuring of astRebinSeq<X> to add further
* corrections to the normalisation. The model is now that each
* input array is first rebinned and then scaled to preserve the
* total data sum, and then each final output pixel is the weighed
* mean of all the aligned rebinned pixels.
* 13-AUG-2012 (DSB):
* Added AST__NONORM flag for asstRebuinSeq<X>.
* 30-AUG_2012 (DSB):
* Added AST__CONSERVEFLUX flag for astRebinSeq<X>.
* 10-SEP-2012 (DSB):
* Cater for Mappings that have different numbers of inputs and
* outputs when finding the flux conservation factor within
* astRebinSeq and astResample.
* 1-OCT-2012 (DSB):
* Ensure astRebinSeq<X> does not create any negative output
* variances.
* 2-OCT-2012 (DSB):
* - Check for Infs as well as NaNs.
* - In Rate, break out of the loop if the RMS is very small, not
* just if it is exactly zero.
* 5-OCT-2012 (DSB):
* Complete re-write of Rate. It's now much simpler, faster and
* more reliable.
* 16-OCT-2012 (DSB):
* In MatrixDet, ignore rows/columns filled with AST_BAD as well as
* rows/columns filled with zeros.
* 26-APR-2013 (DSB):
* Change the "nused" parameter of astRebinSeq<X> from "int *" to
* "size_t *" to allow greater amounts of data to be pasted into
* the output array.
* 29-APR-2013 (DSB):
* No sot simplify Mappings that have a set value for their Ident
* attribute. If an Ident value has been set then it means that we
* should be trying to preserve the identify of the Mapping. This
* is implemented via a new protected method (astDoNotSimplify) which
* is overridden by the Frame class so that this restriction applies
* only to genuine Mappings, not Frames.
* 9-MAY-2013 (DSB):
* Change the "nused" parameter of astRebinSeq<X> from "size_t *" to
* "int64_t *" to cater for systems where "size_t" is only 32 bits long.
* 20-MAY-2013 (DSB):
* Always perform a linear fit in RebinAdaptively if flux
* conservation is requested.
* 18-JUL-2013 (DSB):
* Correct logic for determining whether to divide or not in
* RebinAdaptively. The old logic could lead to infinite recursion.
* 1-SEP-2014 (DSB):
* Modify astLinearAPprox to avoid using regularly placed
* test points, as such regular placement may result in
* non-representative behaviour.
* 25-SEP-2014 (DSB):
* Add support for B and UB data types to astRebin and astRebinSeq.
* 23-OCT-2014 (DSB):
* Report an error if arrays have too many pixels to count in a 32
* bit int (astTranGrid, astResample, astRebin and astRebinSeq).
* 23-APR-2015 (DSB):
* Use one bit of this->flags to store the "IsSimple" attribute
* rather using a whole char (this->issimple).
*class--
*/
/* Module Macros. */
/* ============== */
/* Set the name of the class we are implementing. This indicates to the header
files that define class interfaces that they should make "protected"
symbols available. */
#define astCLASS Mapping
/* Define numerical constants for use in thie module. */
#define GETATTRIB_BUFF_LEN 50
#define RATEFUN_MAX_CACHE 5
#define RATE_ORDER 8
/* Include files. */
/* ============== */
/* Configuration results */
/* ---------------------- */
#if HAVE_CONFIG_H
#include <config.h>
#endif
/* Interface definitions. */
/* ---------------------- */
#include "globals.h" /* Thread-safe global data access */
#include "error.h" /* Error reporting facilities */
#include "memory.h" /* Memory allocation facilities */
#include "object.h" /* Base Object class */
#include "pointset.h" /* Sets of points/coordinates */
#include "channel.h" /* I/O channels */
#include "mapping.h" /* Interface definition for this class */
#include "cmpmap.h" /* Compund Mappings */
#include "unitmap.h" /* Unit Mappings */
#include "permmap.h" /* Axis permutations */
#include "winmap.h" /* Window scalings */
#include "pal.h" /* SLALIB interface */
#include "globals.h" /* Thread-safe global data access */
/* Error code definitions. */
/* ----------------------- */
#include "ast_err.h" /* AST error codes */
/* C header files. */
/* --------------- */
#include <float.h>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
/* Module type definitions. */
/* ======================== */
/* Enum to represent the data type when resampling a grid of data. */
typedef enum DataType {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
TYPE_LD,
#endif
TYPE_D,
TYPE_F,
TYPE_L,
TYPE_UL,
TYPE_K,
TYPE_UK,
TYPE_I,
TYPE_UI,
TYPE_S,
TYPE_US,
TYPE_B,
TYPE_UB
} DataType;
/* Data structure to hold information about a Mapping for use by
optimisation algorithms. */
typedef struct MapData {
AstMapping *mapping; /* Pointer to the Mapping */
AstPointSet *pset_in; /* Pointer to input PointSet */
AstPointSet *pset_out; /* Pointer to output PointSet */
double *lbnd; /* Pointer to lower constraints on input */
double *ubnd; /* Pointer to upper constraints on input */
double **ptr_in; /* Pointer to input PointSet coordinates */
double **ptr_out; /* Pointer to output PointSet coordinates */
int coord; /* Index of output coordinate to optimise */
int forward; /* Use forward transformation? */
int negate; /* Negate the output value? */
int nin; /* Number of input coordinates per point */
int nout; /* Number of output coordinates per point */
} MapData;
/* Convert from floating point to floating point or integer */
#define CONV(IntType,val) ( ( IntType ) ? (int) ( (val) + (((val)>0)?0.5:-0.5) ) : (val) )
/* Module Variables. */
/* ================= */
/* Address of this static variable is used as a unique identifier for
member of this class. */
static int class_check;
/* Pointers to parent class methods which are extended by this class. */
static const char *(* parent_getattrib)( AstObject *, const char *, int * );
static int (* parent_testattrib)( AstObject *, const char *, int * );
static void (* parent_clearattrib)( AstObject *, const char *, int * );
static void (* parent_setattrib)( AstObject *, const char *, int * );
static int (* parent_equal)( AstObject *, AstObject *, int * );
/* Define macros for accessing each item of thread specific global data. */
#ifdef THREAD_SAFE
/* Define how to initialise thread-specific globals. */
#define GLOBAL_inits \
globals->Class_Init = 0; \
globals->GetAttrib_Buff[ 0 ] = 0; \
globals->Unsimplified_Mapping = NULL; \
globals->Rate_Disabled = 0;
/* Create the function that initialises global data for this module. */
astMAKE_INITGLOBALS(Mapping)
/* Define macros for accessing each item of thread specific global data. */
#define class_init astGLOBAL(Mapping,Class_Init)
#define class_vtab astGLOBAL(Mapping,Class_Vtab)
#define getattrib_buff astGLOBAL(Mapping,GetAttrib_Buff)
#define unsimplified_mapping astGLOBAL(Mapping,Unsimplified_Mapping)
#define rate_disabled astGLOBAL(Mapping,Rate_Disabled)
#define ratefun_pset1_cache astGLOBAL(Mapping,RateFun_Pset1_Cache)
#define ratefun_pset2_cache astGLOBAL(Mapping,RateFun_Pset2_Cache)
#define ratefun_next_slot astGLOBAL(Mapping,RateFun_Next_Slot)
#define ratefun_pset_size astGLOBAL(Mapping,RateFun_Pset_Size)
/* If thread safety is not needed, declare and initialise globals at static
variables. */
#else
/* Buffer returned by GetAttrib. */
static char getattrib_buff[ GETATTRIB_BUFF_LEN + 1 ];
/* Pointer to origin (unsimplified) Mapping, only used for reporting
error messages. */
static AstMapping *unsimplified_mapping = NULL;
/* A flag which indicates if the astRate method should be disabled in
order to improve algorithm speed in cases where the rate value is not
significant. If astRate is disabled then it always returns a constant
value of 1.0. */
static int rate_disabled = 0;
/* static values used in function "RateFun". */
static AstPointSet *ratefun_pset1_cache[ RATEFUN_MAX_CACHE ];
static AstPointSet *ratefun_pset2_cache[ RATEFUN_MAX_CACHE ];
static int ratefun_next_slot;
static int ratefun_pset_size[ RATEFUN_MAX_CACHE ];
/* Define the class virtual function table and its initialisation flag
as static variables. */
static AstMappingVtab class_vtab; /* Virtual function table */
static int class_init = 0; /* Virtual function table initialised? */
#endif
/* Prototypes for private member functions. */
/* ======================================== */
#define DECLARE_GENERIC(X,Xtype) \
static int InterpolateKernel1##X( AstMapping *, int, const int *, const int *, \
const Xtype *, const Xtype *, int, \
const int *, const double *const *, \
void (*)( double, const double *, int, \
double *, int * ), \
void (*)( double, const double *, int, \
double * ), \
int, const double *, int, Xtype, \
Xtype *, Xtype *, int * );\
\
static int InterpolateLinear##X( int, const int *, const int *, const Xtype *, \
const Xtype *, int, const int *, \
const double *const *, int, Xtype, Xtype *, \
Xtype *, int * ); \
\
static int InterpolateNearest##X( int, const int *, const int *, const Xtype *, \
const Xtype *, int, const int *, \
const double *const *, int, Xtype, Xtype *, \
Xtype *, int * ); \
\
static int Resample##X( AstMapping *, int, const int [], const int [], \
const Xtype [], const Xtype [], int, \
void (*)( void ), const double [], int, double, int, \
Xtype, int, const int [], const int [], \
const int [], const int [], Xtype [], Xtype [], int * ); \
\
static void ConserveFlux##X( double, int, const int *, Xtype, Xtype *, Xtype *, \
int * ); \
\
static void InterpolateBlockAverage##X( int, const int[], const int[], \
const Xtype [], const Xtype [], int, const int[], \
const double *const[], const double[], int, \
Xtype, Xtype *, Xtype *, int * );
DECLARE_GENERIC(B,signed char)
DECLARE_GENERIC(D,double)
DECLARE_GENERIC(F,float)
DECLARE_GENERIC(I,int)
DECLARE_GENERIC(K,INT_BIG)
DECLARE_GENERIC(L,long int)
DECLARE_GENERIC(S,short int)
DECLARE_GENERIC(UB,unsigned char)
DECLARE_GENERIC(UI,unsigned int)
DECLARE_GENERIC(UK,UINT_BIG)
DECLARE_GENERIC(UL,unsigned long int)
DECLARE_GENERIC(US,unsigned short int)
#if HAVE_LONG_DOUBLE /* Not normally implemented */
DECLARE_GENERIC(LD,long double)
#endif
#undef DECLARE_GENERIC
#define DECLARE_GENERIC(X,Xtype) \
static void Rebin##X( AstMapping *, double, int, const int [], const int [], \
const Xtype [], const Xtype [], int, const double [], int, \
double, int, Xtype, int, const int [], const int [], \
const int [], const int [], Xtype [], Xtype [], int * ); \
\
static void RebinSeq##X( AstMapping *, double, int, const int [], const int [], \
const Xtype [], const Xtype [], int, const double [], \
int, double, int, Xtype, int, const int [], \
const int [], const int [], const int [], Xtype [], \
Xtype [], double [], int64_t *, int * ); \
\
static void SpreadKernel1##X( AstMapping *, int, const int *, const int *, \
const Xtype *, const Xtype *, double, int, const int *, \
const double *const *, \
void (*)( double, const double *, int, double *, int * ), \
int, const double *, int, Xtype, int, Xtype *, \
Xtype *, double *, int64_t *, int * ); \
\
static void SpreadLinear##X( int, const int *, const int *, const Xtype *, \
const Xtype *, double, int, const int *, const double *const *, \
int, Xtype, int, Xtype *, Xtype *, double *, int64_t *, \
int * ); \
\
static void SpreadNearest##X( int, const int *, const int *, const Xtype *, \
const Xtype *, double, int, const int *, const double *const *, \
int, Xtype, int, Xtype *, Xtype *, double *, \
int64_t *, int * );
DECLARE_GENERIC(D,double)
DECLARE_GENERIC(F,float)
DECLARE_GENERIC(I,int)
DECLARE_GENERIC(UB,unsigned char)
DECLARE_GENERIC(B,signed char)
#if HAVE_LONG_DOUBLE /* Not normally implemented */
DECLARE_GENERIC(LD,long double)
#endif
#undef DECLARE_GENERIC
static AstMapping *RemoveRegions( AstMapping *, int * );
static AstMapping *Simplify( AstMapping *, int * );
static AstPointSet *Transform( AstMapping *, AstPointSet *, int, AstPointSet *, int * );
static const char *GetAttrib( AstObject *, const char *, int * );
static double FindGradient( AstMapping *, double *, int, int, double, double, double *, int * );
static double J1Bessel( double, int * );
static double LocalMaximum( const MapData *, double, double, double [], int * );
static double MapFunction( const MapData *, const double [], int *, int * );
static double MatrixDet( int, int, const double *, int * );
static double MaxD( double, double, int * );
static double NewVertex( const MapData *, int, double, double [], double [], int *, double [], int * );
static double Random( long int *, int * );
static double Rate( AstMapping *, double *, int, int, int * );
static double UphillSimplex( const MapData *, double, int, const double [], double [], double *, int *, int * );
static int *MapSplit( AstMapping *, int, const int *, AstMapping **, int * );
static int Equal( AstObject *, AstObject *, int * );
static int GetInvert( AstMapping *, int * );
static int GetIsLinear( AstMapping *, int * );
static int GetIsSimple( AstMapping *, int * );
static int GetNin( AstMapping *, int * );
static int GetNout( AstMapping *, int * );
static int GetReport( AstMapping *, int * );
static int GetTranForward( AstMapping *, int * );
static int GetTranInverse( AstMapping *, int * );
static int LinearApprox( AstMapping *, const double *, const double *, double, double *, int * );
static int MapList( AstMapping *, int, int, int *, AstMapping ***, int **, int * );
static int MapMerge( AstMapping *, int, int, int *, AstMapping ***, int **, int * );
static int MaxI( int, int, int * );
static int MinI( int, int, int * );
static int DoNotSimplify( AstMapping *, int * );
static int QuadApprox( AstMapping *, const double[2], const double[2], int, int, double *, double *, int * );
static int RebinAdaptively( AstMapping *, int, const int *, const int *, const void *, const void *, DataType, int, const double *, int, double, int, const void *, int, const int *, const int *, const int *, const int *, int, void *, void *, double *, int64_t *, int * );
static int RebinWithBlocking( AstMapping *, const double *, int, const int *, const int *, const void *, const void *, DataType, int, const double *, int, const void *, int, const int *, const int *, const int *, const int *, int, void *, void *, double *, int64_t *, int * );
static int ResampleAdaptively( AstMapping *, int, const int *, const int *, const void *, const void *, DataType, int, void (*)( void ), const double *, int, double, int, const void *, int, const int *, const int *, const int *, const int *, void *, void *, int * );
static int ResampleSection( AstMapping *, const double *, int, const int *, const int *, const void *, const void *, DataType, int, void (*)( void ), const double *, double, int, const void *, int, const int *, const int *, const int *, const int *, void *, void *, int * );
static int ResampleWithBlocking( AstMapping *, const double *, int, const int *, const int *, const void *, const void *, DataType, int, void (*)( void ), const double *, int, const void *, int, const int *, const int *, const int *, const int *, void *, void *, int * );
static int SpecialBounds( const MapData *, double *, double *, double [], double [], int * );
static int TestAttrib( AstObject *, const char *, int * );
static int TestInvert( AstMapping *, int * );
static int TestReport( AstMapping *, int * );
static void ClearAttrib( AstObject *, const char *, int * );
static void ClearInvert( AstMapping *, int * );
static void ClearReport( AstMapping *, int * );
static void Copy( const AstObject *, AstObject *, int * );
static void Decompose( AstMapping *, AstMapping **, AstMapping **, int *, int *, int *, int * );
static void Delete( AstObject *, int * );
static void Dump( AstObject *, AstChannel *, int * );
static void Gauss( double, const double [], int, double *, int * );
static void GlobalBounds( MapData *, double *, double *, double [], double [], int * );
static void Invert( AstMapping *, int * );
static void MapBox( AstMapping *, const double [], const double [], int, int, double *, double *, double [], double [], int * );
static void RateFun( AstMapping *, double *, int, int, int, double *, double *, int * );
static void RebinSection( AstMapping *, const double *, int, const int *, const int *, const void *, const void *, double, DataType, int, const double *, int, const void *, int, const int *, const int *, const int *, const int *, int, void *, void *, double *, int64_t *, int * );
static void ReportPoints( AstMapping *, int, AstPointSet *, AstPointSet *, int * );
static void SetAttrib( AstObject *, const char *, int * );
static void SetInvert( AstMapping *, int, int * );
static void SetReport( AstMapping *, int, int * );
static void Sinc( double, const double [], int, double *, int * );
static void SincCos( double, const double [], int, double *, int * );
static void SincGauss( double, const double [], int, double *, int * );
static void SincSinc( double, const double [], int, double *, int * );
static void Somb( double, const double [], int, double *, int * );
static void SombCos( double, const double [], int, double *, int * );
static void Tran1( AstMapping *, int, const double [], int, double [], int * );
static void Tran2( AstMapping *, int, const double [], const double [], int, double [], double [], int * );
static void TranGrid( AstMapping *, int, const int[], const int[], double, int, int, int, int, double *, int * );
static void TranGridAdaptively( AstMapping *, int, const int[], const int[], const int[], const int[], double, int, int, double *[], int * );
static void TranGridSection( AstMapping *, const double *, int, const int *, const int *, const int *, const int *, int, double *[], int * );
static void TranGridWithBlocking( AstMapping *, const double *, int, const int *, const int *, const int *, const int *, int, double *[], int * );
static void TranN( AstMapping *, int, int, int, const double *, int, int, int, double *, int * );
static void TranP( AstMapping *, int, int, const double *[], int, int, double *[], int * );
static void ValidateMapping( AstMapping *, int, int, int, int, const char *, int * );
/* Member functions. */
/* ================= */
static void ClearAttrib( AstObject *this_object, const char *attrib, int *status ) {
/*
* Name:
* ClearAttrib
* Purpose:
* Clear an attribute value for a Mapping.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void ClearAttrib( AstObject *this, const char *attrib, int *status )
* Class Membership:
* Mapping member function (over-rides the astClearAttrib protected
* method inherited from the Object class).
* Description:
* This function clears the value of a specified attribute for a
* Mapping, so that the default value will subsequently be used.
* Parameters:
* this
* Pointer to the Mapping.
* attrib
* Pointer to a null terminated string specifying the attribute
* name. This should be in lower case with no surrounding white
* space.
* status
* Pointer to the inherited status variable.
*/
/* Local Variables: */
AstMapping *this; /* Pointer to the Mapping structure */
/* Check the global error status. */
if ( !astOK ) return;
/* Obtain a pointer to the Mapping structure. */
this = (AstMapping *) this_object;
/* Check the attribute name and clear the appropriate attribute. */
/* Invert. */
/* ------- */
if ( !strcmp( attrib, "invert" ) ) {
astClearInvert( this );
/* Report. */
/* ------- */
} else if ( !strcmp( attrib, "report" ) ) {
astClearReport( this );
/* If the name was not recognised, test if it matches any of the
read-only attributes of this class. If it does, then report an
error. */
} else if ( !strcmp( attrib, "nin" ) ||
!strcmp( attrib, "nout" ) ||
!strcmp( attrib, "issimple" ) ||
!strcmp( attrib, "islinear" ) ||
!strcmp( attrib, "tranforward" ) ||
!strcmp( attrib, "traninverse" ) ) {
astError( AST__NOWRT, "astClear: Invalid attempt to clear the \"%s\" "
"value for a %s.", status, attrib, astGetClass( this ) );
astError( AST__NOWRT, "This is a read-only attribute." , status);
/* If the attribute is still not recognised, pass it on to the parent
method for further interpretation. */
} else {
(*parent_clearattrib)( this_object, attrib, status );
}
}
/*
* Name:
* ConserveFlux<X>
* Purpose:
* Scale the output data and variance values produced by ResampleSection
* by the given flux conservation factor.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void ConserveFlux<X>( double factor, int npoint, const int *offset,
* <Xtype> badval, <Xtype> *out,
* <Xtype> *out_var )
* Class Membership:
* Mapping member function.
* Description:
* This is a set of functions which scale the supplied resampled data
* values by the given flux conservation factor. It also scales any
* variances by the square of the factor.
* Parameters:
* factor
* The flux conservation factor. This should be the ratio of the
* output pixel size to the input pixel size, in the locality of
* the supplied data values.
* npoint
* The number of points at which the input grid was resampled.
* offset
* Pointer to an array of integers with "npoint" elements. For
* each output point, this array should contain the zero-based
* offset in the output array(s) (i.e. the "out" and,
* optionally, the "out_var" arrays) at which the resampled
* output value(s) is stored.
* badval
* This parameter specifies the value which is used to identify
* bad data and/or variance values in the output array(s).
* out
* Pointer to an array in which the resampled data is supplied. Note
* that details of how the output grid maps on to this array
* (e.g. the storage order, number of dimensions, etc.) is
* arbitrary and is specified entirely by means of the "offset"
* array. The "out" array should therefore contain sufficient
* elements to accommodate the "offset" values supplied. There
* is no requirement that all elements of the "out" array should
* be assigned values, and any which are not addressed by the
* contents of the "offset" array will be left unchanged.
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, in which variance estimates for
* the resampled values are supplied. If no output variance estimates
* are available, a NULL pointer should be given.
* Notes:
* - There is a separate function for each numerical type of
* gridded data, distinguished by replacing the <X> in the function
* name by the appropriate 1- or 2-character suffix.
*/
/* Define a macro to implement the function for a specific data
type. */
#define MAKE_CONSERVEFLUX(X,Xtype) \
static void ConserveFlux##X( double factor, int npoint, const int *offset, \
Xtype badval, Xtype *out, Xtype *out_var, int *status ) { \
\
/* Local Variables: */ \
int off_out; /* Pixel offset into output array */ \
int point; /* Loop counter for output points */ \
\
\
/* Check the global error status. */ \
if ( !astOK ) return; \
\
for ( point = 0; point < npoint; point++ ) { \
off_out = offset[ point ]; \
if( out[ off_out ] != badval ) out[ off_out ] *= factor; \
} \
\
if( out_var ) { \
factor *= factor; \
for ( point = 0; point < npoint; point++ ) { \
off_out = offset[ point ]; \
if( out_var[ off_out ] != badval ) out_var[ off_out ] *= factor; \
} \
} \
}
/* Expand the macro above to generate a function for each required
data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_CONSERVEFLUX(LD,long double)
#endif
MAKE_CONSERVEFLUX(D,double)
MAKE_CONSERVEFLUX(F,float)
MAKE_CONSERVEFLUX(K,INT_BIG)
MAKE_CONSERVEFLUX(L,long int)
MAKE_CONSERVEFLUX(I,int)
MAKE_CONSERVEFLUX(S,short int)
MAKE_CONSERVEFLUX(B,signed char)
MAKE_CONSERVEFLUX(UL,unsigned long int)
MAKE_CONSERVEFLUX(UI,unsigned int)
MAKE_CONSERVEFLUX(UK,UINT_BIG)
MAKE_CONSERVEFLUX(US,unsigned short int)
MAKE_CONSERVEFLUX(UB,unsigned char)
/* Undefine the macros used above. */
#undef MAKE_CONSERVEFLUX
static void Decompose( AstMapping *this, AstMapping **map1, AstMapping **map2,
int *series, int *invert1, int *invert2, int *status ) {
/*
*+
* Name:
* astDecompose
* Purpose:
* Decompose a Mapping into two component Mappings.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* void astDecompose( AstMapping *this, AstMapping **map1,
* AstMapping **map2, int *series, int *invert1,
* int *invert2 )
* Class Membership:
* Mapping method.
* Description:
* This function returns pointers to two Mappings which, when applied
* either in series or parallel, are equivalent to the supplied Mapping.
*
* Since the Frame class inherits from the Mapping class, Frames can
* be considered as special types of Mappings and so this method can
* be used to decompose CmpMaps, CmpFrames, CmpRegions or Prisms.
* Parameters:
* this
* Pointer to the Mapping.
* map1
* Address of a location to receive a pointer to first component
* Mapping.
* map2
* Address of a location to receive a pointer to second component
* Mapping.
* series
* Address of a location to receive a value indicating if the
* component Mappings are applied in series or parallel. A non-zero
* value means that the supplied Mapping is equivalent to applying map1
* followed by map2 in series. A zero value means that the supplied
* Mapping is equivalent to applying map1 to the lower numbered axes
* and map2 to the higher numbered axes, in parallel.
* invert1
* The value of the Invert attribute to be used with map1.
* invert2
* The value of the Invert attribute to be used with map2.
* Applicability:
* CmpMap
* If the supplied Mapping is a CmpMap, then map1 and map2 will be
* returned holding pointers to the component Mappings used to
* create the CmpMap, either in series or parallel.
* Mapping
* For any class of Mapping other than a CmpMap, map1 will be
* returned holding a clone of the supplied Mapping pointer, and map2
* will be returned holding a NULL pointer.
* CmpFrame
* If the supplied Mapping is a CmpFrame, then map1 and map2 will be
* returned holding pointers to the component Frames used to
* create the CmpFrame. The component Frames are considered to be in
* applied in parallel.
* Frame
* For any class of Frame other than a CmpFrame, map1 will be
* returned holding a clone of the supplied Frame pointer, and map2
* will be returned holding a NULL pointer.
* Notes:
* - Any changes made to the component Mappings using the returned
* pointers will be reflected in the supplied Mapping.
* - The returned Invert values should be used in preference to the
* current values of the Invert attribute in map1 and map2. This is
* because the attributes may have changed value since the Mappings
* were combined.
* Implementation Notes:
* - This function implements the basic astDecompose method
* available via the protected interface to the Frame class. The
* public interface to this method is provided by the
* astDecomposeId_ function.
*-
*/
/* Check the global error status. */
if ( !astOK ) return;
/* The basic Mapping class returns a clone of the supplied Mapping as
map1 and a NULL pointer as map2. */
if( map1 ) *map1 = astClone( this );
if( map2 ) *map2 = NULL;
if( series ) *series = 1;
if( invert1 ) *invert1 = astGetInvert( this );
if( invert2 ) *invert2 = 0;
}
static int DoNotSimplify( AstMapping *this, int *status ) {
/*
*+
* Name:
* astMapMerge
* Purpose:
* Check if a Mapping is appropriate for simplification.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* int astDoNotSImplify( AstMapping *this );
* Class Membership:
* Mapping method.
* Description:
* This function returns a flag indivating if the supplied Mapping is
* appropriate for simplification.
* Parameters:
* this
* Pointer to the Mapping.
* Returned Value:
* Non-zero if the supplied Mapping is not appropriate for
* simplification, and zero otherwise.
* Notes:
* - A value of 0 will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
*/
/* Check inherited status. */
if( !astOK ) return 0;
/* Mappings that have a set value for the Ident attribute should not be
simplified since we want to preserve their individual identify (otherwise
why would the user have given them an Ident value?). */
return astTestIdent( this );
}
int astRateState_( int disabled, int *status ) {
/*
*+
* Name:
* astRateState
* Purpose:
* Control whether the astRate method is disabled or not.
* Type:
* Protected function.
* Synopsis:
* #include "mapping.h"
* int astRateState( int disabled )
* Class Membership:
* Mapping member function
* Description:
* Some algorithms which use use the astRate method do not actually need
* to know what the Rate value is. For instance, when the Plot class draws
* a border it evaluates the GRAPHICS->Current Mapping hundreds of time.
* If the Mapping includes a RateMap then this can be very very slow
* (depending on how the astRate method is implemented). In fact the
* border drawing algorithm onlyneeds to know if the result is bad or
* not - the actual value produced by the Mappign does not matter.
*
* Such algorithms can be speeded up by forcing the astRate method to
* return a constant value rather than actually doing the numerical
* differentiation. This can be accomplised by calling this method prior
* to implementing the algorithm. It should be called at the end in
* order to re-instate the original disabled flag.
* Parameters:
* disabled
* The new value for the astRate disabled flag.
* Returned Value:
* The original value of the astRate disabled flag.
*-
*/
astDECLARE_GLOBALS
int result;
astGET_GLOBALS(NULL);
result = rate_disabled;
rate_disabled = disabled;
return result;
}
static int Equal( AstObject *this_object, AstObject *that_object, int *status ) {
/*
* Name:
* Equal
* Purpose:
* Test if two Mappings are equivalent.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int Equal( AstObject *this, AstObject *that, int *status )
* Class Membership:
* Mapping member function (over-rides the astEqual protected
* method inherited from the Object class).
* Description:
* This function returns a boolean result (0 or 1) to indicate whether
* two Mappings are equivalent.
*
* The implementation provided by this class (the base Mapping class)
* simply reports an error when called, since all concrete Mapping
* subclasses should provide their own implementation.
*
* Note, sub-class implementations should not use astSimplify (e.g.
* combining the two Mapping and then simplifying it), since the
* astSimplify method for certain classes (e.g. CmpMap) may use
* astEqual. Consequently, if astEqual called astSimplify, there would
* be possibilities for infinite loops.
* Parameters:
* this
* Pointer to the first Object (a Mapping).
* that
* Pointer to the second Object.
* status
* Pointer to the inherited status variable.
* Returned Value:
* One if the Frames are equivalent, zero otherwise.
* Notes:
* - The two Mappings are considered equivalent if the combination of
* the first in series with the inverse of the second simplifies to a
* UnitMap.
* - A value of zero will be returned if this function is invoked
* with the global status set, or if it should fail for any reason.
*/
/* Local Variables: */
int result; /* Result value to return */
/* Initialise. */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Invoke the Equal method inherited from the parent Object class. This checks
that the Objects are both of the same class (amongst other things). */
if( (*parent_equal)( this_object, that_object, status ) ) {
/* Report an error since the concrete sub-class should have over-riden
this method. */
astError( AST__INTER, "astEqual(Mapping): The %s class does "
"not override the abstract astEqual method inherited "
"from the base Mapping class (internal AST programming "
"error).", status, astGetClass( this_object ) );
}
/* If an error occurred, clear the result value. */
if ( !astOK ) result = 0;
/* Return the result, */
return result;
}
static double FindGradient( AstMapping *map, double *at, int ax1, int ax2,
double x0, double h, double *range, int *status ){
/*
* Name:
* FindGradient
* Purpose:
* Find the mean gradient in an interval, and the range of gradients
* within the interval.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* double FindGradient( AstMapping *map, double *at, int ax1, int ax2,
* double x0, double h, double *range, int *status )
* Class Membership:
* Mapping method.
* Description:
* This function finds the mean gradient in an interval, and the range
* of gradients within the interval.
* Parameters:
* map
* Pointer to a Mapping which yields the value of the function at x.
* The Mapping may have any number of inputs and outputs; the specific
* output representing the function value, f, is specified by ax1 and
* the specific input representing the argument, x, is specified by ax2.
* at
* A pointer to an array holding axis values at the position at which
* the function is to be evaluated. The number of values supplied
* must equal the number of inputs to the Mapping. The value supplied
* for axis "ax2" is ignored (the value of "x" is used for axis "ax2").
* ax1
* The zero-based index of the Mapping output which is to be
* differentiated. Set this to -1 to allocate, or -2 to release,
* the static resources used by this function.
* ax2
* The zero-based index of the Mapping input which is to be varied.
* x0
* The central axis value at which the function is to be evaluated.
* h
* The interval over which the fitting is to be performed.
* range
* A pointer to a location at which to return the range of
* gradients found within the interval.
* status
* Pointer to the inherited status variable.
* Returns:
* The mean gradient, or AST__BAD if the mean gradient cannot be
* calculated.
*/
/* Local Variables: */
double dh;
double g;
double gmax;
double gmin;
double ret;
double x1;
double x2;
double x[ RATE_ORDER + 2 ];
double y1;
double y2;
double y[ RATE_ORDER + 2 ];
int i0;
int i;
int ngood;
/* Initialise */
ret = AST__BAD;
/* Check the global error status. */
if ( !astOK ) return ret;
/* Store the x values at (RATE_ORDER+1) evenly spaced points over the interval
"h" centred on "x0". */
i0 = RATE_ORDER/2;
dh = h/RATE_ORDER;
for( i = 0; i <= RATE_ORDER; i++ ) {
x[ i ] = x0 + ( i - i0 )*dh;
}
/* Get the function values at these positions. */
RateFun( map, at, ax1, ax2, RATE_ORDER + 1, x, y, status );
/* Find the maximum and minimum mean gradient within any sub-interval, and
note the (x,y) values at the first and last good point within the
interval. */
y1 = AST__BAD;
y2 = AST__BAD;
gmax = AST__BAD;
gmin = AST__BAD;
ngood = 0;
for( i = 0; i < RATE_ORDER; i++ ) {
if( y[ i + 1 ] !=AST__BAD && y[ i ] != AST__BAD &&
x[ i + 1 ] != x[ i ] ) {
ngood++;
g = ( y[ i + 1 ] - y[ i ] )/( x[ i + 1 ] - x[ i ] );
if( ngood == 1 ) {
gmax = gmin = g;
} else if( g < gmin ) {
gmin = g;
} else if( g > gmax) {
gmax = g;
}
if( y1 == AST__BAD ) {
y1 = y[ i ];
x1 = x[ i ];
}
y2 = y[ i + 1 ];
x2 = x[ i + 1 ];
}
}
/* If two or more sub-intervals were usable, return the range of
gradients found, and the mean gradient. */
if( ngood > 1 ) {
ret = ( y2 - y1 )/( x2 - x1 );
if( range ) *range = ( gmax - gmin );
}
return ret;
}
static void Gauss( double offset, const double params[], int flags,
double *value, int *status ) {
/*
* Name:
* Gauss
* Purpose:
* 1-dimensional Gaussian spreading kernel.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void Gauss( double offset, const double params[], int flags,
* double *value, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function calculates the value of a 1-dimensional sub-pixel
* spreading kernel. The function used is exp(-k*x*x).
* Parameters:
* offset
* The offset of a pixel from the central output point, measured
* in pixels.
* params
* The first element of this array should give a value for "k"
* in the exp(-k*x*x) term.
* flags
* Not used.
* value
* Pointer to a double to receive the calculated kernel value.
* status
* Pointer to the inherited status variable.
* Notes:
* - This function does not perform error checking and does not
* generate errors.
*/
/* Calculate the result. */
*value = exp( -params[ 0 ] * offset * offset );
}
static const char *GetAttrib( AstObject *this_object, const char *attrib, int *status ) {
/*
* Name:
* GetAttrib
* Purpose:
* Get the value of a specified attribute for a Mapping.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* const char *GetAttrib( AstObject *this, const char *attrib, int *status )
* Class Membership:
* Mapping member function (over-rides the protected astGetAttrib
* method inherited from the Object class).
* Description:
* This function returns a pointer to the value of a specified
* attribute for a Mapping, formatted as a character string.
* Parameters:
* this
* Pointer to the Mapping.
* attrib
* Pointer to a null terminated string containing the name of
* the attribute whose value is required. This name should be in
* lower case, with all white space removed.
* status
* Pointer to the inherited status variable.
* Returned Value:
* Pointer to a null terminated string containing the attribute
* value.
* Notes:
* - The returned string pointer may point at memory allocated
* within the Mapping, or at static memory. The contents of the
* string may be over-written or the pointer may become invalid
* following a further invocation of the same function or any
* modification of the Mapping. A copy of the string should
* therefore be made if necessary.
* - A NULL pointer will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*/
/* Local Variables: */
astDECLARE_GLOBALS /* Pointer to thread-specific global data */
AstMapping *this; /* Pointer to the Mapping structure */
const char *result; /* Pointer value to return */
int invert; /* Invert attribute value */
int islinear; /* IsLinear attribute value */
int issimple; /* IsSimple attribute value */
int nin; /* Nin attribute value */
int nout; /* Nout attribute value */
int report; /* Report attribute value */
int tran_forward; /* TranForward attribute value */
int tran_inverse; /* TranInverse attribute value */
/* Initialise. */
result = NULL;
/* Check the global error status. */
if ( !astOK ) return result;
/* Get a pointer to the thread specific global data structure. */
astGET_GLOBALS(this_object);
/* Obtain a pointer to the Mapping structure. */
this = (AstMapping *) this_object;
/* Compare "attrib" with each recognised attribute name in turn,
obtaining the value of the required attribute. If necessary, write
the value into "getattrib_buff" as a null terminated string in an appropriate
format. Set "result" to point at the result string. */
/* Invert. */
/* ------- */
if ( !strcmp( attrib, "invert" ) ) {
invert = astGetInvert( this );
if ( astOK ) {
(void) sprintf( getattrib_buff, "%d", invert );
result = getattrib_buff;
}
/* IsLinear. */
/* --------- */
} else if ( !strcmp( attrib, "islinear" ) ) {
islinear = astGetIsLinear( this );
if ( astOK ) {
(void) sprintf( getattrib_buff, "%d", islinear );
result = getattrib_buff;
}
/* IsSimple. */
/* --------- */
} else if ( !strcmp( attrib, "issimple" ) ) {
issimple = astGetIsSimple( this );
if ( astOK ) {
(void) sprintf( getattrib_buff, "%d", issimple );
result = getattrib_buff;
}
/* Nin. */
/* ---- */
} else if ( !strcmp( attrib, "nin" ) ) {
nin = astGetNin( this );
if ( astOK ) {
(void) sprintf( getattrib_buff, "%d", nin );
result = getattrib_buff;
}
/* Nout. */
/* ----- */
} else if ( !strcmp( attrib, "nout" ) ) {
nout = astGetNout( this );
if ( astOK ) {
(void) sprintf( getattrib_buff, "%d", nout );
result = getattrib_buff;
}
/* Report. */
/* ------- */
} else if ( !strcmp( attrib, "report" ) ) {
report = astGetReport( this );
if ( astOK ) {
(void) sprintf( getattrib_buff, "%d", report );
result = getattrib_buff;
}
/* TranForward. */
/* ------------ */
} else if ( !strcmp( attrib, "tranforward" ) ) {
tran_forward = astGetTranForward( this );
if ( astOK ) {
(void) sprintf( getattrib_buff, "%d", tran_forward );
result = getattrib_buff;
}
/* TranInverse. */
/* ------------ */
} else if ( !strcmp( attrib, "traninverse" ) ) {
tran_inverse = astGetTranInverse( this );
if ( astOK ) {
(void) sprintf( getattrib_buff, "%d", tran_inverse );
result = getattrib_buff;
}
/* If the attribute name was not recognised, pass it on to the parent
method for further interpretation. */
} else {
result = (*parent_getattrib)( this_object, attrib, status );
}
/* Return the result. */
return result;
}
static int GetIsLinear( AstMapping *this, int *status ) {
/*
*+
* Name:
* astGetIsLinear
* Purpose:
* Determine if a Mapping is an instance of a linear Mapping class.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* int astGetIsLinear( AstMapping *this )
* Class Membership:
* Mapping method.
* Description:
* This function returns a value indicating whether a Mapping is
* a member of a class of linear Mappings. The base Mapping class
* returns a value of zero. Linear Mapping classes should over-ride
* this function to return a non-zero value.
* Parameters:
* this
* Pointer to the Mapping.
* Returned Value:
* One if the Mapping is a member of a linear Mapping class. Zero
* otherwise.
* Notes:
* - A value of zero will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
*/
return 0;
}
static int GetNin( AstMapping *this, int *status ) {
/*
*+
* Name:
* astGetNin
* Purpose:
* Get the number of input coordinates for a Mapping.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* int astGetNin( AstMapping *this )
* Class Membership:
* Mapping method.
* Description:
* This function returns the number of input coordinate values
* required per point by a Mapping (i.e. the number of dimensions
* of the space in which input points reside).
* Parameters:
* this
* Pointer to the Mapping.
* Returned Value:
* Number of coordinate values required.
* Notes:
* - A value of zero will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
*/
/* Local Variables: */
int invert; /* Invert attribute value */
int result; /* Result value to return */
/* Initialise. */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Determine if the Mapping has been inverted. */
invert = astGetInvert( this );
/* Obtain the Nin value. */
if ( astOK ) result = invert ? this->nout : this->nin;
/* Return the result. */
return result;
}
static int GetNout( AstMapping *this, int *status ) {
/*
*+
* Name:
* astGetNout
* Purpose:
* Get the number of output coordinates for a Mapping.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* int astGetNout( AstMapping *this )
* Class Membership:
* Mapping method.
* Description:
* This function returns the number of output coordinate values
* generated per point by a Mapping (i.e. the number of dimensions
* of the space in which output points reside).
* Parameters:
* this
* Pointer to the Mapping.
* Returned Value:
* Number of coordinate values generated.
* Notes:
* - A value of zero will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
*/
/* Local Variables: */
int invert; /* Invert attribute value */
int result; /* Result value to return */
/* Initialise. */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Determine if the Mapping has been inverted. */
invert = astGetInvert( this );
/* Obtain the Nout value. */
if ( astOK ) result = invert ? this->nin : this->nout;
/* Return the result. */
return result;
}
static int GetTranForward( AstMapping *this, int *status ) {
/*
*+
* Name:
* astGetTranForward
* Purpose:
* Determine if a Mapping defines a forward coordinate transformation.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* int astGetTranForward( AstMapping *this )
* Class Membership:
* Mapping method.
* Description:
* This function returns a value indicating whether a Mapping is
* able to perform a coordinate transformation in the "forward"
* direction.
* Parameters:
* this
* Pointer to the Mapping.
* Returned Value:
* Zero if the forward coordinate transformation is not defined, or
* 1 if it is.
* Notes:
* - A value of zero will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
*/
/* Local Variables: */
int invert; /* Mapping inverted? */
int result; /* Result value to return */
/* Initialise. */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Determine if the Mapping has been inverted. */
invert = astGetInvert( this );
/* If OK, obtain the result. */
if ( astOK ) result = invert ? this->tran_inverse : this->tran_forward;
/* Return the result. */
return result;
}
static int GetTranInverse( AstMapping *this, int *status ) {
/*
*+
* Name:
* astGetTranInverse
* Purpose:
* Determine if a Mapping defines an inverse coordinate transformation.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* int astGetTranInverse( AstMapping *this )
* Class Membership:
* Mapping method.
* Description:
* This function returns a value indicating whether a Mapping is
* able to perform a coordinate transformation in the "inverse"
* direction.
* Parameters:
* this
* Pointer to the Mapping.
* Returned Value:
* Zero if the inverse coordinate transformation is not defined, or
* 1 if it is.
* Notes:
* - A value of zero will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
*/
/* Local Variables: */
int invert; /* Mapping inverted? */
int result; /* Result value to return */
/* Initialise. */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Determine if the Mapping has been inverted. */
invert = astGetInvert( this );
/* If OK, obtain the result. */
if ( astOK ) result = invert ? this->tran_forward : this->tran_inverse;
/* Return the result. */
return result;
}
static void GlobalBounds( MapData *mapdata, double *lbnd, double *ubnd,
double xl[], double xu[], int *status ) {
/*
* Name:
* GlobalBounds
* Purpose:
* Estimate global coordinate bounds for a Mapping.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void GlobalBounds( MapData *mapdata, double *lbnd, double *ubnd,
* double xl[], double xu[], int *status );
* Class Membership:
* Mapping member function.
* Description:
* This function estimates the global lower and upper bounds of a
* Mapping function within a constrained region of its input
* coordinate space. It uses a robust global optimisation algorithm
* based on the selection of pseudo-random starting positions,
* followed by the location of local minima and maxima using the
* downhill (or uphill) simplex method. The algorithm will cope
* with the case where there are several competing minima (or
* maxima) with nearly equal values. It attempts to locate the
* global bounds to full machine precision when possible.
* Parameters:
* mapdata
* Pointer to a MapData structure describing the Mapping
* function, its coordinate constraints, etc.
* lbnd
* Pointer to a double. On entry, this should contain a
* previously-obtained upper limit on the global lower bound, or
* AST__BAD if no such limit is available. On exit, it will be
* updated with a new estimate of the global lower bound, if a
* better one has been found.
* ubnd
* Pointer to a double. On entry, this should contain a
* previously-obtained lower limit on the global upper bound, or
* AST__BAD if no such limit is available. On exit, it will be
* updated with a new estimate of the global upper bound, if a
* better one has been found.
* xl
* Pointer to an array of double, with one element for each
* input coordinate. On entry, if *lbnd is not equal to AST__OK,
* this should contain the input coordinates of a point at which
* the Mapping function takes the value *lbnd. On exit, this
* function returns the position of a (not necessarily unique)
* input point at which the Mapping function takes the value of
* the new global lower bound. This array is not altered if an
* improved estimate of the global lower bound cannot be found.
* xu
* Pointer to an array of double, with one element for each
* input coordinate. On entry, if *ubnd is not equal to AST__OK,
* this should contain the input coordinates of a point at which
* the Mapping function takes the value *ubnd. On exit, this
* function returns the position of a (not necessarily unique)
* input point at which the Mapping function takes the value of
* the new global upper bound. This array is not altered if an
* improved estimate of the global upper bound cannot be found.
* status
* Pointer to the inherited status variable.
* Notes:
* - The efficiency of this function will usually be improved if
* previously-obtained estimates of the extrema and their locations
* are provided.
* - The values returned via "lbnd", "ubnd", "xl" and "xu" will be
* set to the value AST__BAD if this function should fail for any
* reason. Their initial values on entry will not be altered if the
* function is invoked with the global error status set.
*/
/* Local Constants: */
const double default_acc = 3.0e-5; /* Default convergence accuracy */
const int maxiter = 10000; /* Maximum number of iterations */
const int minsame = 5; /* Minimum no. consistent extrema required */
const int nbatch = 32; /* No. function samples obtained per batch */
/* Local Variables: */
AstPointSet *pset_in; /* Input PointSet for batch transformation */
AstPointSet *pset_out; /* Output PointSet for batch transformation */
double **ptr_in; /* Pointer to batch input coordinates */
double **ptr_out; /* Pointer to batch output coordinates */
double *active_hi; /* Estimated upper limits of active region */
double *active_lo; /* Estimated lower limits of active region */
double *sample_hi; /* Upper limits of sampled region */
double *sample_lo; /* Lower limits of sampled region */
double *sample_width; /* Nominal widths of sampled region */
double *x; /* Pointer to array of coordinates */
double acc; /* Convergence accuracy for finding maximum */
double active_width; /* Estimated width of active region */
double new_max; /* Value of new local maximum */
double new_min; /* Value of new local minimum */
double oversize; /* Over-size factor for sampled region */
double random; /* Pseudo-random number */
int bad; /* Transformed position is bad? */
int batch; /* Next element to use in position batch */
int coord; /* Loop counter for coordinates */
int done_max; /* Satisfactory global maximum found? */
int done_min; /* Satisfactory global minimum found? */
int iter; /* Loop counter for iterations */
int ncoord; /* Number of coordinates in search space */
int nmax; /* Number of local maxima found */
int nmin; /* Number of local minima found */
int nsame_max; /* Number of equivalent local maxima found */
int nsame_min; /* Number of equivalent local minima found */
long int seed = 1776655449; /* Arbitrary pseudo-random number seed */
/* Check the global error status */
if ( !astOK ) return;
/* Initialise. */
done_max = 0;
done_min = 0;
nmax = 0;
nmin = 0;
nsame_max = 0;
nsame_min = 0;
pset_in = NULL;
pset_out = NULL;
ptr_in = NULL;
ptr_out = NULL;
oversize = 0;
bad = 0;
/* Extract the number of input coordinates for the Mapping function
and allocate workspace. */
ncoord = mapdata->nin;
active_hi = astMalloc( sizeof( double ) * (size_t) ncoord );
active_lo = astMalloc( sizeof( double ) * (size_t) ncoord );
sample_hi = astMalloc( sizeof( double ) * (size_t) ncoord );
sample_lo = astMalloc( sizeof( double ) * (size_t) ncoord );
sample_width = astMalloc( sizeof( double ) * (size_t) ncoord );
x = astMalloc( sizeof( double ) * (size_t) ncoord );
if ( astOK ) {
/* Calculate the factor by which the size of the region we sample will
exceed the size of the Mapping function's active region (the region
where the transformed coordinates are non-bad) in each
dimension. This is chosen so that the volume ratio will be 2. */
oversize = pow( 2.0, 1.0 / (double) ncoord );
/* Initialise the limits of the active region to unknown. */
for ( coord = 0; coord < ncoord; coord++ ) {
active_lo[ coord ] = DBL_MAX;;
active_hi[ coord ] = -DBL_MAX;
/* Initialise the nominal widths of the sampled region to be the
actual widths of the search region times the over-size factor. */
sample_width[ coord ] = ( mapdata->ubnd[ coord ] -
mapdata->lbnd[ coord ] ) * oversize;
/* Initialise the sampled region to match the search region. */
sample_lo[ coord ] = mapdata->lbnd[ coord ];
sample_hi[ coord ] = mapdata->ubnd[ coord ];
}
/* Set up position buffer. */
/* ======================= */
/* Create two PointSets to act as buffers to hold a complete batch of
input and output coordinates. Obtain pointers to their coordinate
arrays. */
pset_in = astPointSet( nbatch, ncoord, "", status );
pset_out = astPointSet( nbatch, mapdata->nout, "", status );
ptr_in = astGetPoints( pset_in );
ptr_out = astGetPoints( pset_out );
/* Initialise the next element to be used in the position buffer to
indicate that the buffer is initially empty. */
batch = nbatch;
}
/* Define a macro to fill the position buffer with a set of
pseudo-random positions and to transform them. */
#define FILL_POSITION_BUFFER {\
\
/* We first generate a suitable volume over which to distribute the\
batch of pseudo-random positions. Initially, this will be the\
entire search volume, but if we find that the only non-bad\
transformed coordinates we obtain are restricted to a small\
sub-region of this input volume, then we reduce the sampled volume\
so as to concentrate more on the active region. */\
\
/* Loop through each input coordinate, checking that at least one\
non-bad transformed point has been obtained. If not, we do not\
adjust the sampled volume, as we do not yet know where the active\
region lies. */\
for ( coord = 0; coord < ncoord; coord++ ) {\
if ( active_hi[ coord ] >= active_lo[ coord ] ) {\
\
/* Estimate the width of the active region from the range of input\
coordinates that have so far produced non-bad transformed\
coordinates. */\
active_width = active_hi[ coord ] - active_lo[ coord ];\
\
/* If the current width of the sampled volume exceeds this estimate by\
more than the required factor, then reduce the width of the sampled\
volume. The rate of reduction is set so that the volume of the\
sampled region can halve with every fourth batch of positions. */\
if ( ( active_width * oversize ) < sample_width[ coord ] ) {\
sample_width[ coord ] /= pow( oversize, 0.25 );\
\
/* If the width of the sampled volume does not exceed that of the\
known active region by the required factor, then adjust it so that\
it does. Note that we must continue to sample some points outside\
the known active region in case we have missed any (in which case\
the sampled region will expand again to include them). */\
} else if ( ( active_width * oversize ) > sample_width[ coord ] ) {\
sample_width[ coord ] = active_width * oversize;\
}\
\
/* Calculate the lower and upper bounds on the sampled volume, using\
the new width calculated above and centring it on the active\
region, as currently known. */\
sample_lo[ coord ] = ( active_lo[ coord ] + active_hi[ coord ] -\
sample_width[ coord ] ) * 0.5;\
sample_hi[ coord ] = ( active_lo[ coord ] + active_hi[ coord ] +\
sample_width[ coord ] ) * 0.5;\
\
/* Ensure that the sampled region does not extend beyond the original\
search region. */\
if ( sample_lo[ coord ] < mapdata->lbnd[ coord ] ) {\
sample_lo[ coord ] = mapdata->lbnd[ coord ];\
}\
if ( sample_hi[ coord ] > mapdata->ubnd[ coord ] ) {\
sample_hi[ coord ] = mapdata->ubnd[ coord ];\
}\
}\
}\
\
/* Having determined the size of the sampled volume, create a batch of\
pseudo-random positions uniformly distributed within it. */\
for ( batch = 0; batch < nbatch; batch++ ) {\
for ( coord = 0; coord < ncoord; coord++ ) {\
random = Random( &seed, status );\
ptr_in[ coord ][ batch ] = sample_lo[ coord ] * random +\
sample_hi[ coord ] * ( 1.0 - random );\
}\
}\
\
/* Transform these positions. We process them in a single batch in\
order to minimise the overheads in doing this. */\
(void) astTransform( mapdata->mapping, pset_in, mapdata->forward,\
pset_out );\
\
/* Indicate that the position buffer is now full. */\
batch = 0;\
}
/* Fill the position buffer using the above macro. (Note that because
we do not yet have an estimate of the size of the active region,
this does not change the sampled region size from our earlier
initialised values. */
FILL_POSITION_BUFFER;
/* Iterate. */
/* ======== */
/* Loop to perform up to "maxiter" iterations to estimate the global
minimum and maximum. */
for ( iter = 0; astOK && ( iter < maxiter ); iter++ ) {
/* Determine the search accuracy. */
/* ============================== */
/* Decide the accuracy to which local extrema should be found. The
intention here is to optimise performance, especially where one
extremum lies near zero and so could potentially be found to
unnecessarily high precision. If we make a mis-assumption (the code
below is not fool-proof), we will slow things down for this
iteration, but the error will be corrected in future iterations
once better estimates are available. */
/* If we have no current estimate of either global extremum, we assume
the values we eventually obtain will be of order unity and required
to the default accuracy. */
acc = default_acc;
/* If we already have an estimate of both global extrema, we set the
accuracy level so that the difference between them will be known to
the default accuracy. */
if ( ( *lbnd != AST__BAD ) && ( *ubnd != AST__BAD ) ) {
acc = fabs( *ubnd - *lbnd ) * default_acc;
/* If we have an estimate of only one global extremum, we assume that
the difference between the two global extrema will eventually be of
the same order as the estimate we currently have, so long as this
is not less than unity. */
} else if ( *lbnd != AST__BAD ) {
if ( fabs( *lbnd ) > 1.0 ) acc = fabs( *lbnd) * default_acc;
} else if ( *ubnd != AST__BAD ) {
if ( fabs( *ubnd ) > 1.0 ) acc = fabs( *ubnd) * default_acc;
}
/* Search for a new local minimum. */
/* =============================== */
/* If we are still searching for the global minimum, then obtain a set
of starting coordinates from which to find a new local minimum. */
if ( !done_min ) {
/* On the first iteration, start searching at the position where the
best estimate of the global minimum (if any) has previously been
found. We know that this produces non-bad transformed
coordinates. */
bad = 0;
if ( !iter && ( *lbnd != AST__BAD ) ) {
for ( coord = 0; coord < ncoord; coord++ ) {
x[ coord ] = xl[ coord ];
}
/* Otherwise, if no estimate of the global minimum is available, then
start searching at the position where the best estimate of the
global maximum (if any) has been found. This may be a long way from
a local minimum, but at least it will yield a non-bad value for the
Mapping function, so some sort of estimate of the global minimum
will be obtained. This is important in cases where finding the
active region of the function is the main problem. Note that this
condition can only occur once, since the global minimum will have
an estimate on the next iteration. */
} else if ( ( *lbnd == AST__BAD ) && ( *ubnd != AST__BAD ) ) {
for ( coord = 0; coord < ncoord; coord++ ) {
x[ coord ] = xu[ coord ];
}
/* Having exhausted the above possibilities, we use pseudo-random
starting positions which are uniformly distributed throughout the
search volume. First check to see if the buffer containing such
positions is empty and refill it if necessary. */
} else {
if ( batch >= nbatch ) FILL_POSITION_BUFFER;
/* Test the next available set of output (transformed) coordinates in
the position buffer to see if they are bad. */
if ( astOK ) {
for ( coord = 0; coord < mapdata->nout; coord++ ) {
bad = ( ptr_out[ coord ][ batch ] == AST__BAD );
if ( bad ) break;
}
/* If not, we have a good starting position for finding a local
minimum, so extract the corresponding input coordinates. */
if ( !bad ) {
for ( coord = 0; coord < ncoord; coord++ ) {
x[ coord ] = ptr_in[ coord ][ batch ];
}
}
/* Increment the position buffer location. */
batch++;
}
}
/* If we do not have a good starting position, we can't do anything
more on this iteration. A new position will be obtained and tested
on the next iteration and this (we hope) will eventually identify a
suitable starting point. */
if ( astOK && !bad ) {
/* Form estimates of the lower and upper limits of the active region
from the starting positions used. */
for ( coord = 0; coord < ncoord; coord++ ) {
if ( x[ coord ] < active_lo[ coord ] ) {
active_lo[ coord ] = x[ coord ];
}
if ( x[ coord ] > active_hi[ coord ] ) {
active_hi[ coord ] = x[ coord ];
}
}
/* Indicate that the Mapping function should be negated (because we
want a local minimum) and then search for a local maximum in this
negated function. If the result is non-bad (as it should always be,
barring an error), then negate it to obtain the value of the local
minimum found. */
mapdata->negate = 1;
new_min = LocalMaximum( mapdata, acc, 0.01, x, status );
if ( new_min != AST__BAD ) {
new_min = -new_min;
/* Update the estimates of the lower and upper bounds of the active
region to take account of where the minimum was found. */
for ( coord = 0; coord < ncoord; coord++ ) {
if ( x[ coord ] < active_lo[ coord ] ) {
active_lo[ coord ] = x[ coord ];
}
if ( x[ coord ] > active_hi[ coord ] ) {
active_hi[ coord ] = x[ coord ];
}
}
/* Count the number of times we successfully locate a local minimum
(ignoring the fact they might all be the same one). */
nmin++;
/* Update the global minimum. */
/* ========================== */
/* If this is the first estimate of the global minimum, then set to
one the count of the number of consecutive iterations where this
estimate remains unchanged. Store the minimum value and its
position. */
if ( *lbnd == AST__BAD ) {
nsame_min = 1;
*lbnd = new_min;
for ( coord = 0; coord < ncoord; coord++ ) {
xl[ coord ] = x[ coord ];
}
/* Otherwise, test if this local minimum is lower than the previous
estimate of the global minimum. If so, then reset the count of
unchanged estimates of the global mimimum to one if the difference
exceeds the accuracy with which the minimum was found (i.e. if we
have found a significantly different minimum). Otherwise, just
increment this count (because we have found the same minimum but by
chance with slightly improved accuracy). Store the new minimum and
its position. */
} else if ( new_min < *lbnd ) {
nsame_min = ( ( *lbnd - new_min ) > acc ) ? 1 :
nsame_min + 1;
*lbnd = new_min;
for ( coord = 0; coord < ncoord; coord++ ) {
xl[ coord ] = x[ coord ];
}
/* If the latest local minimum is no improvement on previous estimates
of the global minimum, then increment the count of unchanged
estimates of the global mimimum, but do not save the new one. */
} else {
nsame_min++;
}
/* Determine if a satisfactory estimate of the global minimum has been
obtained. It has if the number of consecutive local minima which
have not significantly improved the estimate is at least equal to
"minsame", and at least 30% of the total number of local minima
found. */
if ( ( nsame_min >= minsame ) &&
( nsame_min >= (int) ( 0.3f * (float) nmin + 0.5f ) ) ) {
done_min = 1;
}
}
}
}
/* Search for a new local maximum. */
/* =============================== */
/* Now repeat all of the above to find a new local maximum which
estimates the global maximum. */
if ( !done_max ) {
/* Choose a suitable starting position, based on one already available
if appropriate. */
if ( !iter && ( *ubnd != AST__BAD ) ) {
for ( coord = 0; coord < ncoord; coord++ ) {
x[ coord ] = xu[ coord ];
}
} else if ( ( *ubnd == AST__BAD ) && ( *lbnd != AST__BAD ) ) {
for ( coord = 0; coord < ncoord; coord++ ) {
x[ coord ] = xl[ coord ];
}
/* Otherwise use a pseudo-random position, refilling the position
buffer if necessary. Check if the transformed coordinates are
bad. */
} else {
if ( batch >= nbatch ) FILL_POSITION_BUFFER;
if ( astOK ) {
for ( coord = 0; coord < mapdata->nout; coord++ ) {
bad = ( ptr_out[ coord ][ batch ] == AST__BAD );
if ( bad ) break;
}
if ( !bad ) {
for ( coord = 0; coord < ncoord; coord++ ) {
x[ coord ] = ptr_in[ coord ][ batch ];
}
}
batch++;
}
}
/* If the coordinates are OK, update the active region limits. */
if ( astOK && !bad ) {
for ( coord = 0; coord < ncoord; coord++ ) {
if ( x[ coord ] < active_lo[ coord ] ) {
active_lo[ coord ] = x[ coord ];
}
if ( x[ coord ] > active_hi[ coord ] ) {
active_hi[ coord ] = x[ coord ];
}
}
/* Find a local maximum in the Mapping function. */
mapdata->negate = 0;
new_max = LocalMaximum( mapdata, acc, 0.01, x, status );
if ( new_max != AST__BAD ) {
/* Use the result to further update the active region limits. */
for ( coord = 0; coord < ncoord; coord++ ) {
if ( x[ coord ] < active_lo[ coord ] ) {
active_lo[ coord ] = x[ coord ];
}
if ( x[ coord ] > active_hi[ coord ] ) {
active_hi[ coord ] = x[ coord ];
}
}
/* Count the number of local maxima found. */
nmax++;
/* Update the estimate of the global maximum. */
if ( *ubnd == AST__BAD ) {
nsame_max = 1;
*ubnd = new_max;
for ( coord = 0; coord < ncoord; coord++ ) {
xu[ coord ] = x[ coord ];
}
} else if ( new_max > *ubnd ) {
nsame_max = ( ( new_max - *ubnd ) > acc ) ? 1 :
nsame_max + 1;
*ubnd = new_max;
for ( coord = 0; coord < ncoord; coord++ ) {
xu[ coord ] = x[ coord ];
}
} else {
nsame_max++;
}
/* Test for a satisfactory global maximum estimate. */
if ( ( nsame_max >= minsame ) &&
( nsame_max >= (int) ( 0.3f * (float) nmax + 0.5 ) ) ) {
done_max = 1;
}
}
}
}
/* Quit iterating once both the global minimum and the global maximum
have been found. */
if ( done_min && done_max ) break;
}
/* Free workspace. */
active_hi = astFree( active_hi );
active_lo = astFree( active_lo );
sample_hi = astFree( sample_hi );
sample_lo = astFree( sample_lo );
sample_width = astFree( sample_width );
x = astFree( x );
/* Annul temporary PointSets. */
pset_in = astAnnul( pset_in );
pset_out = astAnnul( pset_out );
/* If the global minimum has been found, attempt to polish the result
to machine precision by requesting that it be found with an
accuracy tolerance of zero (subject to the maximum number of
iterations that LocalMaximum will perform,). */
if ( astOK ) {
if ( *lbnd != AST__BAD ) {
mapdata->negate = 1;
*lbnd = LocalMaximum( mapdata, 0.0, sqrt( DBL_EPSILON ), xl, status );
if ( *lbnd != AST__BAD ) *lbnd = - *lbnd;
}
/* Similarly polish the estimate of the global maximum. */
if ( *ubnd != AST__BAD ) {
mapdata->negate = 0;
*ubnd = LocalMaximum( mapdata, 0.0, sqrt( DBL_EPSILON ), xu, status );
}
/* If either extremum could not be found, then report an error. */
if ( ( *lbnd == AST__BAD ) || ( *ubnd == AST__BAD ) ) {
astError( AST__MBBNF, "astMapBox(%s): No valid output coordinates "
"(after %d test points).", status, astGetClass( mapdata->mapping ),
2 * maxiter );
}
/* If an error occurred, then return bad extremum values and
coordinates. */
if ( !astOK ) {
*lbnd = AST__BAD;
*ubnd = AST__BAD;
for ( coord = 0; coord < ncoord; coord++ ) {
xl[ coord ] = AST__BAD;
xu[ coord ] = AST__BAD;
}
}
}
/* Undefine macros local to this function. */
#undef FILL_POSITION_BUFFER
}
void astInitMappingVtab_( AstMappingVtab *vtab, const char *name, int *status ) {
/*
*+
* Name:
* astInitMappingVtab
* Purpose:
* Initialise a virtual function table for a Mapping.
* Type:
* Protected function.
* Synopsis:
* #include "mapping.h"
* void astInitMappingVtab( AstMappingVtab *vtab, const char *name )
* Class Membership:
* Mapping vtab initialiser.
* Description:
* This function initialises the component of a virtual function
* table which is used by the Mapping class.
* Parameters:
* vtab
* Pointer to the virtual function table. The components used by
* all ancestral classes will be initialised if they have not already
* been initialised.
* name
* Pointer to a constant null-terminated character string which contains
* the name of the class to which the virtual function table belongs (it
* is this pointer value that will subsequently be returned by the Object
* astClass function).
*-
*/
/* Local Variables: */
astDECLARE_GLOBALS /* Pointer to thread-specific global data */
AstObjectVtab *object; /* Pointer to Object component of Vtab */
/* Check the local error status. */
if ( !astOK ) return;
/* Get a pointer to the thread specific global data structure. */
astGET_GLOBALS(NULL);
/* Initialize the component of the virtual function table used by the
parent class. */
astInitObjectVtab( (AstObjectVtab *) vtab, name );
/* Store a unique "magic" value in the virtual function table. This
will be used (by astIsAMapping) to determine if an object belongs
to this class. We can conveniently use the address of the (static)
class_check variable to generate this unique value. */
vtab->id.check = &class_check;
vtab->id.parent = &(((AstObjectVtab *) vtab)->id);
/* Initialise member function pointers. */
/* ------------------------------------ */
/* Store pointers to the member functions (implemented here) that provide
virtual methods for this class. */
#define VTAB_GENERIC(X) \
vtab->Resample##X = Resample##X;
VTAB_GENERIC(B)
VTAB_GENERIC(D)
VTAB_GENERIC(F)
VTAB_GENERIC(I)
VTAB_GENERIC(K)
VTAB_GENERIC(L)
VTAB_GENERIC(S)
VTAB_GENERIC(UB)
VTAB_GENERIC(UI)
VTAB_GENERIC(UK)
VTAB_GENERIC(UL)
VTAB_GENERIC(US)
#if HAVE_LONG_DOUBLE /* Not normally implemented */
VTAB_GENERIC(LD)
#endif
#undef VTAB_GENERIC
#define VTAB_GENERIC(X) \
vtab->Rebin##X = Rebin##X; \
vtab->RebinSeq##X = RebinSeq##X;
VTAB_GENERIC(D)
VTAB_GENERIC(F)
VTAB_GENERIC(I)
VTAB_GENERIC(B)
VTAB_GENERIC(UB)
#if HAVE_LONG_DOUBLE /* Not normally implemented */
VTAB_GENERIC(LD)
#endif
#undef VTAB_GENERIC
vtab->ClearInvert = ClearInvert;
vtab->ClearReport = ClearReport;
vtab->Decompose = Decompose;
vtab->DoNotSimplify = DoNotSimplify;
vtab->GetInvert = GetInvert;
vtab->GetIsLinear = GetIsLinear;
vtab->GetIsSimple = GetIsSimple;
vtab->GetNin = GetNin;
vtab->GetNout = GetNout;
vtab->GetReport = GetReport;
vtab->GetTranForward = GetTranForward;
vtab->GetTranInverse = GetTranInverse;
vtab->Invert = Invert;
vtab->LinearApprox = LinearApprox;
vtab->MapBox = MapBox;
vtab->MapList = MapList;
vtab->MapMerge = MapMerge;
vtab->MapSplit = MapSplit;
vtab->QuadApprox = QuadApprox;
vtab->Rate = Rate;
vtab->ReportPoints = ReportPoints;
vtab->RemoveRegions = RemoveRegions;
vtab->SetInvert = SetInvert;
vtab->SetReport = SetReport;
vtab->Simplify = Simplify;
vtab->TestInvert = TestInvert;
vtab->TestReport = TestReport;
vtab->Tran1 = Tran1;
vtab->Tran2 = Tran2;
vtab->TranGrid = TranGrid;
vtab->TranN = TranN;
vtab->TranP = TranP;
vtab->Transform = Transform;
/* Save the inherited pointers to methods that will be extended, and
replace them with pointers to the new member functions. */
object = (AstObjectVtab *) vtab;
parent_clearattrib = object->ClearAttrib;
object->ClearAttrib = ClearAttrib;
parent_getattrib = object->GetAttrib;
object->GetAttrib = GetAttrib;
parent_setattrib = object->SetAttrib;
object->SetAttrib = SetAttrib;
parent_testattrib = object->TestAttrib;
object->TestAttrib = TestAttrib;
parent_equal = object->Equal;
object->Equal = Equal;
/* Declare the destructor, copy constructor and dump function. */
astSetDelete( vtab, Delete );
astSetCopy( vtab, Copy );
astSetDump( vtab, Dump, "Mapping", "Mapping between coordinate systems" );
/* If we have just initialised the vtab for the current class, indicate
that the vtab is now initialised, and store a pointer to the class
identifier in the base "object" level of the vtab. */
if( vtab == &class_vtab ) {
class_init = 1;
astSetVtabClassIdentifier( vtab, &(vtab->id) );
}
}
/*
* Name:
* InterpolateKernel1<X>
* Purpose:
* Resample a data grid, using a 1-d interpolation kernel.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int InterpolateKernel1<X>( AstMapping *this, int ndim_in,
* const int *lbnd_in, const int *ubnd_in,
* const <Xtype> *in, const <Xtype> *in_var,
* int npoint, const int *offset,
* const double *const *coords,
* void (* kernel)( double, const double [], int,
* double *, int * ),
* void (* fkernel)( double, const double [], int,
* double * ),
* int neighb, const double *params, int flags,
* <Xtype> badval,
* <Xtype> *out, <Xtype> *out_var )
* Class Membership:
* Mapping member function.
* Description:
* This is a set of functions which resample a rectangular input
* grid of data (and, optionally, associated statistical variance
* values) so as to place them into a new output grid. Each output
* grid point may be mapped on to a position in the input grid in
* an arbitrary way. The input and output grids may have any number
* of dimensions, not necessarily equal.
*
* Where the positions given do not correspond with a pixel centre
* in the input grid, interpolation is performed using a weighted
* sum of the surrounding pixel values. The weights are determined
* by a separable kernel which is the product of a 1-dimensional
* kernel function evaluated along each input dimension. A pointer
* should be supplied to the 1-dimensional kernel function to be
* used.
* Parameters:
* this
* Pointer to the Mapping being used in the resampling operation
* (this is only used for constructing error messages).
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input grid, its extent along a particular
* (i'th) dimension being ubnd_in[i]-lbnd_in[i]+1 (assuming "i"
* is zero-based). They also define the input grid's coordinate
* system, with each pixel being of unit extent along each
* dimension with integral coordinate values at its centre.
* in
* Pointer to the array of data to be resampled (with an element
* for each pixel in the input grid). The numerical type of
* these data should match the function used, as given by the
* suffix on the function name. The storage order should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
* (i.e. Fortran array storage order).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and type as the "in" array), which
* represent estimates of the statistical variance associated
* with each element of the "in" array. If this second array is
* given (along with the corresponding "out_var" array), then
* estimates of the variance of the resampled data will also be
* returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* npoint
* The number of points at which the input grid is to be
* resampled.
* offset
* Pointer to an array of integers with "npoint" elements. For
* each output point, this array should contain the zero-based
* offset in the output array(s) (i.e. the "out" and,
* optionally, the "out_var" arrays) at which the resampled
* output value(s) should be stored.
* coords
* An array of pointers to double, with "ndim_in"
* elements. Element "coords[coord]" should point at the first
* element of an array of double (with "npoint" elements) which
* contains the values of coordinate number "coord" for each
* interpolation point. The value of coordinate number "coord"
* for interpolation point number "point" is therefore given by
* "coords[coord][point]" (assuming both indices to be
* zero-based). If any point has a coordinate value of AST__BAD
* associated with it, then the corresponding output data (and
* variance) will be set to the value given by "badval" (unles the
* AST__NOBAD flag is specified).
* kernel
* Pointer to the 1-dimensional kernel function to be used.
* fkernel
* Pointer to the 1-dimensional kernel function to be used with no
* trailing status argument. This is only used if "kernel" is NULL.
* neighb
* The number of neighbouring pixels in each dimension (on each
* side of the interpolation position) which are to contribute
* to the interpolated value. This value should be at least 1.
* params
* Pointer to an optional array of parameter values to be passed
* to the interpolation kernel function. If no parameters are
* required by this function, then a NULL pointer may be
* supplied.
* flags
* The bitwise OR of a set of flag values which provide
* additional control over the resampling operation.
* badval
* If the AST__USEBAD flag is set in the "flags" value (above),
* this parameter specifies the value which is used to identify
* bad data and/or variance values in the input array(s). Its
* numerical type must match that of the "in" (and "in_var")
* arrays. Unles the AST__NOBAD flag is specified in "flags", the
* same value will also be used to flag any output array elements
* for which resampled values could not be obtained. The output
* arrays(s) may be flagged with this value whether or not the
* AST__USEBAD flag is set (the function return value indicates
* whether any such values have been produced).
* out
* Pointer to an array with the same data type as the "in"
* array, into which the resampled data will be returned. Note
* that details of how the output grid maps on to this array
* (e.g. the storage order, number of dimensions, etc.) is
* arbitrary and is specified entirely by means of the "offset"
* array. The "out" array should therefore contain sufficient
* elements to accommodate the "offset" values supplied. There
* is no requirement that all elements of the "out" array should
* be assigned values, and any which are not addressed by the
* contents of the "offset" array will be left unchanged.
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the resampled values may be returned. This array will only be
* used if the "in_var" array has been given. It is addressed in
* exactly the same way (via the "offset" array) as the "out"
* array. The values returned are estimates of the statistical
* variance of the corresponding values in the "out" array, on
* the assumption that all errors in input grid values (in the
* "in" array) are statistically independent and that their
* variance estimates (in the "in_var" array) may simply be
* summed (with appropriate weighting factors).
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* Returned Value:
* The number of output grid points for which no valid output value
* could be obtained.
* Notes:
* - There is a separate function for each numerical type of
* gridded data, distinguished by replacing the <X> in the function
* name by the appropriate 1- or 2-character suffix.
* - A value of zero will be returned if any of these functions is
* invoked with the global error status set, or if it should fail
* for any reason.
*/
/* Define macros to implement the function for a specific data
type. */
#define MAKE_INTERPOLATE_KERNEL1(X,Xtype,Xfloating,Xfloattype,Xsigned) \
static int InterpolateKernel1##X( AstMapping *this, int ndim_in, \
const int *lbnd_in, const int *ubnd_in, \
const Xtype *in, const Xtype *in_var, \
int npoint, const int *offset, \
const double *const *coords, \
void (* kernel)( double, const double [], \
int, double *, int * ), \
void (* fkernel)( double, const double [], \
int, double * ), \
int neighb, const double *params, \
int flags, Xtype badval, \
Xtype *out, Xtype *out_var, int *status ) { \
\
/* Local Variables: */ \
astDECLARE_GLOBALS /* Thread-specific data */ \
Xfloattype hi_lim; /* Upper limit on output values */ \
Xfloattype lo_lim; /* Lower limit on output values */ \
Xfloattype sum; /* Weighted sum of pixel data values */ \
Xfloattype sum_var; /* Weighted sum of pixel variance values */ \
Xfloattype val; /* Data value to be assigned to output */ \
Xfloattype val_var; /* Variance to be assigned to output */ \
Xfloattype wtsum; /* Sum of weight values */ \
Xfloattype wtsum_sq; /* Square of sum of weights */ \
Xtype var; /* Variance value */ \
double **wtptr; /* Pointer to array of weight pointers */ \
double **wtptr_last; /* Array of highest weight pointer values */ \
double *kval; /* Pointer to array of kernel values */ \
double *wtprod; /* Accumulated weight value array pointer */ \
double *xn_max; /* Pointer to upper limits array (n-d) */ \
double *xn_min; /* Pointer to lower limits array (n-d) */ \
double pixwt; /* Weight to apply to individual pixel */ \
double wt_y; /* Value of y-dependent pixel weight */ \
double x; /* x coordinate value */ \
double xmax; /* x upper limit */ \
double xmin; /* x lower limit */ \
double xn; /* Coordinate value (n-d) */ \
double y; /* y coordinate value */ \
double ymax; /* y upper limit */ \
double ymin; /* y lower limit */ \
int *hi; /* Pointer to array of upper indices */ \
int *lo; /* Pointer to array of lower indices */ \
int *stride; /* Pointer to array of dimension strides */ \
int bad; /* Output pixel bad? */ \
int bad_var; /* Output variance bad? */ \
int done; /* All pixel indices done? */ \
int hi_x; /* Upper pixel index (x dimension) */ \
int hi_y; /* Upper pixel index (y dimension) */ \
int idim; /* Loop counter for dimensions */ \
int ii; /* Loop counter for dimensions */ \
int ix; /* Pixel index in input grid x dimension */ \
int ixn; /* Pixel index in input grid (n-d) */ \
int iy; /* Pixel index in input grid y dimension */ \
int kerror; /* Error signalled by kernel function? */ \
int lo_x; /* Lower pixel index (x dimension) */ \
int lo_y; /* Lower pixel index (y dimension) */ \
int nobad; /* Was the AST__NOBAD flag set? */ \
int off1; /* Input pixel offset due to y index */ \
int off_in; /* Offset to input pixel */ \
int off_out; /* Offset to output pixel */ \
int pixel; /* Offset to input pixel containing point */ \
int point; /* Loop counter for output points */ \
int result; /* Result value to return */ \
int s; /* Temporary variable for strides */ \
int usebad; /* Use "bad" input pixel values? */ \
int usevar; /* Process variance array? */ \
int ystride; /* Stride along input grid y dimension */ \
\
/* Initialise. */ \
result = 0; \
\
/* Check the global error status. */ \
if ( !astOK ) return result; \
\
/* Get a pointer to a structure holding thread-specific global data values */ \
astGET_GLOBALS(this); \
\
/* Further initialisation. */ \
kerror = 0; \
sum_var = 0; \
val = 0; \
val_var = 0; \
wtsum = 0; \
bad = 0; \
bad_var = 0; \
sum = 0.0; \
\
/* Determine if we are processing bad pixels or variances. */ \
nobad = flags & AST__NOBAD; \
usebad = flags & AST__USEBAD; \
usevar = in_var && out_var; \
\
/* Set up limits for checking output values to ensure that they do not \
overflow the range of the data type being used. */ \
lo_lim = LO_##X; \
hi_lim = HI_##X; \
\
/* Handle the 1-dimensional case optimally. */ \
/* ---------------------------------------- */ \
if ( ndim_in == 1 ) { \
\
/* Calculate the coordinate limits of the input grid. */ \
xmin = (double) lbnd_in[ 0 ] - 0.5; \
xmax = (double) ubnd_in[ 0 ] + 0.5; \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,1) \
} \
} \
} \
\
/* Four more cases as above, but this time with the AST__NOBAD flag \
un-set. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,0) \
} \
} \
} \
} \
\
/* Exit point on error in kernel function */ \
Kernel_Error_1d: ; \
\
/* Handle the 2-dimensional case optimally. */ \
/* ---------------------------------------- */ \
} else if ( ndim_in == 2 ) { \
\
/* Allocate workspace. */ \
kval = astMalloc( sizeof( double ) * (size_t) ( 2 * neighb ) ); \
if ( astOK ) { \
\
/* Calculate the stride along the y dimension of the input grid. */ \
ystride = ubnd_in[ 0 ] - lbnd_in[ 0 ] + 1; \
\
/* Calculate the coordinate limits of the input grid in each \
dimension. */ \
xmin = (double) lbnd_in[ 0 ] - 0.5; \
xmax = (double) ubnd_in[ 0 ] + 0.5; \
ymin = (double) lbnd_in[ 1 ] - 0.5; \
ymax = (double) ubnd_in[ 1 ] + 0.5; \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,1) \
} \
} \
} \
\
/* Another four cases, as above, but this time without the AST__NOBAD \
flag. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,0) \
} \
} \
} \
} \
\
/* Exit point on error in kernel function */ \
Kernel_Error_2d: ; \
} \
\
/* Free the workspace. */ \
kval = astFree( kval ); \
\
/* Handle other numbers of dimensions. */ \
/* ----------------------------------- */ \
} else { \
\
/* Allocate workspace. */ \
hi = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
lo = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
stride = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
xn_max = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
xn_min = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
kval = astMalloc( sizeof( double ) * (size_t) \
( 2 * neighb * ndim_in ) ); \
wtprod = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
wtptr = astMalloc( sizeof( double * ) * (size_t) ndim_in ); \
wtptr_last = astMalloc( sizeof( double * ) * (size_t) ndim_in ); \
if ( astOK ) { \
\
/* Calculate the stride along each dimension of the input grid. */ \
for ( s = 1, idim = 0; idim < ndim_in; idim++ ) { \
stride[ idim ] = s; \
s *= ubnd_in[ idim ] - lbnd_in[ idim ] + 1; \
\
/* Calculate the coordinate limits of the input grid in each \
dimension. */ \
xn_min[ idim ] = (double) lbnd_in[ idim ] - 0.5; \
xn_max[ idim ] = (double) ubnd_in[ idim ] + 0.5; \
} \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,1) \
} \
} \
} \
\
/* Another 4 cases as above, but this time with the AST__NOBAD flag \
un-set. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,0) \
} \
} \
} \
} \
\
/* Exit point on error in kernel function */ \
Kernel_Error_Nd: ;\
} \
\
/* Free the workspace. */ \
hi = astFree( hi ); \
lo = astFree( lo ); \
stride = astFree( stride ); \
xn_max = astFree( xn_max ); \
xn_min = astFree( xn_min ); \
kval = astFree( kval ); \
wtprod = astFree( wtprod ); \
wtptr = astFree( wtptr ); \
wtptr_last = astFree( wtptr_last ); \
} \
\
/* If an error occurred in the kernel function, then report a \
contextual error message. */ \
if ( kerror ) { \
astError( astStatus, "astResample"#X"(%s): Error signalled by " \
"user-supplied 1-d interpolation kernel.", status, \
astGetClass( unsimplified_mapping ) ); \
} \
\
/* If an error has occurred, clear the returned result. */ \
if ( !astOK ) result = 0; \
\
/* Return the result. */ \
return result; \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the 1-dimensional
case. */
#define ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,Usebad,Usevar) \
\
/* Obtain the x coordinate of the current point and test if it lies \
outside the input grid, or is bad. */ \
x = coords[ 0 ][ point ]; \
bad = ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* If input bad pixels must be detected, then obtain the offset along \
the input grid x dimension of the input pixel which contains the \
current coordinate, and calculate this pixel's offset from the \
start of the input array. */ \
if ( Usebad ) { \
pixel = (int) floor( x + 0.5 ) - lbnd_in[ 0 ]; \
\
/* Test if the pixel is bad. */ \
bad = ( in[ pixel ] == badval ); \
} \
\
/* If OK, calculate the lowest and highest indices (in the x \
dimension) of the region of neighbouring pixels that will \
contribute to the interpolated result. Constrain these values to \
lie within the input grid. */ \
if ( !bad ) { \
ix = (int) floor( x ); \
lo_x = MaxI( ix - neighb + 1, lbnd_in[ 0 ], status ); \
hi_x = MinI( ix + neighb, ubnd_in[ 0 ], status ); \
\
/* Initialise sums for forming the interpolated result. */ \
sum = (Xfloattype) 0.0; \
wtsum = (Xfloattype) 0.0; \
if ( Usevar ) { \
sum_var = (Xfloattype) 0.0; \
bad_var = 0; \
} \
\
/* Loop to inspect all the contributing pixels, calculating the offset \
of each pixel from the start of the input array. */ \
off_in = lo_x - lbnd_in[ 0 ]; \
for ( ix = lo_x; ix <= hi_x; ix++, off_in++ ) { \
\
/* If necessary, test if the input pixel is bad. If not, calculate its \
weight by evaluating the kernel function. */ \
if ( !( Usebad ) || ( in[ off_in ] != badval ) ) { \
if( kernel ) { \
( *kernel )( (double) ix - x, params, flags, &pixwt, status ); \
} else { \
( *fkernel )( (double) ix - x, params, flags, &pixwt ); \
} \
\
/* Check for errors arising in the kernel function. */ \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_Error_1d; \
} \
\
/* Form the weighted sums required for finding the interpolated \
value. */ \
sum += ( (Xfloattype) pixwt ) * ( (Xfloattype) in[ off_in ] ); \
wtsum += (Xfloattype) pixwt; \
\
/* If a variance estimate is required and it still seems possible to \
obtain one, then obtain the variance value associated with the \
current input pixel. */ \
if ( Usevar ) { \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
var = in_var[ off_in ]; \
\
/* If necessary, test if this value is bad (if the data type is \
signed, also check that it is not negative). */ \
if ( Usebad ) bad_var = ( var == badval ); \
CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
\
/* If any bad input variance value is obtained, we cannot generate a \
valid output variance estimate. Otherwise, form the sum needed to \
calculate this estimate. */ \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
sum_var += ( (Xfloattype) ( pixwt * pixwt ) ) * \
( (Xfloattype) var ); \
} \
} \
} \
} \
} \
} \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the 2-dimensional
case. */
#define ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,Usebad,Usevar) \
\
/* Obtain the x coordinate of the current point and test if it lies \
outside the input grid, or is bad. */ \
x = coords[ 0 ][ point ]; \
bad = ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* If not, then similarly obtain and test the y coordinate. */ \
y = coords[ 1 ][ point ]; \
bad = ( y < ymin ) || ( y >= ymax ) || ( y == AST__BAD ); \
if ( !bad ) { \
\
/* If input bad pixels must be detected, then obtain the offsets along \
each input grid dimension of the input pixel which contains the \
current coordinates, and calculate this pixel's offset from the \
start of the input array. */ \
if ( Usebad ) { \
ix = (int) floor( x + 0.5 ); \
iy = (int) floor( y + 0.5 ); \
pixel = ix - lbnd_in[ 0 ] + ystride * ( iy - lbnd_in[ 1 ] ); \
\
/* Test if the pixel is bad. */ \
bad = ( in[ pixel ] == badval ); \
} \
\
/* If OK, calculate the lowest and highest indices (in each dimension) \
of the region of neighbouring pixels that will contribute to the \
interpolated result. Constrain these values to lie within the input \
grid. */ \
if ( !bad ) { \
ix = (int) floor( x ); \
lo_x = MaxI( ix - neighb + 1, lbnd_in[ 0 ], status ); \
hi_x = MinI( ix + neighb, ubnd_in[ 0 ], status ); \
iy = (int) floor( y ); \
lo_y = MaxI( iy - neighb + 1, lbnd_in[ 1 ], status ); \
hi_y = MinI( iy + neighb, ubnd_in[ 1 ], status ); \
\
/* Loop to evaluate the kernel function along the x dimension, storing \
the resulting values. The function's argument is the offset of the \
contributing pixel (along this dimension) from the input \
position. */ \
for ( ix = lo_x; ix <= hi_x; ix++ ) { \
if( kernel ) { \
( *kernel )( (double) ix - x, params, flags, \
kval + ix - lo_x, status ); \
} else { \
( *fkernel )( (double) ix - x, params, flags, \
kval + ix - lo_x ); \
} \
\
/* Check for errors arising in the kernel function. */ \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_Error_2d; \
} \
} \
\
/* Initialise sums for forming the interpolated result. */ \
sum = (Xfloattype) 0.0; \
wtsum = (Xfloattype) 0.0; \
if ( Usevar ) { \
sum_var = (Xfloattype) 0.0; \
bad_var = 0; \
} \
\
/* Loop over the y index to inspect all the contributing pixels, while \
keeping track of their offset within the input array. Evaluate the \
kernel function for each y index value. */ \
off1 = lo_x - lbnd_in[ 0 ] + ystride * ( lo_y - lbnd_in[ 1 ] ); \
for ( iy = lo_y; iy <= hi_y; iy++, off1 += ystride ) { \
if( kernel ) { \
( *kernel )( (double) iy - y, params, flags, &wt_y, status ); \
} else { \
( *fkernel )( (double) iy - y, params, flags, &wt_y ); \
} \
\
/* Check for errors arising in the kernel function. */ \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_Error_2d; \
} \
\
/* Loop over the x index, calculating the pixel offset in the input \
array. */ \
off_in = off1; \
for ( ix = lo_x; ix <= hi_x; ix++, off_in++ ) { \
\
/* If necessary, test if the input pixel is bad. If not, calculate its \
weight as the product of the kernel function's value for the x and \
y dimensions. */ \
if ( !( Usebad ) || ( in[ off_in ] != badval ) ) { \
pixwt = kval[ ix - lo_x ] * wt_y; \
\
/* Form the weighted sums required for finding the interpolated \
value. */ \
sum += ( (Xfloattype) pixwt ) * \
( (Xfloattype) in[ off_in ] ); \
wtsum += (Xfloattype) pixwt; \
\
/* If a variance estimate is required and it still seems possible to \
obtain one, then obtain the variance value associated with the \
current input pixel. */ \
if ( Usevar ) { \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
var = in_var[ off_in ]; \
\
/* If necessary, test if this value is bad (if the data type is \
signed, also check that it is not negative). */ \
if ( Usebad ) bad_var = ( var == badval ); \
CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
\
/* If any bad input variance value is obtained, we cannot generate a \
valid output variance estimate. Otherwise, form the sum needed to \
calculate this estimate. */ \
if ( !( ( Xsigned ) || ( Usebad ) ) || \
!bad_var ) { \
sum_var += ( (Xfloattype) ( pixwt * pixwt ) ) * \
( (Xfloattype) var ); \
} \
} \
} \
} \
} \
} \
} \
} \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the n-dimensional
case. */
#define ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,Usebad,Usevar) \
\
/* Initialise offsets into the input array. Then loop to obtain each \
coordinate associated with the current output point. */ \
pixel = 0; \
off_in = 0; \
for ( idim = 0; idim < ndim_in; idim++ ) { \
xn = coords[ idim ][ point ]; \
\
/* Test if the coordinate lies outside the input grid, or is bad. If \
either is true, the corresponding output pixel value will be bad, \
so give up on this point. */ \
bad = ( xn < xn_min[ idim ] ) || ( xn >= xn_max[ idim ] ) || \
( xn == AST__BAD ); \
if ( bad ) break; \
\
/* If input bad pixels must be detected, then obtain the index along \
the current input grid dimension of the pixel which contains this \
coordinate and accumulate the pixel's offset from the start of the \
input array. */ \
if ( Usebad ) { \
pixel += stride[ idim ] * \
( (int) floor( xn + 0.5 ) - lbnd_in[ idim ] ); \
} \
\
/* Calculate the lowest and highest indices (in the current dimension) \
of the region of neighbouring pixels that will contribute to the \
interpolated result. Constrain these values to lie within the input \
grid. */ \
ixn = (int) floor( xn ); \
lo[ idim ] = MaxI( ixn - neighb + 1, lbnd_in[ idim ], status ); \
hi[ idim ] = MinI( ixn + neighb, ubnd_in[ idim ], status ); \
\
/* Accumulate the offset (from the start of the input array) of the \
contributing pixel which has the lowest index in each dimension. */ \
off_in += stride[ idim ] * ( lo[ idim ] - lbnd_in[ idim ] ); \
} \
\
/* Once the input pixel which contains the required coordinates has \
been identified, test if it is bad, if necessary. */ \
if ( Usebad ) bad = bad || ( in[ pixel ] == badval ); \
\
/* If OK, loop to evaluate the kernel function which will be used to \
weight the contributions from surrounding pixels. */ \
if ( !bad ) { \
for ( idim = 0; idim < ndim_in; idim++ ) { \
\
/* Set up an array of pointers to locate kernel values (stored in the \
"kval" array) for each dimension. Initially, each of these pointers \
locates the first weight value which applies to the contributing \
pixel with the lowest index in each dimension. */ \
wtptr[ idim ] = kval + ( 2 * neighb * idim ); \
\
/* Also set up pointers to the last weight value in each dimension. */ \
wtptr_last[ idim ] = wtptr[ idim ] + ( hi[ idim ] - lo[ idim ] ); \
\
/* Loop to evaluate the kernel function along each dimension, storing \
the resulting values. The function's argument is the offset of the \
contributing pixel (along the relevant dimension) from the input \
point. */ \
xn = coords[ idim ][ point ]; \
for ( ixn = lo[ idim ]; ixn <= hi[ idim ]; ixn++ ) { \
if( kernel ) { \
( *kernel )( (double) ixn - xn, params, flags, \
wtptr[ idim ] + ixn - lo[ idim ], status ); \
} else { \
( *fkernel )( (double) ixn - xn, params, flags, \
wtptr[ idim ] + ixn - lo[ idim ] ); \
} \
\
/* Check for errors arising in the kernel function. */ \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_Error_Nd; \
} \
} \
} \
\
/* Initialise, and loop over the neighbouring input pixels to obtain \
an interpolated value. */ \
sum = (Xfloattype) 0.0; \
wtsum = (Xfloattype) 0.0; \
if ( Usevar ) { \
sum_var = (Xfloattype) 0.0; \
bad_var = 0; \
} \
idim = ndim_in - 1; \
wtprod[ idim ] = 1.0; \
done = 0; \
do { \
\
/* Each contributing pixel is weighted by the product of the kernel \
weight factors evaluated along each input dimension. However, since \
we typically only change the index of one dimension at a time, we \
can avoid forming this product repeatedly by retaining an array of \
accumulated products for all higher dimensions. We need then only \
update the lower elements in this array, corresponding to those \
dimensions whose index has changed. We do this here, "idim" being \
the index of the most significant dimension to have changed. Note \
that on the first pass, all dimensions are considered changed, \
causing this array to be initialised. */ \
for ( ii = idim; ii >= 1; ii-- ) { \
wtprod[ ii - 1 ] = wtprod[ ii ] * *( wtptr[ ii ] ); \
} \
\
/* If necessary, test each pixel which may contribute to the result to \
see if it is bad. If not, obtain its weight from the accumulated \
product of weights. Also multiply by the weight for dimension zero, \
which is not included in the "wtprod" array). */ \
if ( !( Usebad ) || ( in[ off_in ] != badval ) ) { \
pixwt = wtprod[ 0 ] * *( wtptr[ 0 ] ); \
\
/* Form the weighted sums required for finding the interpolated \
value. */ \
sum += ( (Xfloattype) pixwt ) * ( (Xfloattype) in[ off_in ] ); \
wtsum += (Xfloattype) pixwt; \
\
/* If a variance estimate is required and it still seems possible to \
obtain one, then obtain the variance value associated with the \
current input pixel. */ \
if ( Usevar ) { \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
var = in_var[ off_in ]; \
\
/* If necessary, test if this value is bad (if the data type is \
signed, also check that it is not negative). */ \
if ( Usebad ) bad_var = ( var == badval ); \
CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
\
/* If any bad input variance value is obtained, we cannot generate a \
valid output variance estimate. Otherwise, form the sum needed to \
calculate this estimate. */ \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
sum_var += ( (Xfloattype) ( pixwt * pixwt ) ) * \
( (Xfloattype) var ); \
} \
} \
} \
} \
\
/* Now update the weight value pointers and pixel offset to refer to \
the next input pixel to be considered. */ \
idim = 0; \
do { \
\
/* The first input dimension whose weight value pointer has not yet \
reached its final value has this pointer incremented, and the pixel \
offset into the input array is updated accordingly. */ \
if ( wtptr[ idim ] != wtptr_last[ idim ] ) { \
wtptr[ idim ]++; \
off_in += stride[ idim ]; \
break; \
\
/* Any earlier dimensions (which have reached the final pointer value) \
have this pointer returned to its lowest value. Again, the pixel \
offset into the input image is updated accordingly. */ \
} else { \
wtptr[ idim ] -= ( hi[ idim ] - lo[ idim ] ); \
off_in -= stride[ idim ] * \
( hi[ idim ] - lo[ idim ] ); \
done = ( ++idim == ndim_in ); \
} \
} while ( !done ); \
} while ( !done ); \
}
/* This subsidiary macro calculates the interpolated output value (and
variance) from the sums over contributing pixels, checks the
results for validity, and assigns them to the output array(s). */
#define CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Usebad,Usevar,Nobad) \
\
/* If the output data value has not yet been flagged as bad, then \
check that an interpolated value can actually be produced. First \
check that the sum of weights is not zero. */ \
if ( !bad ) { \
bad = ( wtsum == (Xfloattype) 0.0 ); \
\
/* If OK, calculate the interpolated value. Then, if the output data \
type is not floating point, check that this value will not overflow \
the available output range. */ \
if ( !bad ) { \
val = sum / wtsum; \
if ( !( Xfloating ) ) { \
bad = ( val <= lo_lim ) || ( val >= hi_lim ); \
} \
} \
\
/* If no interpolated data value can be produced, then no associated \
variance will be required either. */ \
if ( ( Usevar ) && bad ) bad_var = 1; \
} \
\
/* Now perform similar checks on the output variance value (if \
required). This time we check that the square of the sum of \
weights is not zero (since this might underflow before the sum of \
weights). Again we also check to prevent the result overflowing the \
output data type. */ \
if ( ( Usevar ) && !bad_var ) { \
wtsum_sq = wtsum * wtsum; \
bad_var = ( wtsum_sq == (Xfloattype) 0.0 ); \
if ( !bad_var ) { \
val_var = sum_var / wtsum_sq; \
if ( !( Xfloating ) ) { \
bad_var = ( val_var <= lo_lim ) || ( val_var >= hi_lim ); \
} \
} \
} \
\
/* Obtain the pixel offset into the output array. */ \
off_out = offset[ point ]; \
\
/* Assign a bad output value (and variance) if required and count it. */ \
if ( bad ) { \
if( !Nobad ) { \
out[ off_out ] = badval; \
if ( Usevar ) out_var[ off_out ] = badval; \
} \
result++; \
\
/* Otherwise, assign the interpolated value. If the output data type \
is floating point, the result can be stored directly, otherwise we \
must round to the nearest integer. */ \
} else { \
if ( Xfloating ) { \
out[ off_out ] = (Xtype) val; \
} else { \
out[ off_out ] = (Xtype) ( val + ( ( val >= (Xfloattype) 0.0 ) ? \
( (Xfloattype) 0.5 ) : \
( (Xfloattype) -0.5 ) ) ); \
} \
\
/* If a variance estimate is required but none can be obtained, then \
store a bad output variance value and count it. */ \
if ( Usevar ) { \
if ( bad_var ) { \
if( !Nobad ) { \
out_var[ off_out ] = badval; \
} \
result++; \
\
/* Otherwise, store the variance estimate, rounding to the nearest \
integer if necessary. */ \
} else { \
if ( Xfloating ) { \
out_var[ off_out ] = (Xtype) val_var; \
} else { \
out_var[ off_out ] = (Xtype) ( val_var + \
( ( val_var >= (Xfloattype) 0.0 ) ? \
( (Xfloattype) 0.5 ) : \
( (Xfloattype) -0.5 ) ) ); \
} \
} \
} \
}
/* These subsidiary macros define limits for range checking of results
before conversion to the final data type. For each data type code
<X>, HI_<X> gives the least positive floating point value which
just overflows that data type towards plus infinity, while LO_<X>
gives the least negative floating point value which just overflows
that data type towards minus infinity. Thus, a floating point value
must satisfy LO<flt_value<HI if overflow is not to occur when it is
converted to that data type.
The data type of each limit should be that of the smallest
precision floating point type which will accommodate the full range
of values that the target type may take. */
/* If <X> is a floating point type, the limits are not actually used,
but must be present to permit error-free compilation. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
#define HI_LD ( 0.0L )
#define LO_LD ( 0.0L )
#endif
#define HI_D ( 0.0 )
#define LO_D ( 0.0 )
#define HI_F ( 0.0f )
#define LO_F ( 0.0f )
#if HAVE_LONG_DOUBLE /* Not normally implemented */
#define HI_K ( 0.5L + (long double) LONG_MAX )
#define LO_K ( -0.5L + (long double) LONG_MIN )
#define HI_UK ( 0.5L + (long double) ULONG_MAX )
#define LO_UK ( -0.5L )
#define HI_L ( 0.5L + (long double) LONG_MAX )
#define LO_L ( -0.5L + (long double) LONG_MIN )
#define HI_UL ( 0.5L + (long double) ULONG_MAX )
#define LO_UL ( -0.5L )
#else
#define HI_K ( 0.5 + (double) LONG_MAX )
#define LO_K ( -0.5 + (double) LONG_MIN )
#define HI_UK ( 0.5 + (double) ULONG_MAX )
#define LO_UK ( -0.5 )
#define HI_L ( 0.5 + (double) LONG_MAX )
#define LO_L ( -0.5 + (double) LONG_MIN )
#define HI_UL ( 0.5 + (double) ULONG_MAX )
#define LO_UL ( -0.5 )
#endif
#define HI_I ( 0.5 + (double) INT_MAX )
#define LO_I ( -0.5 + (double) INT_MIN )
#define HI_UI ( 0.5 + (double) UINT_MAX )
#define LO_UI ( -0.5 )
#define HI_S ( 0.5f + (float) SHRT_MAX )
#define LO_S ( -0.5f + (float) SHRT_MIN )
#define HI_US ( 0.5f + (float) USHRT_MAX )
#define LO_US ( -0.5f )
#define HI_B ( 0.5f + (float) SCHAR_MAX )
#define LO_B ( -0.5f + (float) SCHAR_MIN )
#define HI_UB ( 0.5f + (float) UCHAR_MAX )
#define LO_UB ( -0.5f )
/* This subsidiary macro tests for negative variance values. This
check is required only for signed data types. */
#define CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
bad_var = bad_var || ( var < ( (Xtype) 0 ) );
/* Expand the main macro above to generate a function for each
required signed data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_INTERPOLATE_KERNEL1(LD,long double,1,long double,1)
MAKE_INTERPOLATE_KERNEL1(L,long int,0,long double,1)
MAKE_INTERPOLATE_KERNEL1(K,INT_BIG,0,long double,1)
#else
MAKE_INTERPOLATE_KERNEL1(L,long int,0,double,1)
MAKE_INTERPOLATE_KERNEL1(K,INT_BIG,0,double,1)
#endif
MAKE_INTERPOLATE_KERNEL1(D,double,1,double,1)
MAKE_INTERPOLATE_KERNEL1(F,float,1,float,1)
MAKE_INTERPOLATE_KERNEL1(I,int,0,double,1)
MAKE_INTERPOLATE_KERNEL1(S,short int,0,float,1)
MAKE_INTERPOLATE_KERNEL1(B,signed char,0,float,1)
/* Re-define the macro for testing for negative variances to do
nothing. */
#undef CHECK_FOR_NEGATIVE_VARIANCE
#define CHECK_FOR_NEGATIVE_VARIANCE(Xtype)
/* Expand the main macro above to generate a function for each
required unsigned data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_INTERPOLATE_KERNEL1(UL,unsigned long int,0,long double,0)
MAKE_INTERPOLATE_KERNEL1(UK,UINT_BIG,0,long double,0)
#else
MAKE_INTERPOLATE_KERNEL1(UL,unsigned long int,0,double,0)
MAKE_INTERPOLATE_KERNEL1(UK,UINT_BIG,0,double,0)
#endif
MAKE_INTERPOLATE_KERNEL1(UI,unsigned int,0,double,0)
MAKE_INTERPOLATE_KERNEL1(US,unsigned short int,0,float,0)
MAKE_INTERPOLATE_KERNEL1(UB,unsigned char,0,float,0)
/* Undefine the macros used above. */
#undef CHECK_FOR_NEGATIVE_VARIANCE
#if HAVE_LONG_DOUBLE /* Not normally implemented */
#undef HI_LD
#undef LO_LD
#endif
#undef HI_D
#undef LO_D
#undef HI_F
#undef LO_F
#undef HI_L
#undef LO_L
#undef HI_UL
#undef LO_UL
#undef HI_K
#undef LO_K
#undef HI_UK
#undef LO_UK
#undef HI_I
#undef LO_I
#undef HI_UI
#undef LO_UI
#undef HI_S
#undef LO_S
#undef HI_US
#undef LO_US
#undef HI_B
#undef LO_B
#undef HI_UB
#undef LO_UB
#undef CALC_AND_ASSIGN_OUTPUT
#undef ASSEMBLE_INPUT_ND
#undef ASSEMBLE_INPUT_2D
#undef ASSEMBLE_INPUT_1D
#undef MAKE_INTERPOLATE_KERNEL1
/*
* Name:
* InterpolateLinear<X>
* Purpose:
* Resample a data grid, using the linear interpolation scheme.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int InterpolateLinear<X>( int ndim_in,
* const int *lbnd_in, const int *ubnd_in,
* const <Xtype> *in, const <Xtype> *in_var,
* int npoint, const int *offset,
* const double *const *coords,
* int flags, <Xtype> badval,
* <Xtype> *out, <Xtype> *out_var )
* Class Membership:
* Mapping member function.
* Description:
* This is a set of functions which resample a rectangular input
* grid of data (and, optionally, associated statistical variance
* values) so as to place them into a new output grid. Each output
* grid point may be mapped on to a position in the input grid in
* an arbitrary way. Where the positions given do not correspond
* with a pixel centre in the input grid, the interpolation scheme
* used is linear interpolation between the centres of the nearest
* neighbouring pixels in each dimension (there are 2 nearest
* neighbours in 1 dimension, 4 in 2 dimensions, 8 in 3 dimensions,
* etc.).
* Parameters:
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input grid, its extent along a particular
* (i'th) dimension being ubnd_in[i]-lbnd_in[i]+1 (assuming "i"
* is zero-based). They also define the input grid's coordinate
* system, with each pixel being of unit extent along each
* dimension with integral coordinate values at its centre.
* in
* Pointer to the array of data to be resampled (with an element
* for each pixel in the input grid). The numerical type of
* these data should match the function used, as given by the
* suffix on the function name. The storage order should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
* (i.e. Fortran array storage order).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and type as the "in" array), which
* represent estimates of the statistical variance associated
* with each element of the "in" array. If this second array is
* given (along with the corresponding "out_var" array), then
* estimates of the variance of the resampled data will also be
* returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* npoint
* The number of points at which the input grid is to be
* resampled.
* offset
* Pointer to an array of integers with "npoint" elements. For
* each output point, this array should contain the zero-based
* offset in the output array(s) (i.e. the "out" and,
* optionally, the "out_var" arrays) at which the resampled
* output value(s) should be stored.
* coords
* An array of pointers to double, with "ndim_in"
* elements. Element "coords[coord]" should point at the first
* element of an array of double (with "npoint" elements) which
* contains the values of coordinate number "coord" for each
* interpolation point. The value of coordinate number "coord"
* for interpolation point number "point" is therefore given by
* "coords[coord][point]" (assuming both indices to be
* zero-based). If any point has a coordinate value of AST__BAD
* associated with it, then the corresponding output data (and
* variance) will be set to the value given by "badval" (unles the
* AST__NOBAD flag is specified).
* flags
* The bitwise OR of a set of flag values which control the
* operation of the function. Currently, only the flag
* AST__USEBAD is significant and indicates whether there are
* "bad" (i.e. missing) data in the input array(s) which must be
* recognised and propagated to the output array(s). If this
* flag is not set, all input values are treated literally.
* badval
* If the AST__USEBAD flag is set in the "flags" value (above),
* this parameter specifies the value which is used to identify
* bad data and/or variance values in the input array(s). Its
* numerical type must match that of the "in" (and "in_var")
* arrays. Unles the AST__NOBAD flag is specified in "flags", the
* same value will also be used to flag any output array elements
* for which resampled values could not be obtained. The output
* arrays(s) may be flagged with this value whether or not the
* AST__USEBAD flag is set (the function return value indicates
* whether any such values have been produced).
* out
* Pointer to an array with the same data type as the "in"
* array, into which the resampled data will be returned. Note
* that details of how the output grid maps on to this array
* (e.g. the storage order, number of dimensions, etc.) is
* arbitrary and is specified entirely by means of the "offset"
* array. The "out" array should therefore contain sufficient
* elements to accommodate the "offset" values supplied. There
* is no requirement that all elements of the "out" array should
* be assigned values, and any which are not addressed by the
* contents of the "offset" array will be left unchanged.
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the resampled values may be returned. This array will only be
* used if the "in_var" array has been given. It is addressed in
* exactly the same way (via the "offset" array) as the "out"
* array. The values returned are estimates of the statistical
* variance of the corresponding values in the "out" array, on
* the assumption that all errors in input grid values (in the
* "in" array) are statistically independent and that their
* variance estimates (in the "in_var" array) may simply be
* summed (with appropriate weighting factors).
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* Returned Value:
* The number of output grid points to which a data value (or a
* variance value if relevant) equal to "badval" has been assigned
* because no valid output value could be obtained.
* Notes:
* - There is a separate function for each numerical type of
* gridded data, distinguished by replacing the <X> in the function
* name by the appropriate 1- or 2-character suffix.
* - A value of zero will be returned if any of these functions is
* invoked with the global error status set, or if it should fail
* for any reason.
*/
/* Define macros to implement the function for a specific data
type. */
#define MAKE_INTERPOLATE_LINEAR(X,Xtype,Xfloating,Xfloattype,Xsigned) \
static int InterpolateLinear##X( int ndim_in, \
const int *lbnd_in, const int *ubnd_in, \
const Xtype *in, const Xtype *in_var, \
int npoint, const int *offset, \
const double *const *coords, \
int flags, Xtype badval, \
Xtype *out, Xtype *out_var, int *status ) { \
\
/* Local Variables: */ \
Xfloattype sum; /* Weighted sum of pixel data values */ \
Xfloattype sum_var; /* Weighted sum of pixel variance values */ \
Xfloattype val; /* Value to be asigned to output pixel */ \
Xfloattype wtsum; /* Sum of weight values */ \
Xtype var; /* Variance value */ \
double *frac_hi; /* Pointer to array of weights */ \
double *frac_lo; /* Pointer to array of weights */ \
double *wt; /* Pointer to array of weights */ \
double *wtprod; /* Array of accumulated weights pointer */ \
double *xn_max; /* Pointer to upper limits array (n-d) */ \
double *xn_min; /* Pointer to lower limits array (n-d) */ \
double frac_hi_x; /* Pixel weight (x dimension) */ \
double frac_hi_y; /* Pixel weight (y dimension) */ \
double frac_lo_x; /* Pixel weight (x dimension) */ \
double frac_lo_y; /* Pixel weight (y dimension) */ \
double pixwt; /* Weight to apply to individual pixel */ \
double x; /* x coordinate value */ \
double xmax; /* x upper limit */ \
double xmin; /* x lower limit */ \
double xn; /* Coordinate value (n-d) */ \
double y; /* y coordinate value */ \
double ymax; /* y upper limit */ \
double ymin; /* y lower limit */ \
int *dim; /* Pointer to array of pixel indices */ \
int *hi; /* Pointer to array of upper indices */ \
int *lo; /* Pointer to array of lower indices */ \
int *stride; /* Pointer to array of dimension strides */ \
int bad; /* Output pixel bad? */ \
int bad_var; /* Output variance bad? */ \
int done; /* All pixel indices done? */ \
int hi_x; /* Upper pixel index (x dimension) */ \
int hi_y; /* Upper pixel index (y dimension) */ \
int idim; /* Loop counter for dimensions */ \
int ii; /* Loop counter for weights */ \
int ix; /* Pixel index in input grid x dimension */ \
int ixn; /* Pixel index (n-d) */ \
int iy; /* Pixel index in input grid y dimension */ \
int lo_x; /* Lower pixel index (x dimension) */ \
int lo_y; /* Lower pixel index (y dimension) */ \
int nobad; /* Was the AST__NOBAD flag set? */ \
int off_in; /* Offset to input pixel */ \
int off_lo; /* Offset to "first" input pixel */ \
int off_out; /* Offset to output pixel */ \
int pixel; /* Offset to input pixel containing point */ \
int point; /* Loop counter for output points */ \
int result; /* Result value to return */ \
int s; /* Temporary variable for strides */ \
int usebad; /* Use "bad" input pixel values? */ \
int usevar; /* Process variance array? */ \
int ystride; /* Stride along input grid y dimension */ \
\
/* Initialise. */ \
result = 0; \
\
/* Check the global error status. */ \
if ( !astOK ) return result; \
\
/* Initialise variables to avoid "used of uninitialised variable" \
messages from dumb compilers. */ \
sum = 0; \
sum_var = 0; \
wtsum = 0; \
bad = 0; \
bad_var = 0; \
\
/* Determine if we are processing bad pixels or variances. */ \
nobad = flags & AST__NOBAD; \
usebad = flags & AST__USEBAD; \
usevar = in_var && out_var; \
\
/* Handle the 1-dimensional case optimally. */ \
/* ---------------------------------------- */ \
if ( ndim_in == 1 ) { \
\
/* Calculate the coordinate limits of the input grid. */ \
xmin = (double) lbnd_in[ 0 ] - 0.5; \
xmax = (double) ubnd_in[ 0 ] + 0.5; \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
0,0,1) \
} \
} \
} \
\
/* Four more cases as above, but this time with the AST__NOBAD flag \
un-set. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
0,0,0) \
} \
} \
} \
} \
\
/* Handle the 2-dimensional case optimally. */ \
/* ---------------------------------------- */ \
} else if ( ndim_in == 2 ) { \
\
/* Calculate the stride along the y dimension of the input grid. */ \
ystride = ubnd_in[ 0 ] - lbnd_in[ 0 ] + 1; \
\
/* Calculate the coordinate limits of the input grid in each \
dimension. */ \
xmin = (double) lbnd_in[ 0 ] - 0.5; \
xmax = (double) ubnd_in[ 0 ] + 0.5; \
ymin = (double) lbnd_in[ 1 ] - 0.5; \
ymax = (double) ubnd_in[ 1 ] + 0.5; \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
0,0,1) \
} \
} \
} \
\
/* Four more case as above, but without the AST__NOBAD flag. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
0,0,0) \
} \
} \
} \
} \
\
/* Handle other numbers of dimensions. */ \
/* ----------------------------------- */ \
} else { \
\
/* Allocate workspace. */ \
dim = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
frac_hi = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
frac_lo = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
hi = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
lo = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
stride = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
wt = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
wtprod = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
xn_max = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
xn_min = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
if ( astOK ) { \
\
/* Calculate the stride along each dimension of the input grid. */ \
for ( s = 1, idim = 0; idim < ndim_in; idim++ ) { \
stride[ idim ] = s; \
s *= ubnd_in[ idim ] - lbnd_in[ idim ] + 1; \
\
/* Calculate the coordinate limits of the input grid in each \
dimension. */ \
xn_min[ idim ] = (double) lbnd_in[ idim ] - 0.5; \
xn_max[ idim ] = (double) ubnd_in[ idim ] + 0.5; \
} \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype, \
Xsigned,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype, \
Xsigned,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype, \
Xsigned,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype, \
Xsigned,0,0,1) \
} \
} \
} \
\
/* Four more case as above, but without the AST__NOBAD flag. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype, \
Xsigned,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype, \
Xsigned,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype, \
Xsigned,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype, \
Xsigned,0,0,0) \
} \
} \
} \
} \
} \
\
/* Free the workspace. */ \
dim = astFree( dim ); \
frac_hi = astFree( frac_hi ); \
frac_lo = astFree( frac_lo ); \
hi = astFree( hi ); \
lo = astFree( lo ); \
stride = astFree( stride ); \
wt = astFree( wt ); \
wtprod = astFree( wtprod ); \
xn_max = astFree( xn_max ); \
xn_min = astFree( xn_min ); \
} \
\
/* If an error has occurred, clear the returned result. */ \
if ( !astOK ) result = 0; \
\
/* Return the result. */ \
return result; \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the 1-dimensional
case. */
#define ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,Usebad,Usevar) \
\
/* Obtain the x coordinate of the current point and test if it lies \
outside the input grid. Also test if it is bad. */ \
x = coords[ 0 ][ point ]; \
bad = ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* If input bad pixels must be detected, then obtain the offset along \
the input grid x dimension of the input pixel which contains the \
current coordinate and calculate this pixel's offset from the start \
of the input array. */ \
if ( Usebad ) { \
pixel = (int) floor( x + 0.5 ) - lbnd_in[ 0 ]; \
\
/* Test if the pixel is bad. */ \
bad = ( in[ pixel ] == badval ); \
} \
\
/* If OK, obtain the indices along the input grid x dimension of the \
two adjacent pixels which will contribute to the interpolated \
result. Also obtain the fractional weight to be applied to each of \
these pixels. */ \
if ( !bad ) { \
lo_x = (int) floor( x ); \
hi_x = lo_x + 1; \
frac_lo_x = (double) hi_x - x; \
frac_hi_x = 1.0 - frac_lo_x; \
\
/* Obtain the offset within the input array of the first pixel to be \
used for interpolation (the one with the smaller index). */ \
off_lo = lo_x - lbnd_in[ 0 ]; \
\
/* Initialise sums for forming the interpolated result. */ \
sum = (Xfloattype) 0.0; \
wtsum = (Xfloattype) 0.0; \
if ( Usevar ) { \
sum_var = (Xfloattype) 0.0; \
if ( ( Xsigned ) || ( Usebad ) ) bad_var = 0; \
} \
\
/* For each of the two pixels which may contribute to the result, \
test if the pixel index lies within the input grid. Where it does, \
accumulate the sums required for forming the interpolated \
result. In each case, we supply the pixel's offset within the input \
array and the weight to be applied to it. */ \
if ( lo_x >= lbnd_in[ 0 ] ) { \
FORM_LINEAR_INTERPOLATION_SUM(off_lo,frac_lo_x,Xtype, \
Xfloattype,Xsigned,Usebad,Usevar) \
} \
if ( hi_x <= ubnd_in[ 0 ] ) { \
FORM_LINEAR_INTERPOLATION_SUM(off_lo + 1,frac_hi_x,Xtype, \
Xfloattype,Xsigned,Usebad,Usevar) \
} \
} \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the 2-dimensional
case. */
#define ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,Usebad,Usevar) \
\
/* Obtain the x coordinate of the current point and test if it lies \
outside the input grid. Also test if it is bad. */ \
x = coords[ 0 ][ point ]; \
bad = ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* If OK, then similarly obtain and test the y coordinate. */ \
y = coords[ 1 ][ point ]; \
bad = ( y < ymin ) || ( y >= ymax ) || ( y == AST__BAD ); \
if ( !bad ) { \
\
/* If input bad pixels must be detected, then obtain the offsets along \
each input grid dimension of the input pixel which contains the \
current coordinates. */ \
if ( Usebad ) { \
ix = (int) floor( x + 0.5 ); \
iy = (int) floor( y + 0.5 ); \
\
/* Calculate this pixel's offset from the start of the input array. */ \
pixel = ix - lbnd_in[ 0 ] + ystride * ( iy - lbnd_in[ 1 ] ); \
\
/* Test if the pixel is bad. */ \
bad = ( in[ pixel ] == badval ); \
} \
\
/* If OK, obtain the indices along the input grid x dimension of the \
two adjacent pixels which will contribute to the interpolated \
result. Also obtain the fractional weight to be applied to each of \
these pixels. */ \
if ( !bad ) { \
lo_x = (int) floor( x ); \
hi_x = lo_x + 1; \
frac_lo_x = (double) hi_x - x; \
frac_hi_x = 1.0 - frac_lo_x; \
\
/* Repeat this process for the y dimension. */ \
lo_y = (int) floor( y ); \
hi_y = lo_y + 1; \
frac_lo_y = (double) hi_y - y; \
frac_hi_y = 1.0 - frac_lo_y; \
\
/* Obtain the offset within the input array of the first pixel to be \
used for interpolation (the one with the smaller index along both \
dimensions). */ \
off_lo = lo_x - lbnd_in[ 0 ] + ystride * ( lo_y - lbnd_in[ 1 ] ); \
\
/* Initialise sums for forming the interpolated result. */ \
sum = (Xfloattype) 0.0; \
wtsum = (Xfloattype) 0.0; \
if ( Usevar ) { \
sum_var = (Xfloattype) 0.0; \
if ( ( Xsigned ) || ( Usebad ) ) bad_var = 0; \
} \
\
/* For each of the four pixels which may contribute to the result, \
test if the pixel indices lie within the input grid. Where they do, \
accumulate the sums required for forming the interpolated \
result. In each case, we supply the pixel's offset within the input \
array and the weight to be applied to it. */ \
if ( lo_y >= lbnd_in[ 1 ] ) { \
if ( lo_x >= lbnd_in[ 0 ] ) { \
FORM_LINEAR_INTERPOLATION_SUM(off_lo, \
frac_lo_x * frac_lo_y,Xtype, \
Xfloattype, Xsigned, \
Usebad,Usevar) \
} \
if ( hi_x <= ubnd_in[ 0 ] ) { \
FORM_LINEAR_INTERPOLATION_SUM(off_lo + 1, \
frac_hi_x * frac_lo_y,Xtype, \
Xfloattype,Xsigned, \
Usebad,Usevar) \
} \
} \
if ( hi_y <= ubnd_in[ 1 ] ) { \
if ( lo_x >= lbnd_in[ 0 ] ) { \
FORM_LINEAR_INTERPOLATION_SUM(off_lo + ystride, \
frac_lo_x * frac_hi_y,Xtype, \
Xfloattype,Xsigned, \
Usebad,Usevar) \
} \
if ( hi_x <= ubnd_in[ 0 ] ) { \
FORM_LINEAR_INTERPOLATION_SUM(off_lo + ystride + 1, \
frac_hi_x * frac_hi_y,Xtype, \
Xfloattype,Xsigned, \
Usebad,Usevar) \
} \
} \
} \
} \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the n-dimensional
case. */
#define ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,Usebad,Usevar) \
\
/* Initialise offsets into the input array. Then loop to obtain each
coordinate associated with the current output point. */ \
off_in = 0; \
if ( Usebad ) pixel = 0; \
for ( idim = 0; idim < ndim_in; idim++ ) { \
xn = coords[ idim ][ point ]; \
\
/* Test if the coordinate lies outside the input grid. Also test if \
it is bad. If either is true, the corresponding output pixel value \
will be bad, so give up on this point. */ \
bad = ( xn < xn_min[ idim ] ) || ( xn >= xn_max[ idim ] ) || \
( xn == AST__BAD ); \
if ( bad ) break; \
\
/* If input bad pixels must be detected, obtain the index along the \
current input grid dimension of the pixel which contains this \
coordinate and accumulate the pixel's offset from the start of the \
input array. */ \
if ( Usebad ) { \
pixel += stride[ idim ] * \
( (int) floor( xn + 0.5 ) - lbnd_in[ idim ] ); \
} \
\
/* Obtain the indices along the current dimension of the input grid of \
the two (usually adjacent) pixels which will contribute to the \
output value. If necessary, however, restrict each index to ensure \
it does not lie outside the input grid. Also calculate the \
fractional weight to be given to each pixel in order to interpolate \
linearly between them. */ \
ixn = (int) floor( xn ); \
lo[ idim ] = MaxI( ixn, lbnd_in[ idim ], status ); \
hi[ idim ] = MinI( ixn + 1, ubnd_in[ idim ], status ); \
frac_lo[ idim ] = 1.0 - fabs( xn - (double) lo[ idim ] ); \
frac_hi[ idim ] = 1.0 - fabs( xn - (double) hi[ idim ] ); \
\
/* Store the lower index involved in interpolation along each \
dimension and accumulate the offset from the start of the input \
array of the pixel which has these indices. */ \
dim[ idim ] = lo[ idim ]; \
off_in += stride[ idim ] * ( lo[ idim ] - lbnd_in[ idim ] ); \
\
/* Also store the fractional weight associated with the lower pixel \
along each dimension. */ \
wt[ idim ] = frac_lo[ idim ]; \
} \
\
/* If the input pixel which contains the required coordinates has \
been identified, test if it is bad. */ \
if ( Usebad ) bad = bad || ( in[ pixel ] == badval ); \
\
/* If OK, initialise and loop over adjacent input pixels to obtain an \
interpolated value. */ \
if ( !bad ) { \
sum = (Xfloattype) 0.0; \
wtsum = (Xfloattype) 0.0; \
if ( Usevar ) { \
sum_var = (Xfloattype) 0.0; \
if ( ( Xsigned ) || ( Usebad ) ) bad_var = 0; \
} \
idim = ndim_in - 1; \
wtprod[ idim ] = 1.0; \
done = 0; \
do { \
\
/* Each contributing pixel is weighted by the product of the weights \
which account for the displacement of its centre from the required \
position along each dimension. However, since we typically only \
change the index of one dimension at a time, we can avoid forming \
this product repeatedly by retaining an array of accumulated weight \
products for all higher dimensions. We need then only update the \
lower elements in this array, corresponding to those dimensions \
whose index has changed. We do this here, "idim" being the index of \
the most significant dimension to have changed. Note that on the \
first pass, all dimensions are considered changed, causing this \
array to be initialised. */ \
for ( ii = idim; ii >= 1; ii-- ) { \
wtprod[ ii - 1 ] = wtprod[ ii ] * wt[ ii ]; \
} \
\
/* Accumulate the sums required for forming the interpolated \
result. We supply the pixel's offset within the input array and the \
weight to be applied to it. The pixel weight is formed by including \
the weight factor for dimension zero, since this is not included in \
the "wtprod" array. */ \
FORM_LINEAR_INTERPOLATION_SUM(off_in,wtprod[ 0 ] * wt[ 0 ], \
Xtype,Xfloattype,Xsigned, \
Usebad,Usevar) \
\
/* Now update the indices, offset and weight factors to refer to the \
next input pixel to be considered. */ \
idim = 0; \
do { \
\
/* The first input dimension which still refers to the pixel with the \
lower of the two possible indices is switched to refer to the other \
pixel (with the higher index). The offset into the input array and \
the fractional weight factor for this dimension are also updated \
accordingly. */ \
if ( dim[ idim ] != hi[ idim ] ) { \
dim[ idim ] = hi[ idim ]; \
off_in += stride[ idim ]; \
wt[ idim ] = frac_hi[ idim ]; \
break; \
\
/* Any earlier dimensions (referring to the higher index) are switched \
back to the lower index, if not already there, before going on to \
consider the next dimension. (This process is the same as \
incrementing a binary number and propagating overflows up through \
successive digits, except that dimensions where the "lo" and "hi" \
values are the same can only take one value.) The process stops at \
the first attempt to return the final dimension to the lower \
index. */ \
} else { \
if ( dim[ idim ] != lo[ idim ] ) { \
dim[ idim ] = lo[ idim ]; \
off_in -= stride[ idim ]; \
wt[ idim ] = frac_lo[ idim ]; \
} \
done = ( ++idim == ndim_in ); \
} \
} while ( !done ); \
} while ( !done ); \
}
/* This subsidiary macro adds the contribution from a specified input
pixel to the accumulated sums for forming the linearly interpolated
value. */
#define FORM_LINEAR_INTERPOLATION_SUM(off,wt,Xtype,Xfloattype,Xsigned, \
Usebad,Usevar) \
\
/* Obtain the offset of the input pixel to use. */ \
off_in = ( off ); \
\
/* If necessary, test if this pixel is bad. If not, then obtain the \
weight to apply to it. */ \
if ( !( Usebad ) || ( in[ off_in ] != badval ) ) { \
pixwt = ( wt ); \
\
/* Increment the weighted sum of pixel values and the sum of weights. */ \
sum += ( (Xfloattype) in[ off_in ] ) * ( (Xfloattype) pixwt ); \
wtsum += (Xfloattype) pixwt; \
\
/* If an output variance estimate is to be generated, and it still \
seems possible to produce one, then obtain the input variance \
value. */ \
if ( Usevar ) { \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
var = in_var[ off_in ]; \
\
/* Test if the variance value is bad (if the data type is signed, also \
check that it is not negative). */ \
if ( Usebad ) bad_var = ( var == badval ); \
CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
\
/* If OK, increment the weighted sum of variance values. */ \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
sum_var += ( (Xfloattype) ( pixwt * pixwt ) ) * \
( (Xfloattype) var ); \
} \
} \
} \
}
/* This subsidiary macro calculates the interpolated output value (and
variance) from the sums over contributing pixels and assigns them
to the output array(s). */
#define CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Xsigned, \
Usebad,Usevar,Nobad) \
\
/* Obtain the pixel offset into the output array. */ \
off_out = offset[ point ]; \
\
/* Assign a bad output value (and variance) if required and count it. */ \
if ( bad ) { \
if( !Nobad ) { \
out[ off_out ] = badval; \
if ( Usevar ) out_var[ off_out ] = badval; \
} \
result++; \
\
/* Otherwise, calculate the interpolated value. If the output data \
type is floating point, this result can be stored directly, \
otherwise we must round to the nearest integer. */ \
} else { \
val = sum / wtsum; \
if ( Xfloating ) { \
out[ off_out ] = (Xtype) val; \
} else { \
out[ off_out ] = (Xtype) ( val + ( ( val >= (Xfloattype) 0.0 ) ? \
( (Xfloattype) 0.5 ) : \
( (Xfloattype) -0.5 ) ) ); \
} \
\
/* If a variance estimate is required but none can be obtained, then \
store a bad output variance value and count it. */ \
if ( Usevar ) { \
if ( ( ( Xsigned ) || ( Usebad ) ) && bad_var ) { \
if( !Nobad ) out_var[ off_out ] = badval; \
result++; \
\
/* Otherwise, calculate the variance estimate and store it, rounding \
to the nearest integer if necessary. */ \
} else { \
val = sum_var / ( wtsum * wtsum ); \
if ( Xfloating ) { \
out_var[ off_out ] = (Xtype) val; \
} else { \
out_var[ off_out ] = (Xtype) ( val + \
( ( val >= (Xfloattype) 0.0 ) ? \
( (Xfloattype) 0.5 ) : \
( (Xfloattype) -0.5 ) ) ); \
} \
} \
} \
}
/* This subsidiary macro tests for negative variance values in the
macros above. This check is required only for signed data types. */
#define CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
bad_var = bad_var || ( var < ( (Xtype) 0 ) );
/* Expand the main macro above to generate a function for each
required signed data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_INTERPOLATE_LINEAR(LD,long double,1,long double,1)
MAKE_INTERPOLATE_LINEAR(L,long int,0,long double,1)
MAKE_INTERPOLATE_LINEAR(K,INT_BIG,0,long double,1)
#else
MAKE_INTERPOLATE_LINEAR(L,long int,0,double,1)
MAKE_INTERPOLATE_LINEAR(K,INT_BIG,0,double,1)
#endif
MAKE_INTERPOLATE_LINEAR(D,double,1,double,1)
MAKE_INTERPOLATE_LINEAR(F,float,1,float,1)
MAKE_INTERPOLATE_LINEAR(I,int,0,double,1)
MAKE_INTERPOLATE_LINEAR(S,short int,0,float,1)
MAKE_INTERPOLATE_LINEAR(B,signed char,0,float,1)
/* Re-define the macro for testing for negative variances to do
nothing. */
#undef CHECK_FOR_NEGATIVE_VARIANCE
#define CHECK_FOR_NEGATIVE_VARIANCE(Xtype)
/* Expand the main macro above to generate a function for each
required unsigned data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_INTERPOLATE_LINEAR(UL,unsigned long int,0,long double,0)
MAKE_INTERPOLATE_LINEAR(UK,UINT_BIG,0,long double,0)
#else
MAKE_INTERPOLATE_LINEAR(UL,unsigned long int,0,double,0)
MAKE_INTERPOLATE_LINEAR(UK,UINT_BIG,0,double,0)
#endif
MAKE_INTERPOLATE_LINEAR(UI,unsigned int,0,double,0)
MAKE_INTERPOLATE_LINEAR(US,unsigned short int,0,float,0)
MAKE_INTERPOLATE_LINEAR(UB,unsigned char,0,float,0)
/* Undefine the macros uxsed above. */
#undef CHECK_FOR_NEGATIVE_VARIANCE
#undef CALC_AND_ASSIGN_OUTPUT
#undef FORM_LINEAR_INTERPOLATION_SUM
#undef ASSEMBLE_INPUT_ND
#undef ASSEMBLE_INPUT_2D
#undef ASSEMBLE_INPUT_1D
#undef MAKE_INTERPOLATE_LINEAR
/*
* Name:
* InterpolateNearest<X>
* Purpose:
* Resample a data grid, using the nearest-pixel interpolation scheme.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int InterpolateNearest<X>( int ndim_in,
* const int *lbnd_in, const int *ubnd_in,
* const <Xtype> *in, const <Xtype> *in_var,
* int npoint, const int *offset,
* const double *const *coords,
* int flags, <Xtype> badval,
* <Xtype> *out, <Xtype> *out_var )
* Class Membership:
* Mapping member function.
* Description:
* This is a set of functions which resample a rectangular input
* grid of data (and, optionally, associated statistical variance
* values) so as to place them into a new output grid. Each output
* grid point may be mapped on to a position in the input grid in
* an arbitrary way. Where the positions given do not correspond
* with a pixel centre in the input grid, the interpolation scheme
* used is simply to select the nearest pixel (i.e. the one whose
* bounds contain the supplied position).
* Parameters:
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input grid, its extent along a particular
* (i'th) dimension being ubnd_in[i]-lbnd_in[i]+1 (assuming "i"
* is zero-based). They also define the input grid's coordinate
* system, with each pixel being of unit extent along each
* dimension with integral coordinate values at its centre.
* in
* Pointer to the array of data to be resampled (with an element
* for each pixel in the input grid). The numerical type of
* these data should match the function used, as given by the
* suffix on the function name. The storage order should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
* (i.e. Fortran array storage order).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and type as the "in" array), which
* represent estimates of the statistical variance associated
* with each element of the "in" array. If this second array is
* given (along with the corresponding "out_var" array), then
* estimates of the variance of the resampled data will also be
* returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* npoint
* The number of points at which the input grid is to be
* resampled.
* offset
* Pointer to an array of integers with "npoint" elements. For
* each output point, this array should contain the zero-based
* offset in the output array(s) (i.e. the "out" and,
* optionally, the "out_var" arrays) at which the resampled
* output value(s) should be stored.
* coords
* An array of pointers to double, with "ndim_in"
* elements. Element "coords[coord]" should point at the first
* element of an array of double (with "npoint" elements) which
* contains the values of coordinate number "coord" for each
* interpolation point. The value of coordinate number "coord"
* for interpolation point number "point" is therefore given by
* "coords[coord][point]" (assuming both indices to be
* zero-based). If any point has a coordinate value of AST__BAD
* associated with it, then the corresponding output data (and
* variance) will be set to the value given by "badval" (unles the
* AST__NOBAD flag is specified).
* flags
* The bitwise OR of a set of flag values which control the
* operation of the function. Currently, only the flag
* AST__USEBAD is significant and indicates whether there are
* "bad" (i.e. missing) data in the input array(s) which must be
* recognised and propagated to the output array(s). If this
* flag is not set, all input values are treated literally.
* badval
* If the AST__USEBAD flag is set in the "flags" value (above),
* this parameter specifies the value which is used to identify
* bad data and/or variance values in the input array(s). Its
* numerical type must match that of the "in" (and "in_var")
* arrays. Unles the AST__NOBAD flag is specified in "flags", the
* same value will also be used to flag any output array elements
* for which resampled values could not be obtained. The output
* arrays(s) may be flagged with this value whether or not the
* AST__USEBAD flag is set (the function return value indicates
* whether any such values have been produced).
* out
* Pointer to an array with the same data type as the "in"
* array, into which the resampled data will be returned. Note
* that details of how the output grid maps on to this array
* (e.g. the storage order, number of dimensions, etc.) is
* arbitrary and is specified entirely by means of the "offset"
* array. The "out" array should therefore contain sufficient
* elements to accommodate the "offset" values supplied. There
* is no requirement that all elements of the "out" array should
* be assigned values, and any which are not addressed by the
* contents of the "offset" array will be left unchanged.
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the resampled values may be returned. This array will only be
* used if the "in_var" array has been given. It is addressed in
* exactly the same way (via the "offset" array) as the "out"
* array. The values returned are estimates of the statistical
* variance of the corresponding values in the "out" array, on
* the assumption that all errors in input grid values (in the
* "in" array) are statistically independent and that their
* variance estimates (in the "in_var" array) may simply be
* summed (with appropriate weighting factors).
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* Returned Value:
* The number of output grid points to which a data value (or a
* variance value if relevant) equal to "badval" has been assigned
* because no valid output value could be obtained.
* Notes:
* - There is a separate function for each numerical type of
* gridded data, distinguished by replacing the <X> in the function
* name by the appropriate 1- or 2-character suffix.
* - A value of zero will be returned if any of these functions is
* invoked with the global error status set, or if it should fail
* for any reason.
*/
/* Define a macro to implement the function for a specific data
type. */
#define MAKE_INTERPOLATE_NEAREST(X,Xtype,Xsigned) \
static int InterpolateNearest##X( int ndim_in, \
const int *lbnd_in, const int *ubnd_in, \
const Xtype *in, const Xtype *in_var, \
int npoint, const int *offset, \
const double *const *coords, \
int flags, Xtype badval, \
Xtype *out, Xtype *out_var, int *status ) { \
\
/* Local Variables: */ \
Xtype var; /* Variance value */ \
double *xn_max; /* Pointer to upper limits array (n-d) */ \
double *xn_min; /* Pointer to lower limits array (n-d) */ \
double x; /* x coordinate value */ \
double xmax; /* x upper limit */ \
double xmin; /* x lower limit */ \
double xn; /* Coordinate value (n-d) */ \
double y; /* y coordinate value */ \
double ymax; /* y upper limit */ \
double ymin; /* y lower limit */ \
int *stride; /* Pointer to array of dimension strides */ \
int bad; /* Output pixel bad? */ \
int idim; /* Loop counter for dimensions */ \
int ix; /* Number of pixels offset in x direction */ \
int ixn; /* Number of pixels offset (n-d) */ \
int iy; /* Number of pixels offset in y direction */ \
int nobad; /* Was the AST__NOBAD flag set? */ \
int off_in; /* Pixel offset into input array */ \
int off_out; /* Pixel offset into output array */ \
int point; /* Loop counter for output points */ \
int result; /* Returned result value */ \
int s; /* Temporary variable for strides */ \
int usebad; /* Use "bad" input pixel values? */ \
int usevar; /* Process variance array? */ \
int ystride; /* Stride along input grid y direction */ \
\
/* Initialise. */ \
result = 0; \
\
/* Check the global error status. */ \
if ( !astOK ) return result; \
\
/* Initialise variables to avoid "used of uninitialised variable" \
messages from dumb compilers. */ \
bad = 0; \
off_in = 0; \
\
/* Determine if we are processing bad pixels or variances. */ \
nobad = flags & AST__NOBAD; \
usebad = flags & AST__USEBAD; \
usevar = in_var && out_var; \
\
/* Handle the 1-dimensional case optimally. */ \
/* ---------------------------------------- */ \
if ( ndim_in == 1 ) { \
\
/* Calculate the coordinate limits of the input array. */ \
xmin = (double) lbnd_in[ 0 ] - 0.5; \
xmax = (double) ubnd_in[ 0 ] + 0.5; \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,0,1) \
} \
} \
} \
\
/* Four more cases as above, but without the AST__NOBAD flag. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,0,0) \
} \
} \
} \
} \
\
/* Handle the 2-dimensional case optimally. */ \
/* ---------------------------------------- */ \
} else if ( ndim_in == 2 ) { \
\
/* Calculate the stride along the y dimension of the input grid. */ \
ystride = ubnd_in[ 0 ] - lbnd_in[ 0 ] + 1; \
\
/* Calculate the coordinate limits of the input array in each \
dimension. */ \
xmin = (double) lbnd_in[ 0 ] - 0.5; \
xmax = (double) ubnd_in[ 0 ] + 0.5; \
ymin = (double) lbnd_in[ 1 ] - 0.5; \
ymax = (double) ubnd_in[ 1 ] + 0.5; \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,0,1) \
} \
} \
} \
\
/* Four more cases as above, but without the AST__NOBAD flag. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,0,0) \
} \
} \
} \
} \
\
/* Handle other numbers of dimensions. */ \
/* ----------------------------------- */ \
} else { \
\
/* Allocate workspace. */ \
stride = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
xn_max = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
xn_min = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
if ( astOK ) { \
\
/* Calculate the stride along each dimension of the input grid. */ \
for ( s = 1, idim = 0; idim < ndim_in; idim++ ) { \
stride[ idim ] = s; \
s *= ubnd_in[ idim ] - lbnd_in[ idim ] + 1; \
\
/* Calculate the coordinate limits of the input grid in each \
dimension. */ \
xn_min[ idim ] = (double) lbnd_in[ idim ] - 0.5; \
xn_max[ idim ] = (double) ubnd_in[ idim ] + 0.5; \
} \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,0,1) \
} \
} \
} \
\
/* Another 4 cases as above, but without the AST__NOBAD flag. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,0,0,0) \
} \
} \
} \
} \
} \
\
/* Free the workspace. */ \
stride = astFree( stride ); \
xn_max = astFree( xn_max ); \
xn_min = astFree( xn_min ); \
} \
\
/* If an error has occurred, clear the returned result. */ \
if ( !astOK ) result = 0; \
\
/* Return the result. */ \
return result; \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the 1-dimensional
case. */
#define ASSEMBLE_INPUT_1D(X,Xtype,Usebad,Usevar) \
\
/* Obtain the x coordinate of the current point and test if it lies \
outside the input grid, or is bad. */ \
x = coords[ 0 ][ point ]; \
bad = ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* If not, then obtain the offset within the input grid of the pixel \
which contains the current point. */ \
off_in = (int) floor( x + 0.5 ) - lbnd_in[ 0 ]; \
\
/* If necessary, test if the input pixel is bad. */ \
if ( Usebad ) bad = ( in[ off_in ] == badval ); \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the 2-dimensional
case. */
#define ASSEMBLE_INPUT_2D(X,Xtype,Usebad,Usevar) \
\
/* Obtain the x coordinate of the current point and test if it lies \
outside the input grid, or is bad. */ \
x = coords[ 0 ][ point ]; \
bad = ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* If not, then similarly obtain and test the y coordinate. */ \
y = coords[ 1 ][ point ]; \
bad = ( y < ymin ) || ( y >= ymax ) || ( y == AST__BAD ); \
if ( !bad ) { \
\
/* Obtain the offsets along each input grid dimension of the input \
pixel which contains the current point. */ \
ix = (int) floor( x + 0.5 ) - lbnd_in[ 0 ]; \
iy = (int) floor( y + 0.5 ) - lbnd_in[ 1 ]; \
\
/* Calculate this pixel's offset from the start of the input array. */ \
off_in = ix + ystride * iy; \
\
/* If necessary, test if the input pixel is bad. */ \
if ( Usebad ) bad = ( in[ off_in ] == badval ); \
} \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the n-dimensional
case. */
#define ASSEMBLE_INPUT_ND(X,Xtype,Usebad,Usevar) \
\
/* Initialise the offset into the input array. Then loop to obtain \
each coordinate associated with the current output point. */ \
off_in = 0; \
for ( idim = 0; idim < ndim_in; idim++ ) { \
xn = coords[ idim ][ point ]; \
\
/* Test if the coordinate lies outside the input grid, or is bad. If \
either is true, the corresponding output pixel value will be bad, \
so give up on this point. */ \
bad = ( xn < xn_min[ idim ] ) || ( xn >= xn_max[ idim ] ) || \
( xn == AST__BAD ); \
if ( bad ) break; \
\
/* Obtain the offset along the current input grid dimension of the \
input pixel which contains the current point. */ \
ixn = (int) floor( xn + 0.5 ) - lbnd_in[ idim ]; \
\
/* Accumulate this pixel's offset from the start of the input \
array. */ \
off_in += ixn * stride[ idim ]; \
} \
\
/* Once the required input pixel has been located, test if it is \
bad, if necessary. */ \
if ( Usebad ) bad = bad || ( in[ off_in ] == badval );
/* This subsidiary macro assigns the output value (and variance) to
the output array(s). */
#define CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xsigned,Usebad,Usevar,Nobad) \
\
/* Obtain the pixel offset into the output array. */ \
off_out = offset[ point ]; \
\
/* If the input data value is bad, assign a bad output value (and \
variance, if required) and count it. */ \
if ( bad ) { \
if( !Nobad ) { \
out[ off_out ] = badval; \
if ( Usevar ) out_var[ off_out ] = badval; \
} \
result++; \
\
/* Otherwise, assign the value obtained from the input grid. */ \
} else { \
out[ off_out ] = in[ off_in ]; \
\
/* If required, obtain the associated variance value. If necessary, \
test if it is bad (if the data type is signed, also check that it \
is not negative). */ \
if ( Usevar ) { \
var = in_var[ off_in ]; \
if ( Usebad ) bad = ( var == badval ); \
CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
\
/* If the variance value can be bad, and is, then store a bad value in \
the output array and count it. Otherwise, store the variance \
value. */ \
if ( ( ( Xsigned ) || ( Usebad ) ) && bad ) { \
if( !Nobad ) out_var[ off_out ] = badval; \
result++; \
} else { \
out_var[ off_out ] = var; \
} \
} \
}
/* This subsidiary macro tests for negative variance values in the
macros above. This check is required only for signed data
types. */
#define CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
bad = bad || ( var < ( (Xtype) 0 ) );
/* Expand the main macro above to generate a function for each
required signed data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_INTERPOLATE_NEAREST(LD,long double,1)
#endif
MAKE_INTERPOLATE_NEAREST(D,double,1)
MAKE_INTERPOLATE_NEAREST(F,float,1)
MAKE_INTERPOLATE_NEAREST(L,long int,1)
MAKE_INTERPOLATE_NEAREST(K,INT_BIG,1)
MAKE_INTERPOLATE_NEAREST(I,int,1)
MAKE_INTERPOLATE_NEAREST(S,short int,1)
MAKE_INTERPOLATE_NEAREST(B,signed char,1)
/* Re-define the macro for testing for negative variances to do
nothing. */
#undef CHECK_FOR_NEGATIVE_VARIANCE
#define CHECK_FOR_NEGATIVE_VARIANCE(Xtype)
/* Expand the main macro above to generate a function for each
required unsigned data type. */
MAKE_INTERPOLATE_NEAREST(UK,UINT_BIG,0)
MAKE_INTERPOLATE_NEAREST(UL,unsigned long int,0)
MAKE_INTERPOLATE_NEAREST(UI,unsigned int,0)
MAKE_INTERPOLATE_NEAREST(US,unsigned short int,0)
MAKE_INTERPOLATE_NEAREST(UB,unsigned char,0)
/* Undefine the macros used above. */
#undef CHECK_FOR_NEGATIVE_VARIANCE
#undef CALC_AND_ASSIGN_OUTPUT
#undef ASSEMBLE_INPUT_ND
#undef ASSEMBLE_INPUT_2D
#undef ASSEMBLE_INPUT_1D
#undef MAKE_INTERPOLATE_NEAREST
/*
* Name:
* InterpolateBlockAverage<X>
* Purpose:
* Resample a data grid, using multidimensional block averaging.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void InterpolateBlockAverage<X>( int ndim_in,
* const int lbnd_in[],
* const int ubnd_in[],
* const <Xtype> in[],
* const <Xtype> in_var[],
* int npoint, const int offset[],
* const double *const coords[],
* const double params[], int flags,
* <Xtype> badval, <Xtype> *out,
* <Xtype> *out_var, int *nbad )
* Class Membership:
* Mapping member function.
* Description:
* This is a set of functions which resample a rectangular input
* grid of data (and, optionally, associated statistical variance
* values) so as to place them into a new output grid. To generate
* an output grid pixel, a block average is taken over an ndim-
* dimensional hypercube of pixels in the input grid. If variances
* are being used then the input pixels will be weighted according
* to the reciprocals of the corresponding variance values, and
* input pixels without a valid variance will be ignored;
* otherwise an unweighted average will be taken over
* all non-bad pixels in the cube. The size of the cube over which
* the average is taken is determined by the first element of the
* params array.
*
* This "interpolation" scheme is appropriate where an input grid
* is to be resampled onto a much coarser output grid.
* Parameters:
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input grid, its extent along a particular
* (i'th) dimension being ubnd_in[i]-lbnd_in[i]+1 (assuming "i"
* is zero-based). They also define the input grid's coordinate
* system, with each pixel being of unit extent along each
* dimension with integral coordinate values at its centre.
* in
* Pointer to the array of data to be resampled (with an element
* for each pixel in the input grid). The numerical type of
* these data should match the function used, as given by the
* suffix on the function name. The storage order should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
* (i.e. Fortran array storage order).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and type as the "in" array), which
* represent estimates of the statistical variance associated
* with each element of the "in" array. If this second array is
* given (along with the corresponding "out_var" array), then
* estimates of the variance of the resampled data will also be
* returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* npoint
* The number of points at which the input grid is to be
* resampled.
* offset
* Pointer to an array of integers with "npoint" elements. For
* each output point, this array should contain the zero-based
* offset in the output array(s) (i.e. the "out" and,
* optionally, the "out_var" arrays) at which the resampled
* output value(s) should be stored.
* coords
* An array of pointers to double, with "ndim_in"
* elements. Element "coords[coord]" should point at the first
* element of an array of double (with "npoint" elements) which
* contains the values of coordinate number "coord" for each
* interpolation point. The value of coordinate number "coord"
* for interpolation point number "point" is therefore given by
* "coords[coord][point]" (assuming both indices to be
* zero-based). If any point has a coordinate value of AST__BAD
* associated with it, then the corresponding output data (and
* variance) will be set to the value given by "badval" (unles the
* AST__NOBAD flag is specified).
* params
* A pointer to an array of doubles giving further information
* about how the resampling is to proceed. Only the first
* element is significant; the nearest integer to this gives
* the number of pixels on either side of the central input
* grid pixel to use in each dimension. Therefore
* (1 + 2*params[0])**ndim_in pixels will be averaged over to
* generate each output pixel.
* flags
* The bitwise OR of a set of flag values which control the
* operation of the function. Currently, only the flag
* AST__USEBAD is significant and indicates whether there are
* "bad" (i.e. missing) data in the input array(s) which must be
* recognised and propagated to the output array(s). If this
* flag is not set, all input values are treated literally.
* badval
* If the AST__USEBAD flag is set in the "flags" value (above),
* this parameter specifies the value which is used to identify
* bad data and/or variance values in the input array(s). Its
* numerical type must match that of the "in" (and "in_var")
* arrays. Unles the AST__NOBAD flag is specified in "flags", the
* same value will also be used to flag any output array elements
* for which resampled values could not be obtained. The output
* arrays(s) may be flagged with this value whether or not the
* AST__USEBAD flag is set (the function return value indicates
* whether any such values have been produced).
* out
* Pointer to an array with the same data type as the "in"
* array, into which the resampled data will be returned. Note
* that details of how the output grid maps on to this array
* (e.g. the storage order, number of dimensions, etc.) is
* arbitrary and is specified entirely by means of the "offset"
* array. The "out" array should therefore contain sufficient
* elements to accommodate the "offset" values supplied. There
* is no requirement that all elements of the "out" array should
* be assigned values, and any which are not addressed by the
* contents of the "offset" array will be left unchanged.
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the resampled values may be returned. This array will only be
* used if the "in_var" array has been given. It is addressed in
* exactly the same way (via the "offset" array) as the "out"
* array. The values returned are estimates of the statistical
* variance of the corresponding values in the "out" array, on
* the assumption that all errors in input grid values (in the
* "in" array) are statistically independent and that their
* variance estimates (in the "in_var" array) may simply be
* summed (with appropriate weighting factors).
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* nbad
* Pointer to an int in which to return the number of
* interpolation points at which an output data value (and/or a
* variance value if relevant) equal to "badval" has been
* assigned because no valid interpolated value could be
* obtained. The maximum value that will be returned is
* "npoint" and the minimum is zero (indicating that all output
* values were successfully obtained).
* Notes:
* - There is a separate function for each numerical type of
* gridded data, distinguished by replacing the <X> in the function
* name by the appropriate 1- or 2-character suffix.
*/
/* Define a macro to implement the function for a specific data
type. */
#define MAKE_INTERPOLATE_BLOCKAVE(X,Xtype,Xfloating,Xfloattype,Xsigned) \
static void InterpolateBlockAverage##X( int ndim_in, \
const int lbnd_in[], \
const int ubnd_in[], \
const Xtype in[], \
const Xtype in_var[], \
int npoint, const int offset[], \
const double *const coords[], \
const double params[], int flags, \
Xtype badval, Xtype *out, \
Xtype *out_var, int *nbad ) { \
\
/* Local Variables: */ \
Xfloattype hi_lim; /* Upper limit on output values */ \
Xfloattype lo_lim; /* Lower limit on output values */ \
Xfloattype pixwt; /* Weight to apply to individual pixel */ \
Xfloattype sum; /* Weighted sum of pixel data values */ \
Xfloattype sum_var; /* Weighted sum of pixel variance values */ \
Xfloattype val; /* Data value to be assigned to output */ \
Xfloattype val_var; /* Variance to be assigned to output */ \
Xfloattype wtsum; /* Sum of weight values */ \
Xfloattype wtsum_sq; /* Square of sum of weights */ \
Xtype var; /* Variance value */ \
double *xn_max; /* Pointer to upper limits array (n-d) */ \
double *xn_min; /* Pointer to lower limits array (n-d) */ \
double x; /* x coordinate value */ \
double xn; /* Coordinate value (n-d) */ \
double y; /* y coordinate value */ \
int *hi; /* Pointer to array of upper indices */ \
int *ixm; /* Pointer to array of current indices */ \
int *lo; /* Pointer to array of lower indices */ \
int *status; /* Pointer to inherited status value */ \
int *stride; /* Pointer to array of dimension strides */ \
int bad; /* Output pixel bad? */ \
int bad_var; /* Output variance bad? */ \
int done; /* All pixel indices done? */ \
int hi_x; /* Upper pixel index (x dimension) */ \
int hi_y; /* Upper pixel index (y dimension) */ \
int idim; /* Loop counter for dimensions */ \
int ix; /* Pixel index in input grid x dimension */ \
int ixn; /* Pixel index in input grid (n-d) */ \
int iy; /* Pixel index in input grid y dimension */ \
int lo_x; /* Lower pixel index (x dimension) */ \
int lo_y; /* Lower pixel index (y dimension) */ \
int neighb; /* Number of adjacent pixels on each side */ \
int nobad; /* Was the AST__NOBAD flag set? */ \
int off1; /* Input pixel offset due to y index */ \
int off_in; /* Offset to input pixel */ \
int off_out; /* Offset to output pixel */ \
int point; /* Loop counter for output points */ \
int s; /* Temporary variable for strides */ \
int usebad; /* Use "bad" input pixel values? */ \
int usevar; /* Process variance array? */ \
int ystride; /* Stride along input grid y dimension */ \
\
/* Initialise. */ \
*nbad = 0; \
\
/* Get a pointer to the inherited status argument. */ \
status = astGetStatusPtr; \
\
/* Check the global error status. */ \
if ( !astOK ) return; \
\
/* Initialise variables to avoid "used of uninitialised variable" \
messages from dumb compilers. */ \
val = 0; \
val_var = 0; \
sum_var = 0; \
wtsum = 0; \
bad = 0; \
bad_var = 0; \
\
/* Determine if we are processing bad pixels or variances. */ \
nobad = flags & AST__NOBAD; \
usebad = flags & AST__USEBAD; \
usevar = in_var && out_var; \
\
/* Set the number of pixels each side of central pixel to use. */ \
neighb = (int) floor( params[ 0 ] + 0.5 ); \
\
/* Set up limits for checking output values to ensure that they do not \
overflow the range of the data type being used. */ \
lo_lim = LO_##X; \
hi_lim = HI_##X; \
\
/* Handle the 1-dimensional case optimally. */ \
/* ---------------------------------------- */ \
if ( ndim_in == 1 ) { \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,1) \
} \
} \
} \
\
/* Another 4 cases as above, but without the AST__NOBAD flag. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,0) \
} \
} \
} \
} \
\
/* Handle the 2-dimensional case optimally. */ \
/* ---------------------------------------- */ \
} else if ( ndim_in == 2 ) { \
\
/* Calculate the stride along the y dimension of the input grid. */ \
ystride = ubnd_in[ 0 ] - lbnd_in[ 0 ] + 1; \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,1) \
} \
} \
} \
\
/* Another 4 cases as above, but without the AST__NOBAD flag. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,0) \
} \
} \
} \
} \
\
/* Handle other numbers of dimensions. */ \
/* ----------------------------------- */ \
} else { \
\
/* Allocate workspace. */ \
hi = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
lo = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
stride = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
ixm = astMalloc( sizeof( int ) * (size_t) ndim_in ); \
xn_max = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
xn_min = astMalloc( sizeof( double ) * (size_t) ndim_in ); \
if ( astOK ) { \
\
/* Calculate the stride along each dimension of the input grid. */ \
for ( s = 1, idim = 0; idim < ndim_in; idim++ ) { \
stride[ idim ] = s; \
s *= ubnd_in[ idim ] - lbnd_in[ idim ] + 1; \
\
/* Calculate the coordinate limits of the input grid in each \
dimension. */ \
xn_min[ idim ] = (double) lbnd_in[ idim ] - 0.5; \
xn_max[ idim ] = (double) ubnd_in[ idim ] + 0.5; \
} \
\
/* Identify four cases, according to whether bad pixels and/or \
variances are being processed. In each case, loop through all the \
output points to (a) assemble the input data needed to form the \
interpolated value, and (b) calculate the result and assign it to \
the output arrays(s). In each case we assign constant values (0 or \
1) to the "Usebad" and "Usevar" flags so that code for handling bad \
pixels and variances can be eliminated when not required. */ \
if ( nobad ) { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,1) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,1) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,1) \
} \
} \
} \
\
/* Another 4 cases as above, but this time without the AST__NOBAD flag. */ \
} else { \
if ( usebad ) { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,1,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,1,0,0) \
} \
} \
} else { \
if ( usevar ) { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,1) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,1,0) \
} \
} else { \
for ( point = 0; point < npoint; point++ ) { \
ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,0,0) \
CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,0,0,0) \
} \
} \
} \
} \
} \
\
/* Free the workspace. */ \
hi = astFree( hi ); \
lo = astFree( lo ); \
stride = astFree( stride ); \
ixm = astFree( ixm ); \
xn_max = astFree( xn_max ); \
xn_min = astFree( xn_min ); \
} \
\
/* If an error has occurred, clear the returned result. */ \
if ( !astOK ) *nbad = 0; \
\
/* Return. */ \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the 1-dimensional
case. */
#define ASSEMBLE_INPUT_1D(X,Xtype,Xfloating,Xfloattype,Xsigned,Usebad,Usevar) \
\
/* Obtain the x coordinate of the current point and test if it is bad. */ \
x = coords[ 0 ][ point ]; \
bad = ( x == AST__BAD ); \
\
/* Note we do not need to check here whether the pixel in this position is \
bad; if any pixels in the cube are good we can form an average. */ \
\
/* If OK, calculate the lowest and highest indices (in the x \
dimension) of the region of neighbouring pixels that will \
contribute to the interpolated result. Constrain these values to \
lie within the input grid. */ \
if ( !bad ) { \
ix = (int) floor( x ); \
lo_x = MaxI( ix - neighb + 1, lbnd_in[ 0 ], status ); \
hi_x = MinI( ix + neighb, ubnd_in[ 0 ], status ); \
\
/* Initialise sums for forming the interpolated result. */ \
sum = (Xfloattype) 0.0; \
wtsum = (Xfloattype) 0.0; \
if ( Usevar ) { \
sum_var = (Xfloattype) 0.0; \
bad_var = 0; \
} \
\
/* Loop to inspect all the contributing pixels, calculating the offset \
of each pixel from the start of the input array. */ \
off_in = lo_x - lbnd_in[ 0 ]; \
for ( ix = lo_x; ix <= hi_x; ix++, off_in++ ) { \
\
/* If necessary, test if the input pixel is bad. */ \
if ( !( Usebad ) || ( in[ off_in ] != badval ) ) { \
\
/* If we are using variances, then check that the variance is valid; \
if it is invalid then ignore this pixel altogether. */ \
if ( Usevar ) { \
var = in_var[ off_in ]; \
if ( Usebad ) bad_var = ( var == badval ); \
CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
\
/* If variance is valid then accumulate suitably weighted values into \
the totals. */ \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
pixwt = (Xfloattype) 1.0 / var; \
sum += pixwt * ( (Xfloattype) in[ off_in ] ); \
wtsum += pixwt; \
sum_var += pixwt; \
} \
\
/* If we are not using variances, then accumulate values into the \
totals with a weighting of unity. */ \
} else { \
sum += (Xfloattype) in[ off_in ]; \
wtsum++; \
} \
} \
} \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the 2-dimensional
case. */
#define ASSEMBLE_INPUT_2D(X,Xtype,Xfloating,Xfloattype,Xsigned,Usebad,Usevar) \
\
/* Obtain the x coordinate of the current point and test if it is bad. */ \
x = coords[ 0 ][ point ]; \
bad = ( x == AST__BAD ); \
if ( !bad ) { \
\
/* If not, then similarly obtain and test the y coordinate. */ \
y = coords[ 1 ][ point ]; \
bad = ( y == AST__BAD ); \
\
/* Note we do not need to check here whether the pixel in this position is \
bad; if any pixels in the cube are good we can form an average. */ \
\
/* If OK, calculate the lowest and highest indices (in each dimension) \
of the region of neighbouring pixels that will contribute to the \
interpolated result. Constrain these values to lie within the input \
grid. */ \
if ( !bad ) { \
ix = (int) floor( x ); \
lo_x = MaxI( ix - neighb + 1, lbnd_in[ 0 ], status ); \
hi_x = MinI( ix + neighb, ubnd_in[ 0 ], status ); \
iy = (int) floor( y ); \
lo_y = MaxI( iy - neighb + 1, lbnd_in[ 1 ], status ); \
hi_y = MinI( iy + neighb, ubnd_in[ 1 ], status ); \
\
/* Initialise sums for forming the interpolated result. */ \
sum = (Xfloattype) 0.0; \
wtsum = (Xfloattype) 0.0; \
if ( Usevar ) { \
sum_var = (Xfloattype) 0.0; \
bad_var = 0; \
} \
\
/* Loop to inspect all the contributing pixels, calculating the offset \
of each pixel from the start of the input array. */ \
off1 = lo_x - lbnd_in[ 0 ] + ystride * ( lo_y - lbnd_in[ 1 ] ); \
for ( iy = lo_y; iy <= hi_y; iy++, off1 += ystride ) { \
off_in = off1; \
for ( ix = lo_x; ix <= hi_x; ix++, off_in++ ) { \
\
/* If necessary, test if the input pixel is bad. */ \
if ( !( Usebad ) || ( in[ off_in ] != badval ) ) { \
\
/* If we are using variances, then check that the variance is valid; \
if it is invalid then ignore this pixel altogether. */ \
if ( Usevar ) { \
var = in_var[ off_in ]; \
if ( Usebad ) bad_var = ( var == badval ); \
CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
\
/* If variance is valid then accumulate suitably weighted values into \
the totals. */ \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
pixwt = (Xfloattype) 1.0 / var; \
sum += pixwt * ( (Xfloattype) in[ off_in ] ); \
wtsum += pixwt; \
sum_var += pixwt; \
} \
\
/* If we are not using variances, then accumulate values into the \
totals with a weighting of unity. */ \
} else { \
sum += (Xfloattype) in[ off_in ]; \
wtsum++; \
} \
} \
} \
} \
} \
}
/* This subsidiary macro assembles the input data needed in
preparation for forming the interpolated value in the n-dimensional
case. */
#define ASSEMBLE_INPUT_ND(X,Xtype,Xfloating,Xfloattype,Xsigned,Usebad,Usevar) \
\
/* Initialise offsets into the input array. then loop to obtain each \
coordinate associated with the current output poitn. */ \
off_in = 0; \
for ( idim = 0; idim < ndim_in; idim++ ) { \
xn = coords[ idim ][ point ]; \
\
/* Test if the coordinate is bad. If so give up on this point. */ \
bad = ( xn == AST__BAD ); \
if ( bad ) break; \
\
/* Calculate the lowest and highest indices (in the current dimension) \
of the region of neighbouring pixels that will contribute to the \
interpolated result. Constrain these values to lie within the input \
grid. */ \
ixn = (int) floor( xn ); \
lo[ idim ] = MaxI( ixn - neighb + 1, lbnd_in[ idim ], status ); \
hi[ idim ] = MinI( ixn + neighb, ubnd_in[ idim ], status ); \
\
/* If the cube has a zero dimension then no data can come from it. */ \
bad = ( lo[ idim ] > hi[ idim ] ); \
if ( bad ) break; \
\
/* Accumulate the offset (from the start of the input array) of the \
contributing pixel which has the lowest index in each dimension. */ \
off_in += stride[ idim ] * ( lo[ idim ] - lbnd_in[ idim ] ); \
\
/* Initialise an array to keep track of the current position in the \
input cube. */ \
ixm[ idim ] = lo[ idim ]; \
} \
\
/* Note we do not need to check here whether the pixel in this position is \
bad; if any pixels in the cube are good we can form an average. */ \
\
/* If OK, initialise sums for forming the interpolated result. */ \
if ( !bad ) { \
sum = (Xfloattype) 0.0; \
wtsum= (Xfloattype) 0.0; \
if ( Usevar ) { \
sum_var = (Xfloattype) 0.0; \
bad_var = 0; \
} \
\
/* Loop to inspect all the contributing pixels, calculating the offset \
of each pixel from the start of the input array. */ \
do { \
\
/* If necessary, test if the input pixel is bad. */ \
if ( !( Usebad ) || ( in[ off_in ] != badval ) ) { \
\
/* If we are using variances, then check that the variance is valid; \
if it is invalid then ignore this pixel altogether. */ \
if ( Usevar ) { \
var = in_var[ off_in ]; \
if ( Usebad ) bad_var = ( var == badval ); \
CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
\
/* If variance is valid then accumulate suitably weighted values into \
the totals. */ \
if ( !( ( Xsigned ) || ( Usebad ) ) || !bad_var ) { \
pixwt = (Xfloattype) 1.0 / var; \
sum += pixwt * ( (Xfloattype) in[ off_in ] ); \
wtsum += pixwt; \
sum_var += pixwt; \
} \
\
/* If we are not using variances, then accumulate values into the \
totals with a weighting of unity. */ \
} else { \
sum += (Xfloattype) in[ off_in ]; \
wtsum++; \
} \
} \
\
/* Locate the next pixel in the input cube; try incrementing the lowest \
dimension index first, if that rolls over increment the next \
dimension index, and so on. */ \
for ( idim = 0; idim < ndim_in; idim++ ) { \
if ( ixm[ idim ] < hi[ idim ] ) { \
off_in += stride[ idim ]; \
ixm[ idim ]++; \
break; \
} else { \
off_in -= stride[ idim ] * ( hi[ idim ] - lo[ idim ] ); \
ixm[ idim ] = lo[ idim ]; \
} \
} \
\
/* If the highest dimension index has rolled over, we have done all \
the pixels in the cube. */ \
done = ( idim == ndim_in ); \
} while ( !done ); \
}
/* This subsidiary macro calculates the interpolated output value (and
variance) from the sums over contributing pixels, checks the
results for validity, and assigns them to the output array(s). */
#define CALC_AND_ASSIGN_OUTPUT(X,Xtype,Xfloating,Xfloattype,Usebad,Usevar,Nobad) \
\
/* If the output data value has not yet been flagged as bad, then \
check that an interpolated value can actually be produced. First \
check that the sum of weights is not zero. */ \
if ( !bad ) { \
bad = ( wtsum == (Xfloattype) 0.0 ); \
\
/* If OK, calculate the interpolated value. Then, if the output data \
type is not floating point, check that this value will not overflow \
the available output range. */ \
if ( !bad ) { \
val = sum / wtsum; \
if ( !( Xfloating ) ) { \
bad = ( val <= lo_lim ) || ( val >= hi_lim ); \
} \
} \
\
/* If no interpolated data value can be produced, then no associated \
variance will be required either. */ \
if ( ( Usevar ) && bad ) bad_var = 1; \
} \
\
/* Now perform similar checks on the output variance value (if \
required). This time we check that the square of the sum of \
weights is not zero (since this might underflow before the sum of \
weights). Again we also check to prevent the result overflowing the \
output data type. */ \
if ( ( Usevar ) && !bad_var ) { \
wtsum_sq = wtsum * wtsum; \
bad_var = ( wtsum_sq == (Xfloattype) 0.0 ); \
if ( !bad_var ) { \
val_var = sum_var / wtsum_sq; \
if ( !( Xfloating ) ) { \
bad_var = ( val_var <= lo_lim ) || ( val_var >= hi_lim ); \
} \
} \
} \
\
/* Obtain the pixel offset into the output array. */ \
off_out = offset[ point ]; \
\
/* Assign a bad output value (and variance) if required and count it. */ \
if ( bad ) { \
if( !Nobad ) { \
out[ off_out ] = badval; \
if ( Usevar ) out_var[ off_out ] = badval; \
} \
(*nbad)++; \
\
/* Otherwise, assign the interpolated value. If the output data type \
is floating point, the result can be stored directly, otherwise we \
must round to the nearest integer. */ \
} else { \
if ( Xfloating ) { \
out[ off_out ] = (Xtype) val; \
} else { \
out[ off_out ] = (Xtype) ( val + ( ( val >= (Xfloattype) 0.0 ) ? \
( (Xfloattype) 0.5 ) : \
( (Xfloattype) -0.5 ) ) ); \
} \
\
/* If a variance estimate is required but none can be obtained, then \
store a bad output variance value and count it. */ \
if ( Usevar ) { \
if ( bad_var ) { \
if( !Nobad ) out_var[ off_out ] = badval; \
(*nbad)++; \
\
/* Otherwise, store the variance estimate, rounding to the nearest \
integer if necessary. */ \
} else { \
if ( Xfloating ) { \
out_var[ off_out ] = (Xtype) val_var; \
} else { \
out_var[ off_out ] = (Xtype) ( val_var + \
( ( val_var >= (Xfloattype) 0.0 ) ? \
( (Xfloattype) 0.5 ) : \
( (Xfloattype) -0.5 ) ) ); \
} \
} \
} \
}
/* These subsidiary macros define limits for range checking of results
before conversion to the final data type. For each data type code
<X>, HI_<X> gives the least positive floating point value which
just overflows that data type towards plus infinity, while LO_<X>
gives the least negative floating point value which just overflows
that data type towards minus infinity. Thus, a floating point value
must satisfy LO<flt_value<HI if overflow is not to occur when it is
converted to that data type.
The data type of each limit should be that of the smallest
precision floating point type which will accommodate the full range
of values that the target type may take. */
/* If <X> is a floating point type, the limits are not actually used,
but must be present to permit error-free compilation. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
#define HI_LD ( 0.0L )
#define LO_LD ( 0.0L )
#endif
#define HI_D ( 0.0 )
#define LO_D ( 0.0 )
#define HI_F ( 0.0f )
#define LO_F ( 0.0f )
#if HAVE_LONG_DOUBLE /* Not normally implemented */
#define HI_L ( 0.5L + (long double) LONG_MAX )
#define LO_L ( -0.5L + (long double) LONG_MIN )
#define HI_UL ( 0.5L + (long double) ULONG_MAX )
#define LO_UL ( -0.5L )
#define HI_K ( 0.5L + (long double) LONG_MAX )
#define LO_K ( -0.5L + (long double) LONG_MIN )
#define HI_UK ( 0.5L + (long double) ULONG_MAX )
#define LO_UK ( -0.5L )
#else
#define HI_L ( 0.5 + (double) LONG_MAX )
#define LO_L ( -0.5 + (double) LONG_MIN )
#define HI_UL ( 0.5 + (double) ULONG_MAX )
#define LO_UL ( -0.5 )
#define HI_K ( 0.5 + (double) LONG_MAX )
#define LO_K ( -0.5 + (double) LONG_MIN )
#define HI_UK ( 0.5 + (double) ULONG_MAX )
#define LO_UK ( -0.5 )
#endif
#define HI_I ( 0.5 + (double) INT_MAX )
#define LO_I ( -0.5 + (double) INT_MIN )
#define HI_UI ( 0.5 + (double) UINT_MAX )
#define LO_UI ( -0.5 )
#define HI_S ( 0.5f + (float) SHRT_MAX )
#define LO_S ( -0.5f + (float) SHRT_MIN )
#define HI_US ( 0.5f + (float) USHRT_MAX )
#define LO_US ( -0.5f )
#define HI_B ( 0.5f + (float) SCHAR_MAX )
#define LO_B ( -0.5f + (float) SCHAR_MIN )
#define HI_UB ( 0.5f + (float) UCHAR_MAX )
#define LO_UB ( -0.5f )
/* This subsidiary macro tests for negative variance values. This
check is required only for signed data types. */
#define CHECK_FOR_NEGATIVE_VARIANCE(Xtype) \
bad_var = bad_var || ( var < ( (Xtype) 0 ) );
/* Expand the main macro above to generate a function for each
required signed data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_INTERPOLATE_BLOCKAVE(LD,long double,1,long double,1)
MAKE_INTERPOLATE_BLOCKAVE(L,long int,0,long double,1)
MAKE_INTERPOLATE_BLOCKAVE(K,INT_BIG,0,long double,1)
#else
MAKE_INTERPOLATE_BLOCKAVE(L,long int,0,double,1)
MAKE_INTERPOLATE_BLOCKAVE(K,INT_BIG,0,double,1)
#endif
MAKE_INTERPOLATE_BLOCKAVE(D,double,1,double,1)
MAKE_INTERPOLATE_BLOCKAVE(F,float,1,float,1)
MAKE_INTERPOLATE_BLOCKAVE(I,int,0,double,1)
MAKE_INTERPOLATE_BLOCKAVE(S,short int,0,float,1)
MAKE_INTERPOLATE_BLOCKAVE(B,signed char,0,float,1)
/* Re-define the macro for testing for negative variances to do
nothing. */
#undef CHECK_FOR_NEGATIVE_VARIANCE
#define CHECK_FOR_NEGATIVE_VARIANCE(Xtype)
/* Expand the main macro above to generate a function for each
required unsigned data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_INTERPOLATE_BLOCKAVE(UL,unsigned long int,0,long double,0)
MAKE_INTERPOLATE_BLOCKAVE(UK,UINT_BIG,0,long double,0)
#else
MAKE_INTERPOLATE_BLOCKAVE(UL,unsigned long int,0,double,0)
MAKE_INTERPOLATE_BLOCKAVE(UK,UINT_BIG,0,double,0)
#endif
MAKE_INTERPOLATE_BLOCKAVE(UI,unsigned int,0,double,0)
MAKE_INTERPOLATE_BLOCKAVE(US,unsigned short int,0,float,0)
MAKE_INTERPOLATE_BLOCKAVE(UB,unsigned char,0,float,0)
/* Undefine the macros used above. */
#undef CHECK_FOR_NEGATIVE_VARIANCE
#if HAVE_LONG_DOUBLE /* Not normally implemented */
#undef HI_LD
#undef LO_LD
#endif
#undef HI_D
#undef LO_D
#undef HI_F
#undef LO_F
#undef HI_L
#undef LO_L
#undef HI_UL
#undef LO_UL
#undef HI_K
#undef LO_K
#undef HI_UK
#undef LO_UK
#undef HI_I
#undef LO_I
#undef HI_UI
#undef LO_UI
#undef HI_S
#undef LO_S
#undef HI_US
#undef LO_US
#undef HI_B
#undef LO_B
#undef HI_UB
#undef LO_UB
#undef CALC_AND_ASSIGN_OUTPUT
#undef ASSEMBLE_INPUT_ND
#undef ASSEMBLE_INPUT_2D
#undef ASSEMBLE_INPUT_1D
#undef MAKE_INTERPOLATE_BLOCKAVE
static void Invert( AstMapping *this, int *status ) {
/*
*++
* Name:
c astInvert
f AST_INVERT
* Purpose:
* Invert a Mapping.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astInvert( AstMapping *this )
f CALL AST_INVERT( THIS, STATUS )
* Class Membership:
* Mapping method.
* Description:
c This function inverts a Mapping by reversing the boolean sense
f This routine inverts a Mapping by reversing the boolean sense
* of its Invert attribute. If this attribute is zero (the
* default), the Mapping will transform coordinates in the way
* specified when it was created. If it is non-zero, the input and
* output coordinates will be inter-changed so that the direction
* of the Mapping is reversed. This will cause it to display the
* inverse of its original behaviour.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping.
f STATUS = INTEGER (Given and Returned)
f The global status.
*--
*/
/* Local Variables: */
int invert; /* New Invert attribute value */
/* Check the global error status. */
if ( !astOK ) return;
/* Determine the new Invert attribute value. */
invert = !astGetInvert( this );
/* Clear the old value. */
astClearInvert( this );
/* If the resulting default value is not the one required, then set a
new value explicitly. */
if ( astGetInvert( this ) != invert ) astSetInvert( this, invert );
}
static double J1Bessel( double x, int *status ) {
/*
* Name:
* J1Bessel
* Purpose:
* Calculates the first-order Bessel function of the first kind.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* double J1Bessel( double x, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function calculates the value of the first-order Bessel function
* of the first kind.
* Parameters:
* x
* The argument for J1.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The calculated J1(x) value.
* Notes:
* - The algorithm is taken from the SCUBA routine SCULIB_BESSJ1, by
* J.Lightfoot.
* - This function does not perform error checking and does not
* generate errors.
*/
/* Local Variables: */
static double p1 = 1.0;
static double p2 = 0.183105E-2;
static double p3 = -0.3516396496E-4;
static double p4 = 0.2457520174E-5;
static double p5 = -0.240337019E-6;
static double q1 = 0.04687499995;
static double q2 = -0.2002690873E-3;
static double q3 = 0.8449199096E-5;
static double q4 = -0.88228987E-6;
static double q5 = 0.105787412E-6;
static double r1 = 72362614232.0;
static double r2 = -7895059235.0;
static double r3 = 242396853.1;
static double r4 = -2972611.439;
static double r5 = 15704.48260;
static double r6 = -30.16036606;
static double s1 = 144725228442.0;
static double s2 = 2300535178.0;
static double s3 = 18583304.74;
static double s4 = 99447.43394;
static double s5 = 376.9991397;
static double s6 = 1.0;
double ax;
double xx;
double z;
double y;
double value;
int s;
/* Calculate the value */
ax = fabs( x );
if( ax < 8.0 ) {
y = x*x;
value = x*( r1 + y*( r2 + y*( r3 + y*( r4 + y*( r5 + y*r6 ) ) ) ) ) /
( s1 + y*( s2 + y*( s3 + y*( s4 + y*( s5 + y*s6 ) ) ) ) );
} else {
s = ( x >= 0.0 ) ? 1 : -1;
z = 8.0 / ax;
y = z*z;
xx = ax - 2.356194491;
value = sqrt ( 0.636619772/ax )*( cos( xx )*( p1 + y*( p2 + y*
( p3 + y*( p4 + y*p5 ) ) ) )-z*sin( xx )*( q1 + y*( q2 + y*( q3 + y*
( q4 + y*q5 ) ) ) ) )*s;
}
return value;
}
static int LinearApprox( AstMapping *this, const double *lbnd,
const double *ubnd, double tol, double *fit, int *status ) {
/*
*++
* Name:
c astLinearApprox
f AST_LINEARAPPROX
* Purpose:
* Obtain a linear approximation to a Mapping, if appropriate.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c int astLinearApprox( AstMapping *this, const double *lbnd,
c const double *ubnd, double tol, double *fit )
f RESULT = AST_LINEARAPPROX( THIS, LBND, UBND, TOL, FIT, STATUS )
* Class Membership:
* Mapping function.
* Description:
* This function tests the forward coordinate transformation
* implemented by a Mapping over a given range of input coordinates. If
* the transformation is found to be linear to a specified level of
* accuracy, then an array of fit coefficients is returned. These
* may be used to implement a linear approximation to the Mapping's
* forward transformation within the specified range of output coordinates.
* If the transformation is not sufficiently linear, no coefficients
* are returned.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping.
c lbnd
f LBND( * ) = DOUBLE PRECISION (Given)
c Pointer to an array of doubles
f An array
* containing the lower bounds of a box defined within the input
* coordinate system of the Mapping. The number of elements in this
* array should equal the value of the Mapping's Nin attribute. This
* box should specify the region over which linearity is required.
c ubnd
f UBND( * ) = DOUBLE PRECISION (Given)
c Pointer to an array of doubles
f An array
* containing the upper bounds of the box specifying the region over
* which linearity is required.
c tol
f TOL = DOUBLE PRECISION (Given)
* The maximum permitted deviation from linearity, expressed as
* a positive Cartesian displacement in the output coordinate
* space of the Mapping. If a linear fit to the forward
* transformation of the Mapping deviates from the true transformation
* by more than this amount at any point which is tested, then no fit
* coefficients will be returned.
c fit
f FIT( * ) = DOUBLE PRECISION (Returned)
c Pointer to an array of doubles
f An array
* in which to return the co-efficients of the linear
* approximation to the specified transformation. This array should
* have at least "( Nin + 1 ) * Nout", elements. The first Nout elements
* hold the constant offsets for the transformation outputs. The
* remaining elements hold the gradients. So if the Mapping has 2 inputs
* and 3 outputs the linear approximation to the forward transformation
* is:
*
c X_out = fit[0] + fit[3]*X_in + fit[4]*Y_in
f X_out = fit(1) + fit(4)*X_in + fit(5)*Y_in
*
c Y_out = fit[1] + fit[5]*X_in + fit[6]*Y_in
f Y_out = fit(2) + fit(6)*X_in + fit(7)*Y_in
*
c Z_out = fit[2] + fit[7]*X_in + fit[8]*Y_in
f Z_out = fit(3) + fit(8)*X_in + fit(9)*Y_in
*
f STATUS = INTEGER (Given and Returned)
f The global status.
* Returned Value:
c astLinearApprox()
f AST_LINEARAPPROX = LOGICAL
* If the forward transformation is sufficiently linear,
c a non-zero value is returned. Otherwise zero is returned
f .TRUE is returned. Otherwise .FALSE. is returned
* and the fit co-efficients are set to AST__BAD.
* Notes:
* - This function fits the Mapping's forward transformation. To fit
* the inverse transformation, the Mapping should be inverted using
c astInvert
f AST_INVERT
* before invoking this function.
c - A value of zero
f - A value of .FALSE.
* will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*--
* Implementation Deficiencies:
* Sub-classes which implement linear mappings should probably
* over-ride this function to get better accuracy and faster execution,
* but currently they do not.
*/
/* Local Variables: */
AstPointSet *pset_in_f; /* PointSet for input fitting points */
AstPointSet *pset_in_t; /* PointSet for input test points */
AstPointSet *pset_out_f; /* PointSet for output fitting points */
AstPointSet *pset_out_t; /* PointSet for output test points */
double **ptr_in_f; /* Input coordinate array pointers */
double **ptr_in_t; /* Input coordinate array pointers */
double **ptr_out_f; /* Output coordinate array pointers */
double **ptr_out_t; /* Output coordinate array pointers */
double *grad; /* Pointer to matrix of gradients */
double *zero; /* Pointer to array of zero point values */
double diff; /* Difference in coordinate values */
double err; /* Sum of squared error */
double frac; /* Fraction of input coordinate range */
double in1; /* Input coordinate value */
double in2; /* Input coordinate value */
double indiff; /* Difference in input coordinate values */
double out1; /* Output coordinate value */
double out2; /* Output coordinate value */
double x0; /* Coordinate of grid centre */
double y; /* Output coordinate (transformed) */
double yfit; /* Coordinate resulting from fit */
double z; /* Sum for calculating zero points */
int *vertex; /* Pointer to flag array for vertices */
int coord_in; /* Loop counter for input coordinates */
int coord_out; /* Loop counter for output coordinates. */
int done; /* All vertices visited? */
int face1; /* Index of first face coordinates */
int face2; /* Index of second face coordinates */
int face; /* Loop counter for faces */
int ii; /* Index into gradient matrix */
int linear; /* Mapping is linear? */
int nc; /* Number of coeffs in fit */
int ndim_in; /* Number of Mapping inputs */
int ndim_out; /* Number of Mapping outputs */
int npoint; /* Number of test points required */
int point; /* Counter for points */
int result; /* Returned flag */
/* Initialise. */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Further initialisation. */
linear = 1;
grad = NULL;
zero = NULL;
/* Get the number of Mapping output and inputs. */
ndim_in = astGetNin( this );
ndim_out = astGetNout( this );
/* Store the number of coefficients in the fit.*/
nc = ( ndim_in + 1 ) * ndim_out;
/* Create a PointSet to hold input coordinates and obtain a pointer
to its coordinate arrays. */
pset_in_f = astPointSet( 2 * ndim_in, ndim_in, "", status );
ptr_in_f = astGetPoints( pset_in_f );
if ( astOK ) {
/* Set up and transform an initial set of points. */
/* ---------------------------------------------- */
/* Loop to set up input coordinates at the centre of each face of the
input grid, storing them in the PointSet created above. */
point = 0;
for ( face = 0; face < ( 2 * ndim_in ); face++ ) {
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
ptr_in_f[ coord_in ][ point ] =
0.5 * ( lbnd[ coord_in ] + ubnd[ coord_in ] );
}
ptr_in_f[ face / 2 ][ point ] = ( face % 2 ) ?
ubnd[ face / 2 ] : lbnd[ face / 2 ];
point++;
}
}
/* Transform these coordinates into the output grid's coordinate system
and obtain an array of pointers to the resulting coordinate
data. */
pset_out_f = astTransform( this, pset_in_f, 1, NULL );
ptr_out_f = astGetPoints( pset_out_f );
if ( astOK ) {
/* Fit a linear approximation to the points. */
/* ----------------------------------------- */
/* Obtain pointers to the locations in the fit coefficients array
where the gradients and zero points should be stored. */
grad = fit + ndim_out;
zero = fit;
/* On the assumption that the transformation applied above is
approximately linear, loop to determine the matrix of gradients and
the zero points which describe it. */
ii = 0;
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
z = 0.0;
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
/* Find the indices of opposite faces in each input dimension. */
face1 = 2 * coord_in;
face2 = face1 + 1;
/* Obtain the input and output coordinates at these face centres. */
in1 = ptr_in_f[ coord_in ][ face1 ];
in2 = ptr_in_f[ coord_in ][ face2 ];
out1 = ptr_out_f[ coord_out ][ face1 ];
out2 = ptr_out_f[ coord_out ][ face2 ];
/* Check whether any transformed coordinates are bad. If so, the
transformation cannot be linear, so give up trying to fit it. */
if ( ( out1 == AST__BAD ) || ( out2 == AST__BAD ) ) {
linear = 0;
break;
}
/* If possible, determine the gradient along this dimension, storing
it in the appropriate element of the gradient matrix. */
indiff = in2 - in1;
if ( indiff != 0.0 ) {
grad[ ii++ ] = ( out2 - out1 ) / indiff;
} else {
grad[ ii++ ] = 0.0;
}
/* Accumulate the sum used to determine the zero point. */
z += ( out1 + out2 );
}
/* Also quit the outer loop if a linear fit cannot be obtained. */
if ( !linear ) break;
/* Determine the average zero point from all dimensions. */
zero[ coord_out ] = z / (double) ( 2 * ndim_in );
}
/* If a linear fit was obtained, its zero points will be appropriate
to an input coordinate system with an origin at the centre of the
input grid (we assume this to simplify the calculations above). To
correct for this, we transform the actual input coordinates of the
grid's centre through the matrix of gradients and subtract the
resulting coordinates from the zero point values. The zero points
are then correct for the actual output and input coordinate systems
we are using. */
if ( linear ) {
ii = 0;
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
x0 = 0.5 * ( lbnd[ coord_in ] + ubnd[ coord_in ] );
zero[ coord_out ] -= grad[ ii++ ] * x0;
}
}
}
}
/* Annul the pointers to the PointSets used above. */
pset_out_f = astAnnul( pset_out_f );
pset_in_f = astAnnul( pset_in_f );
/* Calculate the number of test points required. */
/* --------------------------------------------- */
/* If we have obtained a linear fit above, it will (by construction)
be exact at the centre of each face of the input grid. However, it
may not fit anywhere else. We therefore set up some test points to
determine if it is an adequate approximation elsewhere. */
if ( astOK && linear ) {
/* Calculate the number of test points required to place one at each
vertex of the grid. */
npoint = 1;
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
npoint *= 2;
}
/* Now calculate the total number of test points required, also
allowing one at the centre, one at half the distance to each face,
and one at half the distance to each vertex. */
npoint = 1 + 2 * ( ndim_in + npoint );
/* Set up test points in the input coordinate system. */
/* --------------------------------------------------- */
/* Create a PointSet to hold the test coordinates and obtain an array
of pointers to its coordinate data. */
pset_in_t = astPointSet( npoint, ndim_in, "", status );
ptr_in_t = astGetPoints( pset_in_t );
if ( astOK ) {
/* If the input array is 1-dimensional, the face and vertex positions
calculated below will co-incide. Therefore, we simply distribute
the required number of test points uniformly throughout the input
coordinate range (avoiding the end-points, where the fit has been
obtained). The coordinates are stored in the PointSet created
above. */
if ( ndim_in == 1 ) {
for ( point = 0; point < npoint; point++ ) {
frac = ( (double) ( point + 1 ) ) / (double) ( npoint + 1 );
ptr_in_t[ 0 ][ point ] = ( 1.0 - frac ) * lbnd[ 0 ] +
frac * ubnd[ 0 ];
}
/* Otherwise, generate one point at the grid centre (offset slightly
since the exact centre may not be very representative). */
} else {
point = 0;
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
ptr_in_t[ coord_in ][ point ] =
0.49 * lbnd[ coord_in ] + 0.51 * ubnd[ coord_in ];
}
point++;
/* Similarly generate a point half way between the grid centre and the
centre of each face. Again introduce some small random offsets to break
any regularity in the grid. */
for ( face = 0; face < ( 2 * ndim_in ); face++ ) {
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
ptr_in_t[ coord_in ][ point ] =
0.48 * lbnd[ coord_in ] + 0.52 * ubnd[ coord_in ];
}
ptr_in_t[ face / 2 ][ point ] =
( 0.51 * ( ( ( face % 2 ) ? ubnd[ face / 2 ] :
lbnd[ face / 2 ] ) ) +
0.49 * ptr_in_t[ face / 2 ][ 0 ] );
point++;
}
/* Allocate workspace and initialise flags for identifying the
vertices. */
vertex = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
vertex[ coord_in ] = 0;
}
/* Now loop to visit each input grid vertex. */
done = 0;
do {
/* Generate a test point at each vertex. */
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
ptr_in_t[ coord_in ][ point ] = vertex[ coord_in ] ?
ubnd[ coord_in ] :
lbnd[ coord_in ];
/* Also place one half way between the grid centre and each vertex. */
ptr_in_t[ coord_in ][ point + 1 ] =
( 0.52 * ptr_in_t[ coord_in ][ point ] +
0.48 * ptr_in_t[ coord_in ][ 0 ] );
}
point += 2;
/* Now update the array of vertex flags to identify the next vertex. */
coord_in = 0;
do {
/* The least significant dimension which does not have its upper bound
as one of the vertex coordinates is changed to use its upper bound
in the next vertex. */
if ( !vertex[ coord_in ] ) {
vertex[ coord_in ] = 1;
break;
/* Any less significant dimensions whose upper bounds are already
being used are changed to use their lower bounds in the next
vertex. */
} else {
vertex[ coord_in ] = 0;
/* All vertices have been visited when the most significant dimension
is changed back to using its lower bound. */
done = ( ++coord_in == ndim_in );
}
} while ( !done );
} while ( !done );
}
/* Free the workspace used for vertex flags. */
vertex = astFree( vertex );
}
/* Transform the test points. */
/* -------------------------- */
/* Use the Mapping to transform the test points into the output grid's
coordinate system, obtaining a pointer to the resulting arrays of
output coordinates. */
pset_out_t = astTransform( this, pset_in_t, 1, NULL );
ptr_out_t = astGetPoints( pset_out_t );
/* Test the linear fit for accuracy. */
/* --------------------------------- */
/* If OK so far, then loop to use this fit to transform each test
point and compare the result with the result of applying the
Mapping. */
if ( astOK ) {
for ( point = 0; point < npoint; point++ ) {
/* Initialise the fitting error for the current point. */
err = 0.0;
/* Obtain each output coordinate (produced by using the Mapping) in
turn and check that it is not bad. If it is, then the
transformation is not linear, so give up testing the fit. */
ii = 0;
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
y = ptr_out_t[ coord_out ][ point ];
if ( y == AST__BAD ) {
linear = 0;
break;
}
/* Apply the fitted transformation to the input coordinates to obtain
the approximate output coordinate value. */
yfit = zero[ coord_out ];
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
yfit += grad[ ii++ ] * ptr_in_t[ coord_in ][ point ];
}
/* Form the sum of squared differences between the Mapping's
transformation and the fit. */
diff = ( y - yfit );
err += diff * diff;
}
/* Quit the outer loop if the Mapping is found to be non-linear. */
if ( !linear ) break;
/* Test if the Cartesian distance between the true output coordinate
and the approximate one exceeds the accuracy tolerance. If this
happens for any test point, we declare the Mapping non-linear and
give up. */
if ( sqrt( err ) > tol ) {
linear = 0;
break;
}
}
}
/* Annul the pointers to the PointSets used above. */
pset_out_t = astAnnul( pset_out_t );
}
pset_in_t = astAnnul( pset_in_t );
}
/* If an error occurred, or the Mapping was found to be non-linear,
then set the coefficients to AST_BAD. Otherwise, set the returned flag
to indicate that the fit was succesful. */
if ( !astOK || !linear ) {
for( ii = 0; ii < nc; ii++ ) fit[ ii ] = AST__BAD;
} else {
result = 1;
}
/* Return the result. */
return result;
}
static double LocalMaximum( const MapData *mapdata, double acc, double fract,
double x[], int *status ) {
/*
* Name:
* LocalMaximum
* Purpose:
* Find a local maximum in a Mapping function.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* double LocalMaximum( const MapData *mapdata, double acc, double fract,
* double x[], int *status );
* Class Membership:
* Mapping member function.
* Description:
* This function finds a local maximum in the Mapping function
* supplied. It employs the modified simplex method (as
* implemented by UphillSimplex), but repeatedly re-starts the
* simplex algorithm and tests for convergence of successive
* maxima, so as to further improve robustness on difficult
* problems.
* Parameters:
* mapdata
* Pointer to a MapData structure describing the Mapping
* function, its coordinate constraints, etc.
* acc
* The required accuracy with which the maximum is to be found.
* fract
* A value between 0.0 and 1.0 which determines the initial step
* length along each coordinate axis. It should be given as a
* fraction of the difference between the upper and lower
* constraint values for each axis (as specified in the
* "mapdata" structure).
* x
* Pointer to an array of double containing the coordinates of
* an initial estimate of the position of the maximum. On exit,
* this will be updated to contain the best estimate of the
* maximum's position, as found by this function.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The best estimate of the Mapping function's maximum value.
* Notes:
* - A value of AST__BAD will be returned, and no useful
* information about a solution will be produced, if this function
* is invoked with the global error status set or if it should fail
* for any reason.
*/
/* Local Constants: */
const int maxcall = 1500; /* Maximum number of function evaluations */
const int maxiter = 5; /* Maximum number of iterations */
/* Local Variables: */
double *dx; /* Pointer to array of step lengths */
double err; /* Simplex error estimate */
double maximum; /* Simplex maximum value */
double middle; /* Middle coordinate between bounds */
double result; /* Result value to return */
int coord; /* Loop counter for coordinates */
int done; /* Iterations complete? */
int iter; /* Loop counter for iterations */
int ncall; /* Number of function calls (junk) */
/* Initialise. */
result = AST__BAD;
/* Check the global error status. */
if ( !astOK ) return result;
/* Further initialise to avoid compiler warnings. */
err = 0.0;
/* Allocate workspace. */
dx = astMalloc( sizeof( double ) * (size_t) mapdata->nin );
/* Perform iterations to repeatedly identify a local maximum. */
for ( iter = 0; astOK && ( iter < maxiter ); iter++ ) {
/* Set up initial step lengths along each coordinate axis, adjusting
their signs to avoid placing points outside the coordinate
constraints (i.e. step away from the closer boundary on each
axis). */
for ( coord = 0; coord < mapdata->nin; coord++ ) {
middle = 0.5 * ( mapdata->lbnd[ coord ] + mapdata->ubnd[ coord ] );
dx[ coord ] = fract * ( mapdata->ubnd[ coord ] -
mapdata->lbnd[ coord ] );
if ( x[ coord ] > middle ) dx[ coord ] = -dx[ coord ];
}
/* Find an approximation to a local maximum using the simplex method
and check for errors. */
maximum = UphillSimplex( mapdata, acc, maxcall, dx, x, &err, &ncall, status );
if ( astOK ) {
/* Use this maximum value if no previous maximum has been found. */
if ( result == AST__BAD ) {
result = maximum;
/* Otherwise use it only if it improves on the previous maximum. */
} else if ( maximum >= result ) {
/* We iterate, re-starting the simplex algorithm from its previous
best position so as to guard against premature false
convergence. Iterations continue until the improvement in the
maximum is no greater than the required accuracy (and the simplex
algorithm itself has converged to the required accuracy). Note when
iterations should cease. */
done = ( ( ( maximum - result ) <= acc ) && ( err <= acc ) );
/* Store the best maximum and quit iterating if appropriate. */
result = maximum;
if ( done ) break;
}
/* Otherwise, decrement the initial step size for the next iteration. */
fract /= 1000.0;
}
}
/* Free the workspace. */
dx = astFree( dx );
/* If an error occurred, clear the result value. */
if ( !astOK ) result = AST__BAD;
/* return the result. */
return result;
}
static void MapBox( AstMapping *this,
const double lbnd_in[], const double ubnd_in[],
int forward, int coord_out,
double *lbnd_out, double *ubnd_out,
double xl[], double xu[], int *status ) {
/*
*+
* Name:
* astMapBox
* Purpose:
* Find a bounding box for a Mapping.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* void astMapBox( AstMapping *this,
* const double lbnd_in[], const double ubnd_in[],
* int forward, int coord_out,
* double *lbnd_out, double *ubnd_out,
* double xl[], double xu[] );
* Class Membership:
* Mapping method.
* Description:
* This function allows you to find the "bounding box" which just
* encloses another box after it has been transformed by a Mapping
* (using either its forward or inverse transformation). A typical
* use might be to calculate the size which an image would have
* after being transformed by the Mapping.
*
* The function works on one dimension at a time. When supplied
* with the lower and upper bounds of a rectangular region (box) of
* input coordinate space, it finds the lowest and highest values
* taken by a nominated output coordinate within that
* region. Optionally, it also returns the input coordinates where
* these bounding values are attained. It should be used repeatedly
* if the extent of the bounding box is required in more than one
* dimension.
* Parameters:
* this
* Pointer to the Mapping.
* lbnd_in
* Pointer to an array of double, with one element for each
* Mapping input coordinate. This should contain the lower bound
* of the input box in each dimension.
* ubnd_in
* Pointer to an array of double, with one element for each
* Mapping input coordinate. This should contain the upper bound
* of the input box in each dimension.
*
* Note that it is permissible for the lower bound to exceed the
* corresponding upper bound, as the values will simply be
* swapped before use.
* forward
* If this value is non-zero, then the Mapping's forward
* transformation will be used to transform the input
* box. Otherwise, its inverse transformation will be used.
*
* (If the inverse transformation is selected, then references
* to "input" and "output" coordinates in this description
* should be transposed. For example, the size of the "lbnd_in"
* and "ubnd_in" arrays should match the number of output
* coordinates, as given by the Mapping's Nout attribute.)
* coord_out
* The (zero-based) index of the output coordinate for which the
* lower and upper bounds are required.
* lbnd_out
* Pointer to a double in which to return the lowest value taken
* by the nominated output coordinate within the specified
* region of input coordinate space.
* ubnd_out
* Pointer to a double in which to return the highest value
* taken by the nominated output coordinate within the specified
* region of input coordinate space.
* xl
* An optional pointer to an array of double, with one element
* for each Mapping input coordinate. If given, this array will
* be filled with the coordinates of an input point (although
* not necessarily a unique one) for which the nominated output
* coordinate takes the lower bound value returned in
* "*lbnd_out".
*
* If these coordinates are not required, a NULL pointer may be
* supplied.
* xu
* An optional pointer to an array of double, with one element
* for each Mapping input coordinate. If given, this array will
* be filled with the coordinates of an input point (although
* not necessarily a unique one) for which the nominated output
* coordinate takes the upper bound value returned in
* "*ubnd_out".
*
* If these coordinates are not required, a NULL pointer may be
* supplied.
* Notes:
* - Any input points which are transformed by the Mapping to give
* output coordinates containing the value AST__BAD are regarded as
* invalid and are ignored, They will make no contribution to
* determining the output bounds, even although the nominated
* output coordinate might still have a valid value at such points.
* - An error will occur if the required output bounds cannot be
* found. Typically, this might occur if all the input points which
* the function considers turn out to be invalid (see above). The
* number of points considered before generating such an error is
* quite large, however, so this is unlikely to occur by accident
* unless valid points are restricted to a very small subset of the
* input coordinate space.
* - The values returned via "lbnd_out", "ubnd_out", "xl" and "xu"
* will be set to the value AST__BAD if this function should fail
* for any reason. Their initial values on entry will not be
* altered if the function is invoked with the global error status
* set.
*-
* Implementation Notes:
* - This function implements the basic astMapBox method available
* via the protected interface to the Mapping class. The public
* interface to this method is provided by the astMapBoxId_
* function.
*/
/* Local Variables: */
MapData mapdata; /* Structure to describe Mapping function */
double *x_l; /* Pointer to coordinate workspace */
double *x_u; /* Pointer to coordinate workspace */
double lbnd; /* Required lower bound */
double ubnd; /* Required upper bound */
int coord; /* Loop counter for coordinates. */
int nin; /* Effective number of input coordinates */
int nout; /* Effective number of output coordinates */
int refine; /* Can bounds be refined? */
/* Check the global error status. */
if ( !astOK ) return;
/* Initialisation to avoid compiler warnings. */
lbnd = AST__BAD;
ubnd = AST__BAD;
/* Obtain the effective numbers of input and output coordinates for
the Mapping, taking account of which transformation is to be
used. */
nin = forward ? astGetNin( this ) : astGetNout( this );
nout = forward ? astGetNout( this ) : astGetNin( this );
/* Check that the output coordinate index supplied is valid and report
an error if it is not. Use public (one-based) coordinate numbering
in the error message. */
if ( astOK ) {
if ( ( coord_out < 0 ) || ( coord_out >= nout ) ) {
astError( AST__BADCI, "astMapBox(%s): Output coordinate index (%d) "
"invalid - it should be in the range 1 to %d.", status,
astGetClass( this ), coord_out + 1, nout );
}
}
/* Initialise a MapData structure to describe the Mapping function
whose limits are to be found. Since it may be evaluated many
times, we attempt to simplify the Mapping supplied. */
if ( astOK ) {
mapdata.mapping = astSimplify( this );
/* Store the number of input/output coordinates and the index of the
output coordinate in which we are interested. */
mapdata.nin = nin;
mapdata.nout = nout;
mapdata.coord = coord_out;
/* Note which Mapping transformation is being used. */
mapdata.forward = forward;
/* Store pointers to arrays which will contain the input coordinate
bounds. */
mapdata.lbnd = astMalloc( sizeof( double ) * (size_t) nin );
mapdata.ubnd = astMalloc( sizeof( double ) * (size_t) nin );
/* Create PointSets for passing coordinate data to and from the
Mapping. */
mapdata.pset_in = astPointSet( 1, nin, "", status );
mapdata.pset_out = astPointSet( 1, nout, "", status );
/* Obtain pointers to these PointSets' coordinate arrays. */
mapdata.ptr_in = astGetPoints( mapdata.pset_in );
mapdata.ptr_out = astGetPoints( mapdata.pset_out );
/* Allocate workspace for the returned input coordinates. */
x_l = astMalloc( sizeof( double ) * (size_t) nin );
x_u = astMalloc( sizeof( double ) * (size_t) nin );
if ( astOK ) {
/* Initialise the output bounds and corresponding input coordinates to
"unknown". */
for ( coord = 0; coord < nin; coord++ ) {
x_l[ coord ] = AST__BAD;
x_u[ coord ] = AST__BAD;
/* Initialise the input bounds, ensuring they are the correct way
around (if not already supplied this way). */
mapdata.lbnd[ coord ] = ( lbnd_in[ coord ] < ubnd_in[ coord ] ) ?
lbnd_in[ coord ] : ubnd_in[ coord ];
mapdata.ubnd[ coord ] = ( ubnd_in[ coord ] > lbnd_in[ coord ] ) ?
ubnd_in[ coord ] : lbnd_in[ coord ];
}
/* First examine a set of special input points to obtain an initial
estimate of the required output bounds. Do this only so long as the
number of points involved is not excessive. */
if ( nin <= 12 ) {
refine = SpecialBounds( &mapdata, &lbnd, &ubnd, x_l, x_u, status );
} else {
refine = 1;
}
/* Then attempt to refine this estimate using a global search
algorithm. */
if( refine ) GlobalBounds( &mapdata, &lbnd, &ubnd, x_l, x_u, status );
/* If an error occurred, generate a contextual error message. */
if ( !astOK ) {
astError( astStatus, "Unable to find a bounding box for a %s.", status,
astGetClass( this ) );
}
}
/* Return the output bounds and, if required, the input coordinate
values which correspond with them. */
if ( astOK ) {
*lbnd_out = lbnd;
*ubnd_out = ubnd;
for ( coord = 0; coord < nin; coord++ ) {
if ( xl ) xl[ coord ] = x_l[ coord ];
if ( xu ) xu[ coord ] = x_u[ coord ];
}
}
/* Annul the simplified Mapping pointer and the temporary
PointSets. Also free the workspace. */
mapdata.mapping = astAnnul( mapdata.mapping );
mapdata.lbnd = astFree( mapdata.lbnd );
mapdata.ubnd = astFree( mapdata.ubnd );
mapdata.pset_in = astAnnul( mapdata.pset_in );
mapdata.pset_out = astAnnul( mapdata.pset_out );
x_l = astFree( x_l );
x_u = astFree( x_u );
}
/* If an error occurred, then return bad bounds values and
coordinates. */
if ( !astOK ) {
*lbnd_out = AST__BAD;
*ubnd_out = AST__BAD;
for ( coord = 0; coord < nin; coord++ ) {
if ( xl ) xl[ coord ] = AST__BAD;
if ( xu ) xu[ coord ] = AST__BAD;
}
}
}
static double MapFunction( const MapData *mapdata, const double in[],
int *ncall, int *status ) {
/*
* Name:
* MapFunction
* Purpose:
* Return the value of a selected transformed coordinate.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* double MapFunction( const MapData *mapdata, const double in[],
* int *ncall, int *status );
* Class Membership:
* Mapping member function.
* Description:
* This function takes a set of input coordinates and applies a
* Mapping's coordinate transformation to them. It then returns the
* value of one of the transformed coordinates.
*
* It is provided for use by optimisation functions (e.g. those
* used for finding bounding boxes). The Mapping to be used and
* associated parameters (such as constraints on the range of input
* coordinates and the index of the output coordinate to be
* returned) are supplied in a MapData structure. The value
* returned will be negated if the "negate" component of this
* structure is non-zero.
*
* The value AST__BAD will be returned by this function if the
* input coordinates lie outside the constrained range given in
* the MapData structure, or if any of the transformed output
* coordinates is bad.
* Parameters:
* mapdata
* Pointer to a MapData structure which describes the Mapping to
* be used.
* in
* A double array containing the input coordinates of a single point.
* ncall
* Pointer to an int containing a count of the number of times
* the Mapping's coordinate transformation has been used. This
* value will be updated to reflect any use made by this
* function. Normally, this means incrementing the value by 1,
* but this will be omitted if the input coordinates supplied
* are outside the constrained range so that no transformation
* is performed.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The selected output coordinate value, or AST__BAD, as appropriate.
* Notes:
* - A value of AST__BAD will be returned if this function is
* invoked with the global error status set, or if it should fail
* for any reason.
*/
/* Local Variables: */
double result; /* Result to be returned */
int bad; /* Output coordinates invalid? */
int coord_in; /* Loop counter for input coordinates */
int coord_out; /* Loop counter for output coordinates */
int outside; /* Input point outside bounds? */
/* Initialise. */
result = AST__BAD;
/* Check the global error status. */
if ( !astOK ) return result;
/* See if the input point lies outside the required bounds. */
outside = 0;
for ( coord_in = 0; coord_in < mapdata->nin; coord_in++ ) {
if ( ( in[ coord_in ] < mapdata->lbnd[ coord_in ] ) ||
( in[ coord_in ] > mapdata->ubnd[ coord_in ] ) ) {
outside = 1;
break;
}
/* Also store the input coordinates in the memory associated with the
Mapping's input PointSet. */
mapdata->ptr_in[ coord_in ][ 0 ] = in[ coord_in ];
}
/* If the input coordinates are within bounds, transform them, using the
PointSets identified in the "mapdata" structure. */
if ( !outside ) {
(void) astTransform( mapdata->mapping, mapdata->pset_in,
mapdata->forward, mapdata->pset_out );
/* Increment the number of calls to astTransform and check the error
status. */
( *ncall )++;
if ( astOK ) {
/* If OK, test if any of the output coordinates is bad. */
bad = 0;
for ( coord_out = 0; coord_out < mapdata->nout; coord_out++ ) {
if ( mapdata->ptr_out[ coord_out ][ 0 ] == AST__BAD ) {
bad = 1;
break;
}
}
/* If not, then extract the required output coordinate, negating it if
necessary. */
if ( !bad ) {
result = mapdata->ptr_out[ mapdata->coord ][ 0 ];
if ( mapdata->negate ) result = -result;
}
}
}
/* Return the result. */
return result;
}
static int MapList( AstMapping *this, int series, int invert, int *nmap,
AstMapping ***map_list, int **invert_list, int *status ) {
/*
*+
* Name:
* astMapList
* Purpose:
* Decompose a Mapping into a sequence of simpler Mappings.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* int astMapList( AstMapping *this, int series, int invert, int *nmap,
* AstMapping ***map_list, int **invert_list )
* Class Membership:
* Mapping method.
* Description:
* This function decomposes a Mapping (which, in derived classes,
* may be a compound Mapping) into a sequence of simpler Mappings
* which may be applied in sequence to achieve the same effect. The
* Mapping is decomposed as far as possible, but it is not
* guaranteed that this will necessarily yield any more than one
* Mapping, which may actually be the original one supplied.
*
* This function is provided to support both the simplification of
* compound Mappings, and the analysis of Mapping structure so that
* particular forms can be recognised.
* Parameters:
* this
* Pointer to the Mapping to be decomposed (the Mapping is not
* actually modified by this function).
* series
* If this value is non-zero, an attempt will be made to
* decompose the Mapping into a sequence of equivalent Mappings
* which can be applied in series (i.e. one after the other). If
* it is zero, the decomposition will instead yield Mappings
* which can be applied in parallel (i.e. on successive sub-sets
* of the input/output coordinates).
* invert
* The value to which the Mapping's Invert attribute is to be
* (notionally) set before performing the
* decomposition. Normally, the value supplied here will be the
* actual Invert value obtained from the Mapping (e.g. using
* astGetInvert). Sometimes, however, when a Mapping is
* encapsulated within another structure, that structure may
* retain an Invert value (in order to prevent external
* interference) which should be used instead.
*
* Note that the actual Invert value of the Mapping supplied is
* not used (or modified) by this function.
* nmap
* The address of an int which holds a count of the number of
* individual Mappings in the decomposition. On entry, this
* should count the number of Mappings already in the
* "*map_list" array (below). On exit, it is updated to include
* any new Mappings appended by this function.
* map_list
* Address of a pointer to an array of Mapping pointers. On
* entry, this array pointer should either be NULL (if no
* Mappings have yet been obtained) or should point at a
* dynamically allocated array containing Mapping pointers
* ("*nmap" in number) which have been obtained from a previous
* invocation of this function.
*
* On exit, the dynamic array will be enlarged to contain any
* new Mapping pointers that result from the decomposition
* requested. These pointers will be appended to any previously
* present, and the array pointer will be updated as necessary
* to refer to the enlarged array (any space released by the
* original array will be freed automatically).
*
* The new Mapping pointers returned will identify a sequence of
* Mappings which, when applied in order, will perform a forward
* transformation equivalent to that of the original Mapping
* (after its Invert flag has first been set to the value
* requested above). The Mappings should be applied in series or
* in parallel according to the type of decomposition requested.
*
* All the Mapping pointers returned by this function should be
* annulled by the caller, using astAnnul, when no longer
* required. The dynamic array holding these pointers should
* also be freed, using astFree.
* invert_list
* Address of a pointer to an array of int. On entry, this array
* pointer should either be NULL (if no Mappings have yet been
* obtained) or should point at a dynamically allocated array
* containing Invert attribute values ("*nmap" in number) which
* have been obtained from a previous invocation of this
* function.
*
* On exit, the dynamic array will be enlarged to contain any
* new Invert attribute values that result from the
* decomposition requested. These values will be appended to any
* previously present, and the array pointer will be updated as
* necessary to refer to the enlarged array (any space released
* by the original array will be freed automatically).
*
* The new Invert values returned identify the values which must
* be assigned to the Invert attributes of the corresponding
* Mappings (whose pointers are in the "*map_list" array) before
* they are applied. Note that these values may differ from the
* actual Invert attribute values of these Mappings, which are
* not relevant.
*
* The dynamic array holding these values should be freed by the
* caller, using astFree, when no longer required.
* Returned Value:
* A non-zero value is returned if the supplied Mapping contained any
* inverted CmpMaps.
* Notes:
* - It is unspecified to what extent the original Mapping and the
* individual (decomposed) Mappings are
* inter-dependent. Consequently, the individual Mappings cannot be
* modified without risking modification of the original.
* - If this function is invoked with the global error status set,
* or if it should fail for any reason, then the *nmap value, the
* list of Mapping pointers and the list of Invert values will all
* be returned unchanged.
*-
*/
/* Check the global error status. */
if ( !astOK ) return 0;
/* Since we are dealing with a basic Mapping, only one new Mapping
pointer will be returned. Extend the dynamic arrays to accommodate
this Mapping. */
*map_list = astGrow( *map_list, *nmap + 1, sizeof( AstMapping * ) );
*invert_list = astGrow( *invert_list, *nmap + 1, sizeof( int ) );
if ( astOK ) {
/* Return the invert flag value for the Mapping and a clone of the
Mapping pointer. */
( *invert_list )[ *nmap ] = ( invert != 0 );
( *map_list )[ *nmap ] = astClone( this );
/* If OK, return the new Mapping count. */
if ( astOK ) ( *nmap )++;
}
return 0;
}
static int MapMerge( AstMapping *this, int where, int series, int *nmap,
AstMapping ***map_list, int **invert_list, int *status ) {
/*
*+
* Name:
* astMapMerge
* Purpose:
* Simplify a sequence of Mappings.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* int astMapMerge( AstMapping *this, int where, int series, int *nmap,
* AstMapping ***map_list, int **invert_list )
* Class Membership:
* Mapping method.
* Description:
* This function attempts to simplify a sequence of Mappings by
* merging a nominated Mapping in the sequence with its neighbours,
* so as to shorten the sequence if possible.
*
* In many cases, simplification will not be possible and the
* function will return -1 to indicate this, without further
* action.
*
* In most cases of interest, however, this function will either
* attempt to replace the nominated Mapping with one which it
* considers simpler, or to merge it with the Mappings which
* immediately precede it or follow it in the sequence (both will
* normally be considered). This is sufficient to ensure the
* eventual simplification of most Mapping sequences by repeated
* application of this function.
*
* In some cases, the function may attempt more elaborate
* simplification, involving any number of other Mappings in the
* sequence. It is not restricted in the type or scope of
* simplification it may perform, but will normally only attempt
* elaborate simplification in cases where a more straightforward
* approach is not adequate.
* Parameters:
* this
* Pointer to the nominated Mapping which is to be merged with
* its neighbours. This should be a cloned copy of the Mapping
* pointer contained in the array element "(*map_list)[where]"
* (see below). This pointer will not be annulled, and the
* Mapping it identifies will not be modified by this function.
* where
* Index in the "*map_list" array (below) at which the pointer
* to the nominated Mapping resides.
* series
* A non-zero value indicates that the sequence of Mappings to
* be simplified will be applied in series (i.e. one after the
* other), whereas a zero value indicates that they will be
* applied in parallel (i.e. on successive sub-sets of the
* input/output coordinates).
* nmap
* Address of an int which counts the number of Mappings in the
* sequence. On entry this should be set to the initial number
* of Mappings. On exit it will be updated to record the number
* of Mappings remaining after simplification.
* map_list
* Address of a pointer to a dynamically allocated array of
* Mapping pointers (produced, for example, by the astMapList
* method) which identifies the sequence of Mappings. On entry,
* the initial sequence of Mappings to be simplified should be
* supplied.
*
* On exit, the contents of this array will be modified to
* reflect any simplification carried out. Any form of
* simplification may be performed. This may involve any of: (a)
* removing Mappings by annulling any of the pointers supplied,
* (b) replacing them with pointers to new Mappings, (c)
* inserting additional Mappings and (d) changing their order.
*
* The intention is to reduce the number of Mappings in the
* sequence, if possible, and any reduction will be reflected in
* the value of "*nmap" returned. However, simplifications which
* do not reduce the length of the sequence (but improve its
* execution time, for example) may also be performed, and the
* sequence might conceivably increase in length (but normally
* only in order to split up a Mapping into pieces that can be
* more easily merged with their neighbours on subsequent
* invocations of this function).
*
* If Mappings are removed from the sequence, any gaps that
* remain will be closed up, by moving subsequent Mapping
* pointers along in the array, so that vacated elements occur
* at the end. If the sequence increases in length, the array
* will be extended (and its pointer updated) if necessary to
* accommodate any new elements.
*
* Note that any (or all) of the Mapping pointers supplied in
* this array may be annulled by this function, but the Mappings
* to which they refer are not modified in any way (although
* they may, of course, be deleted if the annulled pointer is
* the final one).
* invert_list
* Address of a pointer to a dynamically allocated array which,
* on entry, should contain values to be assigned to the Invert
* attributes of the Mappings identified in the "*map_list"
* array before they are applied (this array might have been
* produced, for example, by the astMapList method). These
* values will be used by this function instead of the actual
* Invert attributes of the Mappings supplied, which are
* ignored.
*
* On exit, the contents of this array will be updated to
* correspond with the possibly modified contents of the
* "*map_list" array. If the Mapping sequence increases in
* length, the "*invert_list" array will be extended (and its
* pointer updated) if necessary to accommodate any new
* elements.
* Returned Value:
* If simplification was possible, the function returns the index
* in the "map_list" array of the first element which was
* modified. Otherwise, it returns -1 (and makes no changes to the
* arrays supplied).
* Notes:
* - A value of -1 will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
*/
/* This is the default method which is inherited by all Mappings which
do not explicitly provide their own simplification method. Return
-1 to indicate that no simplification is provided. */
return -1;
}
static int *MapSplit( AstMapping *this, int nin, const int *in,
AstMapping **map, int *status ){
/*
*+
* Name:
* astMapSplit
* Purpose:
* Create a Mapping representing a subset of the inputs of an existing
* Mapping.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* int *astMapSplit( AstMapping *this, int nin, const int *in,
* AstMapping **map )
* Class Membership:
* Mapping method.
* Description:
* This function creates a new Mapping by picking specified inputs from
* an existing Mapping. This is only possible if the specified inputs
* correspond to some subset of the Mapping outputs. That is, there
* must exist a subset of the Mapping outputs for which each output
* depends only on the selected Mapping inputs, and not on any of the
* inputs which have not been selected. Also, any output which is not in
* this subset must not depend on any of the selected inputs. If these
* conditions are not met by the supplied Mapping, then a NULL Mapping
* is returned.
* Parameters:
* this
* Pointer to the Mapping to be split (the Mapping is not
* actually modified by this function).
* nin
* The number of inputs to pick from "this".
* in
* Pointer to an array of indices (zero based) for the inputs which
* are to be picked. This array should have "nin" elements. If "Nin"
* is the number of inputs of the supplied Mapping, then each element
* should have a value in the range zero to Nin-1.
* map
* Address of a location at which to return a pointer to the new
* Mapping. This Mapping will have "nin" inputs (the number of
* outputs may be differetn to "nin"). A NULL pointer will be
* returned if the supplied Mapping has no subset of outputs which
* depend only on the selected inputs. The returned Mapping is a
* deep copy of the required parts of the supplied Mapping.
* Returned Value:
* A pointer to a dynamically allocated array of ints. The number of
* elements in this array will equal the number of outputs for the
* returned Mapping. Each element will hold the index of the
* corresponding output in the supplied Mapping. The array should be
* freed using astFree when no longer needed. A NULL pointer will
* be returned if no output Mapping can be created.
* Notes:
* - If this function is invoked with the global error status set,
* or if it should fail for any reason, then NULL values will be
* returned as the function value and for the "map" pointer.
*-
* Implementation Notes:
* - This function implements the basic astMapSplit method available
* via the protected interface to the Mapping class. The public
* interface to this method is provided by the astMapSplitId_
* function.
*/
/* Local Variables: */
AstCmpMap *rmap; /* Unsimplified result mapping */
AstPermMap *pm; /* PermMap which rearranges the inputs */
int *outperm; /* PermMap output axis permutation array */
int *result; /* Pointer to returned array */
int iin; /* Input index */
int iout; /* Output index */
int mapnin; /* Number of Mapping inputs */
int nout; /* No of outputs */
int ok; /* Can the supplied "in" array be used? */
int perm; /* Are the inputs permuted? */
/* Initialise */
result = NULL;
*map = NULL;
/* Check the global error status. */
if ( !astOK ) return result;
/* Verify the input axis indices.*/
mapnin = astGetNin( this );
for( iin = 0; iin < nin; iin++ ){
if( in[ iin ] < 0 || in[ iin ] >= mapnin ) {
astError( AST__AXIIN, "astMapSplit(%s): One of the supplied Mapping "
"input indices has value %d which is invalid; it should "
"be in the range 1 to %d.", status, astGetClass( this ),
in[ iin ] + 1, mapnin );
break;
}
}
/* Since we are dealing with a basic Mapping, we can only create the
required output Mapping if all inputs are being selected. */
if( nin == mapnin ) {
/* The inputs may have been selected in a different order to that in
which they occur in the supplied Mapping. We therefore create a
PermMap which rearranges the inputs into the order they have in the
supplied Mapping. The supplied "in" array can act as the PermMap's
"inperm" array. Allocate memory for the "outperm" array. */
outperm = astMalloc( sizeof(int)*(size_t) nin );
if( astOK ) {
/* Store the input index for each output in the outperm array and check that
each input has been selected once and only once. Also set a flag
indicating if a PermMap is needed. */
perm = 0;
ok = 1;
for( iout = 0; iout < nin; iout++ ) outperm[ iout ] = -1;
for( iin = 0; iin < nin; iin++ ) {
iout = in[ iin ];
if( outperm[ iout ] != -1 ) {
ok = 0;
break;
} else {
outperm[ iout ] = iin;
}
}
for( iout = 0; iout < nin; iout++ ) {
if( outperm[ iout ] == -1 ) {
ok = 0;
break;
} else if( outperm[ iout ] != iout ) {
perm = 1;
}
}
if( ok ) {
/* Allocate the array to hold the returned output indices. */
nout = astGetNout( this );
result = astMalloc( sizeof(int)*(size_t) nout );
if( astOK ) {
/* The outputs are copied from the supplied Mapping. */
for( iout = 0; iout < nout; iout++ ) result[ iout ] = iout;
/* If the inputs are to be permuted, create the PermMap. */
if( perm ) {
pm = astPermMap( nin, in, nin, outperm, NULL, "", status );
/* The returned Mapping is a series CmpMap containing this PermMap
followed by the supplied Mapping. */
rmap = astCmpMap( pm, this, 1, "", status );
*map = astSimplify( rmap );
rmap = astAnnul( rmap );
/* Annul the PermMap pointer. */
pm = astAnnul( pm );
/* If no input permutation is needed, the resturned Mapping is just the
supplied Mapping. */
} else {
*map = astClone( this );
}
}
}
/* Free resources. */
outperm = astFree( outperm );
}
}
/* Free resources if an error has occurred. */
if( !astOK ) {
result = astFree( result );
*map = astAnnul( *map );
}
/* Return the list of output indices. */
return result;
}
static double MatrixDet( int nrow, int ncol, const double *matrix, int *status ){
/*
* Name:
* MatrixDet
* Purpose:
* Return the determinant of a matrix.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* double MatrixDet( int nrow, int ncol, const double *matrix, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function returns the determinant of the supplied matrix. Any
* rows or columns that hold only zeros or AST_BAD values are first
* removed from the matrix. If the resulting matrix is not square, a
* value of AST__BAD is returned for the determinant.
* Parameters:
* nrow
* The number of rows in the matrix.
* ncol
* The number of columns in the matrix.
* matrix
* The matrix element values. The first row of "ncol" elements
* should be supplied first, followed by the second row, etc.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The determinant, or AST__BAD if the determinant could not be
* caclculated.
*/
/* Local Variables: */
const double *sqmat;
const double *m;
double *a;
double *y;
double result;
int *iw;
int *usecol;
int *userow;
int i;
int icol;
int irow;
int jf;
int ncoluse;
int ndim;
int nrowuse;
/* Initialise */
result = AST__BAD;
/* Check the global error status. */
if ( !astOK ) return result;
/* Initialise... */
sqmat = NULL;
nrowuse = 0;
ncoluse = 0;
/* Flag any rows and columns that should be ignored because they contain
only bad values or zeros. */
userow = astCalloc( nrow, sizeof( *userow ) );
usecol = astCalloc( ncol, sizeof( *userow ) );
if( astOK ) {
m = matrix;
for( irow = 0; irow < nrow; irow++ ) {
for( icol = 0; icol < ncol; icol++,m++ ) {
if( *m != AST__BAD && *m != 0.0 ) {
usecol[ icol ] = 1;
userow[ irow ] = 1;
}
}
}
/* Find the number of usable rows and columns. */
for( irow = 0; irow < nrow; irow++ ) {
if( userow[ irow ] ) nrowuse++;
}
for( icol = 0; icol < ncol; icol++ ) {
if( usecol[ icol ] ) ncoluse++;
}
}
/* Return AST__BAD if the resulting matrix is not square. */
if( ncoluse == nrowuse ) {
ndim = ncoluse;
/* If any rows or columns contained just bad or zero values, create a new
matrix that excludes them. */
if( ncol > ndim || nrow > ndim ) {
sqmat = astMalloc( ndim*ndim*sizeof(*sqmat) );
if( astOK ) {
m = matrix;
a = (double *) sqmat;
for( irow = 0; irow < nrow; irow++ ) {
if( userow[ irow ] ) {
for( icol = 0; icol < ncol; icol++,m++ ) {
if( usecol[ icol ] ) *(a++) = *m;
}
} else {
m += ncol;
}
}
}
/* If no rows or columns contained just bad values, use the supplied
matrix. */
} else {
sqmat = matrix;
}
/* Calculate the determinant of the modified matrix */
if( ndim == 1 ) {
result = sqmat[ 0 ];
} else if( ndim == 2 ) {
result = sqmat[ 0 ]*sqmat[ 3 ] - sqmat[ 1 ]*sqmat[ 2 ];
} else {
a = astStore( NULL, sqmat, sizeof( double )*(size_t) (ndim*ndim) );
iw = astMalloc( sizeof( int )*(size_t) ndim );
y = astMalloc( sizeof( double )*(size_t) ndim );
if( y ) {
for( i = 0; i < ndim; i++ ) y[ i ] = 1.0;
palDmat( ndim, a, y, &result, &jf, iw );
}
y = astFree( y );
iw = astFree( iw );
a = astFree( a );
}
}
/* Free the square matrix if it was allocated here. */
if( sqmat != matrix ) sqmat = astFree( (void *) sqmat );
/* Free the usable row/column flags. */
userow = astFree( userow );
usecol = astFree( usecol );
return result;
}
static double MaxD( double a, double b, int *status ) {
/*
* Name:
* MaxD
* Purpose:
* Return the maximum of two double values.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* double MaxD( double a, double b, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function returns the maximum of two double values.
* Parameters:
* a
* The first value.
* b
* The second value.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The maximum.
*/
/* Return the larger value. */
return ( a > b ) ? a : b;
}
static int MaxI( int a, int b, int *status ) {
/*
* Name:
* MaxI
* Purpose:
* Return the maximum of two integer values.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int MaxI( int a, int b, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function returns the maximum of two integer values.
* Parameters:
* a
* The first value.
* b
* The second value.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The maximum.
*/
/* Return the larger value. */
return ( a > b ) ? a : b;
}
static int MinI( int a, int b, int *status ) {
/*
* Name:
* MinI
* Purpose:
* Return the minimum of two integer values.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int MinI( int a, int b, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function returns the minimum of two integer values.
* Parameters:
* a
* The first value.
* b
* The second value.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The minimum.
*/
/* Return the smaller value. */
return ( a < b ) ? a : b;
}
static double NewVertex( const MapData *mapdata, int lo, double scale,
double x[], double f[], int *ncall, double xnew[], int *status ) {
/*
* Name:
* NewVertex
* Purpose:
* Locate a new vertex for a simplex.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* double NewVertex( const MapData *mapdata, int lo, double scale,
* double x[], double f[], int *ncall, double xnew[], int *status );
* Class Membership:
* Mapping member function.
* Description:
* This function is provided for use during optimisation of a
* Mapping function using the simplex method. It generates the
* coordinates of a new simplex vertex and evaluates the Mapping
* function at that point. If the function's value is better then
* (i.e. larger than) the value at the previously worst vertex,
* then it is used to replace that vertex.
* Parameters:
* mapdata
* Pointer to a MapData structure which describes the Mapping
* function to be used.
* lo
* The (zero-based) index of the simplex vertex which initially
* has the worst (lowest) value.
* scale
* The scale factor to be used to generate the new vertex. The
* distance of the worst vertex from the centre of the face
* opposite it is scaled by this factor to give the new vertex
* position. Negative factors result in reflection through this
* opposite face.
* x
* An array of double containing the coordinates of the vertices
* of the simplex. The coordinates of the first vertex are
* stored first, then those of the second vertex, etc. This
* array will be updated by this function if the new vertex is
* used to replace an existing one.
* f
* An array of double containing the Mapping function values at
* each vertex of the simplex. This array will be updated by
* this function if the new vertex is used to replace an
* existing one.
* ncall
* Pointer to an int containing a count of the number of times
* the Mapping function has been invoked. This value will be
* updated to reflect the actions of this function.
* xnew
* An array of double with one element for each input coordinate
* of the Mapping function. This is used as workspace.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The Mapping function value at the new vertex. This value is
* returned whether or not the new vertex replaces an existing one.
* Notes:
* - A value of AST__BAD will be returned by this function if it is
* invoked with the global error status set, or if it should fail
* for any reason.
* - A value of AST__BAD will also be returned if the new vertex
* lies outside the constrained range of input coordinates
* associated with the Mapping function (as specified in the
* MapData structure supplied) or if any of the transformed output
* coordinates produced by the underlying Mapping is bad. In either
* case the new vertex will not be used to replace an existing one.
*/
/* Local Variables: */
double fnew; /* Function value at new vertex */
double xface; /* Coordinate of centre of magnification */
int coord; /* Loop counter for coordinates */
int ncoord; /* Number of coordinates */
int nvertex; /* Number of simplex vertices */
int vertex; /* Loop counter for vertices */
/* Initialise. */
fnew = AST__BAD;
/* Check the global error status. */
if ( !astOK ) return fnew;
/* Obtain the number of Mapping input coordinates from the MapData
structure and calculate the number of simplex vertices. */
ncoord = mapdata->nin;
nvertex = ncoord + 1;
/* Loop to obtain each coordinate of the new vertex. */
for ( coord = 0; coord < ncoord; coord++ ) {
/* Loop over all vertices except the lowest one and average their
coordinates. This gives the coordinate of the centre of the face
opposite the lowest vertex, which will act as the centre of
magnification. */
xface = 0.0;
for ( vertex = 0; vertex < nvertex; vertex++ ) {
if ( vertex != lo ) {
/* Divide each coordinate by the number of vertices as the sum is
accumulated in order to minimise the risk of overflow. */
xface += x[ vertex * ncoord + coord ] /
( (double ) ( nvertex - 1 ) );
}
}
/* Magnify the lowest vertex's distance from this point by the
required factor to give the coordinates of the new vertex. */
xnew[ coord ] = xface + ( x[ lo * ncoord + coord ] - xface ) * scale;
}
/* Evaluate the Mapping function at the new vertex. */
fnew = MapFunction( mapdata, xnew, ncall, status );
/* If the result is not bad and exceeds the previous value at the
lowest vertex, then replace the lowest vertex with this new one. */
if ( astOK && ( fnew != AST__BAD ) && ( fnew > f[ lo ] ) ) {
for ( coord = 0; coord < ncoord; coord++ ) {
x[ lo * ncoord + coord ] = xnew[ coord ];
}
f[ lo ] = fnew;
}
/* Return the value at the new vertex. */
return fnew;
}
static int QuadApprox( AstMapping *this, const double lbnd[2],
const double ubnd[2], int nx, int ny, double *fit,
double *rms, int *status ){
/*
*++
* Name:
c astQuadApprox
f AST_QUADAPPROX
* Purpose:
* Obtain a quadratic approximation to a 2D Mapping.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c int QuadApprox( AstMapping *this, const double lbnd[2],
c const double ubnd[2], int nx, int ny, double *fit,
c double *rms )
f RESULT = AST_QUADAPPROX( THIS, LBND, UBND, NX, NY, FIT, RMS, STATUS )
* Class Membership:
* Mapping function.
* Description:
* This function returns the co-efficients of a quadratic fit to the
* supplied Mapping over the input area specified by
c "lbnd" and "ubnd".
f LBND and UBND.
* The Mapping must have 2 inputs, but may have any number of outputs.
* The i'th Mapping output is modelled as a quadratic function of the
* 2 inputs (x,y):
*
* output_i = a_i_0 + a_i_1*x + a_i_2*y + a_i_3*x*y + a_i_4*x*x +
* a_i_5*y*y
*
c The "fit"
f The FIT
* array is returned holding the values of the co-efficients a_0_0,
* a_0_1, etc.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping.
c lbnd
f LBND( * ) = DOUBLE PRECISION (Given)
c Pointer to an array of doubles
f An array
* containing the lower bounds of a box defined within the input
* coordinate system of the Mapping. The number of elements in this
* array should equal the value of the Mapping's Nin attribute. This
* box should specify the region over which the fit is to be
* performed.
c ubnd
f UBND( * ) = DOUBLE PRECISION (Given)
c Pointer to an array of doubles
f An array
* containing the upper bounds of the box specifying the region over
* which the fit is to be performed.
c nx
f NX = INTEGER (Given)
* The number of points to place along the first Mapping input. The
* first point is at
c "lbnd[0]" and the last is at "ubnd[0]".
f LBND( 1 ) and the last is at UBND( 1 ).
* If a value less than three is supplied a value of three will be used.
c ny
f NY = INTEGER (Given)
* The number of points to place along the second Mapping input. The
* first point is at
c "lbnd[1]" and the last is at "ubnd[1]".
f LBND( 2 ) and the last is at UBND( 2 ).
* If a value less than three is supplied a value of three will be used.
c fit
f FIT( * ) = DOUBLE PRECISION (Returned)
c Pointer to an array of doubles
f An array
* in which to return the co-efficients of the quadratic
* approximation to the specified transformation. This array should
* have at least "6*Nout", elements. The first 6 elements hold the
* fit to the first Mapping output. The next 6 elements hold the
* fit to the second Mapping output, etc. So if the Mapping has 2
* inputs and 2 outputs the quadratic approximation to the forward
* transformation is:
*
c X_out = fit[0] + fit[1]*X_in + fit[2]*Y_in + fit[3]*X_in*Y_in +
c fit[4]*X_in*X_in + fit[5]*Y_in*Y_in
c Y_out = fit[6] + fit[7]*X_in + fit[8]*Y_in + fit[9]*X_in*Y_in +
c fit[10]*X_in*X_in + fit[11]*Y_in*Y_in
f X_out = fit(1) + fit(2)*X_in + fit(3)*Y_in + fit(4)*X_in*Y_in +
f fit(5)*X_in*X_in + fit(6)*Y_in*Y_in
f Y_out = fit(7) + fit(8)*X_in + fit(9)*Y_in + fit(10)*X_in*Y_in +
f fit(11)*X_in*X_in + fit(12)*Y_in*Y_in
*
c rms
f RMS = DOUBLE PRECISION (Returned)
c Pointer to a double in which to return the
f The
* RMS residual between the fit and the Mapping, summed over all
* Mapping outputs.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Returned Value:
c astQuadApprox()
f AST_QUADAPPROX = LOGICAL
* If a quadratic approximation was created,
c a non-zero value is returned. Otherwise zero is returned
f .TRUE is returned. Otherwise .FALSE. is returned
* and the fit co-efficients are set to AST__BAD.
* Notes:
* - This function fits the Mapping's forward transformation. To fit
* the inverse transformation, the Mapping should be inverted using
c astInvert
f AST_INVERT
* before invoking this function.
c - A value of zero
f - A value of .FALSE.
* will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*--
*/
/* Local Variables: */
AstPointSet *pset1;
AstPointSet *pset2;
double **pdat1;
double **pdat2;
double *ofit;
double *px;
double *py;
double *pz;
double det;
double dx;
double dy;
double mat[ 6*6 ];
double sx2;
double sx2y2;
double sx2y;
double sx3;
double sx3y;
double sx4;
double sx;
double sxy2;
double sxy3;
double sxy;
double sy2;
double sy3;
double sy4;
double sy;
double sz;
double sz2;
double szx2;
double szx;
double szxy;
double szy2;
double szy;
double x;
double xx;
double xy;
double y;
double yy;
double z;
int i;
int iout;
int iw[ 6 ];
int ix;
int iy;
int n;
int nin;
int nout;
int np;
int ntot;
int result;
int sing;
/* Initialise the returned values. */
result = 0;
fit[ 0 ] = AST__BAD;
*rms = AST__BAD;
ntot = 0;
/* Check the global error status. */
if( !astOK ) return result;
/* Get the number of Mapping inputs and outputs. Report an error if not
correct. */
nin = astGetI( this, "Nin" );
nout = astGetI( this, "Nout" );
if( nin != 2 && astOK ) {
astError( AST__BADNI, "astQuadApprox(%s): Input Mapping has %d %s - "
"it must have 2 inputs.", status, astGetClass( this ), nin,
(nin==1)?"input":"inputs" );
}
/* Ensure we are using at least 3 points on each of the two input axes. */
if( nx < 3 ) nx = 3;
if( ny < 3 ) ny = 3;
/* Get the total number of grid points. */
np = nx*ny;
/* Create a PointSet to hold the 2D grid of input positions. */
pset1 = astPointSet( np, 2, " ", status );
pdat1 = astGetPoints( pset1 );
/* Create a PointSet to hold the N-D grid of output positions. */
pset2 = astPointSet( np, nout, " ", status );
pdat2 = astGetPoints( pset2 );
/* Check the memory allocation (and everything else) was succesful. */
if( astOK ) {
/* Find the cell dimensions on X and Y input axes. */
dx = ( ubnd[ 0 ] - lbnd[ 0 ] )/( nx - 1 );
dy = ( ubnd[ 1 ] - lbnd[ 1 ] )/( ny - 1 );
/* Create a regular grid of input positions. */
px = pdat1[ 0 ];
py = pdat1[ 1 ];
for( iy = 0; iy < ny; iy++ ) {
x = lbnd[ 0 ];
y = lbnd[ 1 ] + iy*dy;
for( ix = 0; ix < nx; ix++ ) {
*(px++) = x;
*(py++) = y;
x += dx;
}
}
/* Use the supplied Mapping to transform this grid into the output space. */
(void) astTransform( this, pset1, 1, pset2 );
/* Assume the approximation can be created. */
result = 1;
*rms = 0.0;
/* Loop round each Mapping output. */
for( iout = 0; iout < nout && astOK; iout++ ) {
/* Get a pointer to the first element of the fit array for this output. */
ofit = fit + 6*iout;
/* Form the required sums. */
n = 0;
sx = 0.0;
sy = 0.0;
sxy = 0.0;
sx2 = 0.0;
sy2 = 0.0;
sx2y = 0.0;
sx3 = 0.0;
sxy2 = 0.0;
sy3 = 0.0;
sx2y2 = 0.0;
sx3y = 0.0;
sxy3 = 0.0;
sx4 = 0.0;
sy4 = 0.0;
sz = 0.0;
sz2 = 0.0;
szx = 0.0;
szy = 0.0;
szxy = 0.0;
szx2 = 0.0;
szy2 = 0.0;
px = pdat1[ 0 ];
py = pdat1[ 1 ];
pz = pdat2[ iout ];
for( i = 0; i < np; i++ ) {
x = *(px++);
y = *(py++);
z = *(pz++);
if( z != AST__BAD ) {
xx = x*x;
yy = y*y;
xy = x*y;
n++;
sx += x;
sy += y;
sxy += xy;
sx2 += xx;
sy2 += yy;
sx2y += xx*y;
sx3 += xx*x;
sxy2 += x*yy;
sy3 += yy*y;
sx2y2 += xx*yy;
sx3y += xx*xy;
sxy3 += xy*yy;
sx4 += xx*xx;
sy4 += yy*yy;
sz += z;
sz2 += z*z;
szx += z*x;
szy += z*y;
szxy += z*xy;
szx2 += z*xx;
szy2 += z*yy;
}
}
/* Form a matrix (M) and vector (V) such that M.X = V, where X is the
solution vector holding the required best fit parameter values (V is
stored in ofit). */
mat[ 0 ] = n;
mat[ 1 ] = sx;
mat[ 2 ] = sy;
mat[ 3 ] = sxy;
mat[ 4 ] = sx2;
mat[ 5 ] = sy2;
mat[ 6 ] = sx;
mat[ 7 ] = sx2;
mat[ 8 ] = sxy;
mat[ 9 ] = sx2y;
mat[ 10 ] = sx3;
mat[ 11 ] = sxy2;
mat[ 12 ] = sy;
mat[ 13 ] = sxy;
mat[ 14 ] = sy2;
mat[ 15 ] = sxy2;
mat[ 16 ] = sx2y;
mat[ 17 ] = sy3;
mat[ 18 ] = sxy;
mat[ 19 ] = sx2y;
mat[ 20 ] = sxy2;
mat[ 21 ] = sx2y2;
mat[ 22 ] = sx3y;
mat[ 23 ] = sxy3;
mat[ 24 ] = sx2;
mat[ 25 ] = sx3;
mat[ 26 ] = sx2y;
mat[ 27 ] = sx3y;
mat[ 28 ] = sx4;
mat[ 29 ] = sx2y2;
mat[ 30 ] = sy2;
mat[ 31 ] = sxy2;
mat[ 32 ] = sy3;
mat[ 33 ] = sxy3;
mat[ 34 ] = sx2y2;
mat[ 35 ] = sy4;
ofit[ 0 ] = sz;
ofit[ 1 ] = szx;
ofit[ 2 ] = szy;
ofit[ 3 ] = szxy;
ofit[ 4 ] = szx2;
ofit[ 5 ] = szy2;
/* Now find the solution vector (the solution over-writes teh current
contents of "ofit"). */
palDmat( 6, mat, ofit, &det, &sing, iw );
/* If the fit failed, fill the coefficient array with bad values. */
if( sing != 0 ) {
for( i = 0; i < 6; i++ ) ofit[ i ] = AST__BAD;
result = 0;
break;
/* If the fit succeeded, update the summ of the squared residuals. */
} else {
ntot += n;
*rms += ofit[ 0 ]*ofit[ 0 ]*n +
2*ofit[ 0 ]*ofit[ 1 ]*sx +
2*ofit[ 0 ]*ofit[ 2 ]*sy +
2*( ofit[ 0 ]*ofit[ 3 ] + ofit[ 1 ]*ofit[ 2 ] )*sxy +
( 2*ofit[ 0 ]*ofit[ 4 ] + ofit[ 1 ]*ofit[ 1 ] )*sx2 +
( 2*ofit[ 0 ]*ofit[ 5 ] + ofit[ 2 ]*ofit[ 2 ] )*sy2 +
2*ofit[ 1 ]*ofit[ 4 ]*sx3 +
2*( ofit[ 1 ]*ofit[ 3 ] + ofit[ 2 ]*ofit[ 4 ] )*sx2y +
2*( ofit[ 1 ]*ofit[ 5 ] + ofit[ 2 ]*ofit[ 3 ] )*sxy2 +
2*ofit[ 2 ]*ofit[ 5 ]*sy3 +
ofit[ 4 ]*ofit[ 4 ]*sx4 +
2*ofit[ 3 ]*ofit[ 4 ]*sx3y +
( 2*ofit[ 4 ]*ofit[ 5 ] + ofit[ 3 ]*ofit[ 3 ] )*sx2y2 +
2*ofit[ 3 ]*ofit[ 5 ]*sxy3 +
ofit[ 5 ]*ofit[ 5 ]*sy4 +
sz2 - 2*(
ofit[ 0 ]*sz +
ofit[ 1 ]*szx +
ofit[ 2 ]*szy +
ofit[ 3 ]*szxy +
ofit[ 4 ]*szx2 +
ofit[ 5 ]*szy2
);
}
}
}
/* Free resources. */
pset1 = astAnnul( pset1 );
pset2 = astAnnul( pset2 );
/* Return AST__BAD if anything went wrong. */
if( !astOK || ntot == 0 ) {
result = 0;
fit[ 0 ] = AST__BAD;
*rms = AST__BAD;
/* Otherwise normalise the returned RMS. */
} else {
if( *rms > 0.0 ) {
*rms = sqrt( *rms/ntot );
} else {
*rms = 0.0;
}
}
/* Return result */
return result;
}
static double Random( long int *seed, int *status ) {
/*
* Name:
* Random
* Purpose:
* Return a pseudo-random value in the range 0 to 1.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* double Random( long int *seed, int *status );
* Class Membership:
* Mapping member function.
* Description:
* This function returns a pseudo-random double value from a PDF
* uniformly distributed in the range 0 to 1. It also updates a
* seed value so that a sequence of pseudo-random values may be
* obtained with successive invocations.
* Parameters:
* seed
* Pointer to a long int which should initially contain a
* non-zero seed value. This will be updated with a new seed
* which may be supplied on the next invocation in order to
* obtain a different pseudo-random value.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The pseudo-random value.
*/
/* Local Variables: */
long int i; /* Temporary storage */
/* This a basic random number generator using constants given in
Numerical Recipes (Press et al.). */
i = *seed / 127773;
*seed = ( *seed - i * 127773 ) * 16807 - i * 2836;
if ( *seed < 0 ) *seed += 2147483647;
/* Return the result as a double value in the range 0 to 1. */
return ( (double) ( *seed - 1 ) ) / (double) 2147483646;
}
static double Rate( AstMapping *this, double *at, int ax1, int ax2,
int *status ){
/*
*+
* Name:
* astRate
* Purpose:
* Calculate the rate of change of a Mapping output.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* result = astRate( AstMapping *this, double *at, int ax1, int ax2 )
* Class Membership:
* Mapping method.
* Description:
* This function evaluates the rate of change of a specified output of
* the supplied Mapping with respect to a specified input, at a
* specified input position.
*
* The result is the mean gradient within a small interval centred on
* the supplied position. The interval size is selected automatically
* to minimise the error on the returned value. For large intervals,
* the error is dominated by changes in the gradient of the
* transformation. For small intervals, the error is dominated by
* rounding errors. The best interval is the one that gives the most
* consistent measure of the gradient within the interval. To find this
* consistency, each candidate interval is subdivided into eight
* sub-intervals, the mean gradient within each sub-interval is found,
* and the associated consistency measure is then the difference between
* the maximum and minimum sub-interval gradient found within the interval.
* Parameters:
* this
* Pointer to the Mapping to be applied.
* at
* The address of an array holding the axis values at the position
* at which the rate of change is to be evaluated. The number of
* elements in this array should equal the number of inputs to the
* Mapping.
* ax1
* The index of the Mapping output for which the rate of change is to
* be found (output numbering starts at 0 for the first output).
* ax2
* The index of the Mapping input which is to be varied in order to
* find the rate of change (input numbering starts at 0 for the first
* input).
* Returned Value:
* astRate()
* The rate of change of Mapping output "ax1" with respect to input
* "ax2", evaluated at "at", or AST__BAD if the value cannot be
* calculated.
* Notes:
* - A value of AST__BAD will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
* Implementation Notes:
* - This function implements the basic astRate method available
* via the protected interface to the Mapping class. The public
* interface to this method is provided by the astRateId_
* function.
*/
#define NN 50
/* Local Variables: */
double h0;
double h;
double mean;
double minrange;
double range0;
double range;
double ret;
double x0;
double y[2*NN+1];
double z[2*NN+1];
int ibot;
int iin;
int iret;
int itop;
int nin;
int nout;
/* Initialise */
ret = AST__BAD;
/* Check the global error status. */
if ( !astOK ) return ret;
/* Allocate resources */
RateFun( NULL, NULL, -1, 0, 0, NULL, NULL, status );
/* Obtain the numbers of input and output coordinates for the Mapping. */
nin = astGetNin( this );
nout = astGetNout( this );
/* Validate the output index. */
if ( astOK && ( ax1 < 0 || ax1 >= nout ) ) {
astError( AST__AXIIN, "astRate(%s): The supplied Mapping output "
"index (%d) is invalid; it should be in the range 1 to %d.", status,
astGetClass( this ), ax1 + 1, nout );
}
/* Validate the input index. */
if ( astOK && ( ax2 < 0 || ax2 >= nin ) ) {
astError( AST__AXIIN, "astRate(%s): The supplied Mapping input "
"index (%d) is invalid; it should be in the range 1 to %d.", status,
astGetClass( this ), ax2 + 1, nin );
}
/* Check the Mapping has a forward transformation. */
if ( astOK && !astGetTranForward( this ) ) {
astError( AST__NODEF, "astRate(%s): The supplied Mapping does not "
"have a defined forward transformation.", status,
astGetClass( this ) );
}
/* Save the central value on the Mapping input which is to be varied. */
x0 = at[ ax2 ];
/* If it is bad, return bad values. */
if( astOK && x0 != AST__BAD ) {
/* The required derivative is formed by evaluating the transformation at
two positions close to "x0", and dividing the change in y by the
change in x. The complexity comes in deciding how close to "x0" the
two points should be. If the points are too far apart, the gradient of
the function may vary significantly between the two points and so we
have little confidence that he mean gradient in the interval is a good
estimate of the gradient at "x0". On the other hand if the points are
too close together, rounding errors will make the gradient value
unreliable. The optimal interval is found by testing a number of
different intervals as follows. Each interval is split into NDIV equal
sub-intervals, and the gradient in each sub-interval is found. The max
and min gradient for any of these sub-intervals is found, and the
difference between them is used as an estimate of the reliability of the
mean gradient within the whole interval. The interval with the
greatest reliability is used to define the returned gradient.
The initial estimate of the interval size is a fixed small fraction of
the supplied "x0" value, or 1.0 if "x0" is zero. */
h0 = ( x0 != 0.0 ) ? DBL_EPSILON*1.0E9*fabs( x0 ) : 1.0;
/* Attempt to find the mean gradient, and the range of gradients, within
an interval of size "h0" centred on "x0". If this cannot be done,
increase "h0" by a factor fo ten repeatedly until it can be done, or a
silly large interval size is reached. */
mean = AST__BAD;
while( mean == AST__BAD && h0 < 1.0E-10*DBL_MAX ) {
h0 *= 10;
mean = FindGradient( this, at, ax1, ax2, x0, h0, &range0, status );
}
/* If this was not successful, return AST__BAD as the function value. */
if( mean != AST__BAD ) {
/* We now search through a range of larger interval sizes, to see if any
produce a more reliable mean gradient estimate (i.e. have a smaller range
of gradients within the interval ). After that we search through a range
of smaller interval sizes. The gradient range and mean gradient for
each interval size are stored in arrays "y" and "z" respectively. "iret"
is the index of the most reliable interval found so far (i.e. the one
with the smallest range of sub-interval gradients). The original interval
"h0" is stored in the middle element of these arrays (index "NN").
Intervals are stored in monotonic order of interval size in the arrays. */
iret = NN;
y[ NN ] = range0;
z[ NN ] = mean;
minrange = range0;
/* itop is the index of the last array elements to store calculated values. */
itop = NN;
/* Loop round increasing the interval size by a factor of four each time
round. */
h = h0;
for( iin = NN + 1; iin <= 2*NN && astOK; iin++ ){
h *= 4.0;
/* Calculate the mean gradient, and the range of gradients, using the
current interval size. */
mean = FindGradient( this, at, ax1, ax2, x0, h, &range, status );
/* If it could be done, store the values in the arrays. */
if( mean != AST__BAD ) {
itop++;
z[ itop ] = mean;
y[ itop ] = range;
/* Look for the smallest range, and note its index in the arrays. */
if( range < minrange ) {
minrange = range;
iret = itop;
/* If a range of zero is encountered, we only believe it if the previous
interval also had zero range. Otherwise, it's probably just a numerical
fluke. If the previous interval also had a range of zero, we can forget
the rest of the algorithm since the supplied transformation is linear
and we now have its gradient. So leave the loop. */
} else if( range == 0.0 && y[ iin - 1 ] == 0 ) {
iret = itop;
break;
}
/* Stop looping when the interval range is 100 times the original
interval range. */
if( range > 100*range0 ) break;
}
}
/* Record the minimum range found so far. */
range0 = minrange;
/* ibot is the index of the first array elements to store calculated values. */
ibot = NN;
/* Loop round decreasing the interval size by a factor of four each time
round. This is just like the last loop, but goes the other way, to
lower indices. */
h = h0;
for( iin = NN - 1; iin >= 0 && astOK; iin-- ){
h /= 4.0;
mean = FindGradient( this, at, ax1, ax2, x0, h, &range, status );
if( mean != AST__BAD ) {
ibot--;
z[ ibot ] = mean;
y[ ibot ] = range;
if( range < minrange ) {
minrange = range;
iret = ibot;
} else if( range == 0.0 && y[ iin + 1 ] == 0 ) {
iret = ibot;
break;
}
if( range > 100*range0 ) break;
}
}
/* If the smallest gradient range in any interval was zero, we only
believe it if the adjacent interval size also had zero range. */
if( minrange == 0.0 ) {
if( ( iret > ibot && y[ iret - 1 ] == 0 ) ||
( iret < itop && y[ iret + 1 ] == 0 ) ) {
ret = z[ iret ];
/* Otherwise, search for the smallest gradient range, ignoring values
exactly equal to zero, and return the corresponding mean interval
gradient. */
} else {
for( iin = ibot; iin <= itop; iin++ ){
if( y[ iin ] > 0.0 ){
if( minrange == 0 || y[ iin ] < minrange ) {
minrange = y[ iin ];
ret = z[ iin ];
}
}
}
}
/* If the minimum range was non-zero, we can just return the
corresponding mean gradient. */
} else {
ret = z[ iret ];
}
}
}
/* Free resources */
RateFun( NULL, NULL, -2, 0, 0, NULL, NULL, status );
/* Return the result. */
return ret;
#undef NN
}
static void RateFun( AstMapping *map, double *at, int ax1, int ax2,
int n, double *x, double *y, int *status ) {
/*
* Name:
* RateFun
* Purpose:
* Find the value of the function currently being differentiated by the
* astRate method.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void RateFun( AstMapping *map, double *at, int ax1, int ax2,
* int n, double *x, double *y, int *status )
* Class Membership:
* Mapping method.
* Description:
* This is a service function for the astRate method. It evaluates the
* function being differentiated at specified axis values.
*
* This function uses static resources in order to avoid the overhead
* of creating new PointSets each time this function is called. These
* static resources which must be initialised before the first invocation
* with a given Mapping, and must be released after the final invocation.
* See "ax1".
* Parameters:
* map
* Pointer to a Mapping which yields the value of the function at x.
* The Mapping may have any number of inputs and outputs; the specific
* output representing the function value, f, is specified by ax1 and
* the specific input representing the argument, x, is specified by ax2.
* at
* A pointer to an array holding axis values at the position at which
* the function is to be evaluated. The number of values supplied
* must equal the number of inputs to the Mapping. The value supplied
* for axis "ax2" is ignored (the value of "x" is used for axis "ax2").
* ax1
* The zero-based index of the Mapping output which is to be
* differentiated. Set this to -1 to allocate, or -2 to release,
* the static resources used by this function.
* ax2
* The zero-based index of the Mapping input which is to be varied.
* n
* The number of elements in the "x" and "y" arrays. This should not
* be greater than 2*RATE_ORDER.
* x
* The value of the Mapping input specified by ax2 at which the
* function is to be evaluated. If "ax2" is set to -1, then the
* supplied value is used as flag indicating if the static resources
* used by this function should be initialised (if x >= 0 ) or
* freed (if x < 0).
* y
* An array in which to return the function values at the positions
* given in "x".
* status
* Pointer to the inherited status variable.
*/
/* Local Variables: */
astDECLARE_GLOBALS
AstPointSet *pset1;
AstPointSet *pset2;
double **ptr1;
double **ptr2;
double *oldx;
double *oldy;
double *p;
double xx;
int i;
int k;
int nin;
int nout;
/* Check the global error status. */
if ( !astOK ) return;
/* Get a pointer to the thread specific global data structure. */
astGET_GLOBALS(map);
/* Initialise variables to avoid "used of uninitialised variable"
messages from dumb compilers. */
pset2 = NULL;
/* If required, initialise things. */
if( ax1 == -1 ) {
for( i = 0; i < RATEFUN_MAX_CACHE; i++ ) {
ratefun_pset_size[ i ] = 0;
ratefun_pset1_cache[ i ] = NULL;
ratefun_pset2_cache[ i ] = NULL;
}
ratefun_next_slot = 0;
/* If required, clean up. */
} else if( ax1 == -2 ) {
for( i = 0; i < RATEFUN_MAX_CACHE; i++ ) {
ratefun_pset_size[ i ] = 0;
if( ratefun_pset1_cache[ i ] ) ratefun_pset1_cache[ i ] = astAnnul( ratefun_pset1_cache[ i ] );
if( ratefun_pset2_cache[ i ] ) ratefun_pset2_cache[ i ] = astAnnul( ratefun_pset2_cache[ i ] );
}
ratefun_next_slot = 0;
/* Otherwise do the transformations. */
} else {
/* See if we have already created PointSets of the correct size. */
pset1 = NULL;
for( i = 0; i < RATEFUN_MAX_CACHE; i++ ) {
if( ratefun_pset_size[ i ] == n ) {
pset1 = ratefun_pset1_cache[ i ];
pset2 = ratefun_pset2_cache[ i ];
break;
}
}
/* If we have not, create new PointSets now. */
if( pset1 == NULL ) {
nin = astGetNin( map );
pset1 = astPointSet( n, nin, "", status );
ptr1 = astGetPoints( pset1 );
nout = astGetNout( map );
pset2 = astPointSet( n, nout, "", status );
ptr2 = astGetPoints( pset2 );
/* Store the input position in the input PointSet. */
for( i = 0; i < nin; i++ ) {
xx = at[ i ];
p = ptr1[ i ];
for( k = 0; k < n; k++, p++ ) *p = xx;
}
/* Add these new PointSets to the cache, removing any existing
PointSets. */
if( ratefun_pset_size[ ratefun_next_slot ] > 0 ) {
(void) astAnnul( ratefun_pset1_cache[ ratefun_next_slot ] );
(void) astAnnul( ratefun_pset2_cache[ ratefun_next_slot ] );
}
ratefun_pset1_cache[ ratefun_next_slot ] = pset1;
ratefun_pset2_cache[ ratefun_next_slot ] = pset2;
ratefun_pset_size[ ratefun_next_slot ] = n;
if( ++ratefun_next_slot == RATEFUN_MAX_CACHE ) ratefun_next_slot = 0;
/* If existing PointSets were found, get there data arrays. */
} else {
ptr1 = astGetPoints( pset1 );
ptr2 = astGetPoints( pset2 );
}
/* Store the input X values in the input PointSet data array. */
oldx = ptr1[ ax2 ];
ptr1[ ax2 ] = x;
/* Store the output Y values in the output PointSet data array. */
oldy = ptr2[ ax1 ];
ptr2[ ax1 ] = y;
/* Transform the positions. */
(void) astTransform( map, pset1, 1, pset2 );
/* Re-instate the original arrays in the PointSets. */
ptr1[ ax2 ] = oldx;
ptr2[ ax1 ] = oldy;
}
}
/*
*++
* Name:
c astRebin<X>
f AST_REBIN<X>
* Purpose:
* Rebin a region of a data grid.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astRebin<X>( AstMapping *this, double wlim, int ndim_in,
c const int lbnd_in[], const int ubnd_in[],
c const <Xtype> in[], const <Xtype> in_var[],
c int spread, const double params[], int flags,
c double tol, int maxpix,
c <Xtype> badval, int ndim_out,
c const int lbnd_out[], const int ubnd_out[],
c const int lbnd[], const int ubnd[],
c <Xtype> out[], <Xtype> out_var[] );
f CALL AST_REBIN<X>( THIS, WLIM, NDIM_IN, LBND_IN, UBND_IN, IN, IN_VAR,
f SPREAD, PARAMS, FLAGS,
f TOL, MAXPIX, BADVAL,
f NDIM_OUT, LBND_OUT, UBND_OUT,
f LBND, UBND, OUT, OUT_VAR, STATUS )
* Class Membership:
* Mapping method.
* Description:
* This is a set of functions for rebinning gridded data (e.g. an
* image) under the control of a geometrical transformation, which
* is specified by a Mapping. The functions operate on a pair of
* data grids (input and output), each of which may have any number
* of dimensions. Rebinning may be restricted to a specified
* region of the input grid. An associated grid of error estimates
* associated with the input data may also be supplied (in the form
* of variance values), so as to produce error estimates for the
* rebined output data. Propagation of missing data (bad pixels)
* is supported.
*
* Note, if you will be rebining a sequence of input arrays and then
* co-adding them into a single array, the alternative
c astRebinSeq<X> functions
f AST_REBINSEQ<X> routines
* will in general be more efficient.
*
* You should use a rebinning function which matches the numerical
* type of the data you are processing by replacing <X> in
c the generic function name astRebin<X> by an appropriate 1- or
f the generic function name AST_REBIN<X> by an appropriate 1- or
* 2-character type code. For example, if you are rebinning data
c with type "float", you should use the function astRebinF (see
f with type REAL, you should use the function AST_REBINR (see
* the "Data Type Codes" section below for the codes appropriate to
* other numerical types).
*
* Rebinning of the grid of input data is performed by transforming
* the coordinates of the centre of each input grid element (or pixel)
* into the coordinate system of the output grid. The input pixel
* value is then divided up and assigned to the output pixels in the
* neighbourhood of the central output coordinates. A choice of
* schemes are provided for determining how each input pixel value is
* divided up between the output pixels. In general, each output pixel
* may be assigned values from more than one input pixel. All
* contributions to a given output pixel are summed to produce the
* final output pixel value. Output pixels can be set to the supplied
* bad value if they receive contributions from an insufficient number
* of input pixels. This is controlled by the
c "wlim" parameter.
f WLIM argument.
*
* Input pixel coordinates are transformed into the coordinate
* system of the output grid using the forward transformation of the
* Mapping which is supplied. This means that geometrical features
* in the input data are subjected to the Mapping's forward
* transformation as they are transferred from the input to the
* output grid.
*
* In practice, transforming the coordinates of every pixel of a
* large data grid can be time-consuming, especially if the Mapping
* involves complicated functions, such as sky projections. To
* improve performance, it is therefore possible to approximate
* non-linear Mappings by a set of linear transformations which are
* applied piece-wise to separate sub-regions of the data. This
* approximation process is applied automatically by an adaptive
* algorithm, under control of an accuracy criterion which
* expresses the maximum tolerable geometrical distortion which may
* be introduced, as a fraction of a pixel.
*
* This algorithm first attempts to approximate the Mapping with a
* linear transformation applied over the whole region of the
* input grid which is being used. If this proves to be
* insufficiently accurate, the input region is sub-divided into
* two along its largest dimension and the process is repeated
* within each of the resulting sub-regions. This process of
* sub-division continues until a sufficiently good linear
* approximation is found, or the region to which it is being
* applied becomes too small (in which case the original Mapping is
* used directly).
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to a Mapping, whose forward transformation will be
* used to transform the coordinates of pixels in the input
* grid into the coordinate system of the output grid.
*
* The number of input coordinates used by this Mapping (as
* given by its Nin attribute) should match the number of input
c grid dimensions given by the value of "ndim_in"
f grid dimensions given by the value of NDIM_IN
* below. Similarly, the number of output coordinates (Nout
* attribute) should match the number of output grid dimensions
c given by "ndim_out".
f given by NDIM_OUT.
c wlim
f WLIM = DOUBLE PRECISION (Given)
* Gives the required number of input pixel values which must contribute
* to an output pixel in order for the output pixel value to be
* considered valid. If the sum of the input pixel weights contributing
* to an output pixel is less than the supplied
c "wlim"
f WLIM
* value, then the output pixel value is returned set to the
* supplied bad value.
c ndim_in
f NDIM_IN = INTEGER (Given)
* The number of dimensions in the input grid. This should be at
* least one.
c lbnd_in
f LBND_IN( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the centre of the first pixel
* in the input grid along each dimension.
c ubnd_in
f UBND_IN( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the centre of the last pixel in
* the input grid along each dimension.
*
c Note that "lbnd_in" and "ubnd_in" together define the shape
f Note that LBND_IN and UBND_IN together define the shape
* and size of the input grid, its extent along a particular
c (j'th) dimension being ubnd_in[j]-lbnd_in[j]+1 (assuming the
c index "j" to be zero-based). They also define
f (J'th) dimension being UBND_IN(J)-LBND_IN(J)+1. They also define
* the input grid's coordinate system, each pixel having unit
* extent along each dimension with integral coordinate values
* at its centre.
c in
f IN( * ) = <Xtype> (Given)
c Pointer to an array, with one element for each pixel in the
f An array, with one element for each pixel in the
* input grid, containing the input data to be rebined. The
* numerical type of this array should match the 1- or
* 2-character type code appended to the function name (e.g. if
c you are using astRebinF, the type of each array element
c should be "float").
f you are using AST_REBINR, the type of each array element
f should be REAL).
*
* The storage order of data within this array should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
c (i.e. Fortran array indexing is used).
f (i.e. normal Fortran array storage order).
c in_var
f IN_VAR( * ) = <Xtype> (Given)
c An optional pointer to a second array with the same size and
c type as the "in" array. If given, this should contain a set
c of non-negative values which represent estimates of the
c statistical variance associated with each element of the "in"
c array. If this array is supplied (together with the
c corresponding "out_var" array), then estimates of the
c variance of the rebined output data will be calculated.
c
c If no input variance estimates are being provided, a NULL
c pointer should be given.
f An optional second array with the same size and type as the
f IN array. If the AST__USEVAR flag is set via the FLAGS
f argument (below), this array should contain a set of
f non-negative values which represent estimates of the
f statistical variance associated with each element of the IN
f array. Estimates of the variance of the rebined output data
f will then be calculated.
f
f If the AST__USEVAR flag is not set, no input variance
f estimates are required and this array will not be used. A
f dummy (e.g. one-element) array may then be supplied.
c spread
f SPREAD = INTEGER (Given)
c This parameter specifies the scheme to be used for dividing
f This argument specifies the scheme to be used for dividing
* each input data value up amongst the corresponding output pixels.
* It may be used to select
* from a set of pre-defined schemes by supplying one of the
* values described in the "Pixel Spreading Schemes"
* section below. If a value of zero is supplied, then the
* default linear spreading scheme is used (equivalent to
* supplying the value AST__LINEAR).
c params
f PARAMS( * ) = DOUBLE PRECISION (Given)
c An optional pointer to an array of double which should contain
f An optional array which should contain
* any additional parameter values required by the pixel
* spreading scheme. If such parameters are required, this
* will be noted in the "Pixel Spreading Schemes"
* section below.
*
c If no additional parameters are required, this array is not
c used and a NULL pointer may be given.
f If no additional parameters are required, this array is not
f used. A dummy (e.g. one-element) array may then be supplied.
c flags
f FLAGS = INTEGER (Given)
c The bitwise OR of a set of flag values which may be used to
f The sum of a set of flag values which may be used to
* provide additional control over the rebinning operation. See
* the "Control Flags" section below for a description of the
* options available. If no flag values are to be set, a value
* of zero should be given.
c tol
f TOL = DOUBLE PRECISION (Given)
* The maximum tolerable geometrical distortion which may be
* introduced as a result of approximating non-linear Mappings
* by a set of piece-wise linear transformations. This should be
* expressed as a displacement in pixels in the output grid's
* coordinate system.
*
* If piece-wise linear approximation is not required, a value
* of zero may be given. This will ensure that the Mapping is
* used without any approximation, but may increase execution
* time.
*
* If the value is too high, discontinuities between the linear
* approximations used in adjacent panel will be higher, and may
* cause the edges of the panel to be visible when viewing the output
* image at high contrast. If this is a problem, reduce the
* tolerance value used.
c maxpix
f MAXPIX = INTEGER (Given)
* A value which specifies an initial scale size (in pixels) for
* the adaptive algorithm which approximates non-linear Mappings
* with piece-wise linear transformations. Normally, this should
* be a large value (larger than any dimension of the region of
* the input grid being used). In this case, a first attempt to
* approximate the Mapping by a linear transformation will be
* made over the entire input region.
*
* If a smaller value is used, the input region will first be
c divided into sub-regions whose size does not exceed "maxpix"
f divided into sub-regions whose size does not exceed MAXPIX
* pixels in any dimension. Only at this point will attempts at
* approximation commence.
*
* This value may occasionally be useful in preventing false
* convergence of the adaptive algorithm in cases where the
* Mapping appears approximately linear on large scales, but has
* irregularities (e.g. holes) on smaller scales. A value of,
* say, 50 to 100 pixels can also be employed as a safeguard in
* general-purpose software, since the effect on performance is
* minimal.
*
* If too small a value is given, it will have the effect of
* inhibiting linear approximation altogether (equivalent to
c setting "tol" to zero). Although this may degrade
f setting TOL to zero). Although this may degrade
* performance, accurate results will still be obtained.
c badval
f BADVAL = <Xtype> (Given)
* This argument should have the same type as the elements of
c the "in" array. It specifies the value used to flag missing
f the IN array. It specifies the value used to flag missing
* data (bad pixels) in the input and output arrays.
*
c If the AST__USEBAD flag is set via the "flags" parameter,
f If the AST__USEBAD flag is set via the FLAGS argument,
c then this value is used to test for bad pixels in the "in"
c (and "in_var") array(s).
f then this value is used to test for bad pixels in the IN
f (and IN_VAR) array(s).
*
* In all cases, this value is also used to flag any output
c elements in the "out" (and "out_var") array(s) for which
f elements in the OUT (and OUT_VAR) array(s) for which
* rebined values could not be obtained (see the "Propagation
* of Missing Data" section below for details of the
* circumstances under which this may occur).
c ndim_out
f NDIM_OUT = INTEGER (Given)
* The number of dimensions in the output grid. This should be
* at least one. It need not necessarily be equal to the number
* of dimensions in the input grid.
c lbnd_out
f LBND_OUT( NDIM_OUT ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_out" elements,
f An array
* containing the coordinates of the centre of the first pixel
* in the output grid along each dimension.
c ubnd_out
f UBND_OUT( NDIM_OUT ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_out" elements,
f An array
* containing the coordinates of the centre of the last pixel in
* the output grid along each dimension.
*
c Note that "lbnd_out" and "ubnd_out" together define the
f Note that LBND_OUT and UBND_OUT together define the
* shape, size and coordinate system of the output grid in the
c same way as "lbnd_in" and "ubnd_in" define the shape, size
f same way as LBND_IN and UBND_IN define the shape, size
* and coordinate system of the input grid.
c lbnd
f LBND( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the first pixel in the region
* of the input grid which is to be included in the rebined output
* array.
c ubnd
f UBND( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the last pixel in the region of
* the input grid which is to be included in the rebined output
* array.
*
c Note that "lbnd" and "ubnd" together define the shape and
f Note that LBND and UBND together define the shape and
* position of a (hyper-)rectangular region of the input grid
* which is to be included in the rebined output array. This region
* should lie wholly within the extent of the input grid (as
c defined by the "lbnd_in" and "ubnd_in" arrays). Regions of
f defined by the LBND_IN and UBND_IN arrays). Regions of
* the input grid lying outside this region will not be used.
c out
f OUT( * ) = <Xtype> (Returned)
c Pointer to an array, with one element for each pixel in the
f An array, with one element for each pixel in the
* output grid, in which the rebined data values will be
* returned. The numerical type of this array should match that
c of the "in" array, and the data storage order should be such
f of the IN array, and the data storage order should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
c (i.e. Fortran array indexing is used).
f (i.e. normal Fortran array storage order).
c out_var
f OUT_VAR( * ) = <Xtype> (Returned)
c An optional pointer to an array with the same type and size
c as the "out" array. If given, this array will be used to
c return variance estimates for the rebined data values. This
c array will only be used if the "in_var" array has also been
c supplied.
f An optional array with the same type and size as the OUT
f array. If the AST__USEVAR flag is set via the FLAGS argument,
f this array will be used to return variance estimates for the
f rebined data values.
*
* The output variance values will be calculated on the
* assumption that errors on the input data values are
* statistically independent and that their variance estimates
* may simply be summed (with appropriate weighting factors)
* when several input pixels contribute to an output data
* value. If this assumption is not valid, then the output error
* estimates may be biased. In addition, note that the
* statistical errors on neighbouring output data values (as
* well as the estimates of those errors) may often be
* correlated, even if the above assumption about the input data
* is correct, because of the pixel spreading schemes
* employed.
*
c If no output variance estimates are required, a NULL pointer
c should be given.
f If the AST__USEVAR flag is not set, no output variance
f estimates will be calculated and this array will not be
f used. A dummy (e.g. one-element) array may then be supplied.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Data Type Codes:
* To select the appropriate rebinning function, you should
c replace <X> in the generic function name astRebin<X> with a
f replace <X> in the generic function name AST_REBIN<X> with a
* 1- or 2-character data type code, so as to match the numerical
* type <Xtype> of the data you are processing, as follows:
c - D: double
c - F: float
c - I: int
c - B: byte (signed char)
c - UB: unsigned byte (unsigned char)
f - D: DOUBLE PRECISION
f - R: REAL
f - I: INTEGER
f - B: BYTE (treated as signed)
f - UB: BYTE (treated as unsigned)
*
c For example, astRebinD would be used to process "double"
c data, while astRebinI would be used to process "int"
c data, etc.
f For example, AST_REBIND would be used to process DOUBLE
f PRECISION data, while AST_REBINI would be used to process
f integer data (stored in an INTEGER array), etc.
*
* Note that, unlike
c astResample<X>, the astRebin<X>
f AST_RESAMPLE<X>, the AST_REBIN<X>
* set of functions does not yet support unsigned integer data types
* or integers of different sizes.
* Pixel Spreading Schemes:
* The pixel spreading scheme specifies the Point Spread Function (PSF)
* applied to each input pixel value as it is copied into the output
* array. It can be thought of as the inverse of the sub-pixel
* interpolation schemes used by the
c astResample<X>
f AST_RESAMPLE<X>
* group of functions. That is, in a sub-pixel interpolation scheme the
* kernel specifies the weight to assign to each input pixel when
* forming the weighted mean of the input pixels, whereas the kernel in a
* pixel spreading scheme specifies the fraction of the input data value
* which is to be assigned to each output pixel. As for interpolation, the
* choice of suitable pixel spreading scheme involves stricking a balance
* between schemes which tend to degrade sharp features in the data by
* smoothing them, and those which attempt to preserve sharp features but
* which often tend to introduce unwanted artifacts. See the
c astResample<X>
f AST_RESAMPLE<X>
* documentation for further discussion.
*
* The binning algorithm used has the ability to introduce artifacts
* not seen when using a resampling algorithm. Particularly, when
* viewing the output image at high contrast, systems of curves lines
* covering the entire image may be visible. These are caused by a
* beating effect between the input pixel positions and the output pixels
* position, and their nature and strength depend critically upon the
* nature of the Mapping and the spreading function being used. In
* general, the nearest neighbour spreading function demonstrates this
* effect more clearly than the other functions, and for this reason
* should be used with caution.
*
* The following values (defined in the
c "ast.h" header file)
f AST_PAR include file)
* may be assigned to the
c "spread"
f SPREAD
* parameter. See the
c astResample<X>
f AST_RESAMPLE<X>
* documentation for details of these schemes including the use of the
c "fspread" and "params" parameters:
f FSPREAD and PARAMS arguments:
*
* - AST__NEAREST
* - AST__LINEAR
* - AST__SINC
* - AST__SINCSINC
* - AST__SINCCOS
* - AST__SINCGAUSS
* - AST__SOMBCOS
*
* In addition, the following schemes can be used with
f AST_REBIN<X> but not with AST_RESAMPLE<X>:
c astRebin<X> but not with astResample<X>:
*
* - AST__GAUSS: This scheme uses a kernel of the form exp(-k*x*x), with k
* a positive constant determined by the full-width at half-maximum (FWHM).
* The FWHM should be supplied in units of output pixels by means of the
c "params[1]"
f PARAMS(2)
* value and should be at least 0.1. The
c "params[0]"
f PARAMS(1)
* value should be used to specify at what point the Gaussian is truncated
* to zero. This should be given as a number of output pixels on either
* side of the central output point in each dimension (the nearest integer
* value is used).
* Control Flags:
c The following flags are defined in the "ast.h" header file and
f The following flags are defined in the AST_PAR include file and
* may be used to provide additional control over the rebinning
* process. Having selected a set of flags, you should supply the
c bitwise OR of their values via the "flags" parameter:
f sum of their values via the FLAGS argument:
*
* - AST__USEBAD: Indicates that there may be bad pixels in the
* input array(s) which must be recognised by comparing with the
c value given for "badval" and propagated to the output array(s).
f value given for BADVAL and propagated to the output array(s).
* If this flag is not set, all input values are treated literally
c and the "badval" value is only used for flagging output array
f and the BADVAL value is only used for flagging output array
* values.
f - AST__USEVAR: Indicates that variance information should be
f processed in order to provide estimates of the statistical error
f associated with the rebined values. If this flag is not set,
f no variance processing will occur and the IN_VAR and OUT_VAR
f arrays will not be used. (Note that this flag is only available
f in the Fortran interface to AST.)
* Propagation of Missing Data:
* Instances of missing data (bad pixels) in the output grid are
c identified by occurrences of the "badval" value in the "out"
f identified by occurrences of the BADVAL value in the OUT
* array. These are produced if the sum of the weights of the
* contributing input pixels is less than
c "wlim".
f WLIM.
*
* An input pixel is considered bad (and is consequently ignored) if
* its
c data value is equal to "badval" and the AST__USEBAD flag is
c set via the "flags" parameter.
f data value is equal to BADVAL and the AST__USEBAD flag is
f set via the FLAGS argument.
*
* In addition, associated output variance estimates (if
c calculated) may be declared bad and flagged with the "badval"
c value in the "out_var" array for similar reasons.
f calculated) may be declared bad and flagged with the BADVAL
f value in the OUT_VAR array for similar reasons.
*--
*/
/* Define a macro to implement the function for a specific data
type. */
#define MAKE_REBIN(X,Xtype,IntType) \
static void Rebin##X( AstMapping *this, double wlim, int ndim_in, \
const int lbnd_in[], const int ubnd_in[], \
const Xtype in[], const Xtype in_var[], \
int spread, const double params[], int flags, \
double tol, int maxpix, Xtype badval, \
int ndim_out, const int lbnd_out[], \
const int ubnd_out[], const int lbnd[], \
const int ubnd[], Xtype out[], Xtype out_var[], int *status ) { \
\
/* Local Variables: */ \
astDECLARE_GLOBALS /* Thread-specific data */ \
const char *badflag; /* Name of illegal flag */ \
AstMapping *simple; /* Pointer to simplified Mapping */ \
Xtype *d; /* Pointer to next output data value */ \
Xtype *v; /* Pointer to next output variance value */ \
double *w; /* Pointer to next weight value */ \
double *work; /* Pointer to weight array */ \
int idim; /* Loop counter for coordinate dimensions */ \
int ipix_out; /* Index into output array */ \
int nin; /* Number of Mapping input coordinates */ \
int nout; /* Number of Mapping output coordinates */ \
int npix; /* Number of pixels in input region */ \
int npix_out; /* Number of pixels in output array */ \
int64_t mpix; /* Number of pixels for testing */ \
\
/* Check the global error status. */ \
if ( !astOK ) return; \
\
/* Get a pointer to a structure holding thread-specific global data values */ \
astGET_GLOBALS(this); \
\
/* Obtain values for the Nin and Nout attributes of the Mapping. */ \
nin = astGetNin( this ); \
nout = astGetNout( this ); \
\
/* If OK, check that the number of input grid dimensions matches the \
number required by the Mapping and is at least 1. Report an error \
if necessary. */ \
if ( astOK && ( ( ndim_in != nin ) || ( ndim_in < 1 ) ) ) { \
astError( AST__NGDIN, "astRebin"#X"(%s): Bad number of input grid " \
"dimensions (%d).", status, astGetClass( this ), ndim_in ); \
if ( ndim_in != nin ) { \
astError( AST__NGDIN, "The %s given requires %d coordinate value%s " \
"to specify an input position.", status, \
astGetClass( this ), nin, ( nin == 1 ) ? "" : "s" ); \
} \
} \
\
/* If OK, also check that the number of output grid dimensions matches \
the number required by the Mapping and is at least 1. Report an \
error if necessary. */ \
if ( astOK && ( ( ndim_out != nout ) || ( ndim_out < 1 ) ) ) { \
astError( AST__NGDIN, "astRebin"#X"(%s): Bad number of output grid " \
"dimensions (%d).", status, astGetClass( this ), ndim_out ); \
if ( ndim_out != nout ) { \
astError( AST__NGDIN, "The %s given generates %s%d coordinate " \
"value%s for each output position.", status, astGetClass( this ), \
( nout < ndim_out ) ? "only " : "", nout, \
( nout == 1 ) ? "" : "s" ); \
} \
} \
\
/* Check that the lower and upper bounds of the input grid are \
consistent. Report an error if any pair is not. */ \
mpix = 1; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_in; idim++ ) { \
if ( lbnd_in[ idim ] > ubnd_in[ idim ] ) { \
astError( AST__GBDIN, "astRebin"#X"(%s): Lower bound of " \
"input grid (%d) exceeds corresponding upper bound " \
"(%d).", status, astGetClass( this ), \
lbnd_in[ idim ], ubnd_in[ idim ] ); \
astError( AST__GBDIN, "Error in input dimension %d.", status, \
idim + 1 ); \
break; \
} else { \
mpix *= ubnd_in[ idim ] - lbnd_in[ idim ] + 1; \
} \
} \
} \
\
/* Report an error if there are too many pixels in the input. */ \
if ( astOK && (int) mpix != mpix ) { \
astError( AST__EXSPIX, "astRebin"#X"(%s): Supplied input array " \
"contains too many pixels (%g): must be fewer than %d.", \
status, astGetClass( this ), (double) mpix, INT_MAX ); \
} \
\
/* Check that the positional accuracy tolerance supplied is valid and \
report an error if necessary. */ \
if ( astOK && ( tol < 0.0 ) ) { \
astError( AST__PATIN, "astRebin"#X"(%s): Invalid positional " \
"accuracy tolerance (%.*g pixel).", status, \
astGetClass( this ), DBL_DIG, tol ); \
astError( AST__PATIN, "This value should not be less than zero." , status); \
} \
\
/* Check that the initial scale size in pixels supplied is valid and \
report an error if necessary. */ \
if ( astOK && ( maxpix < 0 ) ) { \
astError( AST__SSPIN, "astRebin"#X"(%s): Invalid initial scale " \
"size in pixels (%d).", status, astGetClass( this ), maxpix ); \
astError( AST__SSPIN, "This value should not be less than zero." , status); \
} \
\
/* Check that the lower and upper bounds of the output grid are \
consistent. Report an error if any pair is not. */ \
mpix = 1; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_out; idim++ ) { \
if ( lbnd_out[ idim ] > ubnd_out[ idim ] ) { \
astError( AST__GBDIN, "astRebin"#X"(%s): Lower bound of " \
"output grid (%d) exceeds corresponding upper bound " \
"(%d).", status, astGetClass( this ), \
lbnd_out[ idim ], ubnd_out[ idim ] ); \
astError( AST__GBDIN, "Error in output dimension %d.", status, \
idim + 1 ); \
break; \
} else { \
mpix *= ubnd_out[ idim ] - lbnd_out[ idim ] + 1; \
} \
} \
} \
\
/* Report an error if there are too many pixels in the output. */ \
if ( astOK && (int) mpix != mpix ) { \
astError( AST__EXSPIX, "astRebin"#X"(%s): Supplied output array " \
"contains too many pixels (%g): must be fewer than %d.", \
status, astGetClass( this ), (double) mpix, INT_MAX ); \
} \
\
/* Similarly check the bounds of the input region. */ \
mpix = 1; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_out; idim++ ) { \
if ( lbnd[ idim ] > ubnd[ idim ] ) { \
astError( AST__GBDIN, "astRebin"#X"(%s): Lower bound of " \
"input region (%d) exceeds corresponding upper " \
"bound (%d).", status, astGetClass( this ), \
lbnd[ idim ], ubnd[ idim ] ); \
\
/* Also check that the input region lies wholly within the input \
grid. */ \
} else if ( lbnd[ idim ] < lbnd_in[ idim ] ) { \
astError( AST__GBDIN, "astRebin"#X"(%s): Lower bound of " \
"input region (%d) is less than corresponding " \
"bound of input grid (%d).", status, astGetClass( this ), \
lbnd[ idim ], lbnd_in[ idim ] ); \
} else if ( ubnd[ idim ] > ubnd_in[ idim ] ) { \
astError( AST__GBDIN, "astRebin"#X"(%s): Upper bound of " \
"input region (%d) exceeds corresponding " \
"bound of input grid (%d).", status, astGetClass( this ), \
ubnd[ idim ], ubnd_in[ idim ] ); \
} else { \
mpix *= ubnd[ idim ] - lbnd[ idim ] + 1; \
} \
\
/* Say which dimension produced the error. */ \
if ( !astOK ) { \
astError( AST__GBDIN, "Error in output dimension %d.", status, \
idim + 1 ); \
break; \
} \
} \
} \
\
/* Report an error if there are too many pixels in the input region. */ \
if ( astOK && (int) mpix != mpix ) { \
astError( AST__EXSPIX, "astRebin"#X"(%s): Supplied input region " \
"contains too many pixels (%g): must be fewer than %d.", \
status, astGetClass( this ), (double) mpix, INT_MAX ); \
} \
\
/* If OK, loop to determine how many input pixels are to be binned. */ \
simple = NULL; \
npix = 1; \
npix_out = 1; \
unsimplified_mapping = this; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_in; idim++ ) { \
npix *= ubnd[ idim ] - lbnd[ idim ] + 1; \
} \
\
/* Loop to determine how many pixels the output array contains. */ \
for ( idim = 0; idim < ndim_out; idim++ ) { \
npix_out *= ubnd_out[ idim ] - lbnd_out[ idim ] + 1; \
} \
\
/* If there are sufficient pixels to make it worthwhile, simplify the \
Mapping supplied to improve performance. Otherwise, just clone the \
Mapping pointer. Note we have already saved a pointer to the original \
Mapping so that lower-level functions can use it if they need to report \
an error. */ \
if ( npix > 1024 ) { \
simple = astSimplify( this ); \
} else { \
simple = astClone( this ); \
} \
} \
\
/* Report an error if the forward transformation of this simplified \
Mapping is not defined. */ \
if ( !astGetTranForward( simple ) && astOK ) { \
astError( AST__TRNND, "astRebin"#X"(%s): An forward coordinate " \
"transformation is not defined by the %s supplied.", status, \
astGetClass( unsimplified_mapping ), \
astGetClass( unsimplified_mapping ) ); \
} \
\
/* Report an error if any illegal flags were supplied. */ \
if( flags & AST__REBININIT ) { \
badflag = "AST__REBININIT"; \
} else if( flags & AST__REBINEND ) { \
badflag = "AST__REBINEND"; \
} else if( flags & AST__GENVAR ) { \
badflag = "AST__GENVAR"; \
} else if( flags & AST__DISVAR ) { \
badflag = "AST__DISVAR"; \
} else if( flags & AST__VARWGT ) { \
badflag = "AST__VARWGT"; \
} else if( flags & AST__NONORM ) { \
badflag = "AST__NONORM"; \
} else if( flags & AST__CONSERVEFLUX ) { \
badflag = "AST__CONSERVEFLUX"; \
} else if( flags & ~( AST__USEBAD + AST__USEVAR ) ) { \
badflag = "unknown"; \
} else { \
badflag = NULL; \
} \
if ( badflag && astOK ) { \
astError( AST__BADFLG, "astRebin"#X"(%s): An illegal flag (%s) " \
"was included in the 'flags' argument.", status, \
astGetClass( unsimplified_mapping ), badflag ); \
} \
\
/* If required, allocate work array to hold the sum of the weights \
contributing to each output pixel, and initialise it to zero. */ \
if( wlim > 0.0 ) { \
work = astMalloc( sizeof( double )*(size_t) npix_out ); \
if( work ) { \
w = work; \
for( ipix_out = 0; ipix_out < npix_out; ipix_out++ ) *(w++) = 0.0; \
} \
} else { \
work = NULL; \
} \
\
/* Initialise the output arrays to hold zeros. */ \
d = out; \
if( out_var ) { \
v = out_var; \
for( ipix_out = 0; ipix_out < npix_out; ipix_out++, d++, v++ ) { \
*d = 0; \
*v = 0; \
} \
} else { \
for( ipix_out = 0; ipix_out < npix_out; ipix_out++, d++ ) { \
*d = 0; \
} \
} \
\
/* Perform the rebinning. Note that we pass all gridded data, the \
spread function and the bad pixel value by means of pointer \
types that obscure the underlying data type. This is to avoid \
having to replicate functions unnecessarily for each data \
type. However, we also pass an argument that identifies the data \
type we have obscured. */ \
if( RebinAdaptively( simple, ndim_in, lbnd_in, ubnd_in, \
(const void *) in, (const void *) in_var, \
TYPE_##X, spread, \
params, flags, tol, maxpix, \
(const void *) &badval, \
ndim_out, lbnd_out, ubnd_out, \
lbnd, ubnd, npix_out, \
(void *) out, (void *) out_var, work, \
NULL, status ) && astOK ) { \
astError( AST__CNFLX, "astRebin"#X"(%s): Flux conservation was " \
"requested but could not be performed because the " \
"forward transformation of the supplied Mapping " \
"is too non-linear.", status, astGetClass( this ) ); \
} \
\
/* If required set output pixels bad if they have a total weight less \
than "wlim". */ \
if( work ) { \
w = work; \
d = out; \
if( out_var ) { \
v = out_var; \
for( ipix_out = 0; ipix_out < npix_out; ipix_out++, d++, w++, v++ ) { \
if( fabs( *w ) < wlim ) { \
*d = badval; \
*v = badval; \
} \
} \
} else { \
for( ipix_out = 0; ipix_out < npix_out; ipix_out++, d++, w++ ) { \
if( fabs( *w ) < wlim ) *d = badval; \
} \
} \
\
/* Free the work array. */ \
work = astFree( work ); \
} \
\
/* Annul the pointer to the simplified/cloned Mapping. */ \
simple = astAnnul( simple ); \
\
}
/* Expand the above macro to generate a function for each required
data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_REBIN(LD,long double,0)
#endif
MAKE_REBIN(D,double,0)
MAKE_REBIN(F,float,0)
MAKE_REBIN(I,int,1)
MAKE_REBIN(B,signed char,1)
MAKE_REBIN(UB,unsigned char,1)
/* Undefine the macro. */
#undef MAKE_REBIN
static int RebinAdaptively( AstMapping *this, int ndim_in,
const int *lbnd_in, const int *ubnd_in,
const void *in, const void *in_var,
DataType type, int spread,
const double *params, int flags, double tol,
int maxpix, const void *badval_ptr,
int ndim_out, const int *lbnd_out,
const int *ubnd_out, const int *lbnd,
const int *ubnd, int npix_out,
void *out, void *out_var, double *work,
int64_t *nused, int *status ){
/*
* Name:
* RebinAdaptively
* Purpose:
* Rebin a section of a data grid adaptively.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int RebinAdaptively( AstMapping *this, int ndim_in,
* const int *lbnd_in, const int *ubnd_in,
* const void *in, const void *in_var,
* DataType type, int spread,
* const double *params, int flags, double tol,
* int maxpix, const void *badval_ptr,
* int ndim_out, const int *lbnd_out,
* const int *ubnd_out, const int *lbnd,
* const int *ubnd, int npix_out, void *out,
* void *out_var, double *work, int64_t *nused,
* int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function rebins a specified section of a rectangular grid of
* data (with any number of dimensions) into another rectangular grid
* (with a possibly different number of dimensions). The coordinate
* transformation used to convert input pixel coordinates into positions
* in the output grid is given by the forward transformation of the
* Mapping which is supplied. Any pixel spreading scheme may be specified
* for distributing the flux of an input pixel amongst the output
* pixels.
*
* This function is very similar to RebinWithBlocking and RebinSection
* which lie below it in the calling hierarchy. However, this function
* also attempts to adapt to the Mapping supplied and to sub-divide the
* section being rebinned into smaller sections within which a linear
* approximation to the Mapping may be used. This reduces the number of
* Mapping evaluations, thereby improving efficiency particularly when
* complicated Mappings are involved.
* Parameters:
* this
* Pointer to a Mapping, whose forward transformation may be
* used to transform the coordinates of pixels in the input
* grid into associated positions in the output grid.
*
* The number of input coordintes for the Mapping (Nin
* attribute) should match the value of "ndim_in" (below), and
* the number of output coordinates (Nout attribute) should
* match the value of "ndim_out".
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input data grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input data grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input data grid, its extent along a
* particular (i'th) dimension being (ubnd_in[i] - lbnd_in[i] +
* 1). They also define the input grid's coordinate system, with
* each pixel being of unit extent along each dimension with
* integral coordinate values at its centre.
* in
* Pointer to the input array of data to be rebinned (with one
* element for each pixel in the input grid). The numerical type
* of these data should match the "type" value (below). The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and data type as the "in" array),
* which represent estimates of the statistical variance
* associated with each element of the "in" array. If this
* second array is given (along with the corresponding "out_var"
* array), then estimates of the variance of the rebinned data
* will also be returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* type
* A value taken from the "DataType" enum, which specifies the
* data type of the input and output arrays containing the
* gridded data (and variance) values.
* spread
* A value selected from a set of pre-defined macros to identify
* which pixel spread function should be used.
* params
* Pointer to an optional array of parameters that may be passed
* to the pixel spread algorithm, if required. If no parameters
* are required, a NULL pointer should be supplied.
* flags
* The bitwise OR of a set of flag values which provide additional
* control over the resampling operation.
* tol
* The maximum permitted positional error in transforming input
* pixel positions into the output grid in order to rebin
* it. This should be expressed as a displacement in pixels in
* the output grid's coordinate system. If the Mapping's forward
* transformation can be approximated by piecewise linear functions
* to this accuracy, then such functions may be used instead of the
* Mapping in order to improve performance. Otherwise, every input
* pixel position will be transformed individually using the Mapping.
*
* If linear approximation is not required, a "tol" value of
* zero may be given. This will ensure that the Mapping is used
* without any approximation.
* maxpix
* A value which specifies the largest scale size on which to
* search for non-linearities in the Mapping supplied. This
* value should be expressed as a number of pixels in the input
* grid. The function will break the input section specified
* into smaller sub-sections (if necessary), each no larger than
* "maxpix" pixels in any dimension, before it attempts to
* approximate the Mapping by a linear function over each
* sub-section.
*
* If the value given is larger than the largest dimension of
* the input section (the normal recommendation), the function
* will initially search for non-linearity on a scale determined
* by the size of the input section. This is almost always
* satisfactory. Very occasionally, however, a Mapping may
* appear linear on this scale but nevertheless have smaller
* irregularities (e.g. "holes") in it. In such cases, "maxpix"
* may be set to a suitably smaller value so as to ensure this
* non-linearity is not overlooked. Typically, a value of 50 to
* 100 pixels might be suitable and should have little effect on
* performance.
*
* If too small a value is given, however, it will have the
* effect of preventing linear approximation occurring at all
* (equivalent to setting "tol" to zero). Although this may
* degrade performance, accurate results will still be obtained.
* badval_ptr
* If the AST__USEBAD flag is set (above), this parameter is a
* pointer to a value which is used to identify bad data and/or
* variance values in the input array(s). The referenced value's
* data type must match that of the "in" (and "in_var")
* arrays. The same value will also be used to flag any output
* array elements for which rebinned values could not be
* obtained. The output arrays(s) may be flagged with this
* value whether or not the AST__USEBAD flag is set (the
* function return value indicates whether any such values have
* been produced).
* ndim_out
* The number of dimensions in the output grid. This should be
* at least one.
* lbnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the first
* pixel in the output data grid along each dimension.
* ubnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the last
* pixel in the output data grid along each dimension.
*
* Note that "lbnd_out" and "ubnd_out" together define the shape
* and size of the output data grid in the same way as "lbnd_in"
* and "ubnd_in" define the shape and size of the input grid
* (see above).
* lbnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the first pixel in the
* section of the input data grid which is to be rebinned.
* ubnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the last pixel in the
* section of the input data grid which is to be rebinned.
*
* Note that "lbnd" and "ubnd" define the shape and position of
* the section of the input grid which is to be rebinned. This section
* should lie wholly within the extent of the input grid (as defined
* by the "lbnd_out" and "ubnd_out" arrays). Regions of the input
* grid lying outside this section will be ignored.
* npix_out
* The number of pixels in the output array.
* out
* Pointer to an array with the same data type as the "in"
* array, into which the rebinned data will be returned. The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the rebinned values may be returned. This array will only be
* used if the "in_var" array has been given.
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* work
* An optional pointer to a double array with the same size as
* the "out" array. The contents of this array (if supplied) are
* incremented by the accumulated weights assigned to each output pixel.
* If no accumulated weights are required, a NULL pointer should be
* given.
* nused
* An optional pointer to a int64_t which will be incremented by the
* number of input values pasted into the output array. Ignored if NULL.
* status
* Pointer to the inherited status variable.
* Returned Value:
* A non-zero value is returned if "flags" included AST__CONSERVEFLUX (i.e.
* flux conservation was requested), but the forward transformation of the
* supplied Mapping had zero determinant everywhere within the region
* being binned (no error is reported if this happens). Zero is returned
* otherwise.
*/
/* Local Variables: */
double *flbnd; /* Array holding floating point lower bounds */
double *fubnd; /* Array holding floating point upper bounds */
double *linear_fit; /* Pointer to array of fit coefficients */
int *hi; /* Pointer to array of section upper bounds */
int *lo; /* Pointer to array of section lower bounds */
int coord_in; /* Loop counter for input coordinates */
int dim; /* Output section dimension size */
int dimx; /* Dimension with maximum section extent */
int divide; /* Sub-divide the output section? */
int i; /* Loop count */
int isLinear; /* Is the transformation linear? */
int mxdim; /* Largest output section dimension size */
int need_fit; /* Do we need to perform a linear fit? */
int npix; /* Number of pixels in output section */
int npoint; /* Number of points for obtaining a fit */
int nvertex; /* Number of vertices of output section */
int result; /* Returned value */
int res1; /* Flux conservation error in 1st section? */
int res2; /* Flux conservation error in 2nd section? */
int toobig; /* Section too big (must sub-divide)? */
int toosmall; /* Section too small to sub-divide? */
/* Initialise */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Further initialisation. */
npix = 1;
mxdim = 0;
dimx = 1;
nvertex = 1;
/* Loop through the input grid dimensions. */
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
/* Obtain the extent in each dimension of the input section which is
to be rebinned, and calculate the total number of pixels it contains. */
dim = ubnd[ coord_in ] - lbnd[ coord_in ] + 1;
npix *= dim;
/* Find the maximum dimension size of this input section and note which
dimension has this size. */
if ( dim > mxdim ) {
mxdim = dim;
dimx = coord_in;
}
/* Calculate how many vertices the output section has. */
nvertex *= 2;
}
/* Calculate how many sample points will be needed (by the astLinearApprox
function) to obtain a linear fit to the Mapping's forward transformation. */
npoint = 1 + 4 * ndim_in + 2 * nvertex;
/* If the number of pixels in the input section is not at least 4
times this number, we will probably not save significant time by
attempting to obtain a linear fit, so note that the input section
is too small. */
toosmall = ( npix < ( 4 * npoint ) );
/* Note if the maximum dimension of the input section exceeds the
user-supplied scale factor. */
toobig = ( maxpix < mxdim );
/* Indicate we do not yet have a linear fit. */
linear_fit = NULL;
/* Initialise a flag indicating if we need to perform a linear fit. This
is always the case if flux conservation was requested. */
need_fit = ( flags & AST__CONSERVEFLUX );
/* If the output section is too small to be worth obtaining a linear
fit, or if the accuracy tolerance is zero, we will not
sub-divide. This means that the Mapping will be used to transform
each pixel's coordinates and no linear approximation will be
used. */
if ( toosmall || ( tol == 0.0 ) ) {
divide = 0;
/* Otherwise, if the largest input section dimension exceeds the
scale length given, we will sub-divide. This offers the possibility
of obtaining a linear approximation to the Mapping over a reduced
range of input coordinates (which will be handled by a recursive
invocation of this function). */
} else if ( toobig ) {
divide = 1;
/* If neither of the above apply, we need to do a fit regardless of
whether flux conservation was requested or not. Whether we divide or
not will depend on whether the Mapping is linear or not. Assume for
the moment that the Mapping is not linear and so we will divide. */
} else {
need_fit = 1;
divide = 1;
}
/* If required, attempt to fit a linear approximation to the Mapping's
forward transformation over the range of coordinates covered by the
input section. We need to temporarily copy the integer bounds into
floating point arrays to use astLinearApprox. */
if( need_fit ) {
/* Allocate memory for floating point bounds and for the coefficient array */
flbnd = astMalloc( sizeof( double )*(size_t) ndim_in );
fubnd = astMalloc( sizeof( double )*(size_t) ndim_in );
linear_fit = astMalloc( sizeof( double )*
(size_t) ( ndim_out*( ndim_in + 1 ) ) );
if( astOK ) {
/* Copy the bounds into these arrays, and change them so that they refer
to the lower and upper edges of the cell rather than the centre. This
is essential if one of the axes is spanned by a single cell, since
otherwise the upper and lower bounds would be identical. */
for( i = 0; i < ndim_in; i++ ) {
flbnd[ i ] = (double) lbnd[ i ] - 0.5;
fubnd[ i ] = (double) ubnd[ i ] + 0.5;
}
/* Get the linear approximation to the forward transformation. */
isLinear = astLinearApprox( this, flbnd, fubnd, tol, linear_fit );
/* Free the coeff array if the inverse transformation is not linear. */
if( !isLinear ) linear_fit = astFree( linear_fit );
} else {
linear_fit = astFree( linear_fit );
}
/* Free resources */
flbnd = astFree( flbnd );
fubnd = astFree( fubnd );
/* If a linear fit was obtained, we will use it and therefore do not
wish to sub-divide further. Otherwise, we sub-divide (unless the
section is too small or too big as determined earlier) in the hope
that this may result in a linear fit next time. */
if( linear_fit ) divide = 0;
}
/* If no sub-division is required, perform rebinning (in a
memory-efficient manner, since the section we are rebinning might
still be very large). This will use the linear fit, if obtained
above. */
if ( astOK ) {
if ( !divide ) {
result = RebinWithBlocking( this, linear_fit, ndim_in, lbnd_in,
ubnd_in, in, in_var, type, spread,
params, flags, badval_ptr, ndim_out,
lbnd_out, ubnd_out, lbnd, ubnd, npix_out,
out, out_var, work, nused, status );
/* Otherwise, allocate workspace to perform the sub-division. */
} else {
lo = astMalloc( sizeof( int ) * (size_t) ndim_in );
hi = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
/* Initialise the bounds of a new input section to match the original
input section. */
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
lo[ coord_in ] = lbnd[ coord_in ];
hi[ coord_in ] = ubnd[ coord_in ];
}
/* Replace the upper bound of the section's largest dimension with the
mid-point of the section along this dimension, rounded downwards. */
hi[ dimx ] =
(int) floor( 0.5 * (double) ( lbnd[ dimx ] + ubnd[ dimx ] ) );
/* Rebin the resulting smaller section using a recursive invocation
of this function. */
res1 = RebinAdaptively( this, ndim_in, lbnd_in, ubnd_in, in,
in_var, type, spread, params,
flags, tol, maxpix, badval_ptr, ndim_out,
lbnd_out, ubnd_out, lo, hi, npix_out, out,
out_var, work, nused, status );
/* Now set up a second section which covers the remaining half of the
original input section. */
lo[ dimx ] = hi[ dimx ] + 1;
hi[ dimx ] = ubnd[ dimx ];
/* If this section contains pixels, resample it in the same way,
summing the returned values. */
if ( lo[ dimx ] <= hi[ dimx ] ) {
res2 = RebinAdaptively( this, ndim_in, lbnd_in, ubnd_in, in,
in_var, type, spread, params,
flags, tol, maxpix, badval_ptr,
ndim_out, lbnd_out, ubnd_out,
lo, hi, npix_out, out, out_var, work,
nused, status );
} else {
res2 = 0;
}
/* If neither section could be rebinned because of an indeterminant
mapping, return a result indicating this. */
result = ( res1 && res2 );
}
/* Free the workspace. */
lo = astFree( lo );
hi = astFree( hi );
}
}
/* If coefficients for a linear fit were obtained, then free the space
they occupy. */
if ( linear_fit ) linear_fit = astFree( linear_fit );
/* Retyurn a flag indicating if no part of the array could be binned
because of an indeterminate Mapping. */
return result;
}
static void RebinSection( AstMapping *this, const double *linear_fit,
int ndim_in, const int *lbnd_in, const int *ubnd_in,
const void *in, const void *in_var, double infac,
DataType type, int spread, const double *params,
int flags, const void *badval_ptr, int ndim_out,
const int *lbnd_out, const int *ubnd_out,
const int *lbnd, const int *ubnd, int npix_out,
void *out, void *out_var, double *work,
int64_t *nused, int *status ) {
/*
* Name:
* RebinSection
* Purpose:
* Rebin a section of a data grid.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void RebinSection( AstMapping *this, const double *linear_fit,
* int ndim_in, const int *lbnd_in, const int *ubnd_in,
* const void *in, const void *in_var, double infac,
* DataType type, int spread, const double *params,
* int flags, const void *badval_ptr, int ndim_out,
* const int *lbnd_out, const int *ubnd_out,
* const int *lbnd, const int *ubnd, int npix_out,
* void *out, void *out_var, double *work,
* int64_t *nused, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function rebins a specified section of a rectangular grid of
* data (with any number of dimensions) into another rectangular grid
* (with a possibly different number of dimensions). The coordinate
* transformation used to convert input pixel coordinates into positions
* in the output grid is given by the forward transformation of the
* Mapping which is supplied or, alternatively, by a linear approximation
* fitted to a Mapping's forward transformation. Any pixel spreading scheme
* may be specified for distributing the flux of an input pixel amongst
* the output pixels.
* Parameters:
* this
* Pointer to a Mapping, whose forward transformation may be
* used to transform the coordinates of pixels in the input
* grid into associated positions in the output grid.
*
* The number of input coordintes for the Mapping (Nin
* attribute) should match the value of "ndim_in" (below), and
* the number of output coordinates (Nout attribute) should
* match the value of "ndim_out".
* linear_fit
* Pointer to an optional array of double which contains the
* coefficients of a linear fit which approximates the above
* Mapping's forward coordinate transformation. If this is
* supplied, it will be used in preference to the above Mapping
* when transforming coordinates. This may be used to enhance
* performance in cases where evaluation of the Mapping's
* forward transformation is expensive. If no linear fit is
* available, a NULL pointer should be supplied.
*
* The way in which the fit coefficients are stored in this
* array and the number of array elements are as defined by the
* astLinearApprox function.
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input data grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input data grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input data grid, its extent along a
* particular (i'th) dimension being (ubnd_in[i] - lbnd_in[i] +
* 1). They also define the input grid's coordinate system, with
* each pixel being of unit extent along each dimension with
* integral coordinate values at its centre.
* in
* Pointer to the input array of data to be rebinned (with one
* element for each pixel in the input grid). The numerical type
* of these data should match the "type" value (below). The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and data type as the "in" array),
* which represent estimates of the statistical variance
* associated with each element of the "in" array. If this
* second array is given (along with the corresponding "out_var"
* array), then estimates of the variance of the rebinned data
* will also be returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* infac
* A factor by which to multiply the input data values before use.
* type
* A value taken from the "DataType" enum, which specifies the
* data type of the input and output arrays containing the
* gridded data (and variance) values.
* spread
* A value selected from a set of pre-defined macros to identify
* which pixel spread function should be used.
* params
* Pointer to an optional array of parameters that may be passed
* to the pixel spread algorithm, if required. If no parameters
* are required, a NULL pointer should be supplied.
* flags
* The bitwise OR of a set of flag values which provide additional
* control over the resampling operation.
* badval_ptr
* If the AST__USEBAD flag is set (above), this parameter is a
* pointer to a value which is used to identify bad data and/or
* variance values in the input array(s). The referenced value's
* data type must match that of the "in" (and "in_var")
* arrays. The same value will also be used to flag any output
* array elements for which rebinned values could not be
* obtained. The output arrays(s) may be flagged with this
* value whether or not the AST__USEBAD flag is set (the
* function return value indicates whether any such values have
* been produced).
* ndim_out
* The number of dimensions in the output grid. This should be
* at least one.
* lbnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the first
* pixel in the output data grid along each dimension.
* ubnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the last
* pixel in the output data grid along each dimension.
*
* Note that "lbnd_out" and "ubnd_out" together define the shape
* and size of the output data grid in the same way as "lbnd_in"
* and "ubnd_in" define the shape and size of the input grid
* (see above).
* lbnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the first pixel in the
* section of the input data grid which is to be rebinned.
* ubnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the last pixel in the
* section of the input data grid which is to be rebinned.
*
* Note that "lbnd" and "ubnd" define the shape and position of
* the section of the input grid which is to be rebinned. This section
* should lie wholly within the extent of the input grid (as defined
* by the "lbnd_out" and "ubnd_out" arrays). Regions of the input
* grid lying outside this section will be ignored.
* npix_out
* The number of pixels in the output array.
* out
* Pointer to an array with the same data type as the "in"
* array, into which the rebinned data will be returned. The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the rebinned values may be returned. This array will only be
* used if the "in_var" array has been given.
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* work
* An optional pointer to a double array with the same size as
* the "out" array. The contents of this array (if supplied) are
* incremented by the accumulated weights assigned to each output pixel.
* If no accumulated weights are required, a NULL pointer should be
* given.
* nused
* An optional pointer to a int64_t which will be incremented by the
* number of input values pasted into the output array. Ignored if NULL.
* Notes:
* - This function does not take steps to limit memory usage if the
* grids supplied are large. To resample large grids in a more
* memory-efficient way, the ResampleWithBlocking function should
* be used.
*/
/* Local Variables: */
astDECLARE_GLOBALS /* Thread-specific data */
AstPointSet *pset_in; /* Input PointSet for transformation */
AstPointSet *pset_out; /* Output PointSet for transformation */
const double *grad; /* Pointer to gradient matrix of linear fit */
const double *zero; /* Pointer to zero point array of fit */
double **ptr_in; /* Pointer to input PointSet coordinates */
double **ptr_out; /* Pointer to output PointSet coordinates */
double *accum; /* Pointer to array of accumulated sums */
double x1; /* Interim x coordinate value */
double xx1; /* Initial x coordinate value */
double y1; /* Interim y coordinate value */
double yy1; /* Initial y coordinate value */
int *dim; /* Pointer to array of output pixel indices */
int *offset; /* Pointer to array of output pixel offsets */
int *stride; /* Pointer to array of output grid strides */
int coord_in; /* Loop counter for input dimensions */
int coord_out; /* Loop counter for output dimensions */
int done; /* All pixel indices done? */
int i1; /* Interim offset into "accum" array */
int i2; /* Final offset into "accum" array */
int idim; /* Loop counter for dimensions */
int ix; /* Loop counter for output x coordinate */
int iy; /* Loop counter for output y coordinate */
int neighb; /* Number of neighbouring pixels */
int npoint; /* Number of output points (pixels) */
int off1; /* Interim pixel offset into output array */
int off2; /* Interim pixel offset into output array */
int off; /* Final pixel offset into output array */
int point; /* Counter for output points (pixels ) */
int s; /* Temporary variable for strides */
const double *par; /* Pointer to parameter array */
double fwhm; /* Full width half max. of gaussian */
double lpar[ 1 ]; /* Local parameter array */
void (* kernel)( double, const double [], int, double *, int * ); /* Kernel fn. */
/* Check the global error status. */
if ( !astOK ) return;
/* Get a pointer to a structure holding thread-specific global data values */
astGET_GLOBALS(this);
/* Further initialisation. */
pset_in = NULL;
ptr_in = NULL;
ptr_out = NULL;
pset_out = NULL;
neighb = 0;
kernel = NULL;
/* Calculate the number of input points, as given by the product of
the input grid dimensions. */
for ( npoint = 1, coord_in = 0; coord_in < ndim_in; coord_in++ ) {
npoint *= ubnd[ coord_in ] - lbnd[ coord_in ] + 1;
}
/* Allocate workspace. */
offset = astMalloc( sizeof( int ) * (size_t) npoint );
stride = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
/* Calculate the stride for each input grid dimension. */
off = 0;
s = 1;
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
stride[ coord_in ] = s;
s *= ubnd_in[ coord_in ] - lbnd_in[ coord_in ] + 1;
}
/* A linear fit to the Mapping is available. */
/* ========================================= */
if ( linear_fit ) {
/* If a linear fit to the Mapping has been provided, then obtain
pointers to the array of gradients and zero-points comprising the
fit. */
grad = linear_fit + ndim_out;
zero = linear_fit;
/* Create a PointSet to hold the output grid coordinates and obtain an
array of pointers to its coordinate data. */
pset_out = astPointSet( npoint, ndim_out, "", status );
ptr_out = astGetPoints( pset_out );
if ( astOK ) {
/* Initialise the count of input points. */
point = 0;
/* Handle the 1-dimensional case optimally. */
/* ---------------------------------------- */
if ( ( ndim_in == 1 ) && ( ndim_out == 1 ) ) {
/* Loop through the pixels of the input grid and transform their x
coordinates into the output grid's coordinate system using the
linear fit supplied. Store the results in the PointSet created
above. */
off = lbnd[ 0 ] - lbnd_in[ 0 ];
xx1 = zero[ 0 ] + grad[ 0 ] * (double) lbnd[ 0 ];
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_out[ 0 ][ point ] = xx1;
xx1 += grad[ 0 ];
offset[ point++ ] = off++;
}
/* Handle the 2-dimensional case optimally. */
/* ---------------------------------------- */
} else if ( ( ndim_in == 2 ) && ( ndim_out == 2 ) ) {
/* Loop through the range of y coordinates in the input grid and
calculate interim values of the output coordinates using the linear
fit supplied. */
x1 = zero[ 0 ] + grad[ 1 ] * (double) ( lbnd[ 1 ] - 1 );
y1 = zero[ 1 ] + grad[ 3 ] * (double) ( lbnd[ 1 ] - 1 );
off1 = stride[ 1 ] * ( lbnd[ 1 ] - lbnd_in[ 1 ] - 1 ) - lbnd_in[ 0 ];
for ( iy = lbnd[ 1 ]; iy <= ubnd[ 1 ]; iy++ ) {
x1 += grad[ 1 ];
y1 += grad[ 3 ];
/* Also calculate an interim pixel offset into the input array. */
off1 += stride[ 1 ];
/* Now loop through the range of input x coordinates and calculate
the final values of the input coordinates, storing the results in
the PointSet created above. */
xx1 = x1 + grad[ 0 ] * (double) lbnd[ 0 ];
yy1 = y1 + grad[ 2 ] * (double) lbnd[ 0 ];
off = off1 + lbnd[ 0 ];
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_out[ 0 ][ point ] = xx1;
xx1 += grad[ 0 ];
ptr_out[ 1 ][ point ] = yy1;
yy1 += grad[ 2 ];
/* Also calculate final pixel offsets into the input array. */
offset[ point++ ] = off++;
}
}
/* Handle other numbers of dimensions. */
/* ----------------------------------- */
} else {
/* Allocate workspace. */
accum = astMalloc( sizeof( double ) *
(size_t) ( ndim_in * ndim_out ) );
dim = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
/* Initialise an array of pixel indices for the input grid which refer to the
first pixel which we will rebin. Also calculate the offset of this pixel
within the input array. */
off = 0;
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
dim[ coord_in ] = lbnd[ coord_in ];
off += stride[ coord_in ] *
( dim[ coord_in ] - lbnd_in[ coord_in ] );
}
/* To calculate each output grid coordinate we must perform a matrix
multiply on the input grid coordinates (using the gradient matrix)
and then add the zero points. However, since we will usually only
be altering one input coordinate at a time (the least
significant), we can avoid the full matrix multiply by accumulating
partial sums for the most significant input coordinates and only
altering those sums which need to change each time. The zero points
never change, so we first fill the "most significant" end of the
"accum" array with these. */
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
accum[ ( coord_out + 1 ) * ndim_in - 1 ] =
zero[ coord_out ];
}
coord_in = ndim_in - 1;
/* Now loop to process each input pixel. */
for ( done = 0; !done; point++ ) {
/* To generate the output coordinate that corresponds to the current
input pixel, we work down from the most significant dimension
whose index has changed since the previous pixel we considered
(given by "coord_in"). For each affected dimension, we accumulate
in "accum" the matrix sum (including the zero point) for that
dimension and all higher input dimensions. We must accumulate a
separate set of sums for each output coordinate we wish to
produce. (Note that for the first pixel we process, all dimensions
are considered "changed", so we start by initialising the whole
"accum" array.) */
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
/*
ptr_out[ coord_out ][ point ] = zero[ coord_out ];
for ( idim = 0; idim < ndim_in; idim++ ) {
ptr_out[ coord_out ][ point ] +=
grad[ idim + coord_out*ndim_in ] *
dim[ idim ];
}
*/
i1 = coord_out * ndim_in;
for ( idim = coord_in; idim >= 1; idim-- ) {
i2 = i1 + idim;
accum[ i2 - 1 ] = accum[ i2 ] +
dim[ idim ] * grad[ i2 ];
}
/* The output coordinate for each dimension is given by the accumulated
sum for input dimension zero (giving the sum over all input
dimensions). We do not store this in the "accum" array, but assign
the result directly to the coordinate array of the PointSet created
earlier. */
ptr_out[ coord_out ][ point ] = accum[ i1 ] +
dim[ 0 ] * grad[ i1 ];
}
/* Store the offset of the current pixel in the input array. */
offset[ point ] = off;
/* Now update the array of pixel indices to refer to the next input pixel. */
coord_in = 0;
do {
/* The least significant index which currently has less than its maximum
value is incremented by one. The offset into the input array is updated
accordingly. */
if ( dim[ coord_in ] < ubnd[ coord_in ] ) {
dim[ coord_in ]++;
off += stride[ coord_in ];
break;
/* Any less significant indices which have reached their maximum value
are returned to their minimum value and the input pixel offset is
decremented appropriately. */
} else {
dim[ coord_in ] = lbnd[ coord_in ];
off -= stride[ coord_in ] *
( ubnd[ coord_in ] - lbnd[ coord_in ] );
/* All the output pixels have been processed once the most significant
pixel index has been returned to its minimum value. */
done = ( ++coord_in == ndim_in );
}
} while ( !done );
}
}
/* Free the workspace. */
accum = astFree( accum );
dim = astFree( dim );
}
}
/* No linear fit to the Mapping is available. */
/* ========================================== */
} else {
/* Create a PointSet to hold the coordinates of the input pixels and
obtain a pointer to its coordinate data. */
pset_in = astPointSet( npoint, ndim_in, "", status );
ptr_in = astGetPoints( pset_in );
if ( astOK ) {
/* Initialise the count of input points. */
point = 0;
/* Handle the 1-dimensional case optimally. */
/* ---------------------------------------- */
if ( ndim_in == 1 && ndim_out == 1 ) {
/* Loop through the required range of input x coordinates, assigning
the coordinate values to the PointSet created above. Also store a
pixel offset into the input array. */
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_in[ 0 ][ point ] = (double) ix;
offset[ point++ ] = ix - lbnd_in[ 0 ];
}
/* Handle the 2-dimensional case optimally. */
/* ---------------------------------------- */
} else if ( ndim_in == 2 && ndim_out == 2) {
/* Loop through the required range of input y coordinates,
calculating an interim pixel offset into the input array. */
off1 = stride[ 1 ] * ( lbnd[ 1 ] - lbnd_in[ 1 ] - 1 )
- lbnd_in[ 0 ];
for ( iy = lbnd[ 1 ]; iy <= ubnd[ 1 ]; iy++ ) {
off1 += stride[ 1 ];
/* Loop through the required range of input x coordinates, assigning
the coordinate values to the PointSet created above. Also store a
final pixel offset into the input array. */
off2 = off1 + lbnd[ 0 ];
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_in[ 0 ][ point ] = (double) ix;
ptr_in[ 1 ][ point ] = (double) iy;
offset[ point++ ] = off2++;
}
}
/* Handle other numbers of dimensions. */
/* ----------------------------------- */
} else {
/* Allocate workspace. */
dim = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
/* Initialise an array of pixel indices for the input grid which
refer to the first pixel to be rebinned. Also calculate the offset
of this pixel within the input array. */
off = 0;
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
dim[ coord_in ] = lbnd[ coord_in ];
off += stride[ coord_in ] *
( dim[ coord_in ] - lbnd_in[ coord_in ] );
}
/* Loop to generate the coordinates of each input pixel. */
for ( done = 0; !done; point++ ) {
/* Copy each pixel's coordinates into the PointSet created above. */
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
ptr_in[ coord_in ][ point ] =
(double) dim[ coord_in ];
}
/* Store the offset of the pixel in the input array. */
offset[ point ] = off;
/* Now update the array of pixel indices to refer to the next input
pixel. */
coord_in = 0;
do {
/* The least significant index which currently has less than its
maximum value is incremented by one. The offset into the input
array is updated accordingly. */
if ( dim[ coord_in ] < ubnd[ coord_in ] ) {
dim[ coord_in ]++;
off += stride[ coord_in ];
break;
/* Any less significant indices which have reached their maximum value
are returned to their minimum value and the input pixel offset is
decremented appropriately. */
} else {
dim[ coord_in ] = lbnd[ coord_in ];
off -= stride[ coord_in ] *
( ubnd[ coord_in ] - lbnd[ coord_in ] );
/* All the input pixels have been processed once the most significant
pixel index has been returned to its minimum value. */
done = ( ++coord_in == ndim_in );
}
} while ( !done );
}
}
/* Free the workspace. */
dim = astFree( dim );
}
/* When all the input pixel coordinates have been generated, use the
Mapping's forward transformation to generate the output coordinates
from them. Obtain an array of pointers to the resulting coordinate
data. */
pset_out = astTransform( this, pset_in, 1, NULL );
ptr_out = astGetPoints( pset_out );
}
/* Annul the PointSet containing the input coordinates. */
pset_in = astAnnul( pset_in );
}
}
/* Rebin the input grid. */
/* ------------------------ */
if( astOK ) {
/* Identify the pixel spreading scheme to be used. */
/* Nearest pixel. */
/* -------------- */
switch ( spread ) {
case AST__NEAREST:
/* Define a macro to use a "case" statement to invoke the
nearest-pixel spreading function appropriate to a given data
type. */
#define CASE_NEAREST(X,Xtype) \
case ( TYPE_##X ): \
SpreadNearest##X( ndim_out, lbnd_out, ubnd_out, \
(Xtype *) in, (Xtype *) in_var, \
infac, npoint, offset, \
(const double *const *) ptr_out, \
flags, *( (Xtype *) badval_ptr ), \
npix_out, (Xtype *) out, \
(Xtype *) out_var, work, nused, status ); \
break;
/* Use the above macro to invoke the appropriate function. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_NEAREST(LD,long double)
#endif
CASE_NEAREST(D,double)
CASE_NEAREST(F,float)
CASE_NEAREST(I,int)
CASE_NEAREST(B,signed char)
CASE_NEAREST(UB,unsigned char)
case ( TYPE_L ): break;
case ( TYPE_K ): break;
case ( TYPE_S ): break;
case ( TYPE_UL ): break;
case ( TYPE_UI ): break;
case ( TYPE_UK ): break;
case ( TYPE_US ): break;
}
break;
/* Undefine the macro. */
#undef CASE_NEAREST
/* Linear spreading. */
/* ----------------- */
/* Note this is also the default if zero is given. */
case AST__LINEAR:
case 0:
/* Define a macro to use a "case" statement to invoke the linear
spreading function appropriate to a given data type. */
#define CASE_LINEAR(X,Xtype) \
case ( TYPE_##X ): \
SpreadLinear##X( ndim_out, lbnd_out, ubnd_out,\
(Xtype *) in, (Xtype *) in_var, \
infac, npoint, offset, \
(const double *const *) ptr_out, \
flags, *( (Xtype *) badval_ptr ), \
npix_out, (Xtype *) out, \
(Xtype *) out_var, work, nused, status ); \
break;
/* Use the above macro to invoke the appropriate function. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_LINEAR(LD,long double)
#endif
CASE_LINEAR(D,double)
CASE_LINEAR(F,float)
CASE_LINEAR(I,int)
CASE_LINEAR(B,signed char)
CASE_LINEAR(UB,unsigned char)
case ( TYPE_L ): break;
case ( TYPE_K ): break;
case ( TYPE_S ): break;
case ( TYPE_UL ): break;
case ( TYPE_UI ): break;
case ( TYPE_UK ): break;
case ( TYPE_US ): break;
}
break;
/* Undefine the macro. */
#undef CASE_LINEAR
/* Spreading using a 1-d kernel. */
/* ----------------------------- */
case AST__SINC:
case AST__SINCCOS:
case AST__SINCGAUSS:
case AST__GAUSS:
case AST__SINCSINC:
case AST__SOMB:
case AST__SOMBCOS:
/* Obtain a pointer to the appropriate 1-d kernel function (either
internal or user-defined) and set up any parameters it may
require. */
par = NULL;
switch ( spread ) {
/* sinc(pi*x) */
/* ---------- */
/* Assign the kernel function. */
case AST__SINC:
kernel = Sinc;
/* Calculate the number of neighbouring pixels to use. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) {
neighb = 2;
} else {
neighb = MaxI( 1, neighb, status );
}
break;
/* somb(pi*x) */
/* ---------- */
/* Assign the kernel function. */
case AST__SOMB:
kernel = Somb;
/* Calculate the number of neighbouring pixels to use. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) {
neighb = 2;
} else {
neighb = MaxI( 1, neighb, status );
}
break;
/* sinc(pi*x)*cos(k*pi*x) */
/* ---------------------- */
/* Assign the kernel function. */
case AST__SINCCOS:
kernel = SincCos;
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 0.5 / MaxD( 1.0, params[ 1 ], status );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, the number will be calculated automatically below. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = INT_MAX;
/* Calculate the maximum number of neighbouring pixels required by the
width of the kernel, and use this value if preferable. */
neighb = MinI( neighb,
(int) ceil( MaxD( 1.0, params[ 1 ], status ) ), status );
break;
/* sinc(pi*x)*exp(-k*x*x) */
/* ---------------------- */
/* Assign the kernel function. */
case AST__SINCGAUSS:
kernel = SincGauss;
/* Constrain the full width half maximum of the gaussian factor. */
fwhm = MaxD( 0.1, params[ 1 ], status );
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 4.0 * log( 2.0 ) / ( fwhm * fwhm );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, use the number of neighbouring pixels required by the width
of the kernel (out to where the gaussian term falls to 1% of its
peak value). */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = (int) ceil( sqrt( -log( 0.01 ) /
lpar[ 0 ] ) );
break;
/* exp(-k*x*x) */
/* ----------- */
/* Assign the kernel function. */
case AST__GAUSS:
kernel = Gauss;
/* Constrain the full width half maximum of the gaussian. */
fwhm = MaxD( 0.1, params[ 1 ], status );
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 4.0 * log( 2.0 ) / ( fwhm * fwhm );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, use the number of neighbouring pixels required by the width
of the kernel (out to where the gaussian term falls to 1% of its
peak value). */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = (int) ceil( sqrt( -log( 0.01 ) /
lpar[ 0 ] ) );
break;
/* somb(pi*x)*cos(k*pi*x) */
/* ---------------------- */
/* Assign the kernel function. */
case AST__SOMBCOS:
kernel = SombCos;
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 0.5 / MaxD( 1.0, params[ 1 ], status );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, the number will be calculated automatically below. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = INT_MAX;
/* Calculate the maximum number of neighbouring pixels required by the
width of the kernel, and use this value if preferable. */
neighb = MinI( neighb,
(int) ceil( MaxD( 1.0, params[ 1 ], status ) ), status );
break;
/* sinc(pi*x)*sinc(k*pi*x) */
/* ----------------------- */
/* Assign the kernel function. */
case AST__SINCSINC:
kernel = SincSinc;
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 0.5 / MaxD( 1.0, params[ 1 ], status );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, the number will be calculated automatically below. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = INT_MAX;
/* Calculate the maximum number of neighbouring pixels required by the
width of the kernel, and use this value if preferable. */
neighb = MinI( neighb,
(int) ceil( MaxD( 1.0, params[ 1 ], status ) ), status );
break;
}
/* Define a macro to use a "case" statement to invoke the 1-d kernel
interpolation function appropriate to a given data type, passing it
the pointer to the kernel function obtained above. */
#define CASE_KERNEL1(X,Xtype) \
case ( TYPE_##X ): \
SpreadKernel1##X( this, ndim_out, lbnd_out, ubnd_out, \
(Xtype *) in, (Xtype *) in_var, \
infac, npoint, offset, \
(const double *const *) ptr_out, \
kernel, neighb, par, flags, \
*( (Xtype *) badval_ptr ), \
npix_out, (Xtype *) out, \
(Xtype *) out_var, work, nused, \
status ); \
break;
/* Use the above macro to invoke the appropriate function. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_KERNEL1(LD,long double)
#endif
CASE_KERNEL1(D,double)
CASE_KERNEL1(F,float)
CASE_KERNEL1(I,int)
CASE_KERNEL1(B,signed char)
CASE_KERNEL1(UB,unsigned char)
case ( TYPE_L ): break;
case ( TYPE_K ): break;
case ( TYPE_S ): break;
case ( TYPE_UL ): break;
case ( TYPE_UI ): break;
case ( TYPE_UK ): break;
case ( TYPE_US ): break;
}
break;
/* Undefine the macro. */
#undef CASE_KERNEL1
/* Error: invalid pixel spreading scheme specified. */
/* ------------------------------------------------ */
default:
/* Define a macro to report an error message appropriate to a given
data type. */
#define CASE_ERROR(X) \
case TYPE_##X: \
astError( AST__SISIN, "astRebin"#X"(%s): Invalid " \
"pixel spreading scheme (%d) specified.", status, \
astGetClass( unsimplified_mapping ), spread ); \
break;
/* Use the above macro to report an appropriate error message. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_ERROR(LD)
#endif
CASE_ERROR(D)
CASE_ERROR(F)
CASE_ERROR(I)
CASE_ERROR(B)
CASE_ERROR(UB)
case ( TYPE_L ): break;
case ( TYPE_K ): break;
case ( TYPE_S ): break;
case ( TYPE_UL ): break;
case ( TYPE_UI ): break;
case ( TYPE_UK ): break;
case ( TYPE_US ): break;
}
break;
/* Undefine the macro. */
#undef CASE_ERROR
}
}
/* Annul the PointSet used to hold output coordinates. */
pset_out = astAnnul( pset_out );
/* Free the workspace. */
offset = astFree( offset );
stride = astFree( stride );
}
/*
*++
* Name:
c astRebinSeq<X>
f AST_REBINSEQ<X>
* Purpose:
* Rebin a region of a sequence of data grids.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astRebinSeq<X>( AstMapping *this, double wlim, int ndim_in,
c const int lbnd_in[], const int ubnd_in[],
c const <Xtype> in[], const <Xtype> in_var[],
c int spread, const double params[], int flags,
c double tol, int maxpix, <Xtype> badval,
c int ndim_out, const int lbnd_out[],
c const int ubnd_out[], const int lbnd[],
c const int ubnd[], <Xtype> out[], <Xtype> out_var[],
c double weights[], int64_t *nused );
f CALL AST_REBINSEQ<X>( THIS, WLIM, NDIM_IN, LBND_IN, UBND_IN, IN, IN_VAR,
f SPREAD, PARAMS, FLAGS, TOL, MAXPIX, BADVAL,
f NDIM_OUT, LBND_OUT, UBND_OUT, LBND, UBND, OUT,
f OUT_VAR, WEIGHTS, NUSED, STATUS )
* Class Membership:
* Mapping method.
* Description:
* This set of
c functions is identical to astRebin<X>
f routines is identical to AST_REBIN<X>
* except that the rebinned input data is added into the supplied
* output arrays, rather than simply over-writing the contents of the
* output arrays. Thus, by calling this
c function
f routine
* repeatedly, a sequence of input arrays can be rebinned and accumulated
* into a single output array, effectively forming a mosaic of the
* input data arrays.
*
* In addition, the weights associated with each output pixel are
* returned. The weight of an output pixel indicates the number of input
* pixels which have been accumulated in that output pixel. If the entire
* value of an input pixel is assigned to a single output pixel, then the
* weight of that output pixel is incremented by one. If some fraction of
* the value of an input pixel is assigned to an output pixel, then the
* weight of that output pixel is incremented by the fraction used.
*
* The start of a new sequence is indicated by specifying the
* AST__REBININIT flag via the
c "flags" parameter.
f FLAGS argument.
* This causes the supplied arrays to be filled with zeros before the
* rebinned input data is added into them. Subsequenct invocations
* within the same sequence should omit the AST__REBININIT flag.
*
* The last call in a sequence is indicated by specifying the
* AST__REBINEND flag. Depending on which flags are supplied, this may
* cause the output data and variance arrays to be normalised before
* being returned. This normalisation consists of dividing the data
* array by the weights array, and can eliminate artifacts which may be
* introduced into the rebinned data as a consequence of aliasing
* between the input and output grids. This results in each output
* pixel value being the weighted mean of the input pixel values that
* fall in the neighbourhood of the output pixel (rather like
c astResample<X>).
f AST_RESAMPLE<X>).
* Optionally, these normalised
* values can then be multiplied by a scaling factor to ensure that the
* total data sum in any small area is unchanged. This scaling factor
* is equivalent to the number of input pixel values that fall into each
* output pixel. In addition to
* normalisation of the output data values, any output variances are
* also appropriately normalised, and any output data values with
* weight less than
c "wlim" are set to "badval".
f WLIM are set to BADVAL.
*
* Output variances can be generated in two ways; by rebinning the supplied
* input variances with appropriate weights, or by finding the spread of
* input data values contributing to each output pixel (see the AST__GENVAR
* and AST__USEVAR flags).
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to a Mapping, whose forward transformation will be
* used to transform the coordinates of pixels in the input
* grid into the coordinate system of the output grid.
*
* The number of input coordinates used by this Mapping (as
* given by its Nin attribute) should match the number of input
c grid dimensions given by the value of "ndim_in"
f grid dimensions given by the value of NDIM_IN
* below. Similarly, the number of output coordinates (Nout
* attribute) should match the number of output grid dimensions
c given by "ndim_out".
f given by NDIM_OUT.
c If "in" is NULL, the Mapping will not be used, but a valid
c Mapping must still be supplied.
c wlim
f WLIM = DOUBLE PRECISION (Given)
* This value is only used if the AST__REBINEND flag is specified
* via the
c "flags" parameter.
f FLAGS argument.
* It gives the required number of input pixel values which must
* contribute to an output pixel (i.e. the output pixel weight) in
* order for the output pixel value to be considered valid. If the sum
* of the input pixel weights contributing to an output pixel is less
* than the supplied
c "wlim"
f WLIM
* value, then the output pixel value is returned set to the
* supplied bad value. If the supplied value is less than 1.0E-10
* then 1.0E-10 is used instead.
c ndim_in
f NDIM_IN = INTEGER (Given)
* The number of dimensions in the input grid. This should be at
* least one.
c Not used if "in" is NULL.
c lbnd_in
f LBND_IN( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the centre of the first pixel
* in the input grid along each dimension.
c Not used if "in" is NULL.
c ubnd_in
f UBND_IN( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the centre of the last pixel in
* the input grid along each dimension.
*
c Note that "lbnd_in" and "ubnd_in" together define the shape
f Note that LBND_IN and UBND_IN together define the shape
* and size of the input grid, its extent along a particular
c (j'th) dimension being ubnd_in[j]-lbnd_in[j]+1 (assuming the
c index "j" to be zero-based). They also define
f (J'th) dimension being UBND_IN(J)-LBND_IN(J)+1. They also define
* the input grid's coordinate system, each pixel having unit
* extent along each dimension with integral coordinate values
* at its centre.
c Not used if "in" is NULL.
c in
f IN( * ) = <Xtype> (Given)
c Pointer to an array, with one element for each pixel in the
f An array, with one element for each pixel in the
* input grid, containing the input data to be rebined. The
* numerical type of this array should match the 1- or
* 2-character type code appended to the function name (e.g. if
c you are using astRebinSeqF, the type of each array element
c should be "float").
f you are using AST_REBINSEQR, the type of each array element
f should be REAL).
*
* The storage order of data within this array should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
c (i.e. Fortran array indexing is used).
f (i.e. normal Fortran array storage order).
c If a NULL pointer is supplied for "in", then no data is added to
c the output arrays, but any initialisation or normalisation
c requested by "flags" is still performed.
c in_var
f IN_VAR( * ) = <Xtype> (Given)
* An optional
c pointer to a
* second array with the same size and type as the
c "in"
f IN
* array. If given, this should contain a set of non-negative values
* which represent estimates of the statistical variance associated
* with each element of the
c "in"
f IN
* array.
* If neither the AST__USEVAR nor the AST__VARWGT flag is set, no
* input variance estimates are required and this
f array
c pointer
* will not be used.
f A dummy (e.g. one-element) array
c A NULL pointer
* may then be supplied.
c spread
f SPREAD = INTEGER (Given)
c This parameter specifies the scheme to be used for dividing
f This argument specifies the scheme to be used for dividing
* each input data value up amongst the corresponding output pixels.
* It may be used to select
* from a set of pre-defined schemes by supplying one of the
* values described in the "Pixel Spreading Schemes"
* section in the description of the
c astRebin<X> functions.
f AST_REBIN<X> routines.
* If a value of zero is supplied, then the default linear spreading
* scheme is used (equivalent to supplying the value AST__LINEAR).
c Not used if "in" is NULL.
c params
f PARAMS( * ) = DOUBLE PRECISION (Given)
c An optional pointer to an array of double which should contain
f An optional array which should contain
* any additional parameter values required by the pixel
* spreading scheme. If such parameters are required, this
* will be noted in the "Pixel Spreading Schemes" section in the
* description of the
c astRebin<X> functions.
f AST_REBIN<X> routines.
*
c If no additional parameters are required, this array is not
c used and a NULL pointer may be given.
f If no additional parameters are required, this array is not
f used. A dummy (e.g. one-element) array may then be supplied.
c Not used if "in" is NULL.
c flags
f FLAGS = INTEGER (Given)
c The bitwise OR of a set of flag values which may be used to
f The sum of a set of flag values which may be used to
* provide additional control over the rebinning operation. See
* the "Control Flags" section below for a description of the
* options available. If no flag values are to be set, a value
* of zero should be given.
c tol
f TOL = DOUBLE PRECISION (Given)
* The maximum tolerable geometrical distortion which may be
* introduced as a result of approximating non-linear Mappings
* by a set of piece-wise linear transformations. This should be
* expressed as a displacement in pixels in the output grid's
* coordinate system.
*
* If piece-wise linear approximation is not required, a value
* of zero may be given. This will ensure that the Mapping is
* used without any approximation, but may increase execution
* time.
*
* If the value is too high, discontinuities between the linear
* approximations used in adjacent panel will be higher, and may
* cause the edges of the panel to be visible when viewing the output
* image at high contrast. If this is a problem, reduce the
* tolerance value used.
c Not used if "in" is NULL.
c maxpix
f MAXPIX = INTEGER (Given)
* A value which specifies an initial scale size (in pixels) for
* the adaptive algorithm which approximates non-linear Mappings
* with piece-wise linear transformations. Normally, this should
* be a large value (larger than any dimension of the region of
* the input grid being used). In this case, a first attempt to
* approximate the Mapping by a linear transformation will be
* made over the entire input region.
*
* If a smaller value is used, the input region will first be
c divided into sub-regions whose size does not exceed "maxpix"
f divided into sub-regions whose size does not exceed MAXPIX
* pixels in any dimension. Only at this point will attempts at
* approximation commence.
*
* This value may occasionally be useful in preventing false
* convergence of the adaptive algorithm in cases where the
* Mapping appears approximately linear on large scales, but has
* irregularities (e.g. holes) on smaller scales. A value of,
* say, 50 to 100 pixels can also be employed as a safeguard in
* general-purpose software, since the effect on performance is
* minimal.
*
* If too small a value is given, it will have the effect of
* inhibiting linear approximation altogether (equivalent to
c setting "tol" to zero). Although this may degrade
f setting TOL to zero). Although this may degrade
* performance, accurate results will still be obtained.
c Not used if "in" is NULL.
c badval
f BADVAL = <Xtype> (Given)
* This argument should have the same type as the elements of
c the "in" array. It specifies the value used to flag missing
f the IN array. It specifies the value used to flag missing
* data (bad pixels) in the input and output arrays.
*
c If the AST__USEBAD flag is set via the "flags" parameter,
f If the AST__USEBAD flag is set via the FLAGS argument,
c then this value is used to test for bad pixels in the "in"
c (and "in_var") array(s).
f then this value is used to test for bad pixels in the IN
f (and IN_VAR) array(s).
*
* In all cases, this value is also used to flag any output
c elements in the "out" (and "out_var") array(s) for which
f elements in the OUT (and OUT_VAR) array(s) for which
* rebined values could not be obtained (see the "Propagation
* of Missing Data" section below for details of the
* circumstances under which this may occur).
c ndim_out
f NDIM_OUT = INTEGER (Given)
* The number of dimensions in the output grid. This should be
* at least one. It need not necessarily be equal to the number
* of dimensions in the input grid.
c lbnd_out
f LBND_OUT( NDIM_OUT ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_out" elements,
f An array
* containing the coordinates of the centre of the first pixel
* in the output grid along each dimension.
c ubnd_out
f UBND_OUT( NDIM_OUT ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_out" elements,
f An array
* containing the coordinates of the centre of the last pixel in
* the output grid along each dimension.
*
c Note that "lbnd_out" and "ubnd_out" together define the
f Note that LBND_OUT and UBND_OUT together define the
* shape, size and coordinate system of the output grid in the
c same way as "lbnd_in" and "ubnd_in" define the shape, size
f same way as LBND_IN and UBND_IN define the shape, size
* and coordinate system of the input grid.
c lbnd
f LBND( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the first pixel in the region
* of the input grid which is to be included in the rebined output
* array.
c Not used if "in" is NULL.
c ubnd
f UBND( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the last pixel in the region of
* the input grid which is to be included in the rebined output
* array.
*
c Note that "lbnd" and "ubnd" together define the shape and
f Note that LBND and UBND together define the shape and
* position of a (hyper-)rectangular region of the input grid
* which is to be included in the rebined output array. This region
* should lie wholly within the extent of the input grid (as
c defined by the "lbnd_in" and "ubnd_in" arrays). Regions of
f defined by the LBND_IN and UBND_IN arrays). Regions of
* the input grid lying outside this region will not be used.
c Not used if "in" is NULL.
c out
f OUT( * ) = <Xtype> (Given and Returned)
c Pointer to an array, with one element for each pixel in the
f An array, with one element for each pixel in the
* output grid. The rebined data values will be added into the
* original contents of this array. The numerical type of this array
* should match that of the
c "in" array, and the data storage order should be such
f IN array, and the data storage order should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
c (i.e. Fortran array indexing is used).
f (i.e. normal Fortran array storage order).
c out_var
f OUT_VAR( * ) = <Xtype> (Given and Returned)
* A
c pointer to an
* array with the same type and size as the
c "out"
f OUT
* array. This
c pointer
f array
* will only be used if the AST__USEVAR or AST__GENVAR flag is set
f via the FLAGS argument,
f via the "flags" parameter,
* in which case variance estimates for the rebined data values will
* be added into the array. If neither the AST__USEVAR flag nor the
* AST__GENVAR flag is set, no output variance estimates will be
* calculated and this
c pointer
f array
* will not be used. A
c NULL pointer
f dummy (e.g. one-element) array
* may then be supplied.
c weights
f WEIGHTS( * ) = DOUBLE PRECISION (Given and Returned)
c Pointer to an array of double,
f An array
* with one or two elements for each pixel in the output grid,
* depending on whether or not the AST__GENVAR flag has been supplied
* via the
c "flags" parameter.
f FLAGS parameter.
* If AST__GENVAR has not been specified then the array should have
* one element for each output pixel, and it will be used to
* accumulate the weight associated with each output pixel.
* If AST__GENVAR has been specified then the array should have
* two elements for each output pixel. The first half of the array
* is again used to accumulate the weight associated with each output
* pixel, and the second half is used to accumulate the square of
* the weights. In each half, the data storage order should be such that
* the index of the first grid dimension varies most rapidly and that of
* the final dimension least rapidly
c (i.e. Fortran array indexing is used).
f (i.e. normal Fortran array storage order).
c nused
f NUSED = INTEGER*8 (Given and Returned)
c A pointer to an int64_t containing the
f The
* number of input data values that have been added into the output
* array so far. The supplied value is incremented on exit by the
* number of input values used. The value is initially set to zero
* if the AST__REBININIT flag is set in
c "flags".
f FLAGS.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Data Type Codes:
* To select the appropriate rebinning function, you should
c replace <X> in the generic function name astRebinSeq<X> with a
f replace <X> in the generic function name AST_REBINSEQ<X> with a
* 1- or 2-character data type code, so as to match the numerical
* type <Xtype> of the data you are processing, as follows:
c - D: double
c - F: float
c - I: int
c - B: byte (signed char)
c - UB: unsigned byte (unsigned char)
f - D: DOUBLE PRECISION
f - R: REAL
f - I: INTEGER
f - B: BYTE (treated as signed)
f - UB: BYTE (treated as unsigned)
*
c For example, astRebinSeqD would be used to process "double"
c data, while astRebinSeqI would be used to process "int"
c data, etc.
f For example, AST_REBIND would be used to process DOUBLE
f PRECISION data, while AST_REBINI would be used to process
f integer data (stored in an INTEGER array), etc.
*
* Note that, unlike
c astResample<X>, the astRebinSeq<X>
f AST_RESAMPLE<X>, the AST_REBINSEQ<X>
* set of functions does not yet support unsigned integer data types
* or integers of different sizes.
* Control Flags:
c The following flags are defined in the "ast.h" header file and
f The following flags are defined in the AST_PAR include file and
* may be used to provide additional control over the rebinning
* process. Having selected a set of flags, you should supply the
c bitwise OR of their values via the "flags" parameter:
f sum of their values via the FLAGS argument:
*
* - AST__REBININIT: Used to mark the first call in a sequence. It indicates
* that the supplied
c "out", "out_var" and "weights"
f OUT, OUT_VAR and WEIGHTS
* arrays should be filled with zeros (thus over-writing any supplied
* values) before adding the rebinned input data into them. This flag
* should be used when rebinning the first input array in a sequence.
* - AST__REBINEND: Used to mark the last call in a sequence. It causes
* each value in the
c "out" and "out_var"
f OUT and OUT_VAR
* arrays to be divided by a normalisation factor before being
* returned. The normalisation factor for each output data value is just
* the corresponding value from the weights array. The normalisation
* factor for each output variance value is the square of the data value
* normalisation factor (see also AST__CONSERVEFLUX). It also causes
* output data values to be set bad if the corresponding weight is less
* than the value supplied for
c parameter "wlim".
f argument WLIM.
* It also causes any temporary values stored in the output variance array
* (see flag AST__GENVAR below) to be converted into usable variance values.
* Note, this flag is ignored if the AST__NONORM flag is set.
* - AST__USEBAD: Indicates that there may be bad pixels in the
* input array(s) which must be recognised by comparing with the
c value given for "badval" and propagated to the output array(s).
f value given for BADVAL and propagated to the output array(s).
* If this flag is not set, all input values are treated literally
c and the "badval" value is only used for flagging output array
f and the BADVAL value is only used for flagging output array
* values.
* - AST__USEVAR: Indicates that output variance estimates should be
* created by rebinning the supplied input variance estimates. An
* error will be reported if both this flag and the AST__GENVAR flag
* are supplied.
* - AST__GENVAR: Indicates that output variance estimates should be
* created based on the spread of input data values contributing to each
* output pixel. An error will be reported if both this flag and the
* AST__USEVAR flag are supplied. If the AST__GENVAR flag is specified,
* the supplied output variance array is first used as a work array to
* accumulate the temporary values needed to generate the output
* variances. When the sequence ends (as indicated by the
* AST__REBINEND flag), the contents of the output variance array are
* converted into the required variance estimates. If the generation of
* such output variances is required, this flag should be used on every
* invocation of this
c function
f routine
* within a sequence, and any supplied input variances will have no effect
* on the output variances (although input variances will still be used
* to weight the input data if the AST__VARWGT flag is also supplied).
* The statistical meaning of these output varianes is determined by
* the presence or absence of the AST__DISVAR flag (see below).
* - AST__DISVAR: This flag is ignored unless the AST__GENVAR flag
* has also been specified. It determines the statistical meaning of
* the generated output variances. If AST__DISVAR is not specified,
* generated variances represent variances on the output mean values. If
* AST__DISVAR is specified, the generated variances represent the variance
* of the distribution from which the input values were taken. Each output
* variance created with AST__DISVAR will be larger than that created
* without AST__DISVAR by a factor equal to the number of input samples
* that contribute to the output sample.
* - AST__VARWGT: Indicates that the input data should be weighted by
* the reciprocal of the input variances. Otherwise, all input data are
* given equal weight. If this flag is specified, the calculation of the
* output variances (if any) is modified to take account of the
* varying weights assigned to the input data values.
* - AST__NONORM: If the simple unnormalised sum of all input data falling
* in each output pixel is required, then this flag should be set on
* each call in the sequence and the AST__REBINEND should not be used
* on the last call. In this case
c NULL pointers can be supplied for "weights" and "nused".
f WEIGHTS and NUSED are ignored.
* This flag cannot be used with the AST__CONSERVEFLUX, AST__GENVAR
* or AST__VARWGT flag.
* - AST__CONSERVEFLUX: Indicates that the normalized output pixel values
* generated by the AST__REBINEND flag should be scaled in such a way as
* to preserve the total data value in a feature on the sky. Without this
* flag, each normalised output pixel value represents a weighted mean
* of the input data values around the corresponding input position.
f (i.e. AST_REBINSEQ<F> behaves similarly to AST_RESAMPLE<X>). This
f (i.e. AST_REBINSEQ<F> behaves similarly to AST_RESAMPLE<X>). This
* is appropriate if the input data represents the spatial density of
* some quantity (e.g. surface brightness in Janskys per square
* arc-second) because the output pixel values will have the same
* normalisation and units as the input pixel values. However, if the
* input data values represent flux (or some other physical quantity)
* per pixel, then the AST__CONSERVEFLUX flag could be of use. It causes
* each output pixel value to be scaled by the ratio of the output pixel
* size to the input pixel size.
*
* This flag can only be used if the Mapping is successfully approximated
* by one or more linear transformations. Thus an error will be reported
* if it used when the
c "tol" parameter
f TOL argument
* is set to zero (which stops the use of linear approximations), or
* if the Mapping is too non-linear to be approximated by a piece-wise
* linear transformation. The ratio of output to input pixel size is
* evaluated once for each panel of the piece-wise linear approximation to
* the Mapping, and is assumed to be constant for all output pixels in the
* panel. The scaling factors for adjacent panels will in general
* differ slightly, and so the joints between panels may be visible when
* viewing the output image at high contrast. If this is a problem,
* reduce the value of the
c "tol" parameter
f TOL argument
* until the difference between adjacent panels is sufficiently small
* to be insignificant.
*
* This flag should normally be supplied on each invocation of
c astRebinSeq<X>
f AST_REBINSEQ<X>
* within a given sequence.
*
* Note, this flag cannot be used in conjunction with the AST__NOSCALE
* flag (an error will be reported if both flags are specified).
* Propagation of Missing Data:
* Instances of missing data (bad pixels) in the output grid are
c identified by occurrences of the "badval" value in the "out"
f identified by occurrences of the BADVAL value in the OUT
* array. These are only produced if the AST__REBINEND flag is
* specified and a pixel has zero weight.
*
* An input pixel is considered bad (and is consequently ignored) if
* its
c data value is equal to "badval" and the AST__USEBAD flag is
c set via the "flags" parameter.
f data value is equal to BADVAL and the AST__USEBAD flag is
f set via the FLAGS argument.
*
* In addition, associated output variance estimates (if
c calculated) may be declared bad and flagged with the "badval"
c value in the "out_var" array for similar reasons.
f calculated) may be declared bad and flagged with the BADVAL
f value in the OUT_VAR array for similar reasons.
*--
*/
/* Define a macro to implement the function for a specific data
type. */
#define MAKE_REBINSEQ(X,Xtype,IntType) \
static void RebinSeq##X( AstMapping *this, double wlim, int ndim_in, \
const int lbnd_in[], const int ubnd_in[], \
const Xtype in[], const Xtype in_var[], \
int spread, const double params[], int flags, \
double tol, int maxpix, Xtype badval, \
int ndim_out, const int lbnd_out[], \
const int ubnd_out[], const int lbnd[], \
const int ubnd[], Xtype out[], Xtype out_var[], \
double weights[], int64_t *nused, int *status ) { \
\
/* Local Variables: */ \
AstMapping *simple; /* Pointer to simplified Mapping */ \
Xtype *d; /* Pointer to next output data value */ \
Xtype *v; /* Pointer to next output variance value */ \
astDECLARE_GLOBALS /* Thread-specific data */ \
double *w; /* Pointer to next weight value */ \
double mwpip; /* Mean weight per input pixel */ \
double neff; /* Effective number of contributing input pixels */ \
double sw; /* Sum of weights at output pixel */ \
double wgt; /* Output pixel weight */ \
int i; /* Loop counter for output pixels */ \
int idim; /* Loop counter for coordinate dimensions */ \
int ipix_out; /* Index into output array */ \
int nin; /* Number of Mapping input coordinates */ \
int nout; /* Number of Mapping output coordinates */ \
int npix; /* Number of pixels in input region */ \
int npix_out; /* Number of pixels in output array */ \
int64_t mpix; /* Number of pixels for testing */ \
\
/* Check the global error status. */ \
if ( !astOK ) return; \
\
/* Get a pointer to a structure holding thread-specific global data values */ \
astGET_GLOBALS(this); \
\
/* Loop to determine how many pixels the output array contains. */ \
npix_out = 1; \
for ( idim = 0; idim < ndim_out; idim++ ) { \
npix_out *= ubnd_out[ idim ] - lbnd_out[ idim ] + 1; \
} \
\
/* Obtain values for the Nin and Nout attributes of the Mapping. */ \
nin = astGetNin( this ); \
nout = astGetNout( this ); \
\
/* If OK, also check that the number of output grid dimensions matches \
the number required by the Mapping and is at least 1. Report an \
error if necessary. */ \
if ( astOK && ( ( ndim_out != nout ) || ( ndim_out < 1 ) ) ) { \
astError( AST__NGDIN, "astRebinSeq"#X"(%s): Bad number of output grid " \
"dimensions (%d).", status, astGetClass( this ), ndim_out ); \
if ( ndim_out != nout ) { \
astError( AST__NGDIN, "The %s given generates %s%d coordinate " \
"value%s for each output position.", status, astGetClass( this ), \
( nout < ndim_out ) ? "only " : "", nout, \
( nout == 1 ) ? "" : "s" ); \
} \
} \
\
/* If no input data was supplied, jump to the normalisation section. */ \
simple = NULL; \
if( in ) { \
\
/* If OK, check that the number of input grid dimensions matches the \
number required by the Mapping and is at least 1. Report an error \
if necessary. */ \
if ( astOK && ( ( ndim_in != nin ) || ( ndim_in < 1 ) ) ) { \
astError( AST__NGDIN, "astRebinSeq"#X"(%s): Bad number of input grid " \
"dimensions (%d).", status, astGetClass( this ), ndim_in ); \
if ( ndim_in != nin ) { \
astError( AST__NGDIN, "The %s given requires %d coordinate value%s " \
"to specify an input position.", status, \
astGetClass( this ), nin, ( nin == 1 ) ? "" : "s" ); \
} \
} \
\
/* Check that the lower and upper bounds of the input grid are \
consistent. Report an error if any pair is not. */ \
mpix = 1; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_in; idim++ ) { \
if ( lbnd_in[ idim ] > ubnd_in[ idim ] ) { \
astError( AST__GBDIN, "astRebinSeq"#X"(%s): Lower bound of " \
"input grid (%d) exceeds corresponding upper bound " \
"(%d).", status, astGetClass( this ), \
lbnd_in[ idim ], ubnd_in[ idim ] ); \
astError( AST__GBDIN, "Error in input dimension %d.", status, \
idim + 1 ); \
break; \
} else { \
mpix *= ubnd_in[ idim ] - lbnd_in[ idim ] + 1; \
} \
} \
} \
\
/* Report an error if there are too many pixels in the input. */ \
if ( astOK && (int) mpix != mpix ) { \
astError( AST__EXSPIX, "astRebinSeq"#X"(%s): Supplied input array " \
"contains too many pixels (%g): must be fewer than %d.", \
status, astGetClass( this ), (double) mpix, INT_MAX ); \
} \
\
/* Ensure any supplied "in_var" pointer is ignored if no input variances are \
needed. */ \
if( !( flags & AST__USEVAR ) && !( flags & AST__VARWGT ) ) { \
in_var = NULL; \
} \
\
/* Ensure any supplied "out_var" pointer is ignored if no output variances \
being created. */ \
if( !( flags & AST__USEVAR ) && !( flags & AST__GENVAR ) ) { \
out_var = NULL; \
} \
\
/* Check that the positional accuracy tolerance supplied is valid and \
report an error if necessary. */ \
if ( astOK && ( tol < 0.0 ) ) { \
astError( AST__PATIN, "astRebinSeq"#X"(%s): Invalid positional " \
"accuracy tolerance (%.*g pixel).", status, \
astGetClass( this ), DBL_DIG, tol ); \
astError( AST__PATIN, "This value should not be less than zero." , status); \
} \
\
/* Check that the initial scale size in pixels supplied is valid and \
report an error if necessary. */ \
if ( astOK && ( maxpix < 0 ) ) { \
astError( AST__SSPIN, "astRebinSeq"#X"(%s): Invalid initial scale " \
"size in pixels (%d).", status, astGetClass( this ), maxpix ); \
astError( AST__SSPIN, "This value should not be less than zero." , status); \
} \
\
/* Check that the lower and upper bounds of the output grid are \
consistent. Report an error if any pair is not. */ \
mpix = 1; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_out; idim++ ) { \
if ( lbnd_out[ idim ] > ubnd_out[ idim ] ) { \
astError( AST__GBDIN, "astRebinSeq"#X"(%s): Lower bound of " \
"output grid (%d) exceeds corresponding upper bound " \
"(%d).", status, astGetClass( this ), \
lbnd_out[ idim ], ubnd_out[ idim ] ); \
astError( AST__GBDIN, "Error in output dimension %d.", status, \
idim + 1 ); \
break; \
} else { \
mpix *= ubnd_out[ idim ] - lbnd_out[ idim ] + 1; \
} \
} \
} \
\
/* Report an error if there are too many pixels in the output. */ \
if ( astOK && (int) mpix != mpix ) { \
astError( AST__EXSPIX, "astRebinSeq"#X"(%s): Supplied output array " \
"contains too many pixels (%g): must be fewer than %d.", \
status, astGetClass( this ), (double) mpix, INT_MAX ); \
} \
\
/* Similarly check the bounds of the input region. */ \
mpix = 1; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_in; idim++ ) { \
if ( lbnd[ idim ] > ubnd[ idim ] ) { \
astError( AST__GBDIN, "astRebinSeq"#X"(%s): Lower bound of " \
"input region (%d) exceeds corresponding upper " \
"bound (%d).", status, astGetClass( this ), \
lbnd[ idim ], ubnd[ idim ] ); \
\
/* Also check that the input region lies wholly within the input \
grid. */ \
} else if ( lbnd[ idim ] < lbnd_in[ idim ] ) { \
astError( AST__GBDIN, "astRebinSeq"#X"(%s): Lower bound of " \
"input region (%d) is less than corresponding " \
"bound of input grid (%d).", status, astGetClass( this ), \
lbnd[ idim ], lbnd_in[ idim ] ); \
} else if ( ubnd[ idim ] > ubnd_in[ idim ] ) { \
astError( AST__GBDIN, "astRebinSeq"#X"(%s): Upper bound of " \
"input region (%d) exceeds corresponding " \
"bound of input grid (%d).", status, astGetClass( this ), \
ubnd[ idim ], ubnd_in[ idim ] ); \
} else { \
mpix *= ubnd[ idim ] - lbnd[ idim ] + 1; \
} \
\
/* Say which dimension produced the error. */ \
if ( !astOK ) { \
astError( AST__GBDIN, "Error in output dimension %d.", status, \
idim + 1 ); \
break; \
} \
} \
} \
\
/* Report an error if there are too many pixels in the input region. */ \
if ( astOK && (int) mpix != mpix ) { \
astError( AST__EXSPIX, "astRebinSeq"#X"(%s): Supplied input region " \
"contains too many pixels (%g): must be fewer than %d.", \
status, astGetClass( this ), (double) mpix, INT_MAX ); \
} \
\
/* Check that only one of AST__USEVAR and ASR__GENVAR has been supplied. */ \
if( ( flags & AST__USEVAR ) && ( flags & AST__GENVAR ) ) { \
if( astOK ) { \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): Incompatible flags " \
"AST__GENVAR and AST__USEVAR have been specified " \
"together (programming error).", status, astGetClass( this ) ); \
} \
} \
\
/* If AST__USEVAR or AST_VARWGT has been specified, check we have an \
input variance array. */ \
if( !in_var && astOK ) { \
if( ( flags & AST__USEVAR ) ) { \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): The AST__USEVAR flag " \
"was specified but no input variance array was supplied " \
"(programming error).", status, astGetClass( this ) ); \
} else if( ( flags & AST__VARWGT ) ) { \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): The AST__VARWGT flag " \
"was specified but no input variance array was supplied " \
"(programming error).", status, astGetClass( this ) ); \
} \
} \
\
/* If AST__USEVAR or AST_GENVAR has been specified, check we have an \
output variance array. */ \
if( !out_var && astOK ) { \
if( ( flags & AST__USEVAR ) ) { \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): The AST__USEVAR flag " \
"was specified but no output variance array was supplied " \
"(programming error).", status, astGetClass( this ) ); \
} else if( ( flags & AST__GENVAR ) ) { \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): The AST__GENVAR flag " \
"was specified but no output variance array was supplied " \
"(programming error).", status, astGetClass( this ) ); \
} \
} \
\
/* If the AST__NONORM flag has been supplied, check no incompatible flags have \
been specified. */ \
if( flags & AST__NONORM ) { \
if( ( flags & AST__GENVAR ) && astOK ) { \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): Incompatible flags " \
"AST__GENVAR and AST__NONORM have been specified " \
"together (programming error).", status, astGetClass( this ) ); \
} else if( ( flags & AST__VARWGT ) && astOK ) { \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): Incompatible flags " \
"AST__VARWGT and AST__NONORM have been specified " \
"together (programming error).", status, astGetClass( this ) ); \
} else if( ( flags & AST__CONSERVEFLUX ) && astOK ) { \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): Incompatible flags " \
"AST__CONSERVEFLUX and AST__NONORM have been specified " \
"together (programming error).", status, astGetClass( this ) ); \
} \
\
/* If the AST__NONORM flag has not been supplied, check that a weights array \
and nused pointer have been supplied. */ \
} else if( !weights ){ \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): No weights array " \
"supplied (programming error).", status, \
astGetClass( this ) ); \
} else if( !nused ){ \
astError( AST__BDPAR, "astRebinSeq"#X"(%s): No 'nused' pointer " \
"supplied (programming error).", status, \
astGetClass( this ) ); \
} \
\
/* If OK, loop to determine how many input pixels are to be binned. */ \
npix = 1; \
unsimplified_mapping = this; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_in; idim++ ) { \
npix *= ubnd[ idim ] - lbnd[ idim ] + 1; \
} \
\
/* If there are sufficient pixels to make it worthwhile, simplify the \
Mapping supplied to improve performance. Otherwise, just clone the \
Mapping pointer. Note we have already saved a pointer to the original \
Mapping so that lower-level functions can use it if they need to report \
an error. */ \
if ( npix > 1024 ) { \
simple = astSimplify( this ); \
} else { \
simple = astClone( this ); \
} \
} \
\
/* Report an error if the forward transformation of this simplified \
Mapping is not defined. */ \
if ( !astGetTranForward( simple ) && astOK ) { \
astError( AST__TRNND, "astRebinSeq"#X"(%s): An forward coordinate " \
"transformation is not defined by the %s supplied.", status, \
astGetClass( unsimplified_mapping ), \
astGetClass( unsimplified_mapping ) ); \
} \
\
/* If required, initialise the output arrays to hold zeros. */ \
if( flags & AST__REBININIT ) { \
d = out; \
if( out_var ) { \
v = out_var; \
for( ipix_out = 0; ipix_out < npix_out; ipix_out++, d++, v++ ) { \
*d = 0; \
*v = 0; \
} \
} else { \
for( ipix_out = 0; ipix_out < npix_out; ipix_out++, d++ ) { \
*d = 0; \
} \
} \
if( weights ) { \
w = weights; \
for( ipix_out = 0; ipix_out < npix_out; ipix_out++, w++ ) { \
*w = 0; \
} \
if( flags & AST__GENVAR ) { \
for( ipix_out = 0; ipix_out < npix_out; ipix_out++, w++ ) *w = 0; \
} \
} \
if( nused ) *nused = 0; \
} \
\
/* Paste the input values into the supplied output arrays. */ \
if( RebinAdaptively( simple, ndim_in, lbnd_in, ubnd_in, \
(const void *) in, (const void *) in_var, \
TYPE_##X, spread, params, flags, \
tol, maxpix, (const void *) &badval, \
ndim_out, lbnd_out, ubnd_out, lbnd, \
ubnd, npix_out, (void *) out, \
(void *) out_var, weights, nused, status ) ) { \
astError( AST__CNFLX, "astRebinSeq"#X"(%s): Flux conservation was " \
"requested but could not be performed because the " \
"forward transformation of the supplied Mapping " \
"is too non-linear.", status, astGetClass( this ) ); \
} \
\
/* Annul the pointer to the simplified/cloned Mapping. */ \
simple = astAnnul( simple ); \
\
} \
\
/* If required, finalise the sequence. */ \
if( ( flags & AST__REBINEND ) && !( flags & AST__NONORM ) && \
weights && nused ) { \
\
/* Ensure "wlim" is not zero. */ \
if( wlim < 1.0E-10 ) wlim = 1.0E-10; \
\
/* If it will be needed, find the average weight per input pixel. */ \
if( !( flags & AST__GENVAR ) && *nused > 0 ) { \
sw = 0.0; \
for( i = 0; i < npix_out; i++ ) { \
sw += weights[ i ]; \
} \
mwpip = sw/( *nused ); \
} else { \
mwpip = AST__BAD; \
} \
\
/* Normalise each output pixel. */ \
for( i = 0; i < npix_out; i++ ) { \
\
/* Find the effective number of input samples that contribute to the \
output sample. To do this properly requires the sum of the squared \
weights in each output pixel, but this is only available if AST__GENVAR \
flag is in use. In order to avoid changing the API for astRebinSeq, we \
honour this long-standing restriction, and use an approximation if \
AST__GENVAR is not in use. */ \
wgt = weights[ i ]; \
if( flags & AST__GENVAR ) { \
if( wgt > 0.0 && weights[ i + npix_out ] > 0 ) { \
neff = (wgt*wgt)/weights[ i + npix_out ]; \
} else { \
neff = 0.0; \
} \
\
/* If the sum of the squared weights is not available, compare the weight \
for this output pixel with the mean weight per input pixel. */ \
} else if( mwpip != AST__BAD ){ \
neff = wgt/mwpip; \
\
} else if( astOK ) { \
astError( AST__BADIN, "astRebinSeq"#X"(%s): The overlap " \
"between the %d-d input array and the %d-d output " \
"array contains no pixels with good data %svalues.", \
status, astGetClass( this ), nin, nout, \
in_var ? "and variance " : "" ); \
} \
\
/* Assign bad values to unused output pixels. */ \
if( neff < wlim || neff == 0.0 ) { \
out[ i ] = badval; \
if( out_var ) out_var[ i ] = badval; \
\
/* Otherwise, normalise the returned data value. No need to check "wgt" \
since it must be larger than zero since neff is larger than wlim. */ \
} else { \
out[ i ] /= wgt; \
\
/* Normalise the returned variance: propagated from input variances... */ \
if( out_var ) { \
if( flags & AST__USEVAR ) { \
out_var[ i ] /= wgt*wgt; \
\
/* Normalise the returned variance: from spread of input values... */ \
} else if( flags & AST__GENVAR && neff > 1.0 ) { \
out_var[ i ] /= wgt; \
out_var[ i ] -= out[ i ]*out[ i ]; \
if( out_var[ i ] < 0.0 ) out_var[ i ] = 0.0; \
\
/* If output variances are estimates of the variance of the distribution \
from which the input values were sampled... */ \
if( flags & AST__DISVAR ) { \
out_var[ i ] *= neff/( neff - 1.0 ); \
\
/* If output variances are estimates of the error on the mean data value... */ \
} else { \
out_var[ i ] *= 1.0/( neff - 1.0 ); \
} \
\
} else { \
out_var[ i ] = badval; \
} \
} \
} \
} \
} \
\
}
/* Expand the above macro to generate a function for each required
data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_REBINSEQ(LD,long double,0)
#endif
MAKE_REBINSEQ(D,double,0)
MAKE_REBINSEQ(F,float,0)
MAKE_REBINSEQ(I,int,1)
MAKE_REBINSEQ(B,signed char,1)
MAKE_REBINSEQ(UB,unsigned char,1)
/* Undefine the macro. */
#undef MAKE_REBINSEQ
static int RebinWithBlocking( AstMapping *this, const double *linear_fit,
int ndim_in, const int *lbnd_in,
const int *ubnd_in, const void *in,
const void *in_var, DataType type,
int spread, const double *params, int flags,
const void *badval_ptr, int ndim_out,
const int *lbnd_out, const int *ubnd_out,
const int *lbnd, const int *ubnd, int npix_out,
void *out, void *out_var, double *work,
int64_t *nused, int *status ) {
/*
* Name:
* RebinWithBlocking
* Purpose:
* Rebin a section of a data grid in a memory-efficient way.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int RebinWithBlocking( AstMapping *this, const double *linear_fit,
* int ndim_in, const int *lbnd_in,
* const int *ubnd_in, const void *in,
* const void *in_var, DataType type,
* int spread, const double *params, int flags,
* const void *badval_ptr, int ndim_out,
* const int *lbnd_out, const int *ubnd_out,
* const int *lbnd, const int *ubnd, int npix_out,
* void *out, void *out_var, double *work,
* int64_t *nused, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function rebins a specified section of a rectangular grid of
* data (with any number of dimensions) into another rectangular grid
* (with a possibly different number of dimensions). The coordinate
* transformation used to convert input pixel coordinates into positions
* in the output grid is given by the forward transformation of the
* Mapping which is supplied. Any pixel spreading scheme may be specified
* for distributing the flux of an input pixel amongst the output
* pixels.
*
* This function is very similar to RebinSection, except that in
* order to limit memory usage and to ensure locality of reference,
* it divides the input grid up into "blocks" which have a limited
* extent along each input dimension. Each block, which will not
* contain more than a pre-determined maximum number of pixels, is
* then passed to RebinSection for resampling.
* Parameters:
* this
* Pointer to a Mapping, whose forward transformation may be
* used to transform the coordinates of pixels in the input
* grid into associated positions in the output grid.
*
* The number of input coordintes for the Mapping (Nin
* attribute) should match the value of "ndim_in" (below), and
* the number of output coordinates (Nout attribute) should
* match the value of "ndim_out".
* linear_fit
* Pointer to an optional array of double which contains the
* coefficients of a linear fit which approximates the above
* Mapping's forward coordinate transformation. If this is
* supplied, it will be used in preference to the above Mapping
* when transforming coordinates. This may be used to enhance
* performance in cases where evaluation of the Mapping's
* forward transformation is expensive. If no linear fit is
* available, a NULL pointer should be supplied.
*
* The way in which the fit coefficients are stored in this
* array and the number of array elements are as defined by the
* astLinearApprox function.
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input data grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input data grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input data grid, its extent along a
* particular (i'th) dimension being (ubnd_in[i] - lbnd_in[i] +
* 1). They also define the input grid's coordinate system, with
* each pixel being of unit extent along each dimension with
* integral coordinate values at its centre.
* in
* Pointer to the input array of data to be rebinned (with one
* element for each pixel in the input grid). The numerical type
* of these data should match the "type" value (below). The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and data type as the "in" array),
* which represent estimates of the statistical variance
* associated with each element of the "in" array. If this
* second array is given (along with the corresponding "out_var"
* array), then estimates of the variance of the rebinned data
* will also be returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* type
* A value taken from the "DataType" enum, which specifies the
* data type of the input and output arrays containing the
* gridded data (and variance) values.
* spread
* A value selected from a set of pre-defined macros to identify
* which pixel spread function should be used.
* params
* Pointer to an optional array of parameters that may be passed
* to the pixel spread algorithm, if required. If no parameters
* are required, a NULL pointer should be supplied.
* flags
* The bitwise OR of a set of flag values which provide additional
* control over the resampling operation.
* badval_ptr
* If the AST__USEBAD flag is set (above), this parameter is a
* pointer to a value which is used to identify bad data and/or
* variance values in the input array(s). The referenced value's
* data type must match that of the "in" (and "in_var")
* arrays. The same value will also be used to flag any output
* array elements for which rebinned values could not be
* obtained. The output arrays(s) may be flagged with this
* value whether or not the AST__USEBAD flag is set (the
* function return value indicates whether any such values have
* been produced).
* ndim_out
* The number of dimensions in the output grid. This should be
* at least one.
* lbnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the first
* pixel in the output data grid along each dimension.
* ubnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the last
* pixel in the output data grid along each dimension.
*
* Note that "lbnd_out" and "ubnd_out" together define the shape
* and size of the output data grid in the same way as "lbnd_in"
* and "ubnd_in" define the shape and size of the input grid
* (see above).
* lbnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the first pixel in the
* section of the input data grid which is to be rebinned.
* ubnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the last pixel in the
* section of the input data grid which is to be rebinned.
*
* Note that "lbnd" and "ubnd" define the shape and position of
* the section of the input grid which is to be rebinned. This section
* should lie wholly within the extent of the input grid (as defined
* by the "lbnd_out" and "ubnd_out" arrays). Regions of the input
* grid lying outside this section will be ignored.
* npix_out
* The number of pixels in the output array.
* out
* Pointer to an array with the same data type as the "in"
* array, into which the rebinned data will be returned. The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the rebinned values may be returned. This array will only be
* used if the "in_var" array has been given.
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* work
* An optional pointer to a double array with the same size as
* the "out" array. The contents of this array (if supplied) are
* incremented by the accumulated weights assigned to each output pixel.
* If no accumulated weights are required, a NULL pointer should be
* given.
* nused
* An optional pointer to a int64_t which will be incremented by the
* number of input values pasted into the output array. Ignored if NULL.
* Returned Value:
* A non-zero value is returned if "flags" included AST__CONSERVEFLUX (i.e.
* flux conservation was requested), but the supplied linear fit to the
* forward transformation of the Mapping had zero determinant (no error
* is reported if this happens). Zero is returned otherwise.
*/
/* Local Constants: */
const int mxpix = 2 * 1024; /* Maximum number of pixels in a block (this
relatively small number seems to give best
performance) */
/* Local Variables: */
double factor; /* Flux conservation factor */
int *dim_block; /* Pointer to array of block dimensions */
int *lbnd_block; /* Pointer to block lower bound array */
int *ubnd_block; /* Pointer to block upper bound array */
int dim; /* Dimension size */
int done; /* All blocks rebinned? */
int hilim; /* Upper limit on maximum block dimension */
int idim; /* Loop counter for dimensions */
int lolim; /* Lower limit on maximum block dimension */
int mxdim_block; /* Maximum block dimension */
int npix; /* Number of pixels in block */
int result; /* Returned value */
/* Initialise */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Allocate workspace. */
lbnd_block = astMalloc( sizeof( int ) * (size_t) ndim_in );
ubnd_block = astMalloc( sizeof( int ) * (size_t) ndim_in );
dim_block = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
/* Find the optimum block size. */
/* ---------------------------- */
/* We first need to find the maximum extent which a block of input
pixels may have in each dimension. We determine this by taking the
input grid extent in each dimension and then limiting the maximum
dimension size until the resulting number of pixels is sufficiently
small. This approach allows the block shape to approximate (or
match) the input grid shape when appropriate. */
/* First loop to calculate the total number of input pixels and the
maximum input dimension size. */
npix = 1;
mxdim_block = 0;
for ( idim = 0; idim < ndim_in; idim++ ) {
dim = ubnd[ idim ] - lbnd[ idim ] + 1;
npix *= dim;
if ( mxdim_block < dim ) mxdim_block = dim;
}
/* If the number of input pixels is too large for a single block, we
perform iterations to determine the optimum upper limit on a
block's dimension size. Initialise the limits on this result. */
if ( npix > mxpix ) {
lolim = 1;
hilim = mxdim_block;
/* Loop to perform a binary chop, searching for the best result until
the lower and upper limits on the result converge to adjacent
values. */
while ( ( hilim - lolim ) > 1 ) {
/* Form a new estimate from the mid-point of the previous limits. */
mxdim_block = ( hilim + lolim ) / 2;
/* See how many pixels a block contains if its maximum dimension is
limited to this new value. */
for ( npix = 1, idim = 0; idim < ndim_in; idim++ ) {
dim = ubnd[ idim ] - lbnd[ idim ] + 1;
npix *= ( dim < mxdim_block ) ? dim : mxdim_block;
}
/* Update the appropriate limit, according to whether the number of
pixels is too large or too small. */
*( ( npix <= mxpix ) ? &lolim : &hilim ) = mxdim_block;
}
/* When iterations have converged, obtain the maximum limit on the
dimension size of a block which results in no more than the maximum
allowed number of pixels per block. However, ensure that all block
dimensions are at least 2. */
mxdim_block = lolim;
}
if ( mxdim_block < 2 ) mxdim_block = 2;
/* Calculate the block dimensions by applying this limit to the output
grid dimensions. */
for ( idim = 0; idim < ndim_in; idim++ ) {
dim = ubnd[ idim ] - lbnd[ idim ] + 1;
dim_block[ idim ] = ( dim < mxdim_block ) ? dim : mxdim_block;
/* Also initialise the lower and upper bounds of the first block of
output grid pixels to be rebinned, ensuring that this does not
extend outside the grid itself. */
lbnd_block[ idim ] = lbnd[ idim ];
ubnd_block[ idim ] = MinI( lbnd[ idim ] + dim_block[ idim ] - 1,
ubnd[ idim ], status );
}
/* Determine the flux conservation constant if needed. */
/* --------------------------------------------------- */
factor = 1.0;
if( flags & AST__CONSERVEFLUX ) {
if( linear_fit ) {
factor = MatrixDet( ndim_out, ndim_in, linear_fit + ndim_out,
status );
if( factor != 0.0 ) {
factor = 1.0/factor;
} else {
result = 1;
}
} else {
result = 1;
}
}
/* Rebin each block of input pixels. */
/* --------------------------------- */
/* Loop to generate the extent of each block of input pixels and to
rebin them. */
done = result;
while ( !done && astOK ) {
/* Rebin the current block, accumulating the sum of bad pixels produced. */
RebinSection( this, linear_fit, ndim_in, lbnd_in, ubnd_in, in,
in_var, factor, type, spread, params, flags, badval_ptr,
ndim_out, lbnd_out, ubnd_out, lbnd_block, ubnd_block,
npix_out, out, out_var, work, nused, status );
/* Update the block extent to identify the next block of input pixels. */
idim = 0;
do {
/* We find the least significant dimension where the upper bound of
the block has not yet reached the upper bound of the region of the
input grid which we are rebinning. The block's position is then
incremented by one block extent along this dimension, checking that
the resulting extent does not go outside the region being rebinned. */
if ( ubnd_block[ idim ] < ubnd[ idim ] ) {
lbnd_block[ idim ] = MinI( lbnd_block[ idim ] +
dim_block[ idim ], ubnd[ idim ], status );
ubnd_block[ idim ] = MinI( lbnd_block[ idim ] +
dim_block[ idim ] - 1,
ubnd[ idim ], status );
break;
/* If any less significant dimensions are found where the upper bound
of the block has reached its maximum value, we reset the block to
its lowest position. */
} else {
lbnd_block[ idim ] = lbnd[ idim ];
ubnd_block[ idim ] = MinI( lbnd[ idim ] + dim_block[ idim ] - 1,
ubnd[ idim ], status );
/* All the blocks have been processed once the position along the most
significant dimension has been reset. */
done = ( ++idim == ndim_in );
}
} while ( !done );
}
}
/* Free the workspace. */
lbnd_block = astFree( lbnd_block );
ubnd_block = astFree( ubnd_block );
dim_block = astFree( dim_block );
/* Return a flag indicating if there was an error conserving flux. */
return result;
}
static AstMapping *RemoveRegions( AstMapping *this, int *status ) {
/*
*++
* Name:
c astRemoveRegions
f AST_REMOVEREGIONS
* Purpose:
* Remove any Regions from a Mapping.
* Type:
* Public function.
* Synopsis:
c #include "mapping.h"
c AstMapping *astRemoveRegions( AstMapping *this )
f RESULT = AST_REMOVEREGIONS( THIS, STATUS )
* Class Membership:
* Mapping method.
* Description:
* This function searches the suppliedMapping (which may be a
* compound Mapping such as a CmpMap) for any component Mappings
* that are instances of the AST Region class. It then creates a new
* Mapping from which all Regions have been removed. If a Region
* cannot simply be removed (for instance, if it is a component of a
* parallel CmpMap), then it is replaced with an equivalent UnitMap
* in the returned Mapping.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the original Mapping.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Returned Value:
c astRemoveRegions()
f AST_REMOVEREGIONS = INTEGER
* A new pointer to the (possibly modified) Mapping.
* Applicability:
* CmpFrame
* If the supplied Mapping is a CmpFrame, any component Frames that
* are instances of the Region class are replaced by the equivalent
* Frame.
* FrameSet
* If the supplied Mapping is a FrameSet, the returned Mapping
* will be a copy of the supplied FrameSet in which Regions have
* been removed from all the inter-Frame Mappings, and any Frames
* which are instances of the Region class are repalced by the
* equivalent Frame.
* Mapping
* This function applies to all Mappings.
* Region
* If the supplied Mapping is a Region, the returned Mapping will
* be the equivalent Frame.
* Notes:
* - This function can safely be applied even to Mappings which
* contain no Regions. If no Regions are found, it
c behaves exactly like astClone and returns a pointer to the
f behaves exactly like AST_CLONE and returns a pointer to the
* original Mapping.
* - The Mapping returned by this function may not be independent
* of the original (even if some Regions were removed), and
* modifying it may therefore result in indirect modification of
* the original. If a completely independent result is required, a
c copy should be made using astCopy.
f copy should be made using AST_COPY.
* - A null Object pointer (AST__NULL) will be returned if this
c function is invoked with the AST error status set, or if it
f function is invoked with STATUS set to an error value, or if it
* should fail for any reason.
*--
*/
/* This base iplementation just returns a clone of the supplied Mapping
pointer. Sub-classes should override it as necessary. */
return astClone( this );
}
static void ReportPoints( AstMapping *this, int forward,
AstPointSet *in_points, AstPointSet *out_points, int *status ) {
/*
*+
* Name:
* astReportPoints
* Purpose:
* Report the effect of transforming a set of points using a Mapping.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* void astReportPoints( AstMapping *this, int forward,
* AstPointSet *in_points, AstPointSet *out_points )
* Class Membership:
* Mapping method.
* Description:
* This function reports the coordinates of a set of points before
* and after being transformed by a Mapping, by writing them to
* standard output.
* Parameters:
* this
* Pointer to the Mapping.
* forward
* A non-zero value indicates that the Mapping's forward
* coordinate transformation has been applied, while a zero
* value indicates the inverse transformation.
* in_points
* Pointer to a PointSet which is associated with the
* coordinates of a set of points before the Mapping was
* applied.
* out_points
* Pointer to a PointSet which is associated with the
* coordinates of the same set of points after the Mapping has
* been applied.
* Notes:
* - This method is provided as a development and debugging aid to
* be invoked when coordinates are transformed by public Mapping
* methods and under control of the "Report" Mapping attribute.
* - Derived clases may over-ride this method in order to change
* the way in which coordinates are formatted, etc.
*-
*/
/* Local Variables: */
double **ptr_in; /* Pointer to array of input data pointers */
double **ptr_out; /* Pointer to array of output data pointers */
int coord; /* Loop counter for coordinates */
int ncoord_in; /* Number of input coordinates per point */
int ncoord_out; /* Number of output coordinates per point */
int npoint; /* Number of points to report */
int npoint_in; /* Number of input points */
int npoint_out; /* Number of output points */
int point; /* Loop counter for points */
/* Check the global error status. */
if ( !astOK ) return;
/* Obtain the numbers of points and coordinates associated with each
PointSet. */
npoint_in = astGetNpoint( in_points );
npoint_out = astGetNpoint( out_points );
ncoord_in = astGetNcoord( in_points );
ncoord_out = astGetNcoord( out_points );
/* Obtain the pointers that give access to the coordinate data
associated with each PointSet. */
ptr_in = astGetPoints( in_points );
ptr_out = astGetPoints( out_points );
/* In the event that both PointSets don't contain equal numbers of
points (this shouldn't actually happen), simply use the minimum
number. */
npoint = ( npoint_in < npoint_out ) ? npoint_in : npoint_out;
/* Loop to report the effect of the Mapping on each point in turn. */
for ( point = 0; point < npoint; point++ ) {
/* Report the input coordinates (in parentheses and separated by
commas). Replace coordinate values of AST__BAD with the string
"<bad>" to indicate missing values. */
printf( "(" );
for ( coord = 0; coord < ncoord_in; coord++ ) {
if ( ptr_in[ coord ][ point ] == AST__BAD ) {
printf( "%s<bad>", coord ? ", " : "" );
} else {
printf( "%s%.*g", coord ? ", " : "",
DBL_DIG, ptr_in[ coord ][ point ] );
}
}
/* Similarly report the output coordinates. */
printf( ") --> (" );
for ( coord = 0; coord < ncoord_out; coord++ ) {
if ( ptr_out[ coord ][ point ] == AST__BAD ) {
printf( "%s<bad>", coord ? ", " : "" );
} else {
printf( "%s%.*g", coord ? ", " : "",
DBL_DIG, ptr_out[ coord ][ point ] );
}
}
printf( ")\n" );
}
}
/*
*++
* Name:
c astResample<X>
f AST_RESAMPLE<X>
* Purpose:
* Resample a region of a data grid.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c int astResample<X>( AstMapping *this, int ndim_in,
c const int lbnd_in[], const int ubnd_in[],
c const <Xtype> in[], const <Xtype> in_var[],
c int interp, void (* finterp)( void ),
c const double params[], int flags,
c double tol, int maxpix,
c <Xtype> badval, int ndim_out,
c const int lbnd_out[], const int ubnd_out[],
c const int lbnd[], const int ubnd[],
c <Xtype> out[], <Xtype> out_var[] );
f RESULT = AST_RESAMPLE<X>( THIS, NDIM_IN, LBND_IN, UBND_IN, IN, IN_VAR,
f INTERP, FINTERP, PARAMS, FLAGS,
f TOL, MAXPIX, BADVAL,
f NDIM_OUT, LBND_OUT, UBND_OUT,
f LBND, UBND, OUT, OUT_VAR, STATUS )
* Class Membership:
* Mapping method.
* Description:
* This is a set of functions for resampling gridded data (e.g. an
* image) under the control of a geometrical transformation, which
* is specified by a Mapping. The functions operate on a pair of
* data grids (input and output), each of which may have any number
* of dimensions. Resampling may be restricted to a specified
* region of the output grid. An associated grid of error estimates
* associated with the input data may also be supplied (in the form
* of variance values), so as to produce error estimates for the
* resampled output data. Propagation of missing data (bad pixels)
* is supported.
*
* You should use a resampling function which matches the numerical
* type of the data you are processing by replacing <X> in
c the generic function name astResample<X> by an appropriate 1- or
f the generic function name AST_RESAMPLE<X> by an appropriate 1- or
* 2-character type code. For example, if you are resampling data
c with type "float", you should use the function astResampleF (see
f with type REAL, you should use the function AST_RESAMPLER (see
* the "Data Type Codes" section below for the codes appropriate to
* other numerical types).
*
* Resampling of the grid of input data is performed by
* transforming the coordinates of the centre of each output grid
* element (or pixel) into the coordinate system of the input grid.
* Since the resulting coordinates will not, in general, coincide
* with the centre of an input pixel, sub-pixel interpolation is
* performed between the neighbouring input pixels. This produces a
* resampled value which is then assigned to the output pixel. A
* choice of sub-pixel interpolation schemes is provided, but you
* may also implement your own.
*
* This algorithm samples the input data value, it does not integrate
* it. Thus total data value in the input image will not, in general,
* be conserved. However, an option is provided (see the "Control Flags"
* section below) which can produce approximate flux conservation by
* scaling the output values using the ratio of the output pixel size
* to the input pixel size. However, if accurate flux conservation is
* important to you, consder using the
c astRebin<X> or astRebinSeq<X> family of functions
f AST_REBIN<X> or AST_REBINSEQ<X> family of routines
* instead.
*
* Output pixel coordinates are transformed into the coordinate
* system of the input grid using the inverse transformation of the
* Mapping which is supplied. This means that geometrical features
* in the input data are subjected to the Mapping's forward
* transformation as they are transferred from the input to the
* output grid (although the Mapping's forward transformation is
* not explicitly used).
*
* In practice, transforming the coordinates of every pixel of a
* large data grid can be time-consuming, especially if the Mapping
* involves complicated functions, such as sky projections. To
* improve performance, it is therefore possible to approximate
* non-linear Mappings by a set of linear transformations which are
* applied piece-wise to separate sub-regions of the data. This
* approximation process is applied automatically by an adaptive
* algorithm, under control of an accuracy criterion which
* expresses the maximum tolerable geometrical distortion which may
* be introduced, as a fraction of a pixel.
*
* This algorithm first attempts to approximate the Mapping with a
* linear transformation applied over the whole region of the
* output grid which is being used. If this proves to be
* insufficiently accurate, the output region is sub-divided into
* two along its largest dimension and the process is repeated
* within each of the resulting sub-regions. This process of
* sub-division continues until a sufficiently good linear
* approximation is found, or the region to which it is being
* applied becomes too small (in which case the original Mapping is
* used directly).
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to a Mapping, whose inverse transformation will be
* used to transform the coordinates of pixels in the output
* grid into the coordinate system of the input grid. This
* yields the positions which are used to obtain resampled
* values by sub-pixel interpolation within the input grid.
*
* The number of input coordinates used by this Mapping (as
* given by its Nin attribute) should match the number of input
c grid dimensions given by the value of "ndim_in"
f grid dimensions given by the value of NDIM_IN
* below. Similarly, the number of output coordinates (Nout
* attribute) should match the number of output grid dimensions
c given by "ndim_out".
f given by NDIM_OUT.
c ndim_in
f NDIM_IN = INTEGER (Given)
* The number of dimensions in the input grid. This should be at
* least one.
c lbnd_in
f LBND_IN( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the centre of the first pixel
* in the input grid along each dimension.
c ubnd_in
f UBND_IN( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the centre of the last pixel in
* the input grid along each dimension.
*
c Note that "lbnd_in" and "ubnd_in" together define the shape
f Note that LBND_IN and UBND_IN together define the shape
* and size of the input grid, its extent along a particular
c (j'th) dimension being ubnd_in[j]-lbnd_in[j]+1 (assuming the
c index "j" to be zero-based). They also define
f (J'th) dimension being UBND_IN(J)-LBND_IN(J)+1. They also define
* the input grid's coordinate system, each pixel having unit
* extent along each dimension with integral coordinate values
* at its centre.
c in
f IN( * ) = <Xtype> (Given)
c Pointer to an array, with one element for each pixel in the
f An array, with one element for each pixel in the
* input grid, containing the input data to be resampled. The
* numerical type of this array should match the 1- or
* 2-character type code appended to the function name (e.g. if
c you are using astResampleF, the type of each array element
c should be "float").
f you are using AST_RESAMPLER, the type of each array element
f should be REAL).
*
* The storage order of data within this array should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
c (i.e. Fortran array indexing is used).
f (i.e. normal Fortran array storage order).
c in_var
f IN_VAR( * ) = <Xtype> (Given)
c An optional pointer to a second array with the same size and
c type as the "in" array. If given, this should contain a set
c of non-negative values which represent estimates of the
c statistical variance associated with each element of the "in"
c array. If this array is supplied (together with the
c corresponding "out_var" array), then estimates of the
c variance of the resampled output data will be calculated.
c
c If no input variance estimates are being provided, a NULL
c pointer should be given.
f An optional second array with the same size and type as the
f IN array. If the AST__USEVAR flag is set via the FLAGS
f argument (below), this array should contain a set of
f non-negative values which represent estimates of the
f statistical variance associated with each element of the IN
f array. Estimates of the variance of the resampled output data
f will then be calculated.
f
f If the AST__USEVAR flag is not set, no input variance
f estimates are required and this array will not be used. A
f dummy (e.g. one-element) array may then be supplied.
c interp
f INTERP = INTEGER (Given)
c This parameter specifies the scheme to be used for sub-pixel
f This argument specifies the scheme to be used for sub-pixel
* interpolation within the input grid. It may be used to select
* from a set of pre-defined schemes by supplying one of the
* values described in the "Sub-Pixel Interpolation Schemes"
* section below. If a value of zero is supplied, then the
* default linear interpolation scheme is used (equivalent to
* supplying the value AST__LINEAR).
*
* Alternatively, you may supply a value which indicates that
c you will provide your own function to perform sub-pixel
c interpolation by means of the "finterp " parameter. Again, see
f you will provide your own routine to perform sub-pixel
f interpolation by means of the FINTERP argument. Again, see
* the "Sub-Pixel Interpolation Schemes" section below for
* details.
c finterp
f FINTERP = SUBROUTINE (Given)
c If the value given for the "interp" parameter indicates that
c you will provide your own function for sub-pixel
c interpolation, then a pointer to that function should be
c given here. For details of the interface which the function
c should have (several are possible, depending on the value of
c "interp"), see the "Sub-Pixel Interpolation Schemes" section
c below.
f If the value given for the INTERP argument indicates that you
f will provide your own routine for sub-pixel interpolation,
f then the name of that routine should be given here (the name
f should also appear in a Fortran EXTERNAL statement in the
f routine which invokes AST_RESAMPLE<X>). For details of the
f interface which the routine should have (several are
f possible, depending on the value of INTERP), see the
f "Sub-Pixel Interpolation Schemes" section below.
*
c If the "interp" parameter has any other value, corresponding
c to one of the pre-defined interpolation schemes, then this
c function will not be used and you may supply a NULL pointer.
f If the INTERP argument has any other value, corresponding to
f one of the pre-defined interpolation schemes, then this
f routine will not be used and you may supply the null routine
f AST_NULL here (note only one underscore). No EXTERNAL
f statement is required for this routine, so long as the AST_PAR
f include file has been used.
c params
f PARAMS( * ) = DOUBLE PRECISION (Given)
c An optional pointer to an array of double which should contain
f An optional array which should contain
* any additional parameter values required by the sub-pixel
* interpolation scheme. If such parameters are required, this
* will be noted in the "Sub-Pixel Interpolation Schemes"
c section below (you may also use this array to pass values
c to your own interpolation function).
f section below (you may also use this array to pass values
f to your own interpolation routine).
*
c If no additional parameters are required, this array is not
c used and a NULL pointer may be given.
f If no additional parameters are required, this array is not
f used. A dummy (e.g. one-element) array may then be supplied.
c flags
f FLAGS = INTEGER (Given)
c The bitwise OR of a set of flag values which may be used to
f The sum of a set of flag values which may be used to
* provide additional control over the resampling operation. See
* the "Control Flags" section below for a description of the
* options available. If no flag values are to be set, a value
* of zero should be given.
c tol
f TOL = DOUBLE PRECISION (Given)
* The maximum tolerable geometrical distortion which may be
* introduced as a result of approximating non-linear Mappings
* by a set of piece-wise linear transformations. This should be
* expressed as a displacement in pixels in the input grid's
* coordinate system.
*
* If piece-wise linear approximation is not required, a value
* of zero may be given. This will ensure that the Mapping is
* used without any approximation, but may increase execution
* time.
c maxpix
f MAXPIX = INTEGER (Given)
* A value which specifies an initial scale size (in pixels) for
* the adaptive algorithm which approximates non-linear Mappings
* with piece-wise linear transformations. Normally, this should
* be a large value (larger than any dimension of the region of
* the output grid being used). In this case, a first attempt to
* approximate the Mapping by a linear transformation will be
* made over the entire output region.
*
* If a smaller value is used, the output region will first be
c divided into sub-regions whose size does not exceed "maxpix"
f divided into sub-regions whose size does not exceed MAXPIX
* pixels in any dimension. Only at this point will attempts at
* approximation commence.
*
* This value may occasionally be useful in preventing false
* convergence of the adaptive algorithm in cases where the
* Mapping appears approximately linear on large scales, but has
* irregularities (e.g. holes) on smaller scales. A value of,
* say, 50 to 100 pixels can also be employed as a safeguard in
* general-purpose software, since the effect on performance is
* minimal.
*
* If too small a value is given, it will have the effect of
* inhibiting linear approximation altogether (equivalent to
c setting "tol" to zero). Although this may degrade
f setting TOL to zero). Although this may degrade
* performance, accurate results will still be obtained.
c badval
f BADVAL = <Xtype> (Given)
* This argument should have the same type as the elements of
c the "in" array. It specifies the value used to flag missing
f the IN array. It specifies the value used to flag missing
* data (bad pixels) in the input and output arrays.
*
c If the AST__USEBAD flag is set via the "flags" parameter,
f If the AST__USEBAD flag is set via the FLAGS argument,
c then this value is used to test for bad pixels in the "in"
c (and "in_var") array(s).
f then this value is used to test for bad pixels in the IN
f (and IN_VAR) array(s).
*
c Unless the AST__NOBAD flag is set via the "flags" parameter,
f Unless the AST__NOBAD flag is set via the FLAGS argument,
* this value is also used to flag any output
c elements in the "out" (and "out_var") array(s) for which
f elements in the OUT (and OUT_VAR) array(s) for which
* resampled values could not be obtained (see the "Propagation
* of Missing Data" section below for details of the
c circumstances under which this may occur). The astResample<X>
f circumstances under which this may occur). The AST_RESAMPLE<X>
* function return value indicates whether any such values have
* been produced. If the AST__NOBAD flag is set. then output array
* elements for which no resampled value could be obtained are
* left set to the value they had on entry to this function.
c ndim_out
f NDIM_OUT = INTEGER (Given)
* The number of dimensions in the output grid. This should be
* at least one. It need not necessarily be equal to the number
* of dimensions in the input grid.
c lbnd_out
f LBND_OUT( NDIM_OUT ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_out" elements,
f An array
* containing the coordinates of the centre of the first pixel
* in the output grid along each dimension.
c ubnd_out
f UBND_OUT( NDIM_OUT ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_out" elements,
f An array
* containing the coordinates of the centre of the last pixel in
* the output grid along each dimension.
*
c Note that "lbnd_out" and "ubnd_out" together define the
f Note that LBND_OUT and UBND_OUT together define the
* shape, size and coordinate system of the output grid in the
c same way as "lbnd_in" and "ubnd_in" define the shape, size
f same way as LBND_IN and UBND_IN define the shape, size
* and coordinate system of the input grid.
c lbnd
f LBND( NDIM_OUT ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_out" elements,
f An array
* containing the coordinates of the first pixel in the region
* of the output grid for which a resampled value is to be
* calculated.
c ubnd
f UBND( NDIM_OUT ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_out" elements,
f An array
* containing the coordinates of the last pixel in the region of
* the output grid for which a resampled value is to be
* calculated.
*
c Note that "lbnd" and "ubnd" together define the shape and
f Note that LBND and UBND together define the shape and
* position of a (hyper-)rectangular region of the output grid
* for which resampled values should be produced. This region
* should lie wholly within the extent of the output grid (as
c defined by the "lbnd_out" and "ubnd_out" arrays). Regions of
f defined by the LBND_OUT and UBND_OUT arrays). Regions of
* the output grid lying outside this region will not be
* modified.
c out
f OUT( * ) = <Xtype> (Returned)
c Pointer to an array, with one element for each pixel in the
f An array, with one element for each pixel in the
* output grid, into which the resampled data values will be
* returned. The numerical type of this array should match that
c of the "in" array, and the data storage order should be such
f of the IN array, and the data storage order should be such
* that the index of the first grid dimension varies most
* rapidly and that of the final dimension least rapidly
c (i.e. Fortran array indexing is used).
f (i.e. normal Fortran array storage order).
c out_var
f OUT_VAR( * ) = <Xtype> (Returned)
c An optional pointer to an array with the same type and size
c as the "out" array. If given, this array will be used to
c return variance estimates for the resampled data values. This
c array will only be used if the "in_var" array has also been
c supplied.
f An optional array with the same type and size as the OUT
f array. If the AST__USEVAR flag is set via the FLAGS argument,
f this array will be used to return variance estimates for the
f resampled data values.
*
* The output variance values will be calculated on the
* assumption that errors on the input data values are
* statistically independent and that their variance estimates
* may simply be summed (with appropriate weighting factors)
* when several input pixels contribute to an output data
* value. If this assumption is not valid, then the output error
* estimates may be biased. In addition, note that the
* statistical errors on neighbouring output data values (as
* well as the estimates of those errors) may often be
* correlated, even if the above assumption about the input data
* is correct, because of the sub-pixel interpolation schemes
* employed.
*
c If no output variance estimates are required, a NULL pointer
c should be given.
f If the AST__USEVAR flag is not set, no output variance
f estimates will be calculated and this array will not be
f used. A dummy (e.g. one-element) array may then be supplied.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Returned Value:
c astResample<X>()
f AST_RESAMPLE<X> = INTEGER
* The number of output pixels for which no valid resampled value
* could be obtained. Thus, in the absence of any error, a returned
* value of zero indicates that all the required output pixels
* received valid resampled data values (and variances). See the
c "badval" and "flags" parameters.
f BADVAL and FLAGS arguments.
* Notes:
* - A value of zero will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
* Data Type Codes:
* To select the appropriate resampling function, you should
c replace <X> in the generic function name astResample<X> with a
f replace <X> in the generic function name AST_RESAMPLE<X> with a
* 1- or 2-character data type code, so as to match the numerical
* type <Xtype> of the data you are processing, as follows:
c - D: double
c - F: float
c - L: long int (may be 32 or 64 bit)
c - K: 64 bit int
c - UL: unsigned long int (may be 32 or 64 bit)
c - UK: unsigned 64 bit int
c - I: int
c - UI: unsigned int
c - S: short int
c - US: unsigned short int
c - B: byte (signed char)
c - UB: unsigned byte (unsigned char)
f - D: DOUBLE PRECISION
f - R: REAL
f - I: INTEGER
f - UI: INTEGER (treated as unsigned)
f - S: INTEGER*2 (short integer)
f - US: INTEGER*2 (short integer, treated as unsigned)
f - B: BYTE (treated as signed)
f - UB: BYTE (treated as unsigned)
*
c For example, astResampleD would be used to process "double"
c data, while astResampleS would be used to process "short int"
c data, etc.
f For example, AST_RESAMPLED would be used to process DOUBLE
f PRECISION data, while AST_RESAMPLES would be used to process
f short integer data (stored in an INTEGER*2 array), etc.
f
f For compatibility with other Starlink facilities, the codes W
f and UW are provided as synonyms for S and US respectively (but
f only in the Fortran interface to AST).
* Sub-Pixel Interpolation Schemes:
* There is no such thing as a perfect sub-pixel interpolation
* scheme and, in practice, all resampling will result in some
* degradation of gridded data. A range of schemes is therefore
* provided, from which you can choose the one which best suits
* your needs.
*
* In general, a balance must be struck between schemes which tend
* to degrade sharp features in the data by smoothing them, and
* those which attempt to preserve sharp features. The latter will
* often tend to introduce unwanted oscillations, typically visible
* as "ringing" around sharp features and edges, especially if the
* data are under-sampled (i.e. if the sharpest features are less
* than about two pixels across). In practice, a good interpolation
* scheme is likely to be a compromise and may exhibit some aspects
* of both these features.
*
* For under-sampled data, some interpolation schemes may appear to
* preserve data resolution because they transform single input
* pixels into single output pixels, rather than spreading their
* data between several output pixels. While this may look
* better cosmetically, it can result in a geometrical shift of
* sharp features in the data. You should beware of this if you
* plan to use such features (e.g.) for image alignment.
*
* The following are two easy-to-use sub-pixel interpolation
* schemes which are generally applicable. They are selected by
c supplying the appropriate value (defined in the "ast.h" header
c file) via the "interp" parameter. In these cases, the "finterp"
c and "params" parameters are not used:
f supplying the appropriate value (defined in the AST_PAR include
f file) via the INTERP argument. In these cases, the FINTERP
f and PARAMS arguments are not used:
*
* - AST__NEAREST: This is the simplest possible scheme, in which
* the value of the input pixel with the nearest centre to the
* interpolation point is used. This is very quick to execute and
* will preserve single-pixel features in the data, but may
* displace them by up to half their width along each dimension. It
* often gives a good cosmetic result, so is useful for quick-look
* processing, but is unsuitable if accurate geometrical
* transformation is required.
* - AST__LINEAR: This is the default scheme, which uses linear
* interpolation between the nearest neighbouring pixels in the
* input grid (there are two neighbours in one dimension, four
* neighbours in two dimensions, eight in three dimensions,
* etc.). It is superior to the nearest-pixel scheme (above) in not
* displacing features in the data, yet it still executes fairly
* rapidly. It is generally a safe choice if you do not have any
* particular reason to favour another scheme, since it cannot
* introduce oscillations. However, it does introduce some spatial
* smoothing which varies according to the distance of the
* interpolation point from the neighbouring pixels. This can
* degrade the shape of sharp features in the data in a
* position-dependent way. It may also show in the output variance
* grid (if used) as a pattern of stripes or fringes.
*
* An alternative set of interpolation schemes is based on forming
* the interpolated value from the weighted sum of a set of
* surrounding pixel values (not necessarily just the nearest
* neighbours). This approach has its origins in the theory of
* digital filtering, in which interpolated values are obtained by
* conceptually passing the sampled data (represented by a grid of
* delta functions) through a linear filter which implements a
* convolution. Because the convolution kernel is continuous, the
* convolution yields a continuous function which may then be
* evaluated at fractional pixel positions. The (possibly
* multi-dimensional) kernel is usually regarded as "separable" and
* formed from the product of a set of identical 1-dimensional
* kernel functions, evaluated along each dimension. Different
* interpolation schemes are then distinguished by the choice of
* this 1-dimensional interpolation kernel. The number of
* surrounding pixels which contribute to the result may also be
* varied.
*
* From a practical standpoint, it is useful to divide the weighted
* sum of pixel values by the sum of the weights when determining
* the interpolated value. Strictly, this means that a true
* convolution is no longer being performed. However, the
* distinction is rarely important in practice because (for
* slightly subtle reasons) the sum of weights is always
* approximately constant for good interpolation kernels. The
* advantage of this technique, which is used here, is that it can
* easily accommodate missing data and tends to minimise unwanted
* oscillations at the edges of the data grid.
*
* In the following schemes, which are based on a 1-dimensional
c interpolation kernel, the first element of the "params" array
f interpolation kernel, the first element of the PARAMS array
* should be used to specify how many pixels are to contribute to the
* interpolated result on either side of the interpolation point in
* each dimension (the nearest integer value is used). Execution time
* increases rapidly with this number. Typically, a value of 2 is
* appropriate and the minimum value used will be 1 (i.e. two pixels
* altogether, one on either side of the interpolation point).
c A value of zero or less may be given for "params[0]"
f A value of zero or less may be given for PARAMS(1)
* to indicate that a suitable number of pixels should be calculated
* automatically.
*
c In each of these cases, the "finterp" parameter is not used:
f In each of these cases, the FINTERP argument is not used:
*
* - AST__GAUSS: This scheme uses a kernel of the form exp(-k*x*x), with
* k a positive constant. The full-width at half-maximum (FWHM) is
* given by
c "params[1]"
f PARAMS(2)
f value, which should be at least 0.1 (in addition, setting PARAMS(1)
* to zero will select the number of contributing pixels so as to utilise
* the width of the kernel out to where the envelope declines to 1% of its
* maximum value). This kernel suppresses noise at the expense of
* smoothing the output array.
* - AST__SINC: This scheme uses a sinc(pi*x) kernel, where x is the
* pixel offset from the interpolation point and sinc(z)=sin(z)/z. This
* sometimes features as an "optimal" interpolation kernel in books on
* image processing. Its supposed optimality depends on the assumption
* that the data are band-limited (i.e. have no spatial frequencies above
* a certain value) and are adequately sampled. In practice, astronomical
* data rarely meet these requirements. In addition, high spatial
* frequencies are often present due (e.g.) to image defects and cosmic
* ray events. Consequently, substantial ringing can be experienced with
* this kernel. The kernel also decays slowly with distance, so that
* many surrounding pixels are required, leading to poor performance.
* Abruptly truncating it, by using only a few neighbouring pixels,
c improves performance and may reduce ringing (if "params[0]" is set to
f improves performance and may reduce ringing (if PARAMS(1) is set to
* zero, then only two pixels will be used on either side). However, a
* more gradual truncation, as implemented by other kernels, is generally
* to be preferred. This kernel is provided mainly so that you can
* convince yourself not to use it!
* - AST__SINCSINC: This scheme uses an improved kernel, of the form
* sinc(pi*x).sinc(k*pi*x), with k a constant, out to the point where
* sinc(k*pi*x) goes to zero, and zero beyond. The second sinc() factor
* provides an "envelope" which gradually rolls off the normal sinc(pi*x)
* kernel at large offsets. The width of this envelope is specified by
* giving the number of pixels offset at which it goes to zero by means
c of the "params[1]" value, which should be at least 1.0 (in addition,
c setting "params[0]" to zero will select the number of contributing
f of the PARAMS(2) value, which should be at least 1.0 (in addition,
f setting PARAMS(1) to zero will select the number of contributing
* pixels so as to utilise the full width of the kernel, out to where it
c reaches zero). The case given by "params[0]=2, params[1]=2" is typically
f reaches zero). The case given by PARAMS(1)=2, PARAMS(2)=2 is typically
* a good choice and is sometimes known as the Lanczos kernel. This is a
* valuable general-purpose interpolation scheme, intermediate in its
* visual effect on images between the AST__NEAREST and AST__LINEAR
* schemes. Although the kernel is slightly oscillatory, ringing is
* adequately suppressed if the data are well sampled.
* - AST__SINCCOS: This scheme uses a kernel of the form
* sinc(pi*x).cos(k*pi*x), with k a constant, out to the point where
* cos(k*pi*x) goes to zero, and zero beyond. As above, the cos() factor
* provides an envelope which gradually rolls off the sinc() kernel
* at large offsets. The width of this envelope is specified by giving
* the number of pixels offset at which it goes to zero by means
c of the "params[1]" value, which should be at least 1.0 (in addition,
c setting "params[0]" to zero will select the number of contributing
f of the PARAMS(2) value, which should be at least 1.0 (in addition,
f setting PARAMS(1) to zero will select the number of contributing
* pixels so as to utilise the full width of the kernel, out to where it
* reaches zero). This scheme gives similar results to the
* AST__SINCSINC scheme, which it resembles.
* - AST__SINCGAUSS: This scheme uses a kernel of the form
* sinc(pi*x).exp(-k*x*x), with k a positive constant. Here, the sinc()
* kernel is rolled off using a Gaussian envelope which is specified by
c giving its full-width at half-maximum (FWHM) by means of the "params[1]"
c value, which should be at least 0.1 (in addition, setting "params[0]"
f giving its full-width at half-maximum (FWHM) by means of the PARAMS(2)
f value, which should be at least 0.1 (in addition, setting PARAMS(1)
* to zero will select the number of contributing pixels so as to utilise
* the width of the kernel out to where the envelope declines to 1% of its
* maximum value). On astronomical images and spectra, good results are
* often obtained by approximately matching the FWHM of the
c envelope function, given by "params[1]", to the point spread function
f envelope function, given by PARAMS(2), to the point spread function
* of the input data. However, there does not seem to be any theoretical
* reason for this.
* - AST__SOMB: This scheme uses a somb(pi*x) kernel (a "sombrero"
* function), where x is the pixel offset from the interpolation point
* and somb(z)=2*J1(z)/z (J1 is a Bessel function of the first kind of
* order 1). It is similar to the AST__SINC kernel, and has the same
* parameter usage.
* - AST__SOMBCOS: This scheme uses a kernel of the form
* somb(pi*x).cos(k*pi*x), with k a constant, out to the point where
* cos(k*pi*x) goes to zero, and zero beyond. It is similar to the
* AST__SINCCOS kernel, and has the same parameter usage.
*
* In addition, the following schemes are provided which are not based
* on a 1-dimensional kernel:
*
* - AST__BLOCKAVE: This scheme simply takes an average of all the
* pixels on the input grid in a cube centred on the interpolation
* point. The number of pixels in the cube is determined by the
c value of the first element of the "params" array, which gives
f value of the first element of the PARAMS array, which gives
* the number of pixels in each dimension on either side of the
c central point. Hence a block of (2 * params[0])^ndim_in
f central point. Hence a block of (2 * PARAMS(1))**NDIM_IN
* pixels in the input grid will be examined to determine the
* value of the output pixel. If the variance is not being used
c (var_in or var_out = NULL) then all valid pixels in this cube
f (USEVAR = .FALSE.) then all valid pixels in this cube
* will be averaged in to the result with equal weight.
* If variances are being used, then each input pixel will be
* weighted proportionally to the reciprocal of its variance; any
* pixel without a valid variance will be discarded. This scheme
* is suitable where the output grid is much coarser than the
* input grid; if the ratio of pixel sizes is R then a suitable
c value of params[0] may be R/2.
f value of PARAMS(1) may be R/2.
*
c Finally, supplying the following values for "interp" allows you
c to implement your own sub-pixel interpolation scheme by means of
c your own function. You should supply a pointer to this function
c via the "finterp" parameter:
f Finally, supplying the following values for INTERP allows you to
f implement your own sub-pixel interpolation scheme by means of
f your own routine. You should supply the name of this routine via
f the FINTERP argument:
*
c - AST__UKERN1: In this scheme, you supply a function to evaluate
c your own 1-dimensional interpolation kernel, which is then used
c to perform sub-pixel interpolation (as described above). The
c function you supply should have the same interface as the
c fictitious astUkern1 function (q.v.). In addition, a value
c should be given via "params[0]" to specify the number of
c neighbouring pixels which are to contribute to each interpolated
c value (in the same way as for the pre-defined interpolation
c schemes described above). Other elements of the "params" array
c are available to pass values to your interpolation function.
f - AST__UKERN1: In this scheme, you supply a routine to evaluate
f your own 1-dimensional interpolation kernel, which is then used
f to perform sub-pixel interpolation (as described above). The
f routine you supply should have the same interface as the
f fictitious AST_UKERN1 routine (q.v.). In addition, a value
f should be given via PARAMS(1) to specify the number of
f neighbouring pixels which are to contribute to each interpolated
f value (in the same way as for the pre-defined interpolation
f schemes described above). Other elements of the PARAMS array
f are available to pass values to your interpolation routine.
*
c - AST__UINTERP: This is a completely general scheme, in which
c your interpolation function has access to all of the input
c data. This allows you to implement any interpolation algorithm
c you choose, which could (for example) be non-linear, or
c adaptive. In this case, the astResample<X> functions play no
c role in the sub-pixel interpolation process and simply handle
c the geometrical transformation of coordinates and other
c housekeeping. The function you supply should have the same
c interface as the fictitious astUinterp function (q.v.). In this
c case, the "params" parameter is not used by astResample<X>, but
c is available to pass values to your interpolation function.
f - AST__UINTERP: This is a completely general scheme, in which
f your interpolation routine has access to all of the input
f data. This allows you to implement any interpolation algorithm
f you choose, which could (for example) be non-linear, or
f adaptive. In this case, the AST_RESAMPLE<X> functions play no
f role in the sub-pixel interpolation process and simply handle
f the geometrical transformation of coordinates and other
f housekeeping. The routine you supply should have the same
f interface as the fictitious AST_UINTERP routine (q.v.). In this
f case, the PARAMS argument is not used by AST_RESAMPLE<X>, but
f is available to pass values to your interpolation routine.
* Control Flags:
c The following flags are defined in the "ast.h" header file and
f The following flags are defined in the AST_PAR include file and
* may be used to provide additional control over the resampling
* process. Having selected a set of flags, you should supply the
c bitwise OR of their values via the "flags" parameter:
f sum of their values via the FLAGS argument:
*
* - AST__NOBAD: Indicates that any output array elements for which no
* resampled value could be obtained should be left set to the value
* they had on entry to this function. If this flag is not supplied,
* such output array elements are set to the value supplied for
c parameter "badval". Note, this flag cannot be used in conjunction
f argument BADVAL. Note, this flag cannot be used in conjunction
* with the AST__CONSERVEFLUX flag (an error will be reported if both
* flags are specified).
* - AST__URESAMP1, 2, 3 & 4: A set of four flags which are
* reserved for your own use. They may be used to pass private
c information to any sub-pixel interpolation function which you
f information to any sub-pixel interpolation routine which you
* implement yourself. They are ignored by all the pre-defined
* interpolation schemes.
* - AST__USEBAD: Indicates that there may be bad pixels in the
* input array(s) which must be recognised by comparing with the
c value given for "badval" and propagated to the output array(s).
f value given for BADVAL and propagated to the output array(s).
* If this flag is not set, all input values are treated literally
c and the "badval" value is only used for flagging output array
f and the BADVAL value is only used for flagging output array
* values.
f - AST__USEVAR: Indicates that variance information should be
f processed in order to provide estimates of the statistical error
f associated with the resampled values. If this flag is not set,
f no variance processing will occur and the IN_VAR and OUT_VAR
f arrays will not be used. (Note that this flag is only available
f in the Fortran interface to AST.)
* - AST__CONSERVEFLUX: Indicates that the output pixel values should
* be scaled in such a way as to preserve (approximately) the total data
* value in a feature on the sky. Without this flag, each output pixel
* value represents an instantaneous sample of the input data values at
* the corresponding input position. This is appropriate if the input
* data represents the spatial density of some quantity (e.g. surface
* brightness in Janskys per square arc-second) because the output
* pixel values will have the same normalisation and units as the
* input pixel values. However, if the input data values represent
* flux (or some other physical quantity) per pixel, then the
* AST__CONSERVEFLUX flag could be used. This causes each output
* pixel value to be scaled by the ratio of the output pixel size to
* the input pixel size.
*
* This flag can only be used if the Mapping is successfully approximated
* by one or more linear transformations. Thus an error will be reported
* if it used when the
c "tol" parameter
f TOL argument
* is set to zero (which stops the use of linear approximations), or
* if the Mapping is too non-linear to be approximated by a piece-wise
* linear transformation. The ratio of output to input pixel size is
* evaluated once for each panel of the piece-wise linear approximation to
* the Mapping, and is assumed to be constant for all output pixels in the
* panel. The scaling factors for adjacent panels will in general
* differ slightly, and so the joints between panels may be visible when
* viewing the output image at high contrast. If this is a problem,
* reduce the value of the
c "tol" parameter
f TOL argument
* until the difference between adjacent panels is sufficiently small
* to be insignificant.
*
* Note, this flag cannot be used in conjunction with the AST__NOBAD
* flag (an error will be reported if both flags are specified).
* Propagation of Missing Data:
* Unless the AST__NOBAD flag is specified, instances of missing data
* (bad pixels) in the output grid are
c identified by occurrences of the "badval" value in the "out"
f identified by occurrences of the BADVAL value in the OUT
* array. These may be produced if any of the following happen:
*
* - The input position (the transformed position of the output
* pixel's centre) lies outside the boundary of the grid of input
* pixels.
* - The input position lies inside the boundary of a bad input
* pixel. In this context, an input pixel is considered bad if its
c data value is equal to "badval" and the AST__USEBAD flag is
c set via the "flags" parameter.
f data value is equal to BADVAL and the AST__USEBAD flag is
f set via the FLAGS argument.
* (Positions which have half-integral coordinate values, and
* therefore lie on a pixel boundary, are regarded as lying within
* the pixel with the larger, i.e. more positive, index.)
* - The set of neighbouring input pixels (excluding those which
* are bad) is unsuitable for calculating an interpolated
* value. Whether this is true may depend on the sub-pixel
* interpolation scheme in use.
* - The interpolated value lies outside the range which can be
c represented using the data type of the "out" array.
f represented using the data type of the OUT array.
*
* In addition, associated output variance estimates (if
c calculated) may be declared bad and flagged with the "badval"
c value in the "out_var" array under any of the following
f calculated) may be declared bad and flagged with the BADVAL
f value in the OUT_VAR array under any of the following
* circumstances:
*
c - The associated resampled data value (in the "out" array) is bad.
f - The associated resampled data value (in the OUT array) is bad.
* - The set of neighbouring input pixels which contributed to the
* output data value do not all have valid variance estimates
* associated with them. In this context, an input variance
* estimate may be regarded as bad either because it has the value
c "badval" (and the AST__USEBAD flag is set), or because it is
f BADVAL (and the AST__USEBAD flag is set), or because it is
* negative.
* - The set of neighbouring input pixels for which valid variance
* values are available is unsuitable for calculating an overall
* variance value. Whether this is true may depend on the sub-pixel
* interpolation scheme in use.
* - The variance value lies outside the range which can be
c represented using the data type of the "out_var" array.
f represented using the data type of the OUT_VAR array.
*
* If the AST__NOBAD flag is specified via
c parameter "flags",
f argument FLAGS,
* then output array elements that would otherwise be set to
c "badval"
f BADVAL
* are instead left holding the value they had on entry to this
* function. The number of such array elements is returned as
* the function value.
*--
*/
/* Define a macro to implement the function for a specific data
type. */
#define MAKE_RESAMPLE(X,Xtype) \
static int Resample##X( AstMapping *this, int ndim_in, \
const int lbnd_in[], const int ubnd_in[], \
const Xtype in[], const Xtype in_var[], \
int interp, void (* finterp)( void ), \
const double params[], int flags, double tol, \
int maxpix, Xtype badval, \
int ndim_out, const int lbnd_out[], \
const int ubnd_out[], const int lbnd[], \
const int ubnd[], Xtype out[], Xtype out_var[], int *status ) { \
\
/* Local Variables: */ \
astDECLARE_GLOBALS /* Thread-specific data */ \
AstMapping *simple; /* Pointer to simplified Mapping */ \
int idim; /* Loop counter for coordinate dimensions */ \
int nin; /* Number of Mapping input coordinates */ \
int nout; /* Number of Mapping output coordinates */ \
int npix; /* Number of pixels in output region */ \
int result; /* Result value to return */ \
int64_t mpix; /* Number of pixels for testing */ \
\
/* Initialise. */ \
result = 0; \
\
/* Check the global error status. */ \
if ( !astOK ) return result; \
\
/* Get a pointer to a structure holding thread-specific global data values */ \
astGET_GLOBALS(this); \
\
/* Obtain values for the Nin and Nout attributes of the Mapping. */ \
nin = astGetNin( this ); \
nout = astGetNout( this ); \
\
/* If OK, check that the number of input grid dimensions matches the \
number required by the Mapping and is at least 1. Report an error \
if necessary. */ \
if ( astOK && ( ( ndim_in != nin ) || ( ndim_in < 1 ) ) ) { \
astError( AST__NGDIN, "astResample"#X"(%s): Bad number of input grid " \
"dimensions (%d).", status, astGetClass( this ), ndim_in ); \
if ( ndim_in != nin ) { \
astError( AST__NGDIN, "The %s given requires %d coordinate value%s " \
"to specify an input position.", status, \
astGetClass( this ), nin, ( nin == 1 ) ? "" : "s" ); \
} \
} \
\
/* If OK, also check that the number of output grid dimensions matches \
the number required by the Mapping and is at least 1. Report an \
error if necessary. */ \
if ( astOK && ( ( ndim_out != nout ) || ( ndim_out < 1 ) ) ) { \
astError( AST__NGDIN, "astResample"#X"(%s): Bad number of output grid " \
"dimensions (%d).", status, astGetClass( this ), ndim_out ); \
if ( ndim_out != nout ) { \
astError( AST__NGDIN, "The %s given generates %s%d coordinate " \
"value%s for each output position.", status, astGetClass( this ), \
( nout < ndim_out ) ? "only " : "", nout, \
( nout == 1 ) ? "" : "s" ); \
} \
} \
\
/* Check that the lower and upper bounds of the input grid are \
consistent. Report an error if any pair is not. Also get the number \
of pixels in the input grid. */ \
mpix = 1; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_in; idim++ ) { \
if ( lbnd_in[ idim ] > ubnd_in[ idim ] ) { \
astError( AST__GBDIN, "astResample"#X"(%s): Lower bound of " \
"input grid (%d) exceeds corresponding upper bound " \
"(%d).", status, astGetClass( this ), \
lbnd_in[ idim ], ubnd_in[ idim ] ); \
astError( AST__GBDIN, "Error in input dimension %d.", status, \
idim + 1 ); \
break; \
} else { \
mpix *= ubnd_in[ idim ] - lbnd_in[ idim ] + 1; \
} \
} \
} \
\
/* Report an error if there are too many pixels in the input. */ \
if ( astOK && (int) mpix != mpix ) { \
astError( AST__EXSPIX, "astResample"#X"(%s): Supplied input array " \
"contains too many pixels (%g): must be fewer than %d.", \
status, astGetClass( this ), (double) mpix, INT_MAX ); \
} \
\
/* Check that the positional accuracy tolerance supplied is valid and \
report an error if necessary. */ \
if ( astOK && ( tol < 0.0 ) ) { \
astError( AST__PATIN, "astResample"#X"(%s): Invalid positional " \
"accuracy tolerance (%.*g pixel).", status, \
astGetClass( this ), DBL_DIG, tol ); \
astError( AST__PATIN, "This value should not be less than zero." , status); \
} \
\
/* Check that the initial scale size in pixels supplied is valid and \
report an error if necessary. */ \
if ( astOK && ( maxpix < 0 ) ) { \
astError( AST__SSPIN, "astResample"#X"(%s): Invalid initial scale " \
"size in pixels (%d).", status, astGetClass( this ), maxpix ); \
astError( AST__SSPIN, "This value should not be less than zero." , status); \
} \
\
/* Check that the lower and upper bounds of the output grid are \
consistent. Report an error if any pair is not. Also get the \
number of pixels in the output array. */ \
mpix = 1; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_out; idim++ ) { \
if ( lbnd_out[ idim ] > ubnd_out[ idim ] ) { \
astError( AST__GBDIN, "astResample"#X"(%s): Lower bound of " \
"output grid (%d) exceeds corresponding upper bound " \
"(%d).", status, astGetClass( this ), \
lbnd_out[ idim ], ubnd_out[ idim ] ); \
astError( AST__GBDIN, "Error in output dimension %d.", status, \
idim + 1 ); \
break; \
} else { \
mpix *= ubnd_out[ idim ] - lbnd_out[ idim ] + 1; \
} \
} \
} \
\
/* Report an error if there are too many pixels in the output. */ \
if ( astOK && (int) mpix != mpix ) { \
astError( AST__EXSPIX, "astResample"#X"(%s): Supplied output array " \
"contains too many pixels (%g): must be fewer than %d.", \
status, astGetClass( this ), (double) mpix, INT_MAX ); \
} \
\
/* Similarly check the bounds of the output region. */ \
mpix = 1; \
if ( astOK ) { \
for ( idim = 0; idim < ndim_out; idim++ ) { \
if ( lbnd[ idim ] > ubnd[ idim ] ) { \
astError( AST__GBDIN, "astResample"#X"(%s): Lower bound of " \
"output region (%d) exceeds corresponding upper " \
"bound (%d).", status, astGetClass( this ), \
lbnd[ idim ], ubnd[ idim ] ); \
\
/* Also check that the output region lies wholly within the output \
grid. */ \
} else if ( lbnd[ idim ] < lbnd_out[ idim ] ) { \
astError( AST__GBDIN, "astResample"#X"(%s): Lower bound of " \
"output region (%d) is less than corresponding " \
"bound of output grid (%d).", status, astGetClass( this ), \
lbnd[ idim ], lbnd_out[ idim ] ); \
} else if ( ubnd[ idim ] > ubnd_out[ idim ] ) { \
astError( AST__GBDIN, "astResample"#X"(%s): Upper bound of " \
"output region (%d) exceeds corresponding " \
"bound of output grid (%d).", status, astGetClass( this ), \
ubnd[ idim ], ubnd_out[ idim ] ); \
} else { \
mpix *= ubnd[ idim ] - lbnd[ idim ] + 1; \
} \
\
/* Say which dimension produced the error. */ \
if ( !astOK ) { \
astError( AST__GBDIN, "Error in output dimension %d.", status, \
idim + 1 ); \
break; \
} \
} \
} \
\
/* Report an error if there are too many pixels in the output region. */ \
if ( astOK && (int) mpix != mpix ) { \
astError( AST__EXSPIX, "astResample"#X"(%s): Supplied output region " \
"contains too many pixels (%g): must be fewer than %d.", \
status, astGetClass( this ), (double) mpix, INT_MAX ); \
} \
\
/* If we are conserving flux, check "tol" is not zero. */ \
if( ( flags & AST__CONSERVEFLUX ) && astOK ) { \
if( tol == 0.0 ) { \
astError( AST__CNFLX, "astResample"#X"(%s): Flux conservation was " \
"requested but cannot be performed because zero tolerance " \
"was also specified.", status, astGetClass( this ) ); \
\
/* Also check "nin" and "nout" are equal. */ \
} else if( nin != nout ) { \
astError( AST__CNFLX, "astResample"#X"(%s): Flux conservation was " \
"requested but cannot be performed because the Mapping " \
"has different numbers of inputs and outputs.", status, \
astGetClass( this ) ); \
} \
} \
\
/* If OK, loop to determine how many pixels require resampled values. */ \
simple = NULL; \
if ( astOK ) { \
npix = 1; \
for ( idim = 0; idim < ndim_out; idim++ ) { \
npix *= ubnd[ idim ] - lbnd[ idim ] + 1; \
} \
\
/* If there are sufficient pixels to make it worthwhile, simplify the \
Mapping supplied to improve performance. Otherwise, just clone the \
Mapping pointer. Note we save a pointer to the original Mapping so \
that lower-level functions can use it if they need to report an \
error. */ \
unsimplified_mapping = this; \
if ( npix > 1024 ) { \
simple = astSimplify( this ); \
} else { \
simple = astClone( this ); \
} \
} \
\
/* Report an error if the inverse transformation of this simplified \
Mapping is not defined. */ \
if ( !astGetTranInverse( simple ) && astOK ) { \
astError( AST__TRNND, "astResample"#X"(%s): An inverse coordinate " \
"transformation is not defined by the %s supplied.", status, \
astGetClass( unsimplified_mapping ), \
astGetClass( unsimplified_mapping ) ); \
} \
\
/* Perform the resampling. Note that we pass all gridded data, the \
interpolation function and the bad pixel value by means of pointer \
types that obscure the underlying data type. This is to avoid \
having to replicate functions unnecessarily for each data \
type. However, we also pass an argument that identifies the data \
type we have obscured. */ \
result = ResampleAdaptively( simple, ndim_in, lbnd_in, ubnd_in, \
(const void *) in, (const void *) in_var, \
TYPE_##X, interp, finterp, \
params, flags, tol, maxpix, \
(const void *) &badval, \
ndim_out, lbnd_out, ubnd_out, \
lbnd, ubnd, \
(void *) out, (void *) out_var, status ); \
\
/* Annul the pointer to the simplified/cloned Mapping. */ \
simple = astAnnul( simple ); \
\
/* If an error occurred, clear the returned result. */ \
if ( !astOK ) result = 0; \
\
/* Return the result. */ \
return result; \
}
/* Expand the above macro to generate a function for each required
data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_RESAMPLE(LD,long double)
#endif
MAKE_RESAMPLE(D,double)
MAKE_RESAMPLE(F,float)
MAKE_RESAMPLE(L,long int)
MAKE_RESAMPLE(UL,unsigned long int)
MAKE_RESAMPLE(K,INT_BIG)
MAKE_RESAMPLE(UK,UINT_BIG)
MAKE_RESAMPLE(I,int)
MAKE_RESAMPLE(UI,unsigned int)
MAKE_RESAMPLE(S,short int)
MAKE_RESAMPLE(US,unsigned short int)
MAKE_RESAMPLE(B,signed char)
MAKE_RESAMPLE(UB,unsigned char)
/* Undefine the macro. */
#undef MAKE_RESAMPLE
static int ResampleAdaptively( AstMapping *this, int ndim_in,
const int *lbnd_in, const int *ubnd_in,
const void *in, const void *in_var,
DataType type, int interp, void (* finterp)( void ),
const double *params, int flags, double tol,
int maxpix, const void *badval_ptr,
int ndim_out, const int *lbnd_out,
const int *ubnd_out, const int *lbnd,
const int *ubnd, void *out, void *out_var, int *status ) {
/*
* Name:
* ResampleAdaptively
* Purpose:
* Resample a section of a data grid adaptively.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int ResampleAdaptively( AstMapping *this, int ndim_in,
* const int *lbnd_in, const int *ubnd_in,
* const void *in, const void *in_var,
* DataType type, int interp, void (* finterp)( void ),
* const double *params, int flags, double tol,
* int maxpix, const void *badval_ptr,
* int ndim_out, const int *lbnd_out,
* const int *ubnd_out, const int *lbnd,
* const int *ubnd, void *out, void *out_var )
* Class Membership:
* Mapping member function.
* Description:
* This function resamples a rectangular grid of data (with any
* number of dimensions) into a specified section of another
* rectangular grid (with a possibly different number of
* dimensions). The coordinate transformation used to convert
* output pixel coordinates into positions in the input grid is
* given by the inverse transformation of the Mapping which is
* supplied. Any pixel interpolation scheme may be specified for
* interpolating between the pixels of the input grid.
*
* This function is very similar to ResampleWithBlocking and
* ResampleSection which lie below it in the calling
* hierarchy. However, this function also attempts to adapt to the
* Mapping supplied and to sub-divide the section being resampled
* into smaller sections within which a linear approximation to the
* Mapping may be used. This reduces the number of Mapping
* evaluations, thereby improving efficiency particularly when
* complicated Mappings are involved.
* Parameters:
* this
* Pointer to a Mapping, whose inverse transformation may be
* used to transform the coordinates of pixels in the output
* grid into associated positions in the input grid, from which
* the output pixel values should be derived (by interpolation
* if necessary).
*
* The number of input coordintes for the Mapping (Nin
* attribute) should match the value of "ndim_in" (below), and
* the number of output coordinates (Nout attribute) should
* match the value of "ndim_out".
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input data grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input data grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input data grid, its extent along a
* particular (i'th) dimension being (ubnd_in[i] - lbnd_in[i] +
* 1). They also define the input grid's coordinate system, with
* each pixel being of unit extent along each dimension with
* integral coordinate values at its centre.
* in
* Pointer to the input array of data to be resampled (with one
* element for each pixel in the input grid). The numerical type
* of these data should match the "type" value (below). The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and data type as the "in" array),
* which represent estimates of the statistical variance
* associated with each element of the "in" array. If this
* second array is given (along with the corresponding "out_var"
* array), then estimates of the variance of the resampled data
* will also be returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* type
* A value taken from the "DataType" enum, which specifies the
* data type of the input and output arrays containing the
* gridded data (and variance) values.
* interp
* A value selected from a set of pre-defined macros to identify
* which sub-pixel interpolation algorithm should be used.
* finterp
* If "interp" is set to a value which requires a user-supplied
* function, then a pointer to that function shoild be given
* here. Otherwise, this value is not used and may be a NULL
* pointer.
* params
* Pointer to an optional array of parameters that may be passed
* to the interpolation algorithm, if required. If no parameters
* are required, a NULL pointer should be supplied.
* flags
* The bitwise OR of a set of flag values which provide
* additional control over the resampling operation.
* tol
* The maximum permitted positional error in transforming output
* pixel positions into the input grid in order to resample
* it. This should be expressed as a displacement in pixels in
* the input grid's coordinate system. If the Mapping's inverse
* transformation can be approximated by piecewise linear
* functions to this accuracy, then such functions may be used
* instead of the Mapping in order to improve
* performance. Otherwise, every output pixel position will be
* transformed individually using the Mapping.
*
* If linear approximation is not required, a "tol" value of
* zero may be given. This will ensure that the Mapping is used
* without any approximation.
* maxpix
* A value which specifies the largest scale size on which to
* search for non-linearities in the Mapping supplied. This
* value should be expressed as a number of pixels in the output
* grid. The function will break the output section specified
* into smaller sub-sections (if necessary), each no larger than
* "maxpix" pixels in any dimension, before it attempts to
* approximate the Mapping by a linear function over each
* sub-section.
*
* If the value given is larger than the largest dimension of
* the output section (the normal recommendation), the function
* will initially search for non-linearity on a scale determined
* by the size of the output section. This is almost always
* satisfactory. Very occasionally, however, a Mapping may
* appear linear on this scale but nevertheless have smaller
* irregularities (e.g. "holes") in it. In such cases, "maxpix"
* may be set to a suitably smaller value so as to ensure this
* non-linearity is not overlooked. Typically, a value of 50 to
* 100 pixels might be suitable and should have little effect on
* performance.
*
* If too small a value is given, however, it will have the
* effect of preventing linear approximation occurring at all
* (equivalent to setting "tol" to zero). Although this may
* degrade performance, accurate results will still be obtained.
* badval_ptr
* If the AST__USEBAD flag is set (above), this parameter is a
* pointer to a value which is used to identify bad data and/or
* variance values in the input array(s). The referenced value's
* data type must match that of the "in" (and "in_var")
* arrays. Unless the AST__NOBAD flag is set, the same value will
* also be used to flag any output array elements for which
* resampled values could not be obtained. The output arrays(s)
* may be flagged with this value whether or not the AST__USEBAD
* flag is set (the function return value indicates whether any
* such values have been produced).
* ndim_out
* The number of dimensions in the output grid. This should be
* at least one.
* lbnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the first
* pixel in the output data grid along each dimension.
* ubnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the last
* pixel in the output data grid along each dimension.
*
* Note that "lbnd_out" and "ubnd_out" together define the shape
* and size of the output data grid in the same way as "lbnd_in"
* and "ubnd_in" define the shape and size of the input grid
* (see above).
* lbnd
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the first pixel in the
* section of the output data grid for which a value is
* required.
* ubnd
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the last pixel in the
* section of the output data grid for which a value is
* required.
*
* Note that "lbnd" and "ubnd" define the shape and position of
* the section of the output grid for which resampled values are
* required. This section should lie wholly within the extent of
* the output grid (as defined by the "lbnd_out" and "ubnd_out"
* arrays). Regions of the output grid lying outside this section
* will not be modified.
* out
* Pointer to an array with the same data type as the "in"
* array, into which the resampled data will be returned. The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the resampled values may be returned. This array will only be
* used if the "in_var" array has been given.
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* Returned Value:
* The number of output grid points for which no valid output value
* could be obtained.
* Notes:
* - A value of zero will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*/
/* Local Variables: */
double *flbnd; /* Array holding floating point lower bounds */
double *fubnd; /* Array holding floating point upper bounds */
double *linear_fit; /* Pointer to array of fit coefficients */
int *hi; /* Pointer to array of section upper bounds */
int *lo; /* Pointer to array of section lower bounds */
int coord_out; /* Loop counter for output coordinates */
int dim; /* Output section dimension size */
int dimx; /* Dimension with maximum section extent */
int divide; /* Sub-divide the output section? */
int i; /* Loop count */
int isLinear; /* Is the transformation linear? */
int mxdim; /* Largest output section dimension size */
int npix; /* Number of pixels in output section */
int npoint; /* Number of points for obtaining a fit */
int nvertex; /* Number of vertices of output section */
int result; /* Result value to return */
int toobig; /* Section too big (must sub-divide)? */
int toosmall; /* Section too small to sub-divide? */
/* Initialise. */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Further initialisation. */
npix = 1;
mxdim = 0;
dimx = 1;
nvertex = 1;
/* Loop through the output grid dimensions. */
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
/* Obtain the extent in each dimension of the output section which is
to receive resampled values, and calculate the total number of
pixels it contains. */
dim = ubnd[ coord_out ] - lbnd[ coord_out ] + 1;
npix *= dim;
/* Find the maximum dimension size of this output section and note
which dimension has this size. */
if ( dim > mxdim ) {
mxdim = dim;
dimx = coord_out;
}
/* Calculate how many vertices the output section has. */
nvertex *= 2;
}
/* Calculate how many sample points will be needed (by the
astLinearApprox function) to obtain a linear fit to the Mapping's
inverse transformation. */
npoint = 1 + 4 * ndim_out + 2 * nvertex;
/* If the number of pixels in the output section is not at least 4
times this number, we will probably not save significant time by
attempting to obtain a linear fit, so note that the output section
is too small. */
toosmall = ( npix < ( 4 * npoint ) );
/* Note if the maximum dimension of the output section exceeds the
user-supplied scale factor. */
toobig = ( maxpix < mxdim );
/* Assume the Mapping is significantly non-linear before deciding
whether to sub-divide the output section. */
linear_fit = NULL;
/* If the output section is too small to be worth obtaining a linear
fit, or if the accuracy tolerance is zero, we will not
sub-divide. This means that the Mapping will be used to transform
each pixel's coordinates and no linear approximation will be
used. */
if ( toosmall || ( tol == 0.0 ) ) {
divide = 0;
/* Otherwise, if the largest output section dimension exceeds the
scale length given, we will sub-divide. This offers the possibility
of obtaining a linear approximation to the Mapping over a reduced
range of output coordinates (which will be handled by a recursive
invocation of this function). */
} else if ( toobig ) {
divide = 1;
/* If neither of the above apply, then attempt to fit a linear
approximation to the Mapping's inverse transformation over the
range of coordinates covered by the output section. We need to
temporarily copy the integer bounds into floating point arrays to
use astLinearApprox. */
} else {
/* Allocate memory for floating point bounds and for the coefficient array */
flbnd = astMalloc( sizeof( double )*(size_t) ndim_out );
fubnd = astMalloc( sizeof( double )*(size_t) ndim_out );
linear_fit = astMalloc( sizeof( double )*
(size_t) ( ndim_in*( ndim_out + 1 ) ) );
if( astOK ) {
/* Copy the bounds into these arrays, and change them so that they refer
to the lower and upper edges of the cell rather than the centre. This
is essential if one of the axes is spanned by a single cell, since
otherwise the upper and lower bounds would be identical. */
for( i = 0; i < ndim_out; i++ ) {
flbnd[ i ] = (double) lbnd[ i ] - 0.5;
fubnd[ i ] = (double) ubnd[ i ] + 0.5;
}
/* Get the linear approximation to the inverse transformation. The
astLinearApprox function fits the forward transformation so temporarily
invert the Mapping in order to get a fit to the inverse transformation. */
astInvert( this );
isLinear = astLinearApprox( this, flbnd, fubnd, tol, linear_fit );
astInvert( this );
/* Free the coeff array if the inverse transformation is not linear. */
if( !isLinear ) linear_fit = astFree( linear_fit );
} else {
linear_fit = astFree( linear_fit );
}
/* Free resources */
flbnd = astFree( flbnd );
fubnd = astFree( fubnd );
/* If a linear fit was obtained, we will use it and therefore do not
wish to sub-divide further. Otherwise, we sub-divide in the hope
that this may result in a linear fit next time. */
divide = !linear_fit;
}
/* If no sub-division is required, perform resampling (in a
memory-efficient manner, since the section we are resampling might
still be very large). This will use the linear fit, if obtained
above. */
if ( astOK ) {
if ( !divide ) {
result = ResampleWithBlocking( this, linear_fit,
ndim_in, lbnd_in, ubnd_in,
in, in_var, type, interp, finterp,
params, flags, badval_ptr,
ndim_out, lbnd_out, ubnd_out,
lbnd, ubnd, out, out_var, status );
/* Otherwise, allocate workspace to perform the sub-division. */
} else {
lo = astMalloc( sizeof( int ) * (size_t) ndim_out );
hi = astMalloc( sizeof( int ) * (size_t) ndim_out );
if ( astOK ) {
/* Initialise the bounds of a new output section to match the original
output section. */
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
lo[ coord_out ] = lbnd[ coord_out ];
hi[ coord_out ] = ubnd[ coord_out ];
}
/* Replace the upper bound of the section's largest dimension with the
mid-point of the section along this dimension, rounded
downwards. */
hi[ dimx ] =
(int) floor( 0.5 * (double) ( lbnd[ dimx ] + ubnd[ dimx ] ) );
/* Resample the resulting smaller section using a recursive invocation
of this function. */
result = ResampleAdaptively( this, ndim_in, lbnd_in, ubnd_in,
in, in_var, type, interp, finterp,
params, flags, tol, maxpix,
badval_ptr, ndim_out,
lbnd_out, ubnd_out,
lo, hi, out, out_var, status );
/* Now set up a second section which covers the remaining half of the
original output section. */
lo[ dimx ] = hi[ dimx ] + 1;
hi[ dimx ] = ubnd[ dimx ];
/* If this section contains pixels, resample it in the same way,
summing the returned values. */
if ( lo[ dimx ] <= hi[ dimx ] ) {
result += ResampleAdaptively( this, ndim_in, lbnd_in, ubnd_in,
in, in_var, type, interp, finterp,
params, flags, tol, maxpix,
badval_ptr, ndim_out,
lbnd_out, ubnd_out,
lo, hi, out, out_var, status );
}
}
/* Free the workspace. */
lo = astFree( lo );
hi = astFree( hi );
}
}
/* If coefficients for a linear fit were obtained, then free the space
they occupy. */
if ( linear_fit ) linear_fit = astFree( linear_fit );
/* If an error occurred, clear the returned result. */
if ( !astOK ) result = 0;
/* Return the result. */
return result;
}
static int ResampleSection( AstMapping *this, const double *linear_fit,
int ndim_in,
const int *lbnd_in, const int *ubnd_in,
const void *in, const void *in_var,
DataType type, int interp, void (* finterp)( void ),
const double *params, double factor, int flags,
const void *badval_ptr, int ndim_out,
const int *lbnd_out, const int *ubnd_out,
const int *lbnd, const int *ubnd,
void *out, void *out_var, int *status ) {
/*
* Name:
* ResampleSection
* Purpose:
* Resample a section of a data grid.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int ResampleSection( AstMapping *this, const double *linear_fit,
* int ndim_in, const int *lbnd_in, const int *ubnd_in,
* const void *in, const void *in_var,
* DataType type, int interp, void (* finterp)( void ),
* const double *params, double factor, int flags,
* const void *badval_ptr, int ndim_out,
* const int *lbnd_out, const int *ubnd_out,
* const int *lbnd, const int *ubnd,
* void *out, void *out_var )
* Class Membership:
* Mapping member function.
* Description:
* This function resamples a rectangular grid of data (with any
* number of dimensions) into a specified section of another
* rectangular grid (with a possibly different number of
* dimensions). The coordinate transformation used is given by the
* inverse transformation of the Mapping which is supplied or,
* alternatively, by a linear approximation fitted to a Mapping's
* inverse transformation. Any pixel interpolation scheme may be
* specified for interpolating between the pixels of the input
* grid.
* Parameters:
* this
* Pointer to a Mapping, whose inverse transformation may be
* used to transform the coordinates of pixels in the output
* grid into associated positions in the input grid, from which
* the output pixel values should be derived (by interpolation
* if necessary).
*
* The number of input coordintes for the Mapping (Nin
* attribute) should match the value of "ndim_in" (below), and
* the number of output coordinates (Nout attribute) should
* match the value of "ndim_out".
* linear_fit
* Pointer to an optional array of double which contains the
* coefficients of a linear fit which approximates the above
* Mapping's inverse coordinate transformation. If this is
* supplied, it will be used in preference to the above Mapping
* when transforming coordinates. This may be used to enhance
* performance in cases where evaluation of the Mapping's
* inverse transformation is expensive. If no linear fit is
* available, a NULL pointer should be supplied.
*
* The way in which the fit coefficients are stored in this
* array and the number of array elements are as defined by the
* astLinearApprox function.
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input data grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input data grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input data grid, its extent along a
* particular (i'th) dimension being (ubnd_in[i] - lbnd_in[i] +
* 1). They also define the input grid's coordinate system, with
* each pixel being of unit extent along each dimension with
* integral coordinate values at its centre.
* in
* Pointer to the input array of data to be resampled (with one
* element for each pixel in the input grid). The numerical type
* of these data should match the "type" value (below). The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and data type as the "in" array),
* which represent estimates of the statistical variance
* associated with each element of the "in" array. If this
* second array is given (along with the corresponding "out_var"
* array), then estimates of the variance of the resampled data
* will also be returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* type
* A value taken from the "DataType" enum, which specifies the
* data type of the input and output arrays containing the
* gridded data (and variance) values.
* interp
* A value selected from a set of pre-defined macros to identify
* which sub-pixel interpolation algorithm should be used.
* finterp
* If "interp" is set to a value which requires a user-supplied
* function, then a pointer to that function shoild be given
* here. Otherwise, this value is not used and may be a NULL
* pointer.
* params
* Pointer to an optional array of parameters that may be passed
* to the interpolation algorithm, if required. If no parameters
* are required, a NULL pointer should be supplied.
* factor
* A factor by which to scale the resampled output data values before
* returning them. If flux is being conserved this should be set to
* the ratio of the output pixel size to the input pixel size in the
* section. Otherwise it should be set to 1.0.
* flags
* The bitwise OR of a set of flag values which provide
* additional control over the resampling operation.
* badval_ptr
* If the AST__USEBAD flag is set (above), this parameter is a
* pointer to a value which is used to identify bad data and/or
* variance values in the input array(s). The referenced value's
* data type must match that of the "in" (and "in_var")
* arrays. Unless the AST__NOBAD flag is set, the same value will
* also be used to flag any output array elements for which
* resampled values could not be obtained. The output arrays(s)
* may be flagged with this value whether or not the AST__USEBAD
* flag is set (the function return value indicates whether any
* such values have been produced).
* ndim_out
* The number of dimensions in the output grid. This should be
* at least one.
* lbnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the first
* pixel in the output data grid along each dimension.
* ubnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the last
* pixel in the output data grid along each dimension.
*
* Note that "lbnd_out" and "ubnd_out" together define the shape
* and size of the output data grid in the same way as "lbnd_in"
* and "ubnd_in" define the shape and size of the input grid
* (see above).
* lbnd
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the first pixel in the
* section of the output data grid for which a value is
* required.
* ubnd
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the last pixel in the
* section of the output data grid for which a value is
* required.
*
* Note that "lbnd" and "ubnd" define the shape and position of
* the section of the output grid for which resampled values are
* required. This section should lie wholly within the extent of
* the output grid (as defined by the "lbnd_out" and "ubnd_out"
* arrays). Regions of the output grid lying outside this section
* will not be modified.
* out
* Pointer to an array with the same data type as the "in"
* array, into which the resampled data will be returned. The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the resampled values may be returned. This array will only be
* used if the "in_var" array has been given.
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* Returned Value:
* The number of output grid points for which no valid output value
* could be obtained.
* Notes:
* - This function does not take steps to limit memory usage if the
* grids supplied are large. To resample large grids in a more
* memory-efficient way, the ResampleWithBlocking function should
* be used.
* - A value of zero will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*/
/* Local Variables: */
astDECLARE_GLOBALS /* Thread-specific data */
AstPointSet *pset_in; /* Input PointSet for transformation */
AstPointSet *pset_out; /* Output PointSet for transformation */
const double *grad; /* Pointer to gradient matrix of linear fit */
const double *par; /* Pointer to parameter array */
const double *zero; /* Pointer to zero point array of fit */
double **ptr_in; /* Pointer to input PointSet coordinates */
double **ptr_out; /* Pointer to output PointSet coordinates */
double *accum; /* Pointer to array of accumulated sums */
double fwhm; /* Full width half max. of gaussian */
double lpar[ 1 ]; /* Local parameter array */
double x1; /* Interim x coordinate value */
double y1; /* Interim y coordinate value */
int *dim; /* Pointer to array of output pixel indices */
int *offset; /* Pointer to array of output pixel offsets */
int *stride; /* Pointer to array of output grid strides */
int conserve; /* Conserve flux? */
int coord_in; /* Loop counter for input dimensions */
int coord_out; /* Loop counter for output dimensions */
int done; /* All pixel indices done? */
int i1; /* Interim offset into "accum" array */
int i2; /* Final offset into "accum" array */
int idim; /* Loop counter for dimensions */
int ix; /* Loop counter for output x coordinate */
int iy; /* Loop counter for output y coordinate */
int nbad; /* Number of pixels assigned a bad value */
int neighb; /* Number of neighbouring pixels */
int npoint; /* Number of output points (pixels) */
int off1; /* Interim pixel offset into output array */
int off; /* Final pixel offset into output array */
int point; /* Counter for output points (pixels ) */
int result; /* Result value to be returned */
int s; /* Temporary variable for strides */
int usevar; /* Process variance array? */
void (* gifunc)( void ); /* General interpolation function */
void (* kernel)( double, const double [], int, double *, int * ); /* Kernel fn. */
void (* fkernel)( double, const double [], int, double * ); /* User kernel fn. */
/* Initialise. */
result = 0;
/* Get a pointer to a structure holding thread-specific global data values */
astGET_GLOBALS(this);
/* Check the global error status. */
if ( !astOK ) return result;
/* Further initialisation. */
pset_in = NULL;
ptr_in = NULL;
neighb = 0;
gifunc = NULL;
kernel = NULL;
fkernel = NULL;
/* See if we are conserving flux */
conserve = flags & AST__CONSERVEFLUX;
/* If we are conserving flux, then we need some way to tell which output
array elements have been assigned a value and which have not. If the
AST__NOBAD flag has been specified then this is not possible to report
an error. */
if( ( flags & AST__NOBAD ) && conserve ) {
astError( AST__BADFLG, "astResample: Cannot use the AST__NOBAD and "
"AST__CONSERVEFLUX flags together (programming error)." , status);
}
/* Calculate the number of output points, as given by the product of
the output grid dimensions. */
for ( npoint = 1, coord_out = 0; coord_out < ndim_out; coord_out++ ) {
npoint *= ubnd[ coord_out ] - lbnd[ coord_out ] + 1;
}
/* Allocate workspace. */
offset = astMalloc( sizeof( int ) * (size_t) npoint );
stride = astMalloc( sizeof( int ) * (size_t) ndim_out );
if ( astOK ) {
/* Calculate the stride for each output grid dimension. */
off = 0;
s = 1;
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
stride[ coord_out ] = s;
s *= ubnd_out[ coord_out ] - lbnd_out[ coord_out ] + 1;
}
/* A linear fit to the Mapping is available. */
/* ========================================= */
if ( linear_fit ) {
/* If a linear fit to the Mapping has been provided, then obtain
pointers to the array of gradients and zero-points comprising the
fit. */
grad = linear_fit + ndim_in;
zero = linear_fit;
/* Create a PointSet to hold the input grid coordinates and obtain an
array of pointers to its coordinate data. */
pset_in = astPointSet( npoint, ndim_in, "", status );
ptr_in = astGetPoints( pset_in );
if ( astOK ) {
/* Initialise the count of output points. */
point = 0;
/* Handle the 1-dimensional case optimally. */
/* ---------------------------------------- */
if ( ( ndim_in == 1 ) && ( ndim_out == 1 ) ) {
/* Loop through the pixels of the output grid and transform their x
coordinates into the input grid's coordinate system using the
linear fit supplied. Store the results in the PointSet created
above. */
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_in[ 0 ][ point ] = zero[ 0 ] + grad[ 0 ] * (double) ix;
/* Calculate the offset of each pixel within the output array. */
offset[ point ] = ix - lbnd_out[ 0 ];
point++;
}
/* Handle the 2-dimensional case optimally. */
/* ---------------------------------------- */
} else if ( ( ndim_in == 2 ) && ( ndim_out == 2 ) ) {
/* Loop through the range of y coordinates in the output grid and
calculate interim values of the input coordinates using the linear
fit supplied. */
for ( iy = lbnd[ 1 ]; iy <= ubnd[ 1 ]; iy++ ) {
x1 = zero[ 0 ] + grad[ 1 ] * (double) iy;
y1 = zero[ 1 ] + grad[ 3 ] * (double) iy;
/* Also calculate an interim pixel offset into the output array. */
off1 = stride[ 1 ] * ( iy - lbnd_out[ 1 ] ) - lbnd_out[ 0 ];
/* Now loop through the range of output x coordinates and calculate
the final values of the input coordinates, storing the results in
the PointSet created above. */
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_in[ 0 ][ point ] = x1 + grad[ 0 ] * (double) ix;
ptr_in[ 1 ][ point ] = y1 + grad[ 2 ] * (double) ix;
/* Also calculate final pixel offsets into the output array. */
offset[ point ] = off1 + ix;
point++;
}
}
/* Handle other numbers of dimensions. */
/* ----------------------------------- */
} else {
/* Allocate workspace. */
accum = astMalloc( sizeof( double ) *
(size_t) ( ndim_in * ndim_out ) );
dim = astMalloc( sizeof( int ) * (size_t) ndim_out );
if ( astOK ) {
/* Initialise an array of pixel indices for the output grid which
refer to the first pixel for which we require a value. Also
calculate the offset of this pixel within the output array. */
off = 0;
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
dim[ coord_out ] = lbnd[ coord_out ];
off += stride[ coord_out ] *
( dim[ coord_out ] - lbnd_out[ coord_out ] );
}
/* To calculate each input grid coordinate we must perform a matrix
multiply on the output grid coordinates (using the gradient matrix)
and then add the zero points. However, since we will usually only
be altering one output coordinate at a time (the least
significant), we can avoid the full matrix multiply by accumulating
partial sums for the most significant output coordinates and only
altering those sums which need to change each time. The zero points
never change, so we first fill the "most significant" end of the
"accum" array with these. */
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
accum[ ( coord_in + 1 ) * ndim_out - 1 ] =
zero[ coord_in ];
}
coord_out = ndim_out - 1;
/* Now loop to process each output pixel. */
for ( done = 0; !done; point++ ) {
/* To generate the input coordinate that corresponds to the current
output pixel, we work down from the most significant dimension
whose index has changed since the previous pixel we considered
(given by "coord_out"). For each affected dimension, we accumulate
in "accum" the matrix sum (including the zero point) for that
dimension and all higher output dimensions. We must accumulate a
separate set of sums for each input coordinate we wish to
produce. (Note that for the first pixel we process, all dimensions
are considered "changed", so we start by initialising the whole
"accum" array.) */
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
i1 = coord_in * ndim_out;
for ( idim = coord_out; idim >= 1; idim-- ) {
i2 = i1 + idim;
accum[ i2 - 1 ] = accum[ i2 ] +
dim[ idim ] * grad[ i2 ];
}
/* The input coordinate for each dimension is given by the accumulated
sum for output dimension zero (giving the sum over all output
dimensions). We do not store this in the "accum" array, but assign
the result directly to the coordinate array of the PointSet created
earlier. */
ptr_in[ coord_in ][ point ] = accum[ i1 ] +
dim[ 0 ] * grad[ i1 ];
}
/* Store the offset of the current pixel in the output array. */
offset[ point ] = off;
/* Now update the array of pixel indices to refer to the next output
pixel. */
coord_out = 0;
do {
/* The least significant index which currently has less than its
maximum value is incremented by one. The offset into the output
array is updated accordingly. */
if ( dim[ coord_out ] < ubnd[ coord_out ] ) {
dim[ coord_out ]++;
off += stride[ coord_out ];
break;
/* Any less significant indices which have reached their maximum value
are returned to their minimum value and the output pixel offset is
decremented appropriately. */
} else {
dim[ coord_out ] = lbnd[ coord_out ];
off -= stride[ coord_out ] *
( ubnd[ coord_out ] - lbnd[ coord_out ] );
/* All the output pixels have been processed once the most significant
pixel index has been returned to its minimum value. */
done = ( ++coord_out == ndim_out );
}
} while ( !done );
}
}
/* Free the workspace. */
accum = astFree( accum );
dim = astFree( dim );
}
}
/* No linear fit to the Mapping is available. */
/* ========================================== */
} else {
/* If flux conseravtion was requested, report an error, since we can only
conserve flux if a linear approximation is available. */
if( conserve && astOK ) {
astError( AST__CNFLX, "astResampleSection(%s): Flux conservation "
"was requested but cannot be performed because either the Mapping "
"is too non-linear, or the requested tolerance is too small.", status,
astGetClass( this ) );
}
/* Create a PointSet to hold the coordinates of the output pixels and
obtain a pointer to its coordinate data. */
pset_out = astPointSet( npoint, ndim_out, "", status );
ptr_out = astGetPoints( pset_out );
if ( astOK ) {
/* Initialise the count of output points. */
point = 0;
/* Handle the 1-dimensional case optimally. */
/* ---------------------------------------- */
if ( ndim_out == 1 && ndim_in == 1 ) {
/* Loop through the required range of output x coordinates, assigning
the coordinate values to the PointSet created above. Also store a
pixel offset into the output array. */
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_out[ 0 ][ point ] = (double) ix;
offset[ point ] = ix - lbnd_out[ 0 ];
/* Increment the count of output pixels. */
point++;
}
/* Handle the 2-dimensional case optimally. */
/* ---------------------------------------- */
} else if ( ndim_out == 2 && ndim_in == 2 ) {
/* Loop through the required range of output y coordinates,
calculating an interim pixel offset into the output array. */
for ( iy = lbnd[ 1 ]; iy <= ubnd[ 1 ]; iy++ ) {
off1 = stride[ 1 ] * ( iy - lbnd_out[ 1 ] ) - lbnd_out[ 0 ];
/* Loop through the required range of output x coordinates, assigning
the coordinate values to the PointSet created above. Also store a
final pixel offset into the output array. */
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_out[ 0 ][ point ] = (double) ix;
ptr_out[ 1 ][ point ] = (double) iy;
offset[ point ] = off1 + ix;
/* Increment the count of output pixels. */
point++;
}
}
/* Handle other numbers of dimensions. */
/* ----------------------------------- */
} else {
/* Allocate workspace. */
dim = astMalloc( sizeof( int ) * (size_t) ndim_out );
if ( astOK ) {
/* Initialise an array of pixel indices for the output grid which
refer to the first pixel for which we require a value. Also
calculate the offset of this pixel within the output array. */
off = 0;
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
dim[ coord_out ] = lbnd[ coord_out ];
off += stride[ coord_out ] *
( dim[ coord_out ] - lbnd_out[ coord_out ] );
}
/* Loop to generate the coordinates of each output pixel. */
for ( done = 0; !done; point++ ) {
/* Copy each pixel's coordinates into the PointSet created above. */
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
ptr_out[ coord_out ][ point ] =
(double) dim[ coord_out ];
}
/* Store the offset of the pixel in the output array. */
offset[ point ] = off;
/* Now update the array of pixel indices to refer to the next output
pixel. */
coord_out = 0;
do {
/* The least significant index which currently has less than its
maximum value is incremented by one. The offset into the output
array is updated accordingly. */
if ( dim[ coord_out ] < ubnd[ coord_out ] ) {
dim[ coord_out ]++;
off += stride[ coord_out ];
break;
/* Any less significant indices which have reached their maximum value
are returned to their minimum value and the output pixel offset is
decremented appropriately. */
} else {
dim[ coord_out ] = lbnd[ coord_out ];
off -= stride[ coord_out ] *
( ubnd[ coord_out ] - lbnd[ coord_out ] );
/* All the output pixels have been processed once the most significant
pixel index has been returned to its minimum value. */
done = ( ++coord_out == ndim_out );
}
} while ( !done );
}
}
/* Free the workspace. */
dim = astFree( dim );
}
/* When all the output pixel coordinates have been generated, use the
Mapping's inverse transformation to generate the input coordinates
from them. Obtain an array of pointers to the resulting coordinate
data. */
pset_in = astTransform( this, pset_out, 0, NULL );
ptr_in = astGetPoints( pset_in );
}
/* Annul the PointSet containing the output coordinates. */
pset_out = astAnnul( pset_out );
}
}
/* Resample the input grid. */
/* ------------------------ */
/* Determine if a variance array is to be processed. */
usevar = ( in_var && out_var );
/* If the input coordinates have been produced successfully, identify
the input grid resampling method to be used. */
if ( astOK ) {
/* Nearest pixel. */
/* -------------- */
switch ( interp ) {
case AST__NEAREST:
/* Define a macro to use a "case" statement to invoke the
nearest-pixel interpolation function appropriate to a given data
type. */
#define CASE_NEAREST(X,Xtype) \
case ( TYPE_##X ): \
result = \
InterpolateNearest##X( ndim_in, lbnd_in, ubnd_in, \
(Xtype *) in, (Xtype *) in_var, \
npoint, offset, \
(const double *const *) ptr_in, \
flags, *( (Xtype *) badval_ptr ), \
(Xtype *) out, (Xtype *) out_var, status ); \
break;
/* Use the above macro to invoke the appropriate function. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_NEAREST(LD,long double)
#endif
CASE_NEAREST(D,double)
CASE_NEAREST(F,float)
CASE_NEAREST(L,long int)
CASE_NEAREST(UL,unsigned long int)
CASE_NEAREST(K,INT_BIG)
CASE_NEAREST(UK,UINT_BIG)
CASE_NEAREST(I,int)
CASE_NEAREST(UI,unsigned int)
CASE_NEAREST(S,short int)
CASE_NEAREST(US,unsigned short int)
CASE_NEAREST(B,signed char)
CASE_NEAREST(UB,unsigned char)
}
break;
/* Undefine the macro. */
#undef CASE_NEAREST
/* Linear interpolation. */
/* --------------------- */
/* Note this is also the default if zero is given. */
case AST__LINEAR:
case 0:
/* Define a macro to use a "case" statement to invoke the linear
interpolation function appropriate to a given data type. */
#define CASE_LINEAR(X,Xtype) \
case ( TYPE_##X ): \
result = \
InterpolateLinear##X( ndim_in, lbnd_in, ubnd_in,\
(Xtype *) in, (Xtype *) in_var, \
npoint, offset, \
(const double *const *) ptr_in, \
flags, *( (Xtype *) badval_ptr ), \
(Xtype *) out, (Xtype *) out_var, status ); \
break;
/* Use the above macro to invoke the appropriate function. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_LINEAR(LD,long double)
#endif
CASE_LINEAR(D,double)
CASE_LINEAR(F,float)
CASE_LINEAR(L,long int)
CASE_LINEAR(UL,unsigned long int)
CASE_LINEAR(K,INT_BIG)
CASE_LINEAR(UK,UINT_BIG)
CASE_LINEAR(I,int)
CASE_LINEAR(UI,unsigned int)
CASE_LINEAR(S,short int)
CASE_LINEAR(US,unsigned short int)
CASE_LINEAR(B,signed char)
CASE_LINEAR(UB,unsigned char)
}
break;
/* Undefine the macro. */
#undef CASE_LINEAR
/* Interpolation using a 1-d kernel. */
/* --------------------------------- */
case AST__GAUSS:
case AST__SINC:
case AST__SINCCOS:
case AST__SINCGAUSS:
case AST__SINCSINC:
case AST__SOMB:
case AST__SOMBCOS:
case AST__UKERN1: /* User-supplied 1-d kernel function */
/* Obtain a pointer to the appropriate 1-d kernel function (either
internal or user-defined) and set up any parameters it may
require. */
par = NULL;
switch ( interp ) {
/* sinc(pi*x) interpolation. */
/* ------------------------- */
/* Assign the kernel function. */
case AST__SINC:
kernel = Sinc;
/* Calculate the number of neighbouring pixels to use. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) {
neighb = 2;
} else {
neighb = MaxI( 1, neighb, status );
}
break;
/* sinc(pi*x)*cos(k*pi*x) interpolation. */
/* ------------------------------------- */
/* Assign the kernel function. */
case AST__SINCCOS:
kernel = SincCos;
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 0.5 / MaxD( 1.0, params[ 1 ], status );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, the number will be calculated automatically below. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = INT_MAX;
/* Calculate the maximum number of neighbouring pixels required by the
width of the kernel, and use this value if preferable. */
neighb = MinI( neighb,
(int) ceil( MaxD( 1.0, params[ 1 ], status ) ), status );
break;
/* somb(pi*x) interpolation. */
/* ------------------------- */
/* Assign the kernel function. */
case AST__SOMB:
kernel = Somb;
/* Calculate the number of neighbouring pixels to use. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) {
neighb = 2;
} else {
neighb = MaxI( 1, neighb, status );
}
break;
/* somb(pi*x)*cos(k*pi*x) interpolation. */
/* ------------------------------------- */
/* Assign the kernel function. */
case AST__SOMBCOS:
kernel = SombCos;
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 0.5 / MaxD( 1.0, params[ 1 ], status );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, the number will be calculated automatically below. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = INT_MAX;
/* Calculate the maximum number of neighbouring pixels required by the
width of the kernel, and use this value if preferable. */
neighb = MinI( neighb,
(int) ceil( MaxD( 1.0, params[ 1 ], status ) ), status );
break;
/* sinc(pi*x)*exp(-k*x*x) interpolation. */
/* ------------------------------------- */
/* Assign the kernel function. */
case AST__SINCGAUSS:
kernel = SincGauss;
/* Constrain the full width half maximum of the gaussian factor. */
fwhm = MaxD( 0.1, params[ 1 ], status );
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 4.0 * log( 2.0 ) / ( fwhm * fwhm );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, use the number of neighbouring pixels required by the width
of the kernel (out to where the gaussian term falls to 1% of its
peak value). */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = (int) ceil( sqrt( -log( 0.01 ) /
lpar[ 0 ] ) );
break;
/* exp(-k*x*x) interpolation. */
/* -------------------------- */
/* Assign the kernel function. */
case AST__GAUSS:
kernel = Gauss;
/* Constrain the full width half maximum of the gaussian. */
fwhm = MaxD( 0.1, params[ 1 ], status );
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 4.0 * log( 2.0 ) / ( fwhm * fwhm );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, use the number of neighbouring pixels required by the width
of the kernel (out to where the gaussian term falls to 1% of its
peak value). */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = (int) ceil( sqrt( -log( 0.01 ) /
lpar[ 0 ] ) );
break;
/* sinc(pi*x)*sinc(k*pi*x) interpolation. */
/* -------------------------------------- */
/* Assign the kernel function. */
case AST__SINCSINC:
kernel = SincSinc;
/* Store the required value of "k" in a local parameter array and pass
this array to the kernel function. */
lpar[ 0 ] = 0.5 / MaxD( 1.0, params[ 1 ], status );
par = lpar;
/* Obtain the number of neighbouring pixels to use. If this is zero or
less, the number will be calculated automatically below. */
neighb = (int) floor( params[ 0 ] + 0.5 );
if ( neighb <= 0 ) neighb = INT_MAX;
/* Calculate the maximum number of neighbouring pixels required by the
width of the kernel, and use this value if preferable. */
neighb = MinI( neighb,
(int) ceil( MaxD( 1.0, params[ 1 ], status ) ), status );
break;
/* User-supplied kernel. */
/* --------------------- */
/* Assign the kernel function. */
case AST__UKERN1:
fkernel = (void (*)( double, const double [],
int, double * )) finterp;
/* Calculate the number of neighbouring pixels to use. */
neighb = MaxI( 1, (int) floor( params[ 0 ] + 0.5 ), status );
/* Pass a pointer to the "params" array. */
par = params;
break;
}
/* Define a macro to use a "case" statement to invoke the 1-d kernel
interpolation function appropriate to a given data type, passing it
the pointer to the kernel function obtained above. */
#define CASE_KERNEL1(X,Xtype) \
case ( TYPE_##X ): \
result = \
InterpolateKernel1##X( this, ndim_in, lbnd_in, ubnd_in, \
(Xtype *) in, (Xtype *) in_var, \
npoint, offset, \
(const double *const *) ptr_in, \
kernel, fkernel, neighb, par, flags, \
*( (Xtype *) badval_ptr ), \
(Xtype *) out, (Xtype *) out_var, status ); \
break;
/* Use the above macro to invoke the appropriate function. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_KERNEL1(LD,long double)
#endif
CASE_KERNEL1(D,double)
CASE_KERNEL1(F,float)
CASE_KERNEL1(L,long int)
CASE_KERNEL1(UL,unsigned long int)
CASE_KERNEL1(K,INT_BIG)
CASE_KERNEL1(UK,UINT_BIG)
CASE_KERNEL1(I,int)
CASE_KERNEL1(UI,unsigned int)
CASE_KERNEL1(S,short int)
CASE_KERNEL1(US,unsigned short int)
CASE_KERNEL1(B,signed char)
CASE_KERNEL1(UB,unsigned char)
}
break;
/* Undefine the macro. */
#undef CASE_KERNEL1
/* General sub-pixel interpolation function. */
/* ----------------------------------------- */
case AST__BLOCKAVE:
case AST__UINTERP:
/* Define a macro to use a "case" statement to invoke the general
sub-pixel interpolation function appropriate to a given type and
the selected value of the interp variable. */
#define CASE_GINTERP(X,Xtype) \
case ( TYPE_##X ): \
\
/* Obtain a pointer to the appropriate general interpolation function \
(either internal or user-defined) and set up any parameters it may \
require. */ \
switch ( interp ) { \
\
/* Block averaging interpolation. */ \
/* ------------------------------ */ \
case AST__BLOCKAVE: \
gifunc = (void (*)( void )) InterpolateBlockAverage##X; \
break; \
\
/* User-supplied sub-pixel interpolation function. */ \
/* ----------------------------------------------- */ \
case AST__UINTERP: \
gifunc = (void (*)( void )) finterp; \
break; \
} \
\
/* Invoke the general interpolation function. It has to be cast to the \
right type (i.e. a function with the correctly typed arguments) \
to prevent default promotion (to int or double) of its arguments. \
The cast here corresponds to the declaration of
ast_resample_uinterp##Xtype. */ \
( *( (void (*)( int, const int[], const int[], \
const Xtype[], \
const Xtype[], \
int, const int[], \
const double *const[], \
const double[], int, \
Xtype, \
Xtype *, \
Xtype *, \
int * )) \
gifunc ) )( ndim_in, lbnd_in, ubnd_in, \
(Xtype *) in, \
(Xtype *) ( usevar ? in_var : NULL ), \
npoint, offset, \
(const double *const *) ptr_in, \
params, flags, \
*( (Xtype *) badval_ptr ), \
(Xtype *) out, \
(Xtype *) ( usevar ? out_var : NULL ), \
&nbad ); \
if ( astOK ) { \
result += nbad; \
} else { \
astError( astStatus, "astResample"#X"(%s): Error " \
"signalled by user-supplied sub-pixel " \
"interpolation function.", status, \
astGetClass( unsimplified_mapping ) ); \
} \
break;
/* Use the above macro to invoke the function. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_GINTERP(LD,long double)
#endif
CASE_GINTERP(D,double)
CASE_GINTERP(F,float)
CASE_GINTERP(L,long int)
CASE_GINTERP(UL,unsigned long int)
CASE_GINTERP(K,INT_BIG)
CASE_GINTERP(UK,UINT_BIG)
CASE_GINTERP(I,int)
CASE_GINTERP(UI,unsigned int)
CASE_GINTERP(S,short int)
CASE_GINTERP(US,unsigned short int)
CASE_GINTERP(B,signed char)
CASE_GINTERP(UB,unsigned char)
}
break;
/* Undefine the macro. */
#undef CASE_GINTERP
/* Error: invalid interpolation scheme specified. */
/* ---------------------------------------------- */
default:
/* Define a macro to report an error message appropriate to a given
data type. */
#define CASE_ERROR(X) \
case TYPE_##X: \
astError( AST__SISIN, "astResample"#X"(%s): Invalid " \
"sub-pixel interpolation scheme (%d) specified.", status, \
astGetClass( unsimplified_mapping ), interp ); \
break;
/* Use the above macro to report an appropriate error message. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_ERROR(LD)
#endif
CASE_ERROR(D)
CASE_ERROR(F)
CASE_ERROR(L)
CASE_ERROR(UL)
CASE_ERROR(K)
CASE_ERROR(UK)
CASE_ERROR(I)
CASE_ERROR(UI)
CASE_ERROR(S)
CASE_ERROR(US)
CASE_ERROR(B)
CASE_ERROR(UB)
}
break;
/* Undefine the macro. */
#undef CASE_ERROR
}
}
/* Now scale the output values to conserve flux if required. */
if( conserve ) {
/* Define a macro to use a "case" statement to invoke the function
appropriate to a given data type. These simply multiple the output data
value by the factor, and the output variance by the square of the
factor. */
#define CASE_CONSERVE(X,Xtype) \
case ( TYPE_##X ): \
ConserveFlux##X( factor, npoint, offset, *( (Xtype *) badval_ptr ), \
(Xtype *) out, \
(Xtype *) ( usevar ? out_var : NULL ), status ); \
break;
/* Use the above macro to invoke the appropriate function. */
switch ( type ) {
#if HAVE_LONG_DOUBLE /* Not normally implemented */
CASE_CONSERVE(LD,long double)
#endif
CASE_CONSERVE(D,double)
CASE_CONSERVE(F,float)
CASE_CONSERVE(L,long int)
CASE_CONSERVE(UL,unsigned long int)
CASE_CONSERVE(K,INT_BIG)
CASE_CONSERVE(UK,UINT_BIG)
CASE_CONSERVE(I,int)
CASE_CONSERVE(UI,unsigned int)
CASE_CONSERVE(S,short int)
CASE_CONSERVE(US,unsigned short int)
CASE_CONSERVE(B,signed char)
CASE_CONSERVE(UB,unsigned char)
}
/* Undefine the macro. */
#undef CASE_CONSERVE
}
/* Annul the PointSet used to hold input coordinates. */
pset_in = astAnnul( pset_in );
/* Free the workspace. */
offset = astFree( offset );
stride = astFree( stride );
/* If an error occurred, clear the returned value. */
if ( !astOK ) result = 0;
/* Return the result. */
return result;
}
static int ResampleWithBlocking( AstMapping *this, const double *linear_fit,
int ndim_in,
const int *lbnd_in, const int *ubnd_in,
const void *in, const void *in_var,
DataType type, int interp, void (* finterp)( void ),
const double *params, int flags,
const void *badval_ptr, int ndim_out,
const int *lbnd_out, const int *ubnd_out,
const int *lbnd, const int *ubnd,
void *out, void *out_var, int *status ) {
/*
* Name:
* ResampleWithBlocking
* Purpose:
* Resample a section of a data grid in a memory-efficient way.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int ResampleWithBlocking( AstMapping *this, const double *linear_fit,
* int ndim_in,
* const int *lbnd_in, const int *ubnd_in,
* const void *in, const void *in_var,
* DataType type, int interp, void (* finterp)( void ),
* const double *params, int flags,
* const void *badval_ptr, int ndim_out,
* const int *lbnd_out, const int *ubnd_out,
* const int *lbnd, const int *ubnd,
* void *out, void *out_var, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function resamples a rectangular grid of data (with any
* number of dimensions) into a specified section of another
* rectangular grid (with a possibly different number of
* dimensions). The coordinate transformation used is given by the
* inverse transformation of the Mapping which is supplied or,
* alternatively, by a linear approximation fitted to a Mapping's
* inverse transformation. Any pixel interpolation scheme may be
* specified for interpolating between the pixels of the input
* grid.
*
* This function is very similar to ResampleSection, except that in
* order to limit memory usage and to ensure locality of reference,
* it divides the output grid up into "blocks" which have a limited
* extent along each output dimension. Each block, which will not
* contain more than a pre-determined maximum number of pixels, is
* then passed to ResampleSection for resampling.
* Parameters:
* this
* Pointer to a Mapping, whose inverse transformation may be
* used to transform the coordinates of pixels in the output
* grid into associated positions in the input grid, from which
* the output pixel values should be derived (by interpolation
* if necessary).
*
* The number of input coordintes for the Mapping (Nin
* attribute) should match the value of "ndim_in" (below), and
* the number of output coordinates (Nout attribute) should
* match the value of "ndim_out".
* linear_fit
* Pointer to an optional array of double which contains the
* coefficients of a linear fit which approximates the above
* Mapping's inverse coordinate transformation. If this is
* supplied, it will be used in preference to the above Mapping
* when transforming coordinates. This may be used to enhance
* performance in cases where evaluation of the Mapping's
* inverse transformation is expensive. If no linear fit is
* available, a NULL pointer should be supplied.
*
* The way in which the fit coefficients are stored in this
* array and the number of array elements are as defined by the
* astLinearApprox function.
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input data grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input data grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input data grid, its extent along a
* particular (i'th) dimension being (ubnd_in[i] - lbnd_in[i] +
* 1). They also define the input grid's coordinate system, with
* each pixel being of unit extent along each dimension with
* integral coordinate values at its centre.
* in
* Pointer to the input array of data to be resampled (with one
* element for each pixel in the input grid). The numerical type
* of these data should match the "type" value (below). The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and data type as the "in" array),
* which represent estimates of the statistical variance
* associated with each element of the "in" array. If this
* second array is given (along with the corresponding "out_var"
* array), then estimates of the variance of the resampled data
* will also be returned.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* type
* A value taken from the "DataType" enum, which specifies the
* data type of the input and output arrays containing the
* gridded data (and variance) values.
* interp
* A value selected from a set of pre-defined macros to identify
* which sub-pixel interpolation algorithm should be used.
* finterp
* If "interp" is set to a value which requires a user-supplied
* function, then a pointer to that function shoild be given
* here. Otherwise, this value is not used and may be a NULL
* pointer.
* params
* Pointer to an optional array of parameters that may be passed
* to the interpolation algorithm, if required. If no parameters
* are required, a NULL pointer should be supplied.
* flags
* The bitwise OR of a set of flag values which provide
* additional control over the resampling operation.
* badval_ptr
* If the AST__USEBAD flag is set (above), this parameter is a
* pointer to a value which is used to identify bad data and/or
* variance values in the input array(s). The referenced value's
* data type must match that of the "in" (and "in_var")
* arrays. Unless the AST__NOBAD flag is set, the same value will
* also be used to flag any output array elements for which
* resampled values could not be obtained. The output arrays(s)
* may be flagged with this value whether or not the AST__USEBAD
* flag is set (the function return value indicates whether any
* such values have been produced).
* ndim_out
* The number of dimensions in the output grid. This should be
* at least one.
* lbnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the first
* pixel in the output data grid along each dimension.
* ubnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the last
* pixel in the output data grid along each dimension.
*
* Note that "lbnd_out" and "ubnd_out" together define the shape
* and size of the output data grid in the same way as "lbnd_in"
* and "ubnd_in" define the shape and size of the input grid
* (see above).
* lbnd
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the first pixel in the
* section of the output data grid for which a value is
* required.
* ubnd
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the last pixel in the
* section of the output data grid for which a value is
* required.
*
* Note that "lbnd" and "ubnd" define the shape and position of
* the section of the output grid for which resampled values are
* required. This section should lie wholly within the extent of
* the output grid (as defined by the "lbnd_out" and "ubnd_out"
* arrays). Regions of the output grid lying outside this section
* will not be modified.
* out
* Pointer to an array with the same data type as the "in"
* array, into which the resampled data will be returned. The
* storage order should be such that the coordinate of the first
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order is used).
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the resampled values may be returned. This array will only be
* used if the "in_var" array has been given.
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* status
* Pointer to the inherited status variable.
* Returned Value:
* The number of output grid points for which no valid output value
* could be obtained.
* Notes:
* - A value of zero will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*/
/* Local Constants: */
const int mxpix = 2 * 1024; /* Maximum number of pixels in a block (this
relatively small number seems to give best
performance) */
/* Local Variables: */
double factor; /* Flux conservation factor */
int *dim_block; /* Pointer to array of block dimensions */
int *lbnd_block; /* Pointer to block lower bound array */
int *ubnd_block; /* Pointer to block upper bound array */
int dim; /* Dimension size */
int done; /* All blocks resampled? */
int hilim; /* Upper limit on maximum block dimension */
int idim; /* Loop counter for dimensions */
int lolim; /* Lower limit on maximum block dimension */
int mxdim_block; /* Maximum block dimension */
int npix; /* Number of pixels in block */
int result; /* Result value to return */
/* Initialise. */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Allocate workspace. */
lbnd_block = astMalloc( sizeof( int ) * (size_t) ndim_out );
ubnd_block = astMalloc( sizeof( int ) * (size_t) ndim_out );
dim_block = astMalloc( sizeof( int ) * (size_t) ndim_out );
if ( astOK ) {
/* Find the optimum block size. */
/* ---------------------------- */
/* We first need to find the maximum extent which a block of output
pixels may have in each dimension. We determine this by taking the
output grid extent in each dimension and then limiting the maximum
dimension size until the resulting number of pixels is sufficiently
small. This approach allows the block shape to approximate (or
match) the output grid shape when appropriate. */
/* First loop to calculate the total number of output pixels and the
maximum output dimension size. */
npix = 1;
mxdim_block = 0;
for ( idim = 0; idim < ndim_out; idim++ ) {
dim = ubnd[ idim ] - lbnd[ idim ] + 1;
npix *= dim;
if ( mxdim_block < dim ) mxdim_block = dim;
}
/* If the number of output pixels is too large for a single block, we
perform iterations to determine the optimum upper limit on a
block's dimension size. Initialise the limits on this result. */
if ( npix > mxpix ) {
lolim = 1;
hilim = mxdim_block;
/* Loop to perform a binary chop, searching for the best result until
the lower and upper limits on the result converge to adjacent
values. */
while ( ( hilim - lolim ) > 1 ) {
/* Form a new estimate from the mid-point of the previous limits. */
mxdim_block = ( hilim + lolim ) / 2;
/* See how many pixels a block contains if its maximum dimension is
limited to this new value. */
for ( npix = 1, idim = 0; idim < ndim_out ; idim++ ) {
dim = ubnd[ idim ] - lbnd[ idim ] + 1;
npix *= ( dim < mxdim_block ) ? dim : mxdim_block;
}
/* Update the appropriate limit, according to whether the number of
pixels is too large or too small. */
*( ( npix <= mxpix ) ? &lolim : &hilim ) = mxdim_block;
}
/* When iterations have converged, obtain the maximum limit on the
dimension size of a block which results in no more than the maximum
allowed number of pixels per block. However, ensure that all block
dimensions are at least 2. */
mxdim_block = lolim;
}
if ( mxdim_block < 2 ) mxdim_block = 2;
/* Calculate the block dimensions by applying this limit to the output
grid dimensions. */
for ( idim = 0; idim < ndim_out ; idim++ ) {
dim = ubnd[ idim ] - lbnd[ idim ] + 1;
dim_block[ idim ] = ( dim < mxdim_block ) ? dim : mxdim_block;
/* Also initialise the lower and upper bounds of the first block of
output grid pixels to be resampled, ensuring that this does not
extend outside the grid itself. */
lbnd_block[ idim ] = lbnd[ idim ];
ubnd_block[ idim ] = MinI( lbnd[ idim ] + dim_block[ idim ] - 1,
ubnd[ idim ], status );
}
/* Determine the flux conservation constant if needed. */
/* --------------------------------------------------- */
if( ( flags & AST__CONSERVEFLUX ) && linear_fit ) {
factor = MatrixDet( ndim_in, ndim_out, linear_fit + ndim_in, status );
} else {
factor = 1.0;
}
/* Resample each block of output pixels. */
/* ------------------------------------- */
/* Loop to generate the extent of each block of output pixels and to
resample them. */
done = 0;
while ( !done && astOK ) {
/* Resample the current block, accumulating the sum of bad pixels
produced. */
result += ResampleSection( this, linear_fit,
ndim_in, lbnd_in, ubnd_in,
in, in_var, type, interp, finterp, params,
factor, flags, badval_ptr,
ndim_out, lbnd_out, ubnd_out,
lbnd_block, ubnd_block, out, out_var, status );
/* Update the block extent to identify the next block of output
pixels. */
idim = 0;
do {
/* We find the least significant dimension where the upper bound of
the block has not yet reached the upper bound of the region of the
output grid which we are resampling. The block's position is then
incremented by one block extent along this dimension, checking that
the resulting extent does not go outside the region being
resampled. */
if ( ubnd_block[ idim ] < ubnd[ idim ] ) {
lbnd_block[ idim ] = MinI( lbnd_block[ idim ] +
dim_block[ idim ], ubnd[ idim ], status );
ubnd_block[ idim ] = MinI( lbnd_block[ idim ] +
dim_block[ idim ] - 1,
ubnd[ idim ], status );
break;
/* If any less significant dimensions are found where the upper bound
of the block has reached its maximum value, we reset the block to
its lowest position. */
} else {
lbnd_block[ idim ] = lbnd[ idim ];
ubnd_block[ idim ] = MinI( lbnd[ idim ] + dim_block[ idim ] - 1,
ubnd[ idim ], status );
/* All the blocks have been processed once the position along the most
significant dimension has been reset. */
done = ( ++idim == ndim_out );
}
} while ( !done );
}
}
/* Free the workspace. */
lbnd_block = astFree( lbnd_block );
ubnd_block = astFree( ubnd_block );
dim_block = astFree( dim_block );
/* If an error occurred, clear the returned value. */
if ( !astOK ) result = 0;
/* Return the result. */
return result;
}
static void SetAttrib( AstObject *this_object, const char *setting, int *status ) {
/*
* Name:
* SetAttrib
* Purpose:
* Set an attribute value for a Mapping.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void SetAttrib( AstObject *this, const char *setting )
* Class Membership:
* Mapping member function (over-rides the astSetAttrib protected
* method inherited from the Object class).
* Description:
* This function assigns an attribute value for a Mapping, the
* attribute and its value being specified by means of a string of
* the form:
*
* "attribute= value "
*
* Here, "attribute" specifies the attribute name and should be in
* lower case with no white space present. The value to the right
* of the "=" should be a suitable textual representation of the
* value to be assigned and this will be interpreted according to
* the attribute's data type. White space surrounding the value is
* only significant for string attributes.
* Parameters:
* this
* Pointer to the Mapping.
* setting
* Pointer to a null terminated string specifying the new attribute
* value.
*/
/* Local Variables: */
AstMapping *this; /* Pointer to the Mapping structure */
int invert; /* Invert attribute value */
int len; /* Length of setting string */
int nc; /* Number of characters read by astSscanf */
int report; /* Report attribute value */
/* Check the global error status. */
if ( !astOK ) return;
/* Obtain a pointer to the Mapping structure. */
this = (AstMapping *) this_object;
/* Obtain the length of the setting string. */
len = (int) strlen( setting );
/* Test for each recognised attribute in turn, using "astSscanf" to parse
the setting string and extract the attribute value (or an offset to
it in the case of string values). In each case, use the value set
in "nc" to check that the entire string was matched. Once a value
has been obtained, use the appropriate method to set it. */
/* Invert. */
/* ------- */
if ( nc = 0,
( 1 == astSscanf( setting, "invert= %d %n", &invert, &nc ) )
&& ( nc >= len ) ) {
astSetInvert( this, invert );
/* Report. */
/* ------- */
} else if ( nc = 0,
( 1 == astSscanf( setting, "report= %d %n", &report, &nc ) )
&& ( nc >= len ) ) {
astSetReport( this, report );
/* Define a macro to see if the setting string matches any of the
read-only attributes of this class. */
#define MATCH(attrib) \
( nc = 0, ( 0 == astSscanf( setting, attrib "=%*[^\n]%n", &nc ) ) && \
( nc >= len ) )
/* If the attribute was not recognised, use this macro to report an error
if a read-only attribute has been specified. */
} else if ( MATCH( "nin" ) ||
MATCH( "nout" ) ||
MATCH( "islinear" ) ||
MATCH( "issimple" ) ||
MATCH( "tranforward" ) ||
MATCH( "traninverse" ) ) {
astError( AST__NOWRT, "astSet: The setting \"%s\" is invalid for a %s.", status,
setting, astGetClass( this ) );
astError( AST__NOWRT, "This is a read-only attribute." , status);
/* If the attribute is still not recognised, pass it on to the parent
method for further interpretation. */
} else {
(*parent_setattrib)( this_object, setting, status );
}
/* Undefine macros local to this function. */
#undef MATCH
}
static void Sinc( double offset, const double params[], int flags,
double *value, int *status ) {
/*
* Name:
* Sinc
* Purpose:
* 1-dimensional sinc(pi*x) interpolation kernel.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void Sinc( double offset, const double params[], int flags,
* double *value, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function calculates the value of a 1-dimensional sub-pixel
* interpolation kernel. The function used is sinc(pi*x), where
* sinc(z)=sin(z)/z.
* Parameters:
* offset
* The offset of a pixel from the interpolation point, measured
* in pixels.
* params
* Not used.
* flags
* Not used.
* value
* Pointer to a double to receive the calculated kernel value.
* status
* Pointer to the inherited status variable.
* Notes:
* - This function does not perform error checking and does not
* generate errors.
*/
/* Local Variables: */
static double pi; /* Value of pi */
static int init = 0; /* Initialisation flag */
/* On the first invocation, initialise a local value for pi. Do this
only once. */
if ( !init ) {
pi = acos( -1.0 );
init = 1;
}
/* Scale the offset. */
offset *= pi;
/* Evaluate the function. */
*value = ( offset != 0.0 ) ? ( sin( offset ) / offset ) : 1.0;
}
static void SincCos( double offset, const double params[], int flags,
double *value, int *status ) {
/*
* Name:
* SincCos
* Purpose:
* 1-dimensional sinc(pi*x)*cos(k*pi*x) interpolation kernel.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void SincCos( double offset, const double params[], int flags,
* double *value, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function calculates the value of a 1-dimensional sub-pixel
* interpolation kernel. The function used is sinc(pi*x)*cos(k*pi*x)
* out to the point where cos(k*pi*x) = 0, and zero beyond. Here,
* sinc(z)=sin(z)/z.
* Parameters:
* offset
* The offset of a pixel from the interpolation point, measured
* in pixels.
* params
* The first element of this array should give a value for "k"
* in the cos(k*pi*x) term.
* flags
* Not used.
* value
* Pointer to a double to receive the calculated kernel value.
* status
* Pointer to the inherited status variable.
* Notes:
* - This function does not perform error checking and does not
* generate errors.
*/
/* Local Variables: */
double offset_k; /* Scaled offset */
static double halfpi; /* Value of pi/2 */
static double pi; /* Value of pi */
static int init = 0; /* Initialisation flag */
/* On the first invocation, initialise local values for pi and
pi/2. Do this only once. */
if ( !init ) {
pi = acos( -1.0 );
halfpi = 0.5 * pi;
init = 1;
}
/* Multiply the offset by pi and remove its sign. */
offset = pi * fabs( offset );
/* Find the offset scaled by the "k" factor. */
offset_k = offset * params[ 0 ];
/* If the cos(k*pi*x) term has not reached zero, calculate the
result. */
if ( offset_k < halfpi ) {
*value = ( ( offset != 0.0 ) ? ( sin( offset ) / offset ) : 1.0 ) *
cos( offset_k );
/* Otherwise, the result is zero. */
} else {
*value = 0.0;
}
}
static void SincGauss( double offset, const double params[], int flags,
double *value, int *status ) {
/*
* Name:
* SincGauss
* Purpose:
* 1-dimensional sinc(pi*x)*exp(-k*x*x) interpolation kernel.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void SincGauss( double offset, const double params[], int flags,
* double *value, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function calculates the value of a 1-dimensional sub-pixel
* interpolation kernel. The function used is sinc(pi*x)*exp(-k*x*x),
* where sinc(z)=sin(z)/z.
* Parameters:
* offset
* The offset of a pixel from the interpolation point, measured
* in pixels.
* params
* The first element of this array should give a value for "k"
* in the exp(-k*x*x) term.
* flags
* Not used.
* value
* Pointer to a double to receive the calculated kernel value.
* status
* Pointer to the inherited status variable.
* Notes:
* - This function does not perform error checking and does not
* generate errors.
*/
/* Local Variables: */
double offset_pi; /* Offset multiplied by pi */
static double pi; /* Value of pi */
static int init = 0; /* Initialisation flag */
/* On the first invocation, initialise a local value for pi. Do this
only once. */
if ( !init ) {
pi = acos( -1.0 );
init = 1;
}
/* Find the offset scaled by pi. */
offset_pi = pi * offset;
/* Calculate the result. */
*value = ( ( offset_pi != 0.0 ) ? ( sin( offset_pi ) / offset_pi ) : 1.0 ) *
exp( -params[ 0 ] * offset * offset );
}
static void SincSinc( double offset, const double params[], int flags,
double *value, int *status ) {
/*
* Name:
* SincSinc
* Purpose:
* 1-dimensional sinc(pi*x)*sinc(k*pi*x) interpolation kernel.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void SincSinc( double offset, const double params[], int flags,
* double *value, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function calculates the value of a 1-dimensional sub-pixel
* interpolation kernel. The function used is sinc(pi*x)*sinc(k*pi*x),
* out to the point where sinc(k*pi*x)=0, and zero beyond. Here,
* sinc(z)=sin(z)/z.
* Parameters:
* offset
* The offset of a pixel from the interpolation point, measured
* in pixels.
* params
* The first element of this array should give a value for "k"
* in the sinc(k*pi*x) term.
* flags
* Not used.
* value
* Pointer to a double to receive the calculated kernel value.
* status
* Pointer to the inherited status variable.
* Notes:
* - This function does not perform error checking and does not
* generate errors.
*/
/* Local Variables: */
double offset_k; /* Scaled offset */
static double halfpi; /* Value of pi/2 */
static double pi; /* Value of pi */
static int init = 0; /* Initialisation flag */
/* On the first invocation, initialise local values for pi and
pi/2. Do this only once. */
if ( !init ) {
pi = acos( -1.0 );
halfpi = 0.5 * pi;
init = 1;
}
/* Multiply the offset by pi and remove its sign. */
offset = pi * fabs( offset );
/* Find the offset scaled by the "k" factor. */
offset_k = offset * params[ 0 ];
/* If the sinc(k*pi*x) term has not reached zero, calculate the
result. */
if ( offset_k < halfpi ) {
*value = ( ( offset != 0.0 ) ? ( sin( offset ) / offset ) : 1.0 ) *
( ( offset_k != 0.0 ) ? ( sin( offset_k ) / offset_k ) : 1.0 );
/* Otherwise, the result is zero. */
} else {
*value = 0.0;
}
}
static AstMapping *Simplify( AstMapping *this, int *status ) {
/*
*++
* Name:
c astSimplify
f AST_SIMPLIFY
* Purpose:
* Simplify a Mapping.
* Type:
* Public function.
* Synopsis:
c #include "mapping.h"
c AstMapping *astSimplify( AstMapping *this )
f RESULT = AST_SIMPLIFY( THIS, STATUS )
* Class Membership:
* Mapping method.
* Description:
* This function simplifies a Mapping (which may be a compound
* Mapping such as a CmpMap) to eliminate redundant computational
* steps, or to merge separate steps which can be performed more
* efficiently in a single operation.
*
* As a simple example, a Mapping which multiplied coordinates by
* 5, and then multiplied the result by 10, could be simplified to
* a single step which multiplied by 50. Similarly, a Mapping which
* multiplied by 5, and then divided by 5, could be reduced to a
* simple copying operation.
*
* This function should typically be applied to Mappings which have
* undergone substantial processing or have been formed by merging
* other Mappings. It is of potential benefit, for example, in
* reducing execution time if applied before using a Mapping to
* transform a large number of coordinates.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the original Mapping.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Returned Value:
c astSimplify()
f AST_SIMPLIFY = INTEGER
* A new pointer to the (possibly simplified) Mapping.
* Applicability:
* Mapping
* This function applies to all Mappings.
* FrameSet
* If the supplied Mapping is a FrameSet, the returned Mapping
* will be a copy of the supplied FrameSet in which all the
* inter-Frame Mappings have been simplified.
* Notes:
* - Mappings that have a set value for their Ident attribute are
* left unchanged after simplification. This is so that their
* individual identity is preserved. This restriction does not
* apply to the simplification of Frames.
* - This function can safely be applied even to Mappings which
* cannot be simplified. If no simplification is possible, it
c behaves exactly like astClone and returns a pointer to the
f behaves exactly like AST_CLONE and returns a pointer to the
* original Mapping.
* - The Mapping returned by this function may not be independent
* of the original (even if simplification was possible), and
* modifying it may therefore result in indirect modification of
* the original. If a completely independent result is required, a
c copy should be made using astCopy.
f copy should be made using AST_COPY.
* - A null Object pointer (AST__NULL) will be returned if this
c function is invoked with the AST error status set, or if it
f function is invoked with STATUS set to an error value, or if it
* should fail for any reason.
*--
*/
/* Local Variables: */
AstMapping **map_list; /* Pointer to array of Mapping pointers */
AstMapping *map; /* Cloned pointer to nominated Mapping */
AstMapping *result; /* Pointer to result Mapping */
int *invert_list; /* Pointer to array of invert flags */
int imap; /* Loop counter for Mappings */
int modified; /* Index of first modified element */
int nmap; /* Number of Mappings */
int simpler; /* Simplification achieved? */
/* Initialise. */
result = NULL;
/* Check the inherited status. */
if ( !astOK ) return result;
/* Initialise dynamic arrays of Mapping pointers and associated invert
flags. */
nmap = 0;
map_list = NULL;
invert_list = NULL;
/* Build a Mapping list to contain this Mapping (the list should only
have 1 element). */
astMapList( this, 1, astGetInvert( this ), &nmap, &map_list, &invert_list );
/* Pass the list repeatedly to the "astMapMerge" method for
simplification. */
simpler = 0;
while ( astOK ) {
map = astClone( map_list[ 0 ] );
modified = astMapMerge( map, 0, 1, &nmap, &map_list, &invert_list );
map = astAnnul( map );
/* Quit looping if the number of Mappings increases above 1, or if no
further change occurs. Note if any simplification was achieved. */
if ( ( nmap > 1 ) || ( modified < 0 ) ) break;
simpler = 1;
}
/* Check whether simplification has occurred. If not, simply clone the
original Mapping pointer. This is what will normally happen for
Mapping classes which inherit the default (null) "astMapMerge"
method from this class and do not define one of their own. */
if ( astOK ) {
if ( !simpler || ( nmap > 1 ) ) {
result = astClone( this );
/* If simplification occurred, test if the resulting Mapping has the
Invert attribute value we want. If so, we can simply clone a
pointer to it. */
} else {
if ( invert_list[ 0 ] == astGetInvert( map_list[ 0 ] ) ) {
result = astClone( map_list[ 0 ] );
/* If not, we must make a copy. */
} else {
result = astCopy( map_list[ 0 ] );
/* Either clear the copy's Invert attribute, or set it to 1, as
required. */
if ( invert_list[ 0 ] ) {
astSetInvert( result, 1 );
} else {
astClearInvert( result );
}
}
}
}
/* Loop to annul all the pointers in the Mapping list. */
for ( imap = 0; imap < nmap; imap++ ) {
map_list[ imap ] = astAnnul( map_list[ imap ] );
}
/* Free the dynamic arrays. */
map_list = astFree( map_list );
invert_list = astFree( invert_list );
/* If an error occurred, annul the returned Mapping. */
if ( !astOK ) result = astAnnul( result );
/* Return the result. */
return result;
}
static void Somb( double offset, const double params[], int flags,
double *value, int *status ) {
/*
* Name:
* Somb
* Purpose:
* 1-dimensional somb(pi*x) interpolation kernel.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void Somb( double offset, const double params[], int flags,
* double *value, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function calculates the value of a 1-dimensional sub-pixel
* interpolation kernel. The function used is somb(pi*x), where
* somb(z)=2*J1(z)/z (J1 is a Bessel function of the first kind of
* order 1).
* Parameters:
* offset
* The offset of a pixel from the interpolation point, measured
* in pixels.
* params
* Not used.
* flags
* Not used.
* value
* Pointer to a double to receive the calculated kernel value.
* status
* Pointer to the inherited status variable.
* Notes:
* - This function does not perform error checking and does not
* generate errors.
*/
/* Local Variables: */
static double pi; /* Value of pi */
static int init = 0; /* Initialisation flag */
/* On the first invocation, initialise a local value for pi. Do this
only once. */
if ( !init ) {
pi = acos( -1.0 );
init = 1;
}
/* Scale the offset. */
offset *= pi;
/* Evaluate the function. */
*value = ( offset != 0.0 ) ? ( 2.0*J1Bessel( offset, status ) / offset ) : 1.0;
}
static void SombCos( double offset, const double params[], int flags,
double *value, int *status ) {
/*
* Name:
* SombCos
* Purpose:
* 1-dimensional somb(pi*x)*cos(k*pi*x) interpolation kernel.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void SombCos( double offset, const double params[], int flags,
* double *value, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function calculates the value of a 1-dimensional sub-pixel
* interpolation kernel. The function used is somb(pi*x)*cos(k*pi*x)
* out to the point where cos(k*pi*x) = 0, and zero beyond. Here,
* somb(z)=2*J1(z)/z (J1 is a Bessel function of the first kind of
* order 1).
* Parameters:
* offset
* The offset of a pixel from the interpolation point, measured
* in pixels.
* params
* The first element of this array should give a value for "k"
* in the cos(k*pi*x) term.
* flags
* Not used.
* value
* Pointer to a double to receive the calculated kernel value.
* status
* Pointer to the inherited status variable.
* Notes:
* - This function does not perform error checking and does not
* generate errors.
*/
/* Local Variables: */
double offset_k; /* Scaled offset */
static double halfpi; /* Value of pi/2 */
static double pi; /* Value of pi */
static int init = 0; /* Initialisation flag */
/* On the first invocation, initialise local values for pi and
pi/2. Do this only once. */
if ( !init ) {
pi = acos( -1.0 );
halfpi = 0.5 * pi;
init = 1;
}
/* Multiply the offset by pi and remove its sign. */
offset = pi * fabs( offset );
/* Find the offset scaled by the "k" factor. */
offset_k = offset * params[ 0 ];
/* If the cos(k*pi*x) term has not reached zero, calculate the
result. */
if ( offset_k < halfpi ) {
*value = ( ( offset != 0.0 ) ? ( J1Bessel( offset, status ) / offset ) : 1.0 ) *
cos( offset_k );
/* Otherwise, the result is zero. */
} else {
*value = 0.0;
}
}
static int SpecialBounds( const MapData *mapdata, double *lbnd, double *ubnd,
double xl[], double xu[], int *status ) {
/*
* Name:
* SpecialBounds
* Purpose:
* Estimate coordinate bounds using special points.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int SpecialBounds( const MapData *mapdata, double *lbnd, double *ubnd,
* double xl[], double xu[], int *status );
* Class Membership:
* Mapping member function.
* Description:
* This function makes a rough estimate of the lower and upper
* bounds of a Mapping function over a constrained region of its
* input coordinate space by transforming a set of special test
* points. The points used lie at the corners of the constrained
* region, at the centre of each of its faces, at its centroid, and
* (if within the coordinate constraints) the origin.
*
* In many practical cases, the true extrema may actually lie at
* one or other of these points, in which case the true bounds will
* be found. In other cases, this function only provides an
* approximate limit on each bound (there is no way of telling if
* this is the case, however). In either case, having these initial
* estimates can speed subsequent searches to find the global
* extrema as well as making that search more secure
* Parameters:
* mapdata
* Pointer to a MapData structure describing the Mapping
* function, its coordinate constraints, etc.
* lbnd
* Pointer to a double. On entry, this should contain a
* previously-obtained upper limit on the lower bound, or
* AST__BAD if no such limit is available. On exit, it will be
* updated with a new estimate of the lower bound, if a better
* one has been found.
* ubnd
* Pointer to a double. On entry, this should contain a
* previously-obtained lower limit on the upper bound, or
* AST__BAD if no such limit is available. On exit, it will be
* updated with a new estimate of the upper bound, if a better
* one has been found.
* xl
* Pointer to an array of double, with one element for each
* input coordinate, in which to return the position of a (not
* necessarily unique) input point at which the lower output
* bound is reached. This array is not altered if an improved
* estimate of the lower bound cannot be found.
* xu
* Pointer to an array of double, with one element for each
* input coordinate, in which to return the position of a (not
* necessarily unique) input point at which the upper output
* bound is reached. This array is not altered if an improved
* estimate of the upper bound cannot be found.
* status
* Pointer to the inherited status variable.
* Returned:
* A flag indicating if the returned values can be refined.
*/
/* Local Variables: */
AstPointSet *pset_in; /* PointSet for input coordinates */
AstPointSet *pset_out; /* PointSet for output coordinates */
double **ptr_in; /* Pointer to input coordinates */
double **ptr_out; /* Pointer to output coordinates */
double *sxl; /* Secondary xl values */
double *sxu; /* Secondary xu values */
double f; /* Output coordinate value */
double slbnd; /* Secondary lbnd value */
double subnd; /* Secondary lbnd value */
int *limit; /* Workspace for lower/upper limit flags */
int bad; /* Output coordinate bad? */
int coord; /* Loop counter for coordinates */
int done; /* All corners done? */
int face; /* Loop counter for faces */
int ic; /* Index of corner */
int icen; /* Index of centroid point */
int ncorner; /* Number of corners */
int ncoord; /* Number of input coordinates */
int npoint; /* Number of points */
int origin; /* Origin lies within bounds? */
int point; /* Loop counter for points */
int result; /* Returned flag */
/* Initialise */
result = 1;
/* Initialise variables to avoid "used of uninitialised variable"
messages from dumb compilers. */
pset_out = NULL;
/* Obtain the number of coordinate axes and calculate the number of
points required in order to place one at every corner of the
constrained region of the coordinate space. */
ncoord = mapdata->nin;
for ( npoint = 1, coord = 0; coord < ncoord; coord++ ) npoint *= 2;
/* Also include a second point at each corner,offset slightly from the
corner towards the centroid */
ncorner = npoint;
npoint *= 2;
/* Also include placing one at the centre of every face and one at the
centroid of the constrained coordinate space. */
npoint += 2 * ncoord + 1;
/* Determine if the origin lies within the bounds. If so, include it
as a further point. */
origin = 1;
for ( coord = 0; coord < ncoord; coord++ ) {
if ( ( mapdata->lbnd[ coord ] > 0.0 ) ||
( mapdata->ubnd[ coord ] < 0.0 ) ) {
origin = 0;
break;
}
}
if ( origin ) npoint++;
/* Initialise secondary bounds to be the supplied primary bounds */
slbnd = *lbnd;
subnd = *ubnd;
/* Create workspace for ssecondary xl xu values */
sxl = astMalloc( sizeof(double)*(size_t) ncoord );
sxu = astMalloc( sizeof(double)*(size_t) ncoord );
/* Create a PointSet to hold the coordinates and obtain a pointer to
its coordinate values. Also allocate workspace for calculating the
corner coordinates. */
pset_in = astPointSet( npoint, ncoord, "", status );
ptr_in = astGetPoints( pset_in );
limit = astMalloc( sizeof( int ) * (size_t) ncoord );
if ( astOK ) {
/* Initialise the workspace. */
for ( coord = 0; coord < ncoord; coord++ ) limit[ coord ] = 0;
/* Loop to visit every corner. */
point = 0;
done = 0;
do {
/* At each corner, translate the contents of the "limit" array
(containing zeros and ones) into the lower or upper bound on the
corresponding axis. This gives the coordinates of the corner, which
we store in the input PointSet. */
for ( coord = 0; coord < ncoord; coord++ ) {
ptr_in[ coord ][ point ] = limit[ coord ] ?
mapdata->ubnd[ coord ] :
mapdata->lbnd[ coord ];
}
/* Increment the count of points (i.e. corners). */
point++;
/* Now update the limit array to identify the next corner. */
coord = 0;
do {
/* Flip the first zero found to become a one. This gives a new
corner. */
if ( !limit[ coord ] ) {
limit[ coord ] = 1;
break;
/* However, first flip any previous ones to become zeros and then
examine the next element. We have processed all corners once the
array is entirely filled with ones. */
} else {
limit[ coord ] = 0;
done = ( ++coord == ncoord );
}
} while ( !done );
} while ( !done );
/* Once the corners have been processed, loop to consider the centre
of each face. */
for ( face = 0; face < ( 2 * ncoord ); face++ ) {
/* First calculate the centroid value for each coordinate. Then set
one of these coordinates to the bound where the face lies. */
for ( coord = 0; coord < ncoord; coord++ ) {
ptr_in[ coord ][ point ] = 0.5 * ( mapdata->lbnd[ coord ] +
mapdata->ubnd[ coord ] );
}
ptr_in[ face / 2 ][ point ] = ( face % 2 ) ?
mapdata->lbnd[ face / 2 ] :
mapdata->ubnd[ face / 2 ];
/* Increment the count of points. */
point++;
}
/* Place a point at the centroid of the constrained coordinate
space. */
for ( coord = 0; coord < ncoord; coord++ ) {
ptr_in[ coord ][ point ] = 0.5 * ( mapdata->lbnd[ coord ] +
mapdata->ubnd[ coord ] );
}
icen = point++;
/* Add a set of positions which are offset slightly from each corner
towards the centroid. */
for ( ic = 0; ic < ncorner; ic++ ) {
for ( coord = 0; coord < ncoord; coord++ ) {
ptr_in[ coord ][ point ] = 0.999*ptr_in[ coord ][ ic ] +
0.001*ptr_in[ coord ][ icen ];
}
point++;
}
/* Finally, add the origin, if it lies within the constraints. */
if ( origin ) {
for ( coord = 0; coord < ncoord; coord++ ) {
ptr_in[ coord ][ point ] = 0.0;
}
}
/* Once all the input coordinates have been calculated, transform them
and obtain a pointer to the resulting coordinate values. */
pset_out = astTransform( mapdata->mapping, pset_in, mapdata->forward,
NULL );
ptr_out = astGetPoints( pset_out );
if ( astOK ) {
/* Loop through each point and test if any of its transformed
coordinates is bad. */
for ( point = 0; point < npoint; point++ ) {
bad = 0;
for ( coord = 0; coord < mapdata->nout; coord++ ) {
if ( ptr_out[ coord ][ point ] == AST__BAD ) {
bad = 1;
break;
}
}
/* If so, we ignore the point. Otherwise, extract the required
coordinate. */
f = ptr_out[ mapdata->coord ][ point ];
if ( !bad ) {
/* Use this to update the lower and upper bounds we are seeking. If
either bound is updated, also store the coordinates of the
corresponding input point. */
if ( ( *lbnd == AST__BAD ) || ( f < *lbnd ) ) {
*lbnd = f;
for ( coord = 0; coord < ncoord; coord++ ) {
xl[ coord ] = ptr_in[ coord ][ point ];
}
}
if ( ( *ubnd == AST__BAD ) || ( f > *ubnd ) ) {
*ubnd = f;
for ( coord = 0; coord < ncoord; coord++ ) {
xu[ coord ] = ptr_in[ coord ][ point ];
}
}
/* If this point has a bad coord value, it may still be useful if the
required coord value is not bad. In this case, extract the required
coordinate. */
} else if ( f != AST__BAD ) {
/* Use this to update secondary lower and upper bounds we are seeking.
These will be returned if no primary values are found via the previous
code block. */
if ( ( slbnd == AST__BAD ) || ( f < slbnd ) ) {
slbnd = f;
for ( coord = 0; coord < ncoord; coord++ ) {
sxl[ coord ] = ptr_in[ coord ][ point ];
}
}
if ( ( subnd == AST__BAD ) || ( f > subnd ) ) {
subnd = f;
for ( coord = 0; coord < ncoord; coord++ ) {
sxu[ coord ] = ptr_in[ coord ][ point ];
}
}
}
}
/* If no primary values could be found, use secondary values. */
if( *lbnd == AST__BAD && *ubnd == AST__BAD ) {
*lbnd = slbnd;
*ubnd = subnd;
for ( coord = 0; coord < ncoord; coord++ ) {
xu[ coord ] = sxu[ coord ];
xl[ coord ] = sxl[ coord ];
}
result = ( slbnd == AST__BAD || subnd == AST__BAD );
}
}
}
/* Free workspace */
sxl = astFree( sxl );
sxu = astFree( sxu );
/* Annul the temporary PointSets and free the workspace. */
pset_in = astAnnul( pset_in );
pset_out = astAnnul( pset_out );
limit = astFree( limit );
return result;
}
/*
* Name:
* SpreadKernel1<X>
* Purpose:
* Rebin a data grid, using a 1-d interpolation kernel.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void SpreadKernel1<X>( AstMapping *this, int ndim_out,
* const int *lbnd_out, const int *ubnd_out,
* const <Xtype> *in, const <Xtype> *in_var,
* double infac, int npoint, const int *offset,
* const double *const *coords,
* void (* kernel)( double, const double [], int,
* double *, int * ),
* int neighb, const double *params, int flags,
* <Xtype> badval, int npix_out, <Xtype> *out,
* <Xtype> *out_var, double *work, int64_t *nused,
* int *status )
* Class Membership:
* Mapping member function.
* Description:
* This is a set of functions which rebins a rectangular region of an
* input grid of data (and, optionally, associated statistical variance
* values) so as to place them into a new output grid. Each input
* grid point may be mapped on to a position in the output grid in
* an arbitrary way. The input and output grids may have any number
* of dimensions, not necessarily equal.
*
* Where the input positions given do not correspond with a pixel centre
* in the output grid, the each input pixel value is spread out between the
* surrounding output pixels using weights determined by a separable kernel
* which is the product of a 1-dimensional kernel function evaluated along
* each output dimension. A pointer should be supplied to the 1-dimensional
* kernel function to be used.
* Parameters:
* this
* Pointer to the Mapping being used in the rebinning operation
* (this is only used for constructing error messages).
* ndim_out
* The number of dimensions in the output grid. This should be at
* least one.
* lbnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the first
* pixel in the output grid along each dimension.
* ubnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the last
* pixel in the output grid along each dimension.
*
* Note that "lbnd_out" and "ubnd_out" together define the shape
* and size of the output grid, its extent along a particular
* (i'th) dimension being ubnd_out[i]-lbnd_out[i]+1 (assuming "i"
* is zero-based). They also define the output grid's coordinate
* system, with each pixel being of unit extent along each
* dimension with integral coordinate values at its centre.
* in
* Pointer to the array of data to be rebinned. The numerical type
* of these data should match the function used, as given by the
* suffix on the function name. Note that details of how the input
* grid maps on to this array (e.g. the storage order, number of
* dimensions, etc.) is arbitrary and is specified entirely by means
* of the "offset" array. The "in" array should therefore contain
* sufficient elements to accommodate the "offset" values supplied.
* There is no requirement that all elements of the "in" array
* should be rebinned, and any which are not addressed by the
* contents of the "offset" array will be ignored.
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and type as the "in" array), which
* represent estimates of the statistical variance associated
* with each element of the "in" array. If this second array is
* given (along with the corresponding "out_var" array), then
* estimates of the variance of the resampled data will also be
* returned. It is addressed in exactly the same way (via the
* "offset" array) as the "in" array.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* infac
* A factor by which to multiply the input data values before use.
* npoint
* The number of input points which are to be rebinned.
* offset
* Pointer to an array of integers with "npoint" elements. For
* each input point, this array should contain the zero-based
* offset in the input array(s) (i.e. the "in" and, optionally,
* the "in_var" arrays) from which the value to be rebinned should
* be obtained.
* coords
* An array of pointers to double, with "ndim_out" elements.
* Element "coords[coord]" should point at the first element of
* an array of double (with "npoint" elements) which contains the
* values of coordinate number "coord" for each point being
* rebinned. The value of coordinate number "coord" for
* rebinning point number "point" is therefore given by
* "coords[coord][point]" (assuming both indices are
* zero-based). If any point has a coordinate value of AST__BAD
* associated with it, then the corresponding input data (and
* variance) value will be ignored.
* kernel
* Pointer to the 1-dimensional kernel function to be used.
* neighb
* The number of neighbouring pixels in each dimension (on each
* side of the interpolation position) which are to receive
* contributions from the input pixel value. This value should be at
* least 1.
* params
* Pointer to an optional array of parameter values to be passed
* to the kernel function. If no parameters are required by this
* function, then a NULL pointer may be supplied.
* flags
* The bitwise OR of a set of flag values which control the
* operation of the function. These are chosend from:
*
* - AST__USEBAD: indicates whether there are "bad" (i.e. missing) data
* in the input array(s) which must be recognised. If this flag is not
* set, all input values are treated literally.
* - AST__GENVAR: Indicates that output variances should be generated
* from the spread of values contributing to each output pixel.
* - AST__USEVAR: Indicates that output variances should be generated
* by rebinning the input variances.
* - AST__VARWGT: Indicates that input variances should be used to
* create weights for the input data values.
*
* Only one of AST__GENVAR and AST__USEVAR should be supplied.
* badval
* If the AST__USEBAD flag is set in the "flags" value (above),
* this parameter specifies the value which is used to identify
* bad data and/or variance values in the input array(s). Its
* numerical type must match that of the "in" (and "in_var")
* arrays. The same value will also be used to flag any output
* array elements for which resampled values could not be
* obtained. The output arrays(s) may be flagged with this
* value whether or not the AST__USEBAD flag is set (the
* function return value indicates whether any such values have
* been produced).
* npix_out
* Number of pixels in output array.
* out
* Pointer to an array with the same data type as the "in"
* array, into which the rebinned data will be returned. The
* storage order should be such that the index of the first grid
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order).
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the rebinned values may be returned. This array will only be
* used if the "in_var" array has been given. The values returned
* are estimates of the statistical variance of the corresponding
* values in the "out" array, on the assumption that all errors in
* input grid values (in the "in" array) are statistically independent
* and that their variance estimates (in the "in_var" array) may
* simply be summed (with appropriate weighting factors).
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* work
* A pointer to an array with the same data type and size as the "out"
* array which is used as work space. The values in the supplied
* array are incremented on exit by the sum of the weights used
* with each output pixel.
* nused
* An optional pointer to a int64_t which will be incremented by the
* number of input values pasted into the output array. Ignored if NULL.
* Notes:
* - There is a separate function for each numerical type of
* gridded data, distinguished by replacing the <X> in the function
* name by the appropriate 1- or 2-character suffix.
*/
/* Define macros to implement the function for a specific data
type. */
#define MAKE_SPREAD_KERNEL1(X,Xtype,IntType) \
static void SpreadKernel1##X( AstMapping *this, int ndim_out, \
const int *lbnd_out, const int *ubnd_out, \
const Xtype *in, const Xtype *in_var, \
double infac, int npoint, const int *offset, \
const double *const *coords, \
void (* kernel)( double, const double [], \
int, double *, int * ), \
int neighb, const double *params, \
int flags, Xtype badval, int npix_out, \
Xtype *out, Xtype *out_var, double *work, \
int64_t *nused, int *status ) { \
\
/* Local Variables: */ \
astDECLARE_GLOBALS /* Thread-specific data */ \
Xtype c; \
Xtype in_val; /* Input pixel value */ \
double **wtptr; /* Pointer to array of weight pointers */ \
double **wtptr_last; /* Array of highest weight pointer values */ \
double *filter; /* Pointer to Nd array of filter values */ \
double *kp; /* Pointer to next weight values */ \
double *kstart; /* Pointer to next kernel value */ \
double *kval; /* Pointer to 1d array of kernel values */ \
double *wtprod; /* Accumulated weight value array pointer */ \
double *xfilter; /* Pointer to 1d array of x axis filter values */ \
double *xnl; /* Pointer to previous ofset array (n-d) */ \
double pfac; /* Input weight with extra supplied factor */ \
double pixwt; /* Weight to apply to individual pixel */ \
double sum; /* Sum of all filter values */ \
double wgt; /* Weight for input value */ \
double x; /* x coordinate value */ \
double xn; /* Coordinate value (n-d) */ \
double xx; /* X offset */ \
double xxl; /* Previous X offset */ \
double xxn; \
double y; /* y coordinate value */ \
double yy; /* Y offset */ \
double yyl; /* Previous Y offset */ \
int *hi; /* Pointer to array of upper indices */ \
int *jhi; /* Pointer to array of filter upper indices */ \
int *jlo; /* Pointer to array of filter lower indices */ \
int *lo; /* Pointer to array of lower indices */ \
int *stride; /* Pointer to array of dimension strides */ \
int bad; /* Output pixel bad? */ \
int done; /* All pixel indices done? */ \
int genvar; /* Generate output variances? */ \
int hi_ix; /* Upper output pixel index (x dimension) */ \
int hi_iy; /* Upper output pixel index (y dimension) */ \
int hi_jx; /* Upper filter pixel index (x dimension) */ \
int hi_jy; /* Upper filter pixel index (y dimension) */ \
int idim; /* Loop counter for dimensions */ \
int ii; /* Loop counter for dimensions */ \
int ix; /* Pixel index in output grid x dimension */ \
int iy; /* Pixel index in output grid y dimension */ \
int jjx; /* Reflected pixel index in filter grid x dimension */ \
int jjy; /* Reflected pixel index in filter grid y dimension */ \
int jx; /* Pixel index in filter grid x dimension */ \
int jxn; \
int jy; /* Pixel index in filter grid y dimension */ \
int kerror; /* Error signalled by kernel function? */ \
int lo_ix; /* Lower output pixel index (x dimension) */ \
int lo_iy; /* Lower output pixel index (y dimension) */ \
int lo_jx; /* Lower filter pixel index (x dimension) */ \
int lo_jy; /* Lower filter pixel index (y dimension) */ \
int nb2; /* The total number of neighbouring pixels */ \
int nf; /* Number of pixels in filter array */ \
int nwx; /* Used X width of kernel function (*2) */ \
int nwy; /* Used Y width of kernel function (*2) */ \
int off1; /* Input pixel offset due to y index */ \
int off_in; /* Offset to input pixel */ \
int off_out; /* Offset to output pixel */ \
int off_xedge; /* Does filter box overlap array edge on the X axis? */ \
int off_yedge; /* Does filter box overlap array edge on the Y axis? */ \
int point; /* Loop counter for output points */ \
int s; /* Temporary variable for strides */ \
int usebad; /* Use "bad" input pixel values? */ \
int usevar; /* Process variance array? */ \
int varwgt; /* Use input variances as weights? */ \
int ystride; /* Stride along input grid y dimension */ \
\
/* Check the global error status. */ \
if ( !astOK ) return; \
\
/* Get a pointer to a structure holding thread-specific global data values */ \
astGET_GLOBALS(this); \
\
/* Further initialisation. */ \
kerror = 0; \
sum = 0.0; \
bad = 0; \
\
/* Find the total number of pixels in the filter used to spread a single \
input pixel into the output image. */ \
nb2 = 2*neighb; \
nf = 1; \
for ( idim = 0; idim < ndim_out; idim++ ) nf *= nb2; \
\
/* Allocate workspace to hold the filter values. */ \
filter = astMalloc( sizeof( double ) * (size_t) nf ); \
if ( astOK ) { \
\
/* Determine if we are processing bad pixels or variances. */ \
usebad = flags & AST__USEBAD; \
usevar = 0; \
genvar = 0; \
if( flags & AST__GENVAR ) { \
genvar = out_var && work; \
} else if( flags & AST__USEVAR ) { \
usevar = in_var && out_var; \
} \
varwgt = ( flags & AST__VARWGT ) && in_var && work; \
\
/* Handle the 1-dimensional case optimally. */ \
/* ---------------------------------------- */ \
if ( ndim_out == 1 ) { \
\
/* Identify eight cases, according to whether bad pixels and/or variances \
are being processed and/or used. In each case we assign constant values \
(0 or 1) to the "Usebad", "Usevar" and "Varwgt" flags so that code for \
handling bad pixels and variances can be eliminated by the compiler's \
optimisation system when not required. */ \
if( varwgt ) { \
if ( usebad ) { \
if ( usevar ) { \
KERNEL_1D(X,Xtype,1,1,0,IntType,1) \
} else if ( genvar ) { \
KERNEL_1D(X,Xtype,1,0,1,IntType,1) \
} else { \
KERNEL_1D(X,Xtype,1,0,0,IntType,1) \
} \
} else { \
if ( usevar ) { \
KERNEL_1D(X,Xtype,0,1,0,IntType,1) \
} else if ( genvar ) { \
KERNEL_1D(X,Xtype,0,0,1,IntType,1) \
} else { \
KERNEL_1D(X,Xtype,0,0,0,IntType,1) \
} \
} \
} else { \
if ( usebad ) { \
if ( usevar ) { \
KERNEL_1D(X,Xtype,1,1,0,IntType,0) \
} else if ( genvar ) { \
KERNEL_1D(X,Xtype,1,0,1,IntType,0) \
} else { \
KERNEL_1D(X,Xtype,1,0,0,IntType,0) \
} \
} else { \
if ( usevar ) { \
KERNEL_1D(X,Xtype,0,1,0,IntType,0) \
} else if ( genvar ) { \
KERNEL_1D(X,Xtype,0,0,1,IntType,0) \
} else { \
KERNEL_1D(X,Xtype,0,0,0,IntType,0) \
} \
} \
} \
\
/* Exit point on error in kernel function */ \
Kernel_SError_1d: ; \
\
/* Handle the 2-dimensional case optimally. */ \
/* ---------------------------------------- */ \
} else if ( ndim_out == 2 ) { \
\
/* Allocate workspace to hold the X axis filter values. */ \
xfilter = astMalloc( sizeof( double ) * (size_t) nb2 ); \
\
/* Calculate the stride along the y dimension of the output grid. */ \
ystride = ubnd_out[ 0 ] - lbnd_out[ 0 ] + 1; \
\
/* Identify eight cases, according to whether bad pixels and/or variances \
are being processed and/or used. In each case we assign constant values \
(0 or 1) to the "Usebad", "Usevar" and "Varwgt" flags so that code for \
handling bad pixels and variances can be eliminated by the compiler's \
optimisation system when not required. */ \
if( varwgt ) { \
if ( usebad ) { \
if ( usevar ) { \
KERNEL_2D(X,Xtype,1,1,0,IntType,1) \
} else if ( genvar ) { \
KERNEL_2D(X,Xtype,1,0,1,IntType,1) \
} else { \
KERNEL_2D(X,Xtype,1,0,0,IntType,1) \
} \
} else { \
if ( usevar ) { \
KERNEL_2D(X,Xtype,0,1,0,IntType,1) \
} else if ( genvar ) { \
KERNEL_2D(X,Xtype,0,0,1,IntType,1) \
} else { \
KERNEL_2D(X,Xtype,0,0,0,IntType,1) \
} \
} \
} else { \
if ( usebad ) { \
if ( usevar ) { \
KERNEL_2D(X,Xtype,1,1,0,IntType,0) \
} else if ( genvar ) { \
KERNEL_2D(X,Xtype,1,0,1,IntType,0) \
} else { \
KERNEL_2D(X,Xtype,1,0,0,IntType,0) \
} \
} else { \
if ( usevar ) { \
KERNEL_2D(X,Xtype,0,1,0,IntType,0) \
} else if ( genvar ) { \
KERNEL_2D(X,Xtype,0,0,1,IntType,0) \
} else { \
KERNEL_2D(X,Xtype,0,0,0,IntType,0) \
} \
} \
} \
\
/* Free work space */ \
xfilter = astFree( xfilter ); \
\
/* Exit point on error in kernel function */ \
Kernel_SError_2d: ; \
\
/* Handle other numbers of dimensions. */ \
/* ----------------------------------- */ \
} else { \
\
/* Allocate workspace. */ \
hi = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
lo = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
jhi = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
jlo = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
stride = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
xnl = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
kval = astMalloc( sizeof( double ) * (size_t) \
( nb2 * ndim_out ) ); \
wtprod = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
wtptr = astMalloc( sizeof( double * ) * (size_t) ndim_out ); \
wtptr_last = astMalloc( sizeof( double * ) * (size_t) ndim_out ); \
if ( astOK ) { \
\
/* Calculate the stride along each dimension of the output grid. */ \
for ( s = 1, idim = 0; idim < ndim_out; idim++ ) { \
stride[ idim ] = s; \
s *= ubnd_out[ idim ] - lbnd_out[ idim ] + 1; \
xnl[ idim ] = AST__BAD; \
} \
\
/* Identify eight cases, according to whether bad pixels and/or variances \
are being processed and/or used. In each case we assign constant values \
(0 or 1) to the "Usebad", "Usevar" and "Varwgt" flags so that code for \
handling bad pixels and variances can be eliminated by the compiler's \
optimisation system when not required. */ \
if( varwgt ) { \
if ( usebad ) { \
if ( usevar ) { \
KERNEL_ND(X,Xtype,1,1,0,IntType,1) \
} else if ( genvar ) { \
KERNEL_ND(X,Xtype,1,0,1,IntType,1) \
} else { \
KERNEL_ND(X,Xtype,1,0,0,IntType,1) \
} \
} else { \
if ( usevar ) { \
KERNEL_ND(X,Xtype,0,1,0,IntType,1) \
} else if ( genvar ) { \
KERNEL_ND(X,Xtype,0,0,1,IntType,1) \
} else { \
KERNEL_ND(X,Xtype,0,0,0,IntType,1) \
} \
} \
} else { \
if ( usebad ) { \
if ( usevar ) { \
KERNEL_ND(X,Xtype,1,1,0,IntType,0) \
} else if ( genvar ) { \
KERNEL_ND(X,Xtype,1,0,1,IntType,0) \
} else { \
KERNEL_ND(X,Xtype,1,0,0,IntType,0) \
} \
} else { \
if ( usevar ) { \
KERNEL_ND(X,Xtype,0,1,0,IntType,0) \
} else if ( genvar ) { \
KERNEL_ND(X,Xtype,0,0,1,IntType,0) \
} else { \
KERNEL_ND(X,Xtype,0,0,0,IntType,0) \
} \
} \
} \
\
/* Exit point on error in kernel function */ \
Kernel_SError_Nd: ;\
} \
\
/* Free the workspace. */ \
hi = astFree( hi ); \
lo = astFree( lo ); \
jhi = astFree( jhi ); \
jlo = astFree( jlo ); \
stride = astFree( stride ); \
xnl = astFree( xnl ); \
kval = astFree( kval ); \
wtprod = astFree( wtprod ); \
wtptr = astFree( wtptr ); \
wtptr_last = astFree( wtptr_last ); \
} \
filter = astFree( filter ); \
}\
\
/* If an error occurred in the kernel function, then report a \
contextual error message. */ \
if ( kerror ) { \
astError( astStatus, "astRebin"#X"(%s): Error signalled by " \
"user-supplied 1-d interpolation kernel.", status, \
astGetClass( unsimplified_mapping ) ); \
} \
\
}
#define KERNEL_1D(X,Xtype,Usebad,Usevar,Genvar,IntType,Varwgt) \
\
/* We do not yet have a previous filter position. */ \
xxl = AST__BAD; \
\
/* Loop round all input points which are to be rebinned. */ \
for( point = 0; point < npoint; point++ ) { \
\
/* Obtain the input data value which is to be added into the output array. */ \
off_in = offset[ point ]; \
in_val = in[ off_in ]; \
\
/* If necessary, test if the input data value or variance is bad. If we \
are using the reciprocal of the input variances as weights, then \
variance values of zero are also effectively bad (but we can use input \
variances of zero otherwise). */ \
if ( Usebad ) { \
bad = ( in_val == badval ); \
if ( Varwgt ) { \
bad = bad || ( in_var[ off_in ] == badval ) \
|| ( in_var[ off_in ] <= 0.0 ); \
} else if ( Usevar ) { \
bad = bad || ( in_var[ off_in ] == badval ); \
} \
} else { \
if ( Varwgt ) { \
bad = ( in_var[ off_in ] <= 0.0 ); \
} else { \
bad = 0; \
} \
} \
\
/* Obtain the x coordinate of the current point and test if it is bad. \
Also test that the central point falls within the output array. */ \
x = coords[ 0 ][ point ]; \
ix = (int) floor( x + 0.5 ); \
if( ix < lbnd_out[ 0 ] || ix > ubnd_out[ 0 ] ) bad = 1; \
bad = bad || ( x == AST__BAD ); \
\
/* If OK, calculate the lowest and highest indices (in the x \
dimension) of the region of neighbouring output pixels that will \
receive contributions from the current input pixel. Constrain these \
values to lie within the output grid. */ \
if ( !bad ) { \
ix = (int) floor( x ) - neighb + 1; \
lo_ix = MaxI( ix, lbnd_out[ 0 ], status ); \
hi_ix = MinI( ix + nb2 - 1, ubnd_out[ 0 ], status ); \
\
/* Skip to the next input point if the current input point makes no \
contribution to any output pixel. */ \
if( lo_ix <= hi_ix ) { \
\
/* Increment the number of input pixels pasted into the output array. */ \
if( nused ) (*nused)++; \
\
/* Convert these output indices to the corresponding indices \
within a box [ 0, 2*neighb ] holding the kernel values. */ \
lo_jx = lo_ix - ix; \
hi_jx = hi_ix - ix; \
\
/* See if the kernel extends off the edge of the output array. */ \
nwx = hi_jx - lo_jx + 1; \
off_xedge = ( nwx < nb2 ); \
\
/* Use the kernel function to fill the work array with weights for all output \
pixels whether or not they fall within the output array. At the same \
time find the sum of all the factors. */ \
xx = (double) ix - x; \
if( xx != xxl || off_xedge ) { \
sum = 0.0; \
\
/* First handle cases where the kernel box overlaps an edge of the output \
array. In these cases, in order to conserve flux, the bit of the \
kernel function that is off the edge is reflected back onto the array. \
Care must be taken since the reflected part of the kernel may itself \
overlap the opposite edge of the array, in which case the overlapping \
part must again be reflected back onto the array. This iterative \
reflection is implemented using a fractional division (%) operator. */ \
if( off_xedge ) { \
nwx *= 2; \
xxl = AST__BAD; \
for( jx = 0; jx < nb2; jx++ ) filter[ jx ] = 0.0; \
\
for ( jx = 0; jx < nb2; jx++ ) { \
( *kernel )( xx, params, flags, &pixwt, status ); \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_SError_1d; \
} \
\
jjx = ( jx - lo_jx ) % nwx + lo_jx; \
if( jjx < lo_jx ) jjx += nwx; \
if( jjx > hi_jx ) jjx = 2*hi_jx - jjx + 1; \
\
filter[ jjx ] += pixwt; \
sum += pixwt; \
xx += 1.0; \
} \
\
/* Now handle cases where the kernel box is completely within the output \
array. */ \
} else { \
xxl = xx; \
\
for ( jx = 0; jx < nb2; jx++ ) { \
( *kernel )( xx, params, flags, &pixwt, status ); \
\
/* Check for errors arising in the kernel function. */ \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_SError_1d; \
} \
\
/* Store the kernel factor and increment the sum of all factors. */ \
filter[ jx ] = pixwt; \
sum += pixwt; \
xx += 1.0; \
} \
\
} \
\
/* Ensure we do not divide by zero. */ \
if( sum == 0.0 ) sum = 1.0; \
} \
\
/* If we are using the input data variances as weights, calculate the \
total weight, incorporating the normalisation factor for the kernel. */ \
if( Varwgt ) { \
wgt = 1.0/(sum*in_var[ off_in ]); \
\
/* If we are not using input variances as weights, the weight is just the \
kernel normalisation factor. */ \
} else { \
wgt = 1.0/sum; \
} \
\
/* Loop round all the output pixels which receive contributions from this \
input pixel, calculating the offset of each pixel from the start of the \
input array. */ \
off_out = lo_ix - lbnd_out[ 0 ]; \
for ( jx = lo_jx; jx <= hi_jx; jx++, off_out++ ) { \
\
/* Retrieve the weight for the current output pixel and normalise it. */ \
pixwt = wgt*filter[ jx ]; \
pfac = pixwt*infac; \
\
/* Update the output pixel with the required fraction of the input pixel \
value. */ \
c = CONV(IntType,pfac*in_val); \
\
if( work ) { \
out[ off_out ] += c; \
work[ off_out ] += pixwt; \
} else {\
out[ off_out ] += c; \
} \
\
if ( Usevar ) { \
out_var[ off_out ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && pixwt != 0.0 ) { \
out_var[ off_out ] += c*c/pixwt; \
work[ off_out + npix_out ] += pixwt*pixwt; \
} \
\
} \
} \
} \
}
#define KERNEL_2D(X,Xtype,Usebad,Usevar,Genvar,IntType,Varwgt) \
\
/* We do not yet have a previous filter position. */ \
xxl = AST__BAD; \
yyl = AST__BAD; \
\
/* Loop round all input points which are to be rebinned. */ \
for( point = 0; point < npoint; point++ ) { \
\
/* Obtain the input data value which is to be added into the output array. */ \
off_in = offset[ point ]; \
in_val = in[ off_in ]; \
\
/* If necessary, test if the input data value or variance is bad. If we \
are using the reciprocal of the input variances as weights, then \
variance values of zero are also effectively bad (but we can use input \
variances of zero otherwise). */ \
if ( Usebad ) { \
bad = ( in_val == badval ); \
if ( Varwgt ) { \
bad = bad || ( in_var[ off_in ] == badval ) \
|| ( in_var[ off_in ] <= 0.0 ); \
} else if ( Usevar ) { \
bad = bad || ( in_var[ off_in ] == badval ); \
} \
} else { \
if ( Varwgt ) { \
bad = ( in_var[ off_in ] <= 0.0 ); \
} else { \
bad = 0; \
} \
} \
\
/* Obtain the x coordinate of the current point and test if it is bad. \
Also test that the central point falls within the output array. */ \
x = coords[ 0 ][ point ]; \
ix = (int) floor( x + 0.5 ); \
if( ix < lbnd_out[ 0 ] || ix > ubnd_out[ 0 ] ) bad = 1; \
bad = bad || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* Similarly obtain and test the y coordinate. */ \
y = coords[ 1 ][ point ]; \
iy = (int) floor( y + 0.5 ); \
if( iy < lbnd_out[ 1 ] || iy > ubnd_out[ 1 ] ) bad = 1; \
bad = bad || ( y == AST__BAD ); \
if ( !bad ) { \
\
/* If OK, calculate the lowest and highest indices (in each dimension) \
of the region of neighbouring output pixels which will receive \
contributions from the current input pixel. Constrain these values \
to lie within the input grid. */ \
ix = (int) floor( x ) - neighb + 1; \
lo_ix = MaxI( ix, lbnd_out[ 0 ], status ); \
hi_ix = MinI( ix + nb2 - 1, ubnd_out[ 0 ], status ); \
iy = (int) floor( y ) - neighb + 1; \
lo_iy = MaxI( iy, lbnd_out[ 1 ], status ); \
hi_iy = MinI( iy + nb2 - 1, ubnd_out[ 1 ], status ); \
\
/* Skip to the next input point if the current input point makes no \
contribution to any output pixel. */ \
if( lo_ix <= hi_ix && lo_iy <= hi_iy ) { \
\
/* Increment the number of input pixels pasted into the output array. */ \
if( nused ) (*nused)++; \
\
/* Convert these output indices to the corresponding indices \
within a box [ 0:2*neighb, 0:2*neighb ] holding the kernel values. */ \
lo_jx = lo_ix - ix; \
hi_jx = hi_ix - ix; \
lo_jy = lo_iy - iy; \
hi_jy = hi_iy - iy; \
\
/* See if the kernel extends off the edge of the output array on either \
axis. */ \
nwx = hi_jx - lo_jx + 1; \
nwy = hi_jy - lo_jy + 1; \
off_xedge = ( nwx < nb2 ); \
off_yedge = ( nwy < nb2 ); \
\
/* Loop to evaluate the kernel function along the y dimension, storing \
the resulting weight values in all elements of each associated row \
in the kvar array. The function's argument is the offset of the \
output pixel (along this dimension) from the central output \
position. */ \
yy = (double) iy - y; \
xx = (double) ix - x; \
if( xx != xxl || yy != yyl || off_xedge || off_yedge ) { \
\
/* First handle cases where the kernel box extends beyond the top or \
bottom edge of the output array. In these cases, in order to conserve \
flux, the bit of the kernel function that is off the edge is reflected \
back onto the array. Care must be taken since the reflected part of the \
kernel may itself overlap the opposite edge of the array, in which \
case the overlapping part must again be reflected back onto the \
array. This iterative reflection is implemented using a fractional \
division (%) operator. */ \
if( off_yedge ) { \
nwy *= 2; \
xxl = AST__BAD; \
yyl = AST__BAD; \
for( jy = 0; jy < nb2*nb2; jy++ ) filter[ jy ] = 0.0; \
\
for ( jy = 0; jy < nb2; jy++ ) { \
( *kernel )( yy, params, flags, &pixwt, status ); \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_SError_2d; \
} \
\
jjy = ( jy - lo_jy ) % nwy + lo_jy; \
if( jjy < lo_jy ) jjy += nwy; \
if( jjy > hi_jy ) jjy = 2*hi_jy - jjy + 1; \
\
kp = filter + jjy*nb2; \
for( jx = 0; jx < nb2; jx++ ) *(kp++) += pixwt; \
yy += 1.0; \
} \
\
/* Now handles cases where the kernel does not overlap the top or bottom edge \
of the output array. */ \
} else { \
xxl = xx; \
yyl = yy; \
kp = filter; \
for ( jy = 0; jy < nb2; jy++ ) { \
( *kernel )( yy, params, flags, &pixwt, status ); \
\
/* Check for errors arising in the kernel function. */ \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_SError_2d; \
} \
\
/* Store the kernel factor in all elements of the current row. */ \
for( jx = 0; jx < nb2; jx++ ) *(kp++) = pixwt; \
\
/* Move on to the next row. */ \
yy += 1.0; \
} \
} \
\
/* Loop to evaluate the kernel function along the x dimension, multiplying \
the resulting weight values by the values already stored in the the \
associated column in the kvar array. The function's argument is the \
offset of the output pixel (along this dimension) from the central output \
position. Also form the total data sum in the filter array. First \
handle cases where the kernel overlaps the left or right edge of the \
output array. */ \
sum = 0.0; \
\
/* First deal with cases where the kernel extends beyond the left or \
right edge of the output array. */ \
if( off_xedge ) { \
nwx *= 2; \
xxl = AST__BAD; \
for( jx = 0; jx < nb2; jx++ ) xfilter[ jx ] = 0.0; \
\
for ( jx = 0; jx < nb2; jx++ ) { \
( *kernel )( xx, params, flags, &pixwt, status ); \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_SError_2d; \
} \
\
jjx = ( jx - lo_jx ) % nwx + lo_jx; \
if( jjx < lo_jx ) jjx += nwx; \
if( jjx > hi_jx ) jjx = 2*hi_jx - jjx + 1; \
\
xfilter[ jjx ] += pixwt; \
xx += 1.0; \
} \
\
for ( jx = 0; jx < nb2; jx++ ) { \
kp = filter + jx; \
for( jy = 0; jy < nb2; jy++, kp += nb2 ) { \
*kp *= xfilter[ jx ]; \
sum += *kp; \
} \
} \
\
/* Now deal with cases where the kernel does not extends beyond the left or \
right edge of the output array. */ \
} else { \
\
for ( jx = 0; jx < nb2; jx++ ) { \
( *kernel )( xx, params, flags, &pixwt, status ); \
\
/* Check for errors arising in the kernel function. */ \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_SError_2d; \
} \
\
/* Multiply the kernel factor by all elements of the current column. */ \
kp = filter + jx; \
for( jy = 0; jy < nb2; jy++, kp += nb2 ) { \
*kp *= pixwt; \
sum += *kp; \
} \
\
/* Move on to the next column. */ \
xx += 1.0; \
} \
} \
\
/* Ensure we do not divide by zero. */ \
if( sum == 0.0 ) sum = 1.0; \
} \
\
/* If we are using the input data variances as weights, calculate the \
total weight, incorporating the normalisation factor for the kernel. */ \
if( Varwgt ) { \
wgt = 1.0/(sum*in_var[ off_in ]); \
\
/* If we are not using input variances as weights, the weight is just the \
kernel normalisation factor. */ \
} else { \
wgt = 1.0/sum; \
} \
\
/* Find the offset into the output array at the first modified output pixel \
in the first modified row. */ \
off1 = lo_ix - lbnd_out[ 0 ] + ystride * ( lo_iy - lbnd_out[ 1 ] ); \
\
/* Loop over the affected output rows again. */ \
for ( jy = lo_jy; jy <= hi_jy; jy++, off1 += ystride ) { \
\
/* Save the offset of the first output pixel to be modified in the \
current row. */ \
off_out = off1; \
\
/* Get a pointer to the first weight value which will be used. */ \
kp = filter + lo_jx + jy*nb2; \
\
/* Loop over the affected output columns again. */ \
for ( jx = lo_jx; jx <= hi_jx; jx++, off_out++, kp++ ) { \
\
/* Calculate the weight for this output pixel and normalise it. */ \
pixwt = wgt*( *kp ); \
\
/* Update the output pixel with the required fraction of the input pixel \
value. */ \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
\
out[ off_out ] += c; \
if( work ) work[ off_out ] += pixwt; \
\
if ( Usevar ) { \
out_var[ off_out ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && pixwt != 0.0 ) { \
out_var[ off_out ] += c*c/pixwt; \
work[ off_out + npix_out ] += pixwt*pixwt; \
} \
} \
} \
} \
} \
} \
}
#define KERNEL_ND(X,Xtype,Usebad,Usevar,Genvar,IntType,Varwgt) \
\
/* We do not yet have a normalising factor */ \
sum = AST__BAD; \
\
/* Loop round all input points which are to be rebinned. */ \
for( point = 0; point < npoint; point++ ) { \
\
/* Obtain the input data value which is to be added into the output array. */ \
off_in = offset[ point ]; \
in_val = in[ off_in ]; \
\
/* If necessary, test if the input data value or variance is bad. If we \
are using the reciprocal of the input variances as weights, then \
variance values of zero are also effectively bad (but we can use input \
variances of zero otherwise). */ \
if ( Usebad ) { \
bad = ( in_val == badval ); \
if ( Varwgt ) { \
bad = bad || ( in_var[ off_in ] == badval ) \
|| ( in_var[ off_in ] <= 0.0 ); \
} else if ( Usevar ) { \
bad = bad || ( in_var[ off_in ] == badval ); \
} \
} else { \
if ( Varwgt ) { \
bad = ( in_var[ off_in ] <= 0.0 ); \
} else { \
bad = 0; \
} \
} \
\
/* Initialise offsets into the output array. Then loop to obtain each \
coordinate associated with the current output point. Set a flag \
indicating if any output pixel will be modified. */ \
if( !bad ) { \
off_out = 0; \
for ( idim = 0; idim < ndim_out; idim++ ) { \
xn = coords[ idim ][ point ]; \
\
/* Test if the coordinate is bad. If true, the corresponding output pixel \
value will be bad, so give up on this point. */ \
ix = (int) floor( xn + 0.5 ); \
if( ix < lbnd_out[ idim ] || ix > ubnd_out[ idim ] ) bad = 1; \
bad = bad || ( xn == AST__BAD ); \
if ( bad ) break; \
\
/* Calculate the lowest and highest indices (in the current dimension) \
of the region of neighbouring output pixels that will be modified. \
Constrain these values to lie within the output grid. */ \
ix = (int) floor( xn ) - neighb + 1; \
lo[ idim ] = MaxI( ix, lbnd_out[ idim ], status ); \
hi[ idim ] = MinI( ix + nb2 - 1, ubnd_out[ idim ], status ); \
jlo[ idim ] = lo[ idim ] - ix; \
jhi[ idim ] = hi[ idim ] - ix; \
\
/* Check there is some overlap with the output array on this axis. */ \
if( lo[ idim ] > hi[ idim ] ) { \
bad = 1; \
break; \
} \
\
/* Accumulate the offset (from the start of the output array) of the \
modified output pixel which has the lowest index in each dimension. */ \
off_out += stride[ idim ] * ( lo[ idim ] - lbnd_out[ idim ] ); \
\
/* Set up an array of pointers to locate the first filter pixel (stored in the \
"kval" array) for each dimension. */ \
wtptr[ idim ] = kval + nb2*idim; \
wtptr_last[ idim ] = wtptr[ idim ] + nb2 - 1; \
\
/* See if the kernel extends off the edge of the output array on the current \
axis. */ \
lo_jx = jlo[ idim ]; \
hi_jx = jhi[ idim ]; \
nwx = hi_jx - lo_jx + 1; \
off_xedge = ( nwx < nb2 ); \
\
/* Loop to evaluate the kernel function along each dimension, storing \
the resulting values. The function's argument is the offset of the \
output pixel (along the relevant dimension) from the central output \
point. */ \
xxn = (double) ix - xn; \
if( xxn != xnl[ idim ] || off_xedge ) { \
sum = AST__BAD; \
\
/* First handle cases where the kernel box overlaps an edge of the output \
array. In these cases, in order to conserve flux, the bit of the \
kernel function that is off the edge is reflected back onto the array. \
Care must be taken since the reflected part of the kernel may itself \
overlap the opposite edge of the array, in which case the overlapping \
part must again be reflected back onto the array. This iterative \
reflection is implemented using a fractional division (%) operator. */ \
if( off_xedge ) { \
nwx *= 2; \
xnl[ idim ] = AST__BAD; \
kp = wtptr[ idim ]; \
for( jx = 0; jx < nb2; jx++ ) *(kp++) = 0.0; \
\
kp = wtptr[ idim ]; \
for ( jx = 0; jx < nb2; jx++ ) { \
( *kernel )( xxn, params, flags, &pixwt, status ); \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_SError_1d; \
} \
\
jjx = ( jx - lo_jx ) % nwx + lo_jx; \
if( jjx < lo_jx ) jjx += nwx; \
if( jjx > hi_jx ) jjx = 2*hi_jx - jjx + 1; \
\
kp[ jjx ] += pixwt; \
xxn += 1.0; \
} \
\
/* Now handle cases where the kernel box is completely within the output \
array. */ \
} else { \
xnl[ idim ] = xxn; \
for ( jxn = 0; jxn < nb2; jxn++ ) { \
( *kernel )( xxn, params, flags, wtptr[ idim ] + jxn, status ); \
\
/* Check for errors arising in the kernel function. */ \
if ( !astOK ) { \
kerror = 1; \
goto Kernel_SError_Nd; \
} \
\
/* Increment the kernel position. */ \
xxn += 1.0; \
} \
} \
} \
} \
\
/* If OK... */ \
if ( !bad ) { \
\
/* We only need to modify the normalising factor if the weight values \
have changed. */ \
if( sum == AST__BAD ) { \
\
/* The kernel value to use for each output pixel is the product of the \
kernel values for each individual axis at that point. To conserve \
flux we need to make sure that the sum of these kernel products is unity. \
So loop over the values now to find the total sum of all kernel values. */ \
idim = ndim_out - 1; \
wtprod[ idim ] = 1.0; \
done = 0; \
sum = 0; \
do { \
\
/* Each modified output pixel has a weight equal to the product of the kernel \
weight factors evaluated along each input dimension. However, since \
we typically only change the index of one dimension at a time, we \
can avoid forming this product repeatedly by retaining an array of \
accumulated products for all higher dimensions. We need then only \
update the lower elements in this array, corresponding to those \
dimensions whose index has changed. We do this here, "idim" being \
the index of the most significant dimension to have changed. Note \
that on the first pass, all dimensions are considered changed, \
causing this array to be initialised. */ \
for ( ii = idim; ii >= 1; ii-- ) { \
wtprod[ ii - 1 ] = wtprod[ ii ] * *( wtptr[ ii ] ); \
} \
\
/* Obtain the weight of each pixel from the accumulated product of \
weights. Also multiply by the weight for dimension zero, which is not \
included in the "wtprod" array). Increment the sum of all weights. */ \
sum += wtprod[ 0 ] * *( wtptr[ 0 ] ); \
\
/* Now update the weight value pointers and pixel offset to refer to \
the next output pixel to be considered. */ \
idim = 0; \
do { \
\
/* The first input dimension whose weight value pointer has not yet \
reached its final value has this pointer incremented. */ \
if ( wtptr[ idim ] != wtptr_last[ idim ] ) { \
wtptr[ idim ]++; \
break; \
\
/* Any earlier dimensions (which have reached the final pointer value) \
have this pointer returned to its lowest value. */ \
} else { \
wtptr[ idim ] -= nb2 - 1; \
done = ( ++idim == ndim_out ); \
} \
} while ( !done ); \
} while ( !done ); \
\
/* Ensure we do not divide by zero. */ \
if( sum == 0.0 ) sum = 1.0; \
} \
\
/* Re-initialise the weights pointers to refer to the first and last \
filter pixels which overlaps the output array. */ \
kstart = kval; \
for ( idim = 0; idim < ndim_out; idim++ ) { \
wtptr[ idim ] = kstart + jlo[ idim ]; \
wtptr_last[ idim ] = kstart + jhi[ idim ]; \
kstart += nb2; \
} \
\
/* If we are using the input data variances as weights, calculate the \
total weight, incorporating the normalisation factor for the kernel. */ \
if( Varwgt ) { \
wgt = 1.0/(sum*in_var[ off_in ]); \
\
/* If we are not using input variances as weights, the weight is just the \
kernel normalisation factor. */ \
} else { \
wgt = 1.0/sum; \
} \
\
/* Increment the number of input pixels pasted into the output array. */ \
if( nused ) (*nused)++; \
\
/* Initialise, and loop over the neighbouring output pixels to divide up \
the input pixel value between them. */ \
idim = ndim_out - 1; \
wtprod[ idim ] = 1.0; \
done = 0; \
do { \
\
/* Each modified output pixel has a weight equal to the product of the kernel \
weight factors evaluated along each input dimension. However, since \
we typically only change the index of one dimension at a time, we \
can avoid forming this product repeatedly by retaining an array of \
accumulated products for all higher dimensions. We need then only \
update the lower elements in this array, corresponding to those \
dimensions whose index has changed. We do this here, "idim" being \
the index of the most significant dimension to have changed. Note \
that on the first pass, all dimensions are considered changed, \
causing this array to be initialised. */ \
for ( ii = idim; ii >= 1; ii-- ) { \
wtprod[ ii - 1 ] = wtprod[ ii ] * *( wtptr[ ii ] ); \
} \
\
/* Obtain the weight of each pixel from the accumulated \
product of weights. Also multiply by the weight for dimension zero, \
which is not included in the "wtprod" array). */ \
pixwt = ( wtprod[ 0 ] * *( wtptr[ 0 ] ) )*wgt; \
\
/* Update the output pixel with the required fraction of the input pixel \
value. */ \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
\
if( work ) { \
out[ off_out ] += c; \
work[ off_out ] += pixwt; \
} else {\
out[ off_out ] += c; \
} \
\
if ( Usevar ) { \
out_var[ off_out ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && pixwt != 0.0 ) { \
out_var[ off_out ] += c*c/pixwt; \
work[ off_out + npix_out ] += pixwt*pixwt; \
} \
\
/* Now update the weight value pointers and pixel offset to refer to \
the next output pixel to be considered. */ \
idim = 0; \
do { \
\
/* The first input dimension whose weight value pointer has not yet \
reached its final value has this pointer incremented, and the pixel \
offset into the input array is updated accordingly. */ \
if ( wtptr[ idim ] != wtptr_last[ idim ] ) { \
wtptr[ idim ]++; \
off_out += stride[ idim ]; \
break; \
\
/* Any earlier dimensions (which have reached the final pointer value) \
have this pointer returned to its lowest value. Again, the pixel \
offset into the input image is updated accordingly. */ \
} else { \
wtptr[ idim ] -= ( hi[ idim ] - lo[ idim ] ); \
off_out -= stride[ idim ] * \
( hi[ idim ] - lo[ idim ] ); \
done = ( ++idim == ndim_out ); \
} \
} while ( !done ); \
} while ( !done ); \
} \
} \
}
/* Expand the main macro above to generate a function for each
required signed data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_SPREAD_KERNEL1(LD,long double,0)
#endif
MAKE_SPREAD_KERNEL1(D,double,0)
MAKE_SPREAD_KERNEL1(F,float,0)
MAKE_SPREAD_KERNEL1(I,int,1)
MAKE_SPREAD_KERNEL1(B,signed char,1)
MAKE_SPREAD_KERNEL1(UB,unsigned char,1)
/* Undefine the macros used above. */
#undef KERNEL_ND
#undef KERNEL_2D
#undef KERNEL_1D
#undef MAKE_SPREAD_KERNEL1
/*
* Name:
* SpreadLinear<X>
* Purpose:
* Rebin a data grid, using the linear spreading scheme.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void SpreadLinear<X>( int ndim_out,
* const int *lbnd_out, const int *ubnd_out,
* const <Xtype> *in, const <Xtype> *in_var,
* double infac, int npoint, const int *offset,
* const double *const *coords, int flags,
* <Xtype> badval, int npix_out, <Xtype> *out,
* <Xtype> *out_var, double *work, int64_t *nused )
* Class Membership:
* Mapping member function.
* Description:
* This is a set of functions which rebins a rectangular region of an
* input grid of data (and, optionally, associated statistical variance
* values) so as to place them into a new output grid. Each input
* grid point may be mapped on to a position in the output grid in
* an arbitrary way. Where the positions given do not correspond
* with a pixel centre in the input grid, the spreading scheme
* used divides the input pixel value up linearly between the
* nearest neighbouring output pixels in each dimension (there are 2
* nearest neighbours in 1 dimension, 4 in 2 dimensions, 8 in 3
* dimensions, etc.).
* Parameters:
* ndim_out
* The number of dimensions in the output grid. This should be at
* least one.
* lbnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the first
* pixel in the output grid along each dimension.
* ubnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the last
* pixel in the output grid along each dimension.
*
* Note that "lbnd_out" and "ubnd_out" together define the shape
* and size of the output grid, its extent along a particular
* (i'th) dimension being ubnd_out[i]-lbnd_out[i]+1 (assuming "i"
* is zero-based). They also define the output grid's coordinate
* system, with each pixel being of unit extent along each
* dimension with integral coordinate values at its centre.
* in
* Pointer to the array of data to be rebinned. The numerical type
* of these data should match the function used, as given by the
* suffix on the function name. Note that details of how the input
* grid maps on to this array (e.g. the storage order, number of
* dimensions, etc.) is arbitrary and is specified entirely by means
* of the "offset" array. The "in" array should therefore contain
* sufficient elements to accommodate the "offset" values supplied.
* There is no requirement that all elements of the "in" array
* should be rebinned, and any which are not addressed by the
* contents of the "offset" array will be ignored.
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and type as the "in" array), which
* represent estimates of the statistical variance associated
* with each element of the "in" array. If this second array is
* given (along with the corresponding "out_var" array), then
* estimates of the variance of the resampled data will also be
* returned. It is addressed in exactly the same way (via the
* "offset" array) as the "in" array.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* infac
* A factor by which to multiply the input data values before use.
* npoint
* The number of input points which are to be rebinned.
* offset
* Pointer to an array of integers with "npoint" elements. For
* each input point, this array should contain the zero-based
* offset in the input array(s) (i.e. the "in" and, optionally,
* the "in_var" arrays) from which the value to be rebinned should
* be obtained.
* coords
* An array of pointers to double, with "ndim_out" elements.
* Element "coords[coord]" should point at the first element of
* an array of double (with "npoint" elements) which contains the
* values of coordinate number "coord" for each point being
* rebinned. The value of coordinate number "coord" for
* rebinning point number "point" is therefore given by
* "coords[coord][point]" (assuming both indices are
* zero-based). If any point has a coordinate value of AST__BAD
* associated with it, then the corresponding input data (and
* variance) value will be ignored.
* The bitwise OR of a set of flag values which control the
* operation of the function. These are chosend from:
*
* - AST__USEBAD: indicates whether there are "bad" (i.e. missing) data
* in the input array(s) which must be recognised. If this flag is not
* set, all input values are treated literally.
* - AST__GENVAR: Indicates that any input variances are to be
* ignored, and that the output variances should be generated from
* the spread of values contributing to each output pixel.
* badval
* If the AST__USEBAD flag is set in the "flags" value (above),
* this parameter specifies the value which is used to identify
* bad data and/or variance values in the input array(s). Its
* numerical type must match that of the "in" (and "in_var")
* arrays. The same value will also be used to flag any output
* array elements for which resampled values could not be
* obtained. The output arrays(s) may be flagged with this
* value whether or not the AST__USEBAD flag is set (the
* function return value indicates whether any such values have
* been produced).
* npix_out
* Number of pixels in output array.
* out
* Pointer to an array with the same data type as the "in"
* array, into which the rebinned data will be returned. The
* storage order should be such that the index of the first grid
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order).
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the rebinned values may be returned. This array will only be
* used if the "in_var" array has been given. The values returned
* are estimates of the statistical variance of the corresponding
* values in the "out" array, on the assumption that all errors in
* input grid values (in the "in" array) are statistically independent
* and that their variance estimates (in the "in_var" array) may
* simply be summed (with appropriate weighting factors).
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* work
* An optional pointer to a double array with the same size as
* the "out" array. The contents of this array (if supplied) are
* incremented by the accumulated weights assigned to each output pixel.
* If no accumulated weights are required, a NULL pointer should be
* given.
* nused
* An optional pointer to a int64_t which will be incremented by the
* number of input values pasted into the output array. Ignored if NULL.
* Notes:
* - There is a separate function for each numerical type of
* gridded data, distinguished by replacing the <X> in the function
* name by the appropriate 1- or 2-character suffix.
*/
/* Define macros to implement the function for a specific data
type. */
#define MAKE_SPREAD_LINEAR(X,Xtype,IntType) \
static void SpreadLinear##X( int ndim_out, \
const int *lbnd_out, const int *ubnd_out, \
const Xtype *in, const Xtype *in_var, \
double infac, int npoint, const int *offset, \
const double *const *coords, int flags, \
Xtype badval, int npix_out, Xtype *out, \
Xtype *out_var, double *work, int64_t *nused, \
int *status ) { \
\
/* Local Variables: */ \
Xtype c; /* Contribution to output value */ \
Xtype in_val; /* Input value */ \
double *frac_hi; /* Pointer to array of weights */ \
double *frac_lo; /* Pointer to array of weights */ \
double *wt; /* Pointer to array of weights */ \
double *wtprod; /* Array of accumulated weights pointer */ \
double *xn_max; /* Pointer to upper limits array (n-d) */ \
double *xn_min; /* Pointer to lower limits array (n-d) */ \
double frac_hi_x; /* Pixel weight (x dimension) */ \
double frac_hi_y; /* Pixel weight (y dimension) */ \
double frac_lo_x; /* Pixel weight (x dimension) */ \
double frac_lo_y; /* Pixel weight (y dimension) */ \
double pfac; /* Scaled pixel weight */ \
double pixwt; /* Total pixel weight */ \
double wgt; /* Weight for input value */ \
double x; /* x coordinate value */ \
double xmax; /* x upper limit */ \
double xmin; /* x lower limit */ \
double xn; /* Coordinate value (n-d) */ \
double y; /* y coordinate value */ \
double ymax; /* y upper limit */ \
double ymin; /* y lower limit */ \
int *dim; /* Pointer to array of pixel indices */ \
int *hi; /* Pointer to array of upper indices */ \
int *lo; /* Pointer to array of lower indices */ \
int *stride; /* Pointer to array of dimension strides */ \
int bad; /* Output pixel bad? */ \
int done; /* All pixel indices done? */ \
int genvar; /* Generate output variances? */ \
int hi_x; /* Upper pixel index (x dimension) */ \
int hi_y; /* Upper pixel index (y dimension) */ \
int idim; /* Loop counter for dimensions */ \
int ii; /* Loop counter for weights */ \
int ixn; /* Pixel index (n-d) */ \
int lo_x; /* Lower pixel index (x dimension) */ \
int lo_y; /* Lower pixel index (y dimension) */ \
int off; /* Total offset to input pixel */ \
int off_in; /* Offset to input pixel */ \
int off_lo; /* Offset to "first" input pixel */ \
int off_out; /* Offset to output pixel */ \
int point; /* Loop counter for output points */ \
int s; /* Temporary variable for strides */ \
int usebad; /* Use "bad" input pixel values? */ \
int usevar; /* Process variance array? */ \
int varwgt; /* Use input variances as weights? */ \
int ystride; /* Stride along input grid y dimension */ \
\
/* Check the global error status. */ \
if ( !astOK ) return; \
\
/* Initialise variables to avoid "used of uninitialised variable" \
messages from dumb compilers. */ \
bad = 0; \
\
/* Determine if we are processing bad pixels or variances. */ \
usebad = flags & AST__USEBAD; \
usevar = 0; \
genvar = 0; \
if( flags & AST__GENVAR ) { \
genvar = out_var && work; \
} else if( flags & AST__USEVAR ) { \
usevar = in_var && out_var; \
} \
varwgt = ( flags & AST__VARWGT ) && in_var && work; \
\
/* Handle the 1-dimensional case optimally. */ \
/* ---------------------------------------- */ \
if ( ndim_out == 1 ) { \
\
/* Calculate the coordinate limits of the input grid. */ \
xmin = (double) lbnd_out[ 0 ] - 0.5; \
xmax = (double) ubnd_out[ 0 ] + 0.5; \
\
/* Identify eight cases, according to whether bad pixels and/or variances \
are being processed and/or used. In each case we assign constant values \
(0 or 1) to the "Usebad", "Usevar" and "Varwgt" flags so that code for \
handling bad pixels and variances can be eliminated by the compiler's \
optimisation system when not required. */ \
if( varwgt ) { \
if ( usebad ) { \
if ( usevar ) { \
LINEAR_1D(X,Xtype,1,1,0,IntType,1) \
} else if ( genvar ) { \
LINEAR_1D(X,Xtype,1,0,1,IntType,1) \
} else { \
LINEAR_1D(X,Xtype,1,0,0,IntType,1) \
} \
} else { \
if ( usevar ) { \
LINEAR_1D(X,Xtype,0,1,0,IntType,1) \
} else if ( genvar ) { \
LINEAR_1D(X,Xtype,0,0,1,IntType,1) \
} else { \
LINEAR_1D(X,Xtype,0,0,0,IntType,1) \
} \
} \
} else { \
if ( usebad ) { \
if ( usevar ) { \
LINEAR_1D(X,Xtype,1,1,0,IntType,0) \
} else if ( genvar ) { \
LINEAR_1D(X,Xtype,1,0,1,IntType,0) \
} else { \
LINEAR_1D(X,Xtype,1,0,0,IntType,0) \
} \
} else { \
if ( usevar ) { \
LINEAR_1D(X,Xtype,0,1,0,IntType,0) \
} else if ( genvar ) { \
LINEAR_1D(X,Xtype,0,0,1,IntType,0) \
} else { \
LINEAR_1D(X,Xtype,0,0,0,IntType,0) \
} \
} \
} \
\
/* Handle the 2-dimensional case optimally. */ \
/* ---------------------------------------- */ \
} else if ( ndim_out == 2 ) { \
\
/* Calculate the stride along the y dimension of the output grid. */ \
ystride = ubnd_out[ 0 ] - lbnd_out[ 0 ] + 1; \
\
/* Calculate the coordinate limits of the output grid in each \
dimension. */ \
xmin = (double) lbnd_out[ 0 ] - 0.5; \
xmax = (double) ubnd_out[ 0 ] + 0.5; \
ymin = (double) lbnd_out[ 1 ] - 0.5; \
ymax = (double) ubnd_out[ 1 ] + 0.5; \
\
/* Identify eight cases, according to whether bad pixels and/or variances \
are being processed and/or used. In each case we assign constant values \
(0 or 1) to the "Usebad", "Usevar" and "Varwgt" flags so that code for \
handling bad pixels and variances can be eliminated by the compiler's \
optimisation system when not required. */ \
if( varwgt ) { \
if ( usebad ) { \
if ( usevar ) { \
LINEAR_2D(X,Xtype,1,1,0,IntType,1) \
} else if ( genvar ) { \
LINEAR_2D(X,Xtype,1,0,1,IntType,1) \
} else { \
LINEAR_2D(X,Xtype,1,0,0,IntType,1) \
} \
} else { \
if ( usevar ) { \
LINEAR_2D(X,Xtype,0,1,0,IntType,1) \
}else if ( genvar ) { \
LINEAR_2D(X,Xtype,0,0,1,IntType,1) \
} else { \
LINEAR_2D(X,Xtype,0,0,0,IntType,1) \
} \
} \
} else { \
if ( usebad ) { \
if ( usevar ) { \
LINEAR_2D(X,Xtype,1,1,0,IntType,0) \
} else if ( genvar ) { \
LINEAR_2D(X,Xtype,1,0,1,IntType,0) \
} else { \
LINEAR_2D(X,Xtype,1,0,0,IntType,0) \
} \
} else { \
if ( usevar ) { \
LINEAR_2D(X,Xtype,0,1,0,IntType,0) \
}else if ( genvar ) { \
LINEAR_2D(X,Xtype,0,0,1,IntType,0) \
} else { \
LINEAR_2D(X,Xtype,0,0,0,IntType,0) \
} \
} \
} \
\
/* Handle other numbers of dimensions. */ \
/* ----------------------------------- */ \
} else { \
\
/* Allocate workspace. */ \
dim = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
frac_hi = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
frac_lo = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
hi = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
lo = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
stride = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
wt = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
wtprod = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
xn_max = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
xn_min = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
if ( astOK ) { \
\
/* Calculate the stride along each dimension of the output grid. */ \
for ( s = 1, idim = 0; idim < ndim_out; idim++ ) { \
stride[ idim ] = s; \
s *= ubnd_out[ idim ] - lbnd_out[ idim ] + 1; \
\
/* Calculate the coordinate limits of the output grid in each \
dimension. */ \
xn_min[ idim ] = (double) lbnd_out[ idim ] - 0.5; \
xn_max[ idim ] = (double) ubnd_out[ idim ] + 0.5; \
} \
\
/* Identify eight cases, according to whether bad pixels and/or variances \
are being processed and/or used. In each case we assign constant values \
(0 or 1) to the "Usebad", "Usevar" and "Varwgt" flags so that code for \
handling bad pixels and variances can be eliminated by the compiler's \
optimisation system when not required. */ \
if( varwgt ) { \
if ( usebad ) { \
if ( usevar ) { \
LINEAR_ND(X,Xtype,1,1,0,IntType,1) \
} else if ( genvar ) { \
LINEAR_ND(X,Xtype,1,0,1,IntType,1) \
} else { \
LINEAR_ND(X,Xtype,1,0,0,IntType,1) \
} \
} else { \
if ( usevar ) { \
LINEAR_ND(X,Xtype,0,1,0,IntType,1) \
} else if ( genvar ) { \
LINEAR_ND(X,Xtype,0,0,1,IntType,1) \
} else { \
LINEAR_ND(X,Xtype,0,0,0,IntType,1) \
} \
} \
} else { \
if ( usebad ) { \
if ( usevar ) { \
LINEAR_ND(X,Xtype,1,1,0,IntType,0) \
} else if ( genvar ) { \
LINEAR_ND(X,Xtype,1,0,1,IntType,0) \
} else { \
LINEAR_ND(X,Xtype,1,0,0,IntType,0) \
} \
} else { \
if ( usevar ) { \
LINEAR_ND(X,Xtype,0,1,0,IntType,0) \
} else if ( genvar ) { \
LINEAR_ND(X,Xtype,0,0,1,IntType,0) \
} else { \
LINEAR_ND(X,Xtype,0,0,0,IntType,0) \
} \
} \
} \
} \
\
/* Free the workspace. */ \
dim = astFree( dim ); \
frac_hi = astFree( frac_hi ); \
frac_lo = astFree( frac_lo ); \
hi = astFree( hi ); \
lo = astFree( lo ); \
stride = astFree( stride ); \
wt = astFree( wt ); \
wtprod = astFree( wtprod ); \
xn_max = astFree( xn_max ); \
xn_min = astFree( xn_min ); \
} \
\
}
#define LINEAR_1D(X,Xtype,Usebad,Usevar,Genvar,IntType,Varwgt) \
\
/* Loop round all input points which are to be rebinned. */ \
for( point = 0; point < npoint; point++ ) { \
\
/* Obtain the input data value which is to be added into the output array. */ \
off_in = offset[ point ]; \
in_val = in[ off_in ]; \
\
/* If necessary, test if the input data value or variance is bad. If we \
are using the reciprocal of the input variances as weights, then \
variance values of zero are also effectively bad (but we can use input \
variances of zero otherwise). */ \
if ( Usebad ) { \
bad = ( in_val == badval ); \
if ( Varwgt ) { \
bad = bad || ( in_var[ off_in ] == badval ) \
|| ( in_var[ off_in ] <= 0.0 ); \
} else if ( Usevar ) { \
bad = bad || ( in_var[ off_in ] == badval ); \
} \
} else { \
if ( Varwgt ) { \
bad = ( in_var[ off_in ] <= 0.0 ); \
} else { \
bad = 0; \
} \
} \
\
/* Obtain the x coordinate of the current point and test if it lies \
outside the output grid. Also test if it is bad. */ \
x = coords[ 0 ][ point ]; \
bad = bad || ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
\
/* If OK, obtain the indices along the output grid x dimension of the \
two adjacent output pixels which will receive contributions from the \
input pixel. Also obtain the fractional weight to be applied to each of \
these pixels. */ \
if ( !bad ) { \
lo_x = (int) floor( x ); \
hi_x = lo_x + 1; \
frac_lo_x = (double) hi_x - x; \
frac_hi_x = 1.0 - frac_lo_x; \
\
/* Increment the number of input pixels pasted into the output array. */ \
if( nused ) (*nused)++; \
\
/* Obtain the offset within the output array of the first pixel to be \
updated (the one with the smaller index). */ \
off_lo = lo_x - lbnd_out[ 0 ]; \
\
/* If we are using the input data variances as weights, calculate the \
weight, and scale the fractions of each input pixel by the weight. */ \
if( Varwgt ) { \
wgt = 1.0/in_var[ off_in ]; \
frac_lo_x *= wgt; \
frac_hi_x *= wgt; \
} \
\
/* For each of the two pixels which may be updated, test if the pixel index \
lies within the output grid. Where it does, update the output pixel \
with the required fraction of the input pixel value. */ \
if ( lo_x >= lbnd_out[ 0 ] ) { \
pfac = frac_lo_x*infac; \
c = CONV(IntType,pfac*in_val); \
out[ off_lo ] += CONV(IntType, c ); \
if( work ) work[ off_lo ] += frac_lo_x; \
if ( Usevar ) { \
out_var[ off_lo ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && frac_lo_x != 0.0 ) { \
out_var[ off_lo ] += c*c/frac_lo_x; \
work[ off_lo + npix_out ] += frac_lo_x*frac_lo_x; \
} \
} \
if ( hi_x <= ubnd_out[ 0 ] ) { \
pfac = frac_hi_x*infac; \
c = CONV(IntType,pfac*in_val); \
out[ off_lo + 1 ] += CONV(IntType, c ); \
if( work ) work[ off_lo + 1 ] += frac_hi_x; \
if ( Usevar ) { \
out_var[ off_lo + 1 ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && frac_hi_x != 0.0 ) { \
out_var[ off_lo + 1 ] += c*c/frac_hi_x; \
work[ off_lo + 1 + npix_out ] += frac_hi_x*frac_hi_x; \
} \
} \
} \
}
#define LINEAR_2D(X,Xtype,Usebad,Usevar,Genvar,IntType,Varwgt) \
\
/* Loop round all input points which are to be rebinned. */ \
for( point = 0; point < npoint; point++ ) { \
\
/* Obtain the input data value which is to be added into the output array. */ \
off_in = offset[ point ]; \
in_val = in[ off_in ]; \
\
/* If necessary, test if the input data value or variance is bad. If we \
are using the reciprocal of the input variances as weights, then \
variance values of zero are also effectively bad (but we can use input \
variances of zero otherwise). */ \
if ( Usebad ) { \
bad = ( in_val == badval ); \
if ( Varwgt ) { \
bad = bad || ( in_var[ off_in ] == badval ) \
|| ( in_var[ off_in ] <= 0.0 ); \
} else if ( Usevar ) { \
bad = bad || ( in_var[ off_in ] == badval ); \
} \
} else { \
if ( Varwgt ) { \
bad = ( in_var[ off_in ] <= 0.0 ); \
} else { \
bad = 0; \
} \
} \
\
/* Obtain the x coordinate of the current point and test if it lies \
outside the output grid. Also test if it is bad. */ \
y = coords[ 1 ][ point ]; \
bad = bad || ( y < ymin ) || ( y >= ymax ) || ( y == AST__BAD ); \
if ( !bad ) { \
\
/* Similarly obtain and test the y coordinate. */ \
x = coords[ 0 ][ point ]; \
bad = bad || ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* Increment the number of input pixels pasted into the output array. */ \
if( nused ) (*nused)++; \
\
/* If OK, obtain the indices along the output grid x dimension of the \
two adjacent pixels which recieve contributions from the input pixel. \
Also obtain the fractional weight to be applied to each of \
these pixels. */ \
lo_x = (int) floor( x ); \
hi_x = lo_x + 1; \
frac_lo_x = (double) hi_x - x; \
frac_hi_x = 1.0 - frac_lo_x; \
\
/* Repeat this process for the y dimension. */ \
lo_y = (int) floor( y ); \
hi_y = lo_y + 1; \
frac_lo_y = (double) hi_y - y; \
frac_hi_y = 1.0 - frac_lo_y; \
\
/* If we are using the input data variances as weights, calculate the \
weight, and scale the fractions of each input pixel by the weight. \
Since the product of two fractions is always used ot scale the input \
data values, we use the square root of the reciprocal of the variance \
as the weight (so that when the product of two fractions is taken, \
the square roots multiply together to give the required 1/variance \
weight). */ \
if( Varwgt ) { \
wgt = 1.0/sqrt( in_var[ off_in ] ); \
frac_lo_x *= wgt; \
frac_hi_x *= wgt; \
frac_lo_y *= wgt; \
frac_hi_y *= wgt; \
} \
\
/* Obtain the offset within the output array of the first pixel to be \
updated (the one with the smaller index along both dimensions). */ \
off_lo = lo_x - lbnd_out[ 0 ] + ystride * ( lo_y - lbnd_out[ 1 ] ); \
\
/* For each of the four pixels which may be updated, test if the pixel indices \
lie within the output grid. Where they do, update the output pixel \
with the required fraction of the input pixel value. */ \
if ( lo_y >= lbnd_out[ 1 ] ) { \
if ( lo_x >= lbnd_out[ 0 ] ) { \
pixwt = frac_lo_x * frac_lo_y; \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
out[ off_lo ] += CONV(IntType, c ); \
if( work ) work[ off_lo ] += pixwt; \
if ( Usevar ) { \
out_var[ off_lo ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && pixwt != 0.0 ) { \
out_var[ off_lo ] += c*c/pixwt; \
work[ off_lo + npix_out ] += pixwt*pixwt; \
} \
} \
if ( hi_x <= ubnd_out[ 0 ] ) { \
off = off_lo + 1; \
pixwt = frac_hi_x * frac_lo_y; \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
out[ off ] += CONV(IntType, c ); \
if( work ) work[ off ] += pixwt; \
if ( Usevar ) { \
out_var[ off ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && pixwt != 0.0 ) { \
out_var[ off ] += c*c/pixwt; \
work[ off + npix_out ] += pixwt*pixwt; \
} \
} \
} \
if ( hi_y <= ubnd_out[ 1 ] ) { \
if ( lo_x >= lbnd_out[ 0 ] ) { \
off = off_lo + ystride; \
pixwt = frac_lo_x * frac_hi_y; \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
out[ off ] += CONV(IntType, c ); \
if( work ) work[ off ] += pixwt; \
if ( Usevar ) { \
out_var[ off ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && pixwt != 0.0 ) { \
out_var[ off ] += c*c/pixwt; \
work[ off + npix_out ] += pixwt*pixwt; \
} \
} \
if ( hi_x <= ubnd_out[ 0 ] ) { \
off = off_lo + ystride + 1; \
pixwt = frac_hi_x * frac_hi_y; \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
out[ off ] += CONV(IntType, c ); \
if( work ) work[ off ] += pixwt; \
if ( Usevar ) { \
out_var[ off ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && pixwt != 0.0 ) { \
out_var[ off ] += c*c/pixwt; \
work[ off + npix_out ] += pixwt*pixwt; \
} \
} \
} \
} \
} \
}
#define LINEAR_ND(X,Xtype,Usebad,Usevar,Genvar,IntType,Varwgt) \
\
/* Loop round all input points which are to be rebinned. */ \
for( point = 0; point < npoint; point++ ) { \
\
/* Obtain the input data value which is to be added into the output array. */ \
off_in = offset[ point ]; \
in_val = in[ off_in ]; \
\
/* If necessary, test if the input data value or variance is bad. If we \
are using the reciprocal of the input variances as weights, then \
variance values of zero are also effectively bad (but we can use input \
variances of zero otherwise). */ \
if ( Usebad ) { \
bad = ( in_val == badval ); \
if ( Varwgt ) { \
bad = bad || ( in_var[ off_in ] == badval ) \
|| ( in_var[ off_in ] <= 0.0 ); \
} else if ( Usevar ) { \
bad = bad || ( in_var[ off_in ] == badval ); \
} \
} else { \
if ( Varwgt ) { \
bad = ( in_var[ off_in ] <= 0.0 ); \
} else { \
bad = 0; \
} \
} \
\
/* Initialise offsets into the output array. Then loop to obtain each \
coordinate associated with the current output point. */ \
if( !bad ) { \
off_out = 0; \
for ( idim = 0; idim < ndim_out; idim++ ) { \
xn = coords[ idim ][ point ]; \
\
/* Test if the coordinate lies outside the output grid. Also test if \
it is bad. If either is true, the corresponding output pixel value \
will be bad, so give up on this point. */ \
bad = ( xn < xn_min[ idim ] ) || ( xn >= xn_max[ idim ] ) || \
( xn == AST__BAD ); \
if ( bad ) break; \
\
/* Obtain the indices along the current dimension of the output grid of \
the two (usually adjacent) pixels which will be updated. If necessary, \
however, restrict each index to ensure it does not lie outside the \
input grid. Also calculate the fractional weight to be given to each \
pixel in order to divide the input value linearly between them. */ \
ixn = (int) floor( xn ); \
lo[ idim ] = MaxI( ixn, lbnd_out[ idim ], status ); \
hi[ idim ] = MinI( ixn + 1, ubnd_out[ idim ], status ); \
frac_lo[ idim ] = 1.0 - fabs( xn - (double) lo[ idim ] ); \
frac_hi[ idim ] = 1.0 - fabs( xn - (double) hi[ idim ] ); \
\
/* Store the lower index involved in spreading along each \
dimension and accumulate the offset from the start of the output \
array of the pixel which has these indices. */ \
dim[ idim ] = lo[ idim ]; \
off_out += stride[ idim ] * ( lo[ idim ] - lbnd_out[ idim ] ); \
\
/* Also store the fractional weight associated with the lower pixel \
along each dimension. */ \
wt[ idim ] = frac_lo[ idim ]; \
} \
\
/* If we are using the input data variances as weights, calculate the \
weight, and scale the fractions of each input pixel by the weight. */ \
if( Varwgt ) { \
wgt = pow( in_var[ off_in ], -1.0/(double)ndim_out ); \
for ( idim = 0; idim < ndim_out; idim++ ) { \
frac_lo[ idim ] *= wgt; \
frac_hi[ idim ] *= wgt; \
wt[ idim ] = frac_lo[ idim ]; \
} \
} \
\
/* If OK, increment the number of input pixels pasted into the output array. */ \
if ( !bad ) { \
if( nused ) (*nused)++; \
\
/* Loop over adjacent output pixels to divide up the input value. */ \
idim = ndim_out - 1; \
wtprod[ idim ] = 1.0; \
done = 0; \
do { \
\
/* Each pixel pixel to be updated has a total weight equal to the product \
of the weights which account for the displacement of its centre from \
the required position along each dimension. However, since we typically \
only change the index of one dimension at a time, we can avoid forming \
this product repeatedly by retaining an array of accumulated weight \
products for all higher dimensions. We need then only update the \
lower elements in this array, corresponding to those dimensions \
whose index has changed. We do this here, "idim" being the index of \
the most significant dimension to have changed. Note that on the \
first pass, all dimensions are considered changed, causing this \
array to be initialised. */ \
for ( ii = idim; ii >= 1; ii-- ) { \
wtprod[ ii - 1 ] = wtprod[ ii ] * wt[ ii ]; \
} \
\
/* Update the relevent output pixel. The pixel weight is formed by including \
the weight factor for dimension zero, since this is not included in \
the "wtprod" array. */ \
pixwt = wtprod[ 0 ] * wt[ 0 ]; \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
out[ off_out ] += CONV(IntType, c ); \
if( work ) work[ off_out ] += pixwt; \
if ( Usevar ) { \
out_var[ off_out ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
} else if ( Genvar && pixwt != 0.0 ) { \
out_var[ off_out ] += c*c/pixwt; \
work[ off_out + npix_out ] += pixwt*pixwt; \
} \
\
/* Now update the indices, offset and weight factors to refer to the \
next output pixel to be updated. */ \
idim = 0; \
do { \
\
/* The first input dimension which still refers to the pixel with the \
lower of the two possible indices is switched to refer to the other \
pixel (with the higher index). The offset into the output array and \
the fractional weight factor for this dimension are also updated \
accordingly. */ \
if ( dim[ idim ] != hi[ idim ] ) { \
dim[ idim ] = hi[ idim ]; \
off_out += stride[ idim ]; \
wt[ idim ] = frac_hi[ idim ]; \
break; \
\
/* Any earlier dimensions (referring to the higher index) are switched \
back to the lower index, if not already there, before going on to \
consider the next dimension. (This process is the same as \
incrementing a binary number and propagating overflows up through \
successive digits, except that dimensions where the "lo" and "hi" \
values are the same can only take one value.) The process stops at \
the first attempt to return the final dimension to the lower \
index. */ \
} else { \
if ( dim[ idim ] != lo[ idim ] ) { \
dim[ idim ] = lo[ idim ]; \
off_out -= stride[ idim ]; \
wt[ idim ] = frac_lo[ idim ]; \
} \
done = ( ++idim == ndim_out ); \
} \
} while ( !done ); \
} while ( !done ); \
} \
} \
}
/* Expand the main macro above to generate a function for each
required signed data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_SPREAD_LINEAR(LD,long double,0)
#endif
MAKE_SPREAD_LINEAR(D,double,0)
MAKE_SPREAD_LINEAR(F,float,0)
MAKE_SPREAD_LINEAR(I,int,1)
MAKE_SPREAD_LINEAR(B,signed char,1)
MAKE_SPREAD_LINEAR(UB,unsigned char,1)
/* Undefine the macros used above. */
#undef LINEAR_1D
#undef LINEAR_2D
#undef LINEAR_ND
#undef MAKE_SPREAD_LINEAR
/*
* Name:
* SpreadNearest<X>
* Purpose:
* Rebin a data grid, using the nearest-pixel spreading scheme.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void SpreadNearest<X>( int ndim_out, const int *lbnd_out,
* const int *ubnd_out, const <Xtype> *in,
* const <Xtype> *in_var, double infac, int npoint,
* const int *offset, const double *const *coords,
* int flags, <Xtype> badval, int npix_out, <Xtype> *out,
* <Xtype> *out_var, double *work, int64_t *nused,
* int *status )
* Class Membership:
* Mapping member function.
* Description:
* This is a set of functions which rebins a rectangular region of an
* input grid of data (and, optionally, associated statistical variance
* values) so as to place them into a new output grid. Each input
* grid point may be mapped on to a position in the output grid in
* an arbitrary way. Where the positions given do not correspond
* with a pixel centre in the output grid, the spreading scheme
* used is simply to select the nearest pixel (i.e. the one whose
* bounds contain the supplied position).
* Parameters:
* ndim_out
* The number of dimensions in the output grid. This should be at
* least one.
* lbnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the first
* pixel in the output grid along each dimension.
* ubnd_out
* Pointer to an array of integers, with "ndim_out" elements.
* This should give the coordinates of the centre of the last
* pixel in the output grid along each dimension.
*
* Note that "lbnd_out" and "ubnd_out" together define the shape
* and size of the output grid, its extent along a particular
* (i'th) dimension being ubnd_out[i]-lbnd_out[i]+1 (assuming "i"
* is zero-based). They also define the output grid's coordinate
* system, with each pixel being of unit extent along each
* dimension with integral coordinate values at its centre.
* in
* Pointer to the array of data to be rebinned. The numerical type
* of these data should match the function used, as given by the
* suffix on the function name. Note that details of how the input
* grid maps on to this array (e.g. the storage order, number of
* dimensions, etc.) is arbitrary and is specified entirely by means
* of the "offset" array. The "in" array should therefore contain
* sufficient elements to accommodate the "offset" values supplied.
* There is no requirement that all elements of the "in" array
* should be rebinned, and any which are not addressed by the
* contents of the "offset" array will be ignored.
* in_var
* An optional pointer to a second array of positive numerical
* values (with the same size and type as the "in" array), which
* represent estimates of the statistical variance associated
* with each element of the "in" array. If this second array is
* given (along with the corresponding "out_var" array), then
* estimates of the variance of the resampled data will also be
* returned. It is addressed in exactly the same way (via the
* "offset" array) as the "in" array.
*
* If no variance estimates are required, a NULL pointer should
* be given.
* infac
* A factor by which to multiply the input data values before use.
* npoint
* The number of input points which are to be rebinned.
* offset
* Pointer to an array of integers with "npoint" elements. For
* each input point, this array should contain the zero-based
* offset in the input array(s) (i.e. the "in" and, optionally,
* the "in_var" arrays) from which the value to be rebinned should
* be obtained.
* coords
* An array of pointers to double, with "ndim_out" elements.
* Element "coords[coord]" should point at the first element of
* an array of double (with "npoint" elements) which contains the
* values of coordinate number "coord" for each point being
* rebinned. The value of coordinate number "coord" for
* rebinning point number "point" is therefore given by
* "coords[coord][point]" (assuming both indices are
* zero-based). If any point has a coordinate value of AST__BAD
* associated with it, then the corresponding input data (and
* variance) value will be ignored.
* flags
* The bitwise OR of a set of flag values which control the
* operation of the function. These are chosend from:
*
* - AST__USEBAD: indicates whether there are "bad" (i.e. missing) data
* in the input array(s) which must be recognised. If this flag is not
* set, all input values are treated literally.
* - AST__GENVAR: Indicates that output variances should be generated
* from the spread of values contributing to each output pixel.
* - AST__USEVAR: Indicates that output variances should be generated
* by rebinning the input variances.
* - AST__VARWGT: Indicates that input variances should be used to
* create weights for the input data values.
*
* Only one of AST__GENVAR and AST__USEVAR should be supplied.
* badval
* If the AST__USEBAD flag is set in the "flags" value (above),
* this parameter specifies the value which is used to identify
* bad data and/or variance values in the input array(s). Its
* numerical type must match that of the "in" (and "in_var")
* arrays. The same value will also be used to flag any output
* array elements for which resampled values could not be
* obtained. The output arrays(s) may be flagged with this
* value whether or not the AST__USEBAD flag is set (the
* function return value indicates whether any such values have
* been produced).
* npix_out
* Number of pixels in output array.
* out
* Pointer to an array with the same data type as the "in"
* array, into which the rebinned data will be returned. The
* storage order should be such that the index of the first grid
* dimension varies most rapidly and that of the final dimension
* least rapidly (i.e. Fortran array storage order).
* out_var
* An optional pointer to an array with the same data type and
* size as the "out" array, into which variance estimates for
* the rebinned values may be returned. This array will only be
* used if the "in_var" array has been given. The values returned
* are estimates of the statistical variance of the corresponding
* values in the "out" array, on the assumption that all errors in
* input grid values (in the "in" array) are statistically independent
* and that their variance estimates (in the "in_var" array) may
* simply be summed (with appropriate weighting factors).
*
* If no output variance estimates are required, a NULL pointer
* should be given.
* work
* A pointer to an array with the same data type and size as the "out"
* array which is used as work space. The values in the supplied
* array are incremented on exit by the sum of the weights used
* with each output pixel.
* nused
* An optional pointer to a size_t which will be incremented by the
* number of input values pasted into the output array. Ignored if NULL.
* Notes:
* - There is a separate function for each numerical type of
* gridded data, distinguished by replacing the <X> in the function
* name by the appropriate 1- or 2-character suffix.
*/
/* Define a macro to implement the function for a specific data type. */
#define MAKE_SPREAD_NEAREST(X,Xtype,IntType) \
static void SpreadNearest##X( int ndim_out, \
const int *lbnd_out, const int *ubnd_out, \
const Xtype *in, const Xtype *in_var, \
double infac, int npoint, const int *offset, \
const double *const *coords, int flags, \
Xtype badval, int npix_out, Xtype *out, \
Xtype *out_var, double *work, int64_t *nused, \
int *status ) { \
\
/* Local Variables: */ \
Xtype c; /* Contribution to output value */ \
Xtype in_val; /* Input data value */ \
double *xn_max; /* Pointer to upper limits array (n-d) */ \
double *xn_min; /* Pointer to lower limits array (n-d) */ \
double pfac; /* Input weight with extra supplied factor */ \
double pixwt; /* Weight for input value */ \
double x; /* x coordinate value */ \
double xmax; /* x upper limit */ \
double xmin; /* x lower limit */ \
double xn; /* Coordinate value (n-d) */ \
double y; /* y coordinate value */ \
double ymax; /* y upper limit */ \
double ymin; /* y lower limit */ \
int *stride; /* Pointer to array of dimension strides */ \
int bad; /* Output pixel bad? */ \
int genvar; /* Generate output variances? */ \
int idim; /* Loop counter for dimensions */ \
int ix; /* Number of pixels offset in x direction */ \
int ixn; /* Number of pixels offset (n-d) */ \
int iy; /* Number of pixels offset in y direction */ \
int off_in; /* Pixel offset into input array */ \
int off_out; /* Pixel offset into output array */ \
int point; /* Loop counter for output points */ \
int s; /* Temporary variable for strides */ \
int usebad; /* Use "bad" input pixel values? */ \
int usevar; /* Process variance array? */ \
int varwgt; /* Use input variances as weights? */ \
int ystride; /* Stride along input grid y direction */ \
\
/* Check the global error status. */ \
if ( !astOK ) return; \
\
/* Determine if we are processing bad pixels or variances. */ \
usebad = flags & AST__USEBAD; \
usevar = 0; \
genvar = 0; \
if( flags & AST__GENVAR ) { \
genvar = out_var && work; \
} else if( flags & AST__USEVAR ) { \
usevar = in_var && out_var; \
} \
varwgt = ( flags & AST__VARWGT ) && in_var && work; \
\
/* Handle the 1-dimensional case optimally. */ \
/* ---------------------------------------- */ \
if ( ndim_out == 1 ) { \
\
/* Calculate the coordinate limits of the output array. */ \
xmin = (double) lbnd_out[ 0 ] - 0.5; \
xmax = (double) ubnd_out[ 0 ] + 0.5; \
\
/* Identify eight cases, according to whether bad pixels and/or variances \
are being processed and/or used. In each case we assign constant values \
(0 or 1) to the "Usebad", "Usevar" and "Varwgt" flags so that code for \
handling bad pixels and variances can be eliminated by the compiler's \
optimisation system when not required. */ \
if( varwgt ) { \
if ( usebad ) { \
if ( usevar ) { \
NEAR_1D(X,Xtype,1,1,0,IntType,1) \
} else if ( genvar ) { \
NEAR_1D(X,Xtype,1,0,1,IntType,1) \
} else { \
NEAR_1D(X,Xtype,1,0,0,IntType,1) \
} \
} else { \
if ( usevar ) { \
NEAR_1D(X,Xtype,0,1,0,IntType,1) \
} else if ( genvar ) { \
NEAR_1D(X,Xtype,0,0,1,IntType,1) \
} else { \
NEAR_1D(X,Xtype,0,0,0,IntType,1) \
} \
} \
} else { \
if ( usebad ) { \
if ( usevar ) { \
NEAR_1D(X,Xtype,1,1,0,IntType,0) \
} else if ( genvar ) { \
NEAR_1D(X,Xtype,1,0,1,IntType,0) \
} else { \
NEAR_1D(X,Xtype,1,0,0,IntType,0) \
} \
} else { \
if ( usevar ) { \
NEAR_1D(X,Xtype,0,1,0,IntType,0) \
} else if ( genvar ) { \
NEAR_1D(X,Xtype,0,0,1,IntType,0) \
} else { \
NEAR_1D(X,Xtype,0,0,0,IntType,0) \
} \
} \
} \
\
/* Handle the 2-dimensional case optimally. */ \
/* ---------------------------------------- */ \
} else if ( ndim_out == 2 ) { \
\
/* Calculate the stride along the y dimension of the output grid. */ \
ystride = ubnd_out[ 0 ] - lbnd_out[ 0 ] + 1; \
\
/* Calculate the coordinate limits of the output array in each \
dimension. */ \
xmin = (double) lbnd_out[ 0 ] - 0.5; \
xmax = (double) ubnd_out[ 0 ] + 0.5; \
ymin = (double) lbnd_out[ 1 ] - 0.5; \
ymax = (double) ubnd_out[ 1 ] + 0.5; \
\
/* Identify eight cases, according to whether bad pixels and/or variances \
are being processed and/or used. In each case we assign constant values \
(0 or 1) to the "Usebad", "Usevar" and "Varwgt" flags so that code for \
handling bad pixels and variances can be eliminated by the compiler's \
optimisation system when not required. */ \
if( varwgt ) { \
if ( usebad ) { \
if ( usevar ) { \
NEAR_2D(X,Xtype,1,1,0,IntType,1) \
} else if ( genvar ) { \
NEAR_2D(X,Xtype,1,0,1,IntType,1) \
} else { \
NEAR_2D(X,Xtype,1,0,0,IntType,1) \
} \
} else { \
if ( usevar ) { \
NEAR_2D(X,Xtype,0,1,0,IntType,1) \
} else if ( genvar ) { \
NEAR_2D(X,Xtype,0,0,1,IntType,1) \
} else { \
NEAR_2D(X,Xtype,0,0,0,IntType,1) \
} \
} \
} else { \
if ( usebad ) { \
if ( usevar ) { \
NEAR_2D(X,Xtype,1,1,0,IntType,0) \
} else if ( genvar ) { \
NEAR_2D(X,Xtype,1,0,1,IntType,0) \
} else { \
NEAR_2D(X,Xtype,1,0,0,IntType,0) \
} \
} else { \
if ( usevar ) { \
NEAR_2D(X,Xtype,0,1,0,IntType,0) \
} else if ( genvar ) { \
NEAR_2D(X,Xtype,0,0,1,IntType,0) \
} else { \
NEAR_2D(X,Xtype,0,0,0,IntType,0) \
} \
} \
} \
\
/* Handle other numbers of dimensions. */ \
/* ----------------------------------- */ \
} else { \
\
/* Allocate workspace. */ \
stride = astMalloc( sizeof( int ) * (size_t) ndim_out ); \
xn_max = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
xn_min = astMalloc( sizeof( double ) * (size_t) ndim_out ); \
if ( astOK ) { \
\
/* Calculate the stride along each dimension of the output grid. */ \
for ( s = 1, idim = 0; idim < ndim_out; idim++ ) { \
stride[ idim ] = s; \
s *= ubnd_out[ idim ] - lbnd_out[ idim ] + 1; \
\
/* Calculate the coordinate limits of the output grid in each \
dimension. */ \
xn_min[ idim ] = (double) lbnd_out[ idim ] - 0.5; \
xn_max[ idim ] = (double) ubnd_out[ idim ] + 0.5; \
} \
\
/* Identify eight cases, according to whether bad pixels and/or variances \
are being processed and/or used. In each case we assign constant values \
(0 or 1) to the "Usebad", "Usevar" and "Varwgt" flags so that code for \
handling bad pixels and variances can be eliminated by the compiler's \
optimisation system when not required. */ \
if( varwgt ) { \
if ( usebad ) { \
if ( usevar ) { \
NEAR_ND(X,Xtype,1,1,0,IntType,1) \
} else if ( genvar ) { \
NEAR_ND(X,Xtype,1,0,1,IntType,1) \
} else { \
NEAR_ND(X,Xtype,1,0,0,IntType,1) \
} \
} else { \
if ( usevar ) { \
NEAR_ND(X,Xtype,0,1,0,IntType,1) \
} else if ( genvar ) { \
NEAR_ND(X,Xtype,0,0,1,IntType,1) \
} else { \
NEAR_ND(X,Xtype,0,0,0,IntType,1) \
} \
} \
} else { \
if ( usebad ) { \
if ( usevar ) { \
NEAR_ND(X,Xtype,1,1,0,IntType,0) \
} else if ( genvar ) { \
NEAR_ND(X,Xtype,1,0,1,IntType,0) \
} else { \
NEAR_ND(X,Xtype,1,0,0,IntType,0) \
} \
} else { \
if ( usevar ) { \
NEAR_ND(X,Xtype,0,1,0,IntType,0) \
} else if ( genvar ) { \
NEAR_ND(X,Xtype,0,0,1,IntType,0) \
} else { \
NEAR_ND(X,Xtype,0,0,0,IntType,0) \
} \
} \
} \
} \
\
/* Free the workspace. */ \
stride = astFree( stride ); \
xn_max = astFree( xn_max ); \
xn_min = astFree( xn_min ); \
} \
\
}
#define NEAR_1D(X,Xtype,Usebad,Usevar,Genvar,IntType,Varwgt) \
\
/* Loop round all input points which are to be rebinned. */ \
for( point = 0; point < npoint; point++ ) { \
\
/* Obtain the input data value which is to be added into the output array. */ \
off_in = offset[ point ]; \
in_val = in[ off_in ]; \
\
/* If necessary, test if the input data value or variance is bad. If we \
are using the reciprocal of the input variances as weights, then \
variance values of zero are also effectively bad (but we can use input \
variances of zero otherwise). */ \
if ( Usebad ) { \
bad = ( in_val == badval ); \
if ( Varwgt ) { \
bad = bad || ( in_var[ off_in ] == badval ) \
|| ( in_var[ off_in ] <= 0.0 ); \
} else if ( Usevar ) { \
bad = bad || ( in_var[ off_in ] == badval ); \
} \
} else { \
if ( Varwgt ) { \
bad = ( in_var[ off_in ] <= 0.0 ); \
} else { \
bad = 0; \
} \
} \
\
/* Obtain the output x coordinate corresponding to the centre of the \
current input pixel and test if it lies outside the output grid, or \
is bad. */ \
x = coords[ 0 ][ point ]; \
bad = bad || ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* Increment the number of input pixels pasted into the output array. */ \
if( nused ) (*nused)++; \
\
/* If not, then obtain the offset within the output grid of the pixel \
which contains the current input point. */ \
off_out = (int) floor( x + 0.5 ) - lbnd_out[ 0 ]; \
\
/* If we are using the input data variances as weights, calculate the \
weight. */ \
if( Varwgt ) { \
pixwt = 1.0/in_var[ off_in ]; \
} else { \
pixwt = 1.0; \
} \
\
/* Get the weighted input data value, including any extra scaling. */ \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
\
/* Increment the value of this output pixel by the weighted input pixel \
value, and increment the sum of the weights. */ \
out[ off_out ] += CONV(IntType, c ); \
if( work ) work[ off_out ] += pixwt; \
\
/* If output variances are being calculated on the basis of the input \
variances, then we also store the required sum in "out_var". */ \
if( Usevar ) { \
out_var[ off_out ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
\
/* If output variances are being calculated on the basis of the spread of \
input values, we need the sum of the squared weighted data values, the \
sum of the weights (already in the first half of the "work" array), and \
the sum of the squared weights. */ \
} else if( Genvar && pixwt != 0.0 ) { \
out_var[ off_out ] += c*c/pixwt; \
work[ off_out + npix_out ] += pixwt*pixwt; \
} \
} \
}
#define NEAR_2D(X,Xtype,Usebad,Usevar,Genvar,IntType,Varwgt) \
\
/* Loop round all input points which are to be rebinned. */ \
for( point = 0; point < npoint; point++ ) { \
\
/* Obtain the input data value which is to be added into the output array. */ \
off_in = offset[ point ]; \
in_val = in[ off_in ]; \
\
/* If necessary, test if the input data value or variance is bad. If we \
are using the reciprocal of the input variances as weights, then \
variance values of zero are also effectively bad (but we can use input \
variances of zero otherwise). */ \
if ( Usebad ) { \
bad = ( in_val == badval ); \
if ( Varwgt ) { \
bad = bad || ( in_var[ off_in ] == badval ) \
|| ( in_var[ off_in ] <= 0.0 ); \
} else if ( Usevar ) { \
bad = bad || ( in_var[ off_in ] == badval ); \
} \
} else { \
if ( Varwgt ) { \
bad = ( in_var[ off_in ] <= 0.0 ); \
} else { \
bad = 0; \
} \
} \
\
/* Obtain the output y coordinate corresponding to the centre of the \
current input pixel and test if it lies outside the output grid, or \
is bad. */ \
y = coords[ 1 ][ point ]; \
bad = bad || ( y < ymin ) || ( y >= ymax ) || ( y == AST__BAD ); \
if ( !bad ) { \
\
/* Obtain the output x coordinate corresponding to the centre of the \
current input pixel and test if it lies outside the output grid, or \
is bad. */ \
x = coords[ 0 ][ point ]; \
bad = bad || ( x < xmin ) || ( x >= xmax ) || ( x == AST__BAD ); \
if ( !bad ) { \
\
/* Increment the number of input pixels pasted into the output array. */ \
if( nused ) (*nused)++; \
\
/* Obtain the offsets along each output grid dimension of the output \
pixel which is to receive the input pixel value. */ \
ix = (int) floor( x + 0.5 ) - lbnd_out[ 0 ]; \
iy = (int) floor( y + 0.5 ) - lbnd_out[ 1 ]; \
\
/* Calculate this pixel's offset from the start of the output array. */ \
off_out = ix + ystride * iy; \
\
/* If we are using the input data variances as weights, calculate the \
weight. */ \
if( Varwgt ) { \
pixwt = 1.0/in_var[ off_in ]; \
} else { \
pixwt = 1.0; \
} \
\
/* Get the weighted input data value, including any extra scaling. */ \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
\
/* Increment the value of this output pixel by the weighted input pixel \
value, and increment the sum of the weights. */ \
out[ off_out ] += CONV(IntType, c ); \
if( work ) work[ off_out ] += pixwt; \
\
/* If output variances are being calculated on the basis of the input \
variances, then we also store the required sum in "out_var". */ \
if( Usevar ) { \
out_var[ off_out ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
\
/* If output variances are being calculated on the basis of the spread of \
input values, we need the sum of the squared weighted data values, the \
sum of the weights (already in the first half of the "work" array), and \
the sum of the squared weights. */ \
} else if( Genvar && pixwt != 0.0 ) { \
out_var[ off_out ] += c*c/pixwt; \
work[ off_out + npix_out ] += pixwt*pixwt; \
} \
} \
} \
}
#define NEAR_ND(X,Xtype,Usebad,Usevar,Genvar,IntType,Varwgt) \
\
/* Loop round all input points which are to be rebinned. */ \
for( point = 0; point < npoint; point++ ) { \
\
/* Obtain the input data value which is to be added into the output array. */ \
off_in = offset[ point ]; \
in_val = in[ off_in ]; \
\
/* If necessary, test if the input data value or variance is bad. If we \
are using the reciprocal of the input variances as weights, then \
variance values of zero are also effectively bad (but we can use input \
variances of zero otherwise). */ \
if ( Usebad ) { \
bad = ( in_val == badval ); \
if ( Varwgt ) { \
bad = bad || ( in_var[ off_in ] == badval ) \
|| ( in_var[ off_in ] <= 0.0 ); \
} else if ( Usevar ) { \
bad = bad || ( in_var[ off_in ] == badval ); \
} \
} else { \
if ( Varwgt ) { \
bad = ( in_var[ off_in ] <= 0.0 ); \
} else { \
bad = 0; \
} \
} \
\
if( !bad ) { \
\
/* Initialise the offset into the output array. Then loop to obtain \
each coordinate associated with the current output point. */ \
off_out = 0; \
for ( idim = 0; idim < ndim_out; idim++ ) { \
xn = coords[ idim ][ point ]; \
\
/* Test if the coordinate lies outside the output grid, or is bad. If \
either is true, the corresponding input pixel value will be ignored, \
so give up on this point. */ \
bad = ( xn < xn_min[ idim ] ) || ( xn >= xn_max[ idim ] ) || \
( xn == AST__BAD ); \
if ( bad ) { \
break; \
} \
\
/* Obtain the offset along the current output grid dimension of the \
output pixel which is to receive the input pixel value. */ \
ixn = (int) floor( xn + 0.5 ) - lbnd_out[ idim ]; \
\
/* Accumulate this pixel's offset from the start of the output array. */ \
off_out += ixn * stride[ idim ]; \
} \
\
if( !bad ) { \
\
/* Increment the number of input pixels pasted into the output array. */ \
if( nused ) (*nused)++; \
\
/* If we are using the input data variances as weights, calculate the \
weight. */ \
if( Varwgt ) { \
pixwt = 1.0/in_var[ off_in ]; \
} else { \
pixwt = 1.0; \
} \
\
/* Get the weighted input data value, including any extra scaling. */ \
pfac = pixwt*infac; \
c = CONV(IntType,pfac*in_val); \
\
/* Increment the value of this output pixel by the weighted input pixel \
value, and increment the sum of the weights. */ \
out[ off_out ] += CONV(IntType, c ); \
if( work ) work[ off_out ] += pixwt; \
\
/* If output variances are being calculated on the basis of the input \
variances, then we also store the required sum in "out_var". */ \
if( Usevar ) { \
out_var[ off_out ] += CONV(IntType,in_var[ off_in ]*pfac*pfac); \
\
/* If output variances are being calculated on the basis of the spread of \
input values, we need the sum of the squared weighted data values, the \
sum of the weights (already in the first half of the "work" array), and \
the sum of the squared weights. */ \
} else if( Genvar && pixwt != 0.0 ) { \
out_var[ off_out ] += c*c/pixwt; \
work[ off_out + npix_out ] += pixwt*pixwt; \
} \
} \
} \
}
/* Expand the main macro above to generate a function for each
required signed data type. */
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_SPREAD_NEAREST(LD,long double,0)
#endif
MAKE_SPREAD_NEAREST(D,double,0)
MAKE_SPREAD_NEAREST(F,float,0)
MAKE_SPREAD_NEAREST(I,int,1)
MAKE_SPREAD_NEAREST(B,signed char,1)
MAKE_SPREAD_NEAREST(UB,unsigned char,1)
/* Undefine the macros used above. */
#undef NEAR_ND
#undef NEAR_2D
#undef NEAR_1D
#undef MAKE_SPREAD_NEAREST
static int TestAttrib( AstObject *this_object, const char *attrib, int *status ) {
/*
* Name:
* TestAttrib
* Purpose:
* Test if a specified attribute value is set for a Mapping.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* int TestAttrib( AstObject *this, const char *attrib, int *status )
* Class Membership:
* Mapping member function (over-rides the astTestAttrib protected
* method inherited from the Object class).
* Description:
* This function returns a boolean result (0 or 1) to indicate whether
* a value has been set for one of a Mapping's attributes.
* Parameters:
* this
* Pointer to the Mapping.
* attrib
* Pointer to a null terminated string specifying the attribute
* name. This should be in lower case with no surrounding white
* space.
* status
* Pointer to the inherited status variable.
* Returned Value:
* One if a value has been set, otherwise zero.
* Notes:
* - A value of zero will be returned if this function is invoked
* with the global status set, or if it should fail for any reason.
*/
/* Local Variables: */
AstMapping *this; /* Pointer to the Mapping structure */
int result; /* Result value to return */
/* Initialise. */
result = 0;
/* Check the global error status. */
if ( !astOK ) return result;
/* Obtain a pointer to the Mapping structure. */
this = (AstMapping *) this_object;
/* Check the attribute name and test the appropriate attribute. */
/* Invert. */
/* ------- */
if ( !strcmp( attrib, "invert" ) ) {
result = astTestInvert( this );
/* Report. */
/* ------- */
} else if ( !strcmp( attrib, "report" ) ) {
result = astTestReport( this );
/* If the name is not recognised, test if it matches any of the
read-only attributes of this class. If it does, then return
zero. */
} else if ( !strcmp( attrib, "nin" ) ||
!strcmp( attrib, "islinear" ) ||
!strcmp( attrib, "issimple" ) ||
!strcmp( attrib, "nout" ) ||
!strcmp( attrib, "tranforward" ) ||
!strcmp( attrib, "traninverse" ) ) {
result = 0;
/* If the attribute is still not recognised, pass it on to the parent
method for further interpretation. */
} else {
result = (*parent_testattrib)( this_object, attrib, status );
}
/* Return the result, */
return result;
}
static void Tran1( AstMapping *this, int npoint, const double xin[],
int forward, double xout[], int *status ) {
/*
*++
* Name:
c astTran1
f AST_TRAN1
* Purpose:
* Transform 1-dimensional coordinates.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astTran1( AstMapping *this, int npoint, const double xin[],
c int forward, double xout[] )
f CALL AST_TRAN1( THIS, NPOINT, XIN, FORWARD, XOUT, STATUS )
* Class Membership:
* Mapping method.
* Description:
c This function applies a Mapping to transform the coordinates of
f This routine applies a Mapping to transform the coordinates of
* a set of points in one dimension.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping to be applied.
c npoint
f NPOINT = INTEGER (Given)
* The number of points to be transformed.
c xin
f XIN( NPOINT ) = DOUBLE PRECISION (Given)
c An array of "npoint" coordinate values for the input
f An array of coordinate values for the input
* (untransformed) points.
c forward
f FORWARD = LOGICAL (Given)
c A non-zero value indicates that the Mapping's forward
c coordinate transformation is to be applied, while a zero
c value indicates that the inverse transformation should be
c used.
f A .TRUE. value indicates that the Mapping's forward
f coordinate transformation is to be applied, while a .FALSE.
f value indicates that the inverse transformation should be
f used.
c xout
f XOUT( NPOINT ) = DOUBLE PRECISION (Returned)
c An array (with "npoint" elements) into which the
f An array into which the
* coordinates of the output (transformed) points will be written.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Notes:
* - The Mapping supplied must have the value 1 for both its Nin
* and Nout attributes.
*--
*/
/* Local Variables: */
AstPointSet *in_points; /* Pointer to input PointSet */
AstPointSet *out_points; /* Pointer to output PointSet */
const double *in_ptr[ 1 ]; /* Array of input data pointers */
double *out_ptr[ 1 ]; /* Array of output data pointers */
/* Check the global error status. */
if ( !astOK ) return;
/* Validate the Mapping and numbers of points/coordinates. */
ValidateMapping( this, forward, npoint, 1, 1, "astTran1", status );
/* Set up pointers to the input and output coordinate arrays. */
if ( astOK ) {
in_ptr[ 0 ] = xin;
out_ptr[ 0 ] = xout;
/* Create PointSets to describe the input and output points. */
in_points = astPointSet( npoint, 1, "", status );
out_points = astPointSet( npoint, 1, "", status );
/* Associate the data pointers with the PointSets (note we must
explicitly remove the "const" qualifier from the input data here,
although they will not be modified). */
astSetPoints( in_points, (double **) in_ptr );
astSetPoints( out_points, out_ptr );
/* Apply the required transformation to the coordinates. */
(void) astTransform( this, in_points, forward, out_points );
/* If the Mapping's Report attribute is set, report the effect the
Mapping has had on the coordinates. */
if ( astGetReport( this ) ) astReportPoints( this, forward,
in_points, out_points );
/* Delete the two PointSets. */
in_points = astDelete( in_points );
out_points = astDelete( out_points );
}
}
static void Tran2( AstMapping *this,
int npoint, const double xin[], const double yin[],
int forward, double xout[], double yout[], int *status ) {
/*
*++
* Name:
c astTran2
f AST_TRAN2
* Purpose:
* Transform 2-dimensional coordinates.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astTran2( AstMapping *this,
c int npoint, const double xin[], const double yin[],
c int forward, double xout[], double yout[] )
f CALL AST_TRAN2( THIS, NPOINT, XIN, YIN, FORWARD, XOUT, YOUT, STATUS )
* Class Membership:
* Mapping method.
* Description:
c This function applies a Mapping to transform the coordinates of
f This routine applies a Mapping to transform the coordinates of
* a set of points in two dimensions.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping to be applied.
c npoint
f NPOINT = INTEGER (Given)
* The number of points to be transformed.
c xin
f XIN( NPOINT ) = DOUBLE PRECISION (Given)
c An array of "npoint" X-coordinate values for the input
f An array of X-coordinate values for the input
* (untransformed) points.
c yin
f YIN( NPOINT ) = DOUBLE PRECISION (Given)
c An array of "npoint" Y-coordinate values for the input
f An array of Y-coordinate values for the input
* (untransformed) points.
c forward
f FORWARD = LOGICAL (Given)
c A non-zero value indicates that the Mapping's forward
c coordinate transformation is to be applied, while a zero
c value indicates that the inverse transformation should be
c used.
f A .TRUE. value indicates that the Mapping's forward
f coordinate transformation is to be applied, while a .FALSE.
f value indicates that the inverse transformation should be
f used.
c xout
f XOUT( NPOINT ) = DOUBLE PRECISION (Returned)
c An array (with "npoint" elements) into which the
f An array into which the
* X-coordinates of the output (transformed) points will be written.
c yout
f YOUT( NPOINT ) = DOUBLE PRECISION (Returned)
c An array (with "npoint" elements) into which the
f An array into which the
* Y-coordinates of the output (transformed) points will be written.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Notes:
* - The Mapping supplied must have the value 2 for both its Nin
* and Nout attributes.
*--
*/
/* Local Variables: */
AstPointSet *in_points; /* Pointer to input PointSet */
AstPointSet *out_points; /* Pointer to output PointSet */
const double *in_ptr[ 2 ]; /* Array of input data pointers */
double *out_ptr[ 2 ]; /* Array of output data pointers */
/* Check the global error status. */
if ( !astOK ) return;
/* Validate the Mapping and the numbers of points/coordinates. */
ValidateMapping( this, forward, npoint, 2, 2, "astTran2", status );
/* Set up pointers to the input and output coordinate arrays. */
if ( astOK ) {
in_ptr[ 0 ] = xin;
in_ptr[ 1 ] = yin;
out_ptr[ 0 ] = xout;
out_ptr[ 1 ] = yout;
/* Create PointSets to describe the input and output points. */
in_points = astPointSet( npoint, 2, "", status );
out_points = astPointSet( npoint, 2, "", status );
/* Associate the data pointers with the PointSets (note we must
explicitly remove the "const" qualifier from the input data here,
although they will not be modified). */
astSetPoints( in_points, (double **) in_ptr );
astSetPoints( out_points, out_ptr );
/* Apply the required transformation to the coordinates. */
(void) astTransform( this, in_points, forward, out_points );
/* If the Mapping's Report attribute is set, report the effect the
Mapping has had on the coordinates. */
if ( astGetReport( this ) ) astReportPoints( this, forward,
in_points, out_points );
/* Delete the two PointSets. */
in_points = astDelete( in_points );
out_points = astDelete( out_points );
}
}
static void TranGrid( AstMapping *this, int ncoord_in, const int lbnd[],
const int ubnd[], double tol, int maxpix, int forward,
int ncoord_out, int outdim, double *out, int *status ) {
/*
*++
* Name:
c astTranGrid
f AST_TRANGRID
* Purpose:
* Transform a grid of positions
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astTranGrid( AstMapping *this, int ncoord_in,
c const int lbnd[], const int ubnd[],
c double tol, int maxpix, int forward,
c int ncoord_out, int outdim, double *out );
f CALL AST_TRANGRID( THIS, NCOORD_IN, LBND, UBND, TOL, MAXPIX,
f FORWARD, NCOORD_OUT, OUTDIM, OUT, STATUS )
* Class Membership:
* Mapping method.
* Description:
* This function uses the supplied Mapping to transforms a regular square
* grid of points covering a specified box. It attempts to do this
* quickly by first approximating the Mapping with a linear transformation
* applied over the whole region of the input grid which is being used.
* If this proves to be insufficiently accurate, the input region is
* sub-divided into two along its largest dimension and the process is
* repeated within each of the resulting sub-regions. This process of
* sub-division continues until a sufficiently good linear approximation
* is found, or the region to which it is being applied becomes too small
* (in which case the original Mapping is used directly).
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping to be applied.
c ncoord_in
f NCOORD_IN = INTEGER (Given)
* The number of coordinates being supplied for each box corner
* (i.e. the number of dimensions of the space in which the
* input points reside).
c lbnd
f LBND( NCOORD_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ncoord_in" elements,
f An array
* containing the coordinates of the centre of the first pixel
* in the input grid along each dimension.
c ubnd
f UBND( NCOORD_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ncoord_in" elements,
f An array
* containing the coordinates of the centre of the last pixel in
* the input grid along each dimension.
*
c Note that "lbnd" and "ubnd" together define the shape
f Note that LBND and UBND together define the shape
* and size of the input grid, its extent along a particular
c (j'th) dimension being ubnd[j]-lbnd[j]+1 (assuming the
c index "j" to be zero-based). They also define
f (J'th) dimension being UBND(J)-LBND(J)+1. They also define
* the input grid's coordinate system, each pixel having unit
* extent along each dimension with integral coordinate values
* at its centre.
c tol
f TOL = DOUBLE PRECISION (Given)
* The maximum tolerable geometrical distortion which may be
* introduced as a result of approximating non-linear Mappings
* by a set of piece-wise linear transformations. This should be
* expressed as a displacement within the output coordinate system
* of the Mapping.
*
* If piece-wise linear approximation is not required, a value
* of zero may be given. This will ensure that the Mapping is
* used without any approximation, but may increase execution
* time.
*
* If the value is too high, discontinuities between the linear
* approximations used in adjacent panel will be higher. If this
* is a problem, reduce the tolerance value used.
c maxpix
f MAXPIX = INTEGER (Given)
* A value which specifies an initial scale size (in input grid points)
* for the adaptive algorithm which approximates non-linear Mappings
* with piece-wise linear transformations. Normally, this should
* be a large value (larger than any dimension of the region of
* the input grid being used). In this case, a first attempt to
* approximate the Mapping by a linear transformation will be
* made over the entire input region.
*
* If a smaller value is used, the input region will first be
c divided into sub-regions whose size does not exceed "maxpix"
f divided into sub-regions whose size does not exceed MAXPIX
* grid points in any dimension. Only at this point will attempts
* at approximation commence.
*
* This value may occasionally be useful in preventing false
* convergence of the adaptive algorithm in cases where the
* Mapping appears approximately linear on large scales, but has
* irregularities (e.g. holes) on smaller scales. A value of,
* say, 50 to 100 grid points can also be employed as a safeguard
* in general-purpose software, since the effect on performance is
* minimal.
*
* If too small a value is given, it will have the effect of
* inhibiting linear approximation altogether (equivalent to
c setting "tol" to zero). Although this may degrade
f setting TOL to zero). Although this may degrade
* performance, accurate results will still be obtained.
c forward
f FORWARD = LOGICAL (Given)
c A non-zero value indicates that the Mapping's forward
c coordinate transformation is to be applied, while a zero
c value indicates that the inverse transformation should be
c used.
f A .TRUE. value indicates that the Mapping's forward
f coordinate transformation is to be applied, while a .FALSE.
f value indicates that the inverse transformation should be
f used.
c ncoord_out
f NCOORD_OUT = INTEGER (Given)
* The number of coordinates being generated by the Mapping for
* each output point (i.e. the number of dimensions of the
* space in which the output points reside). This need not be
c the same as "ncoord_in".
f the same as NCOORD_IN.
c outdim
f OUTDIM = INTEGER (Given)
c The number of elements along the second dimension of the "out"
f The number of elements along the first dimension of the OUT
* array (which will contain the output coordinates). The value
* given should not be less than the number of points in the grid.
c out
f OUT( OUTDIM, NCOORD_OUT ) = DOUBLE PRECISION (Returned)
c The address of the first element in a 2-dimensional array of
c shape "[ncoord_out][outdim]", into
c which the coordinates of the output (transformed) points will
c be written. These will be stored such that the value of
c coordinate number "coord" for output point number "point"
c will be found in element "out[coord][point]".
f An array into which the coordinates of the output
f (transformed) points will be written. These will be stored
f such that the value of coordinate number COORD for output
f point number POINT will be found in element OUT(POINT,COORD).
* The points are ordered such that the first axis of the input
* grid changes most rapidly. For example, if the input grid is
* 2-dimensional and extends from (2,-1) to (3,1), the output
* points will be stored in the order (2,-1), (3, -1), (2,0), (3,0),
* (2,1), (3,1).
f STATUS = INTEGER (Given and Returned)
f The global status.
* Notes:
c - If the forward coordinate transformation is being applied, the
c Mapping supplied must have the value of "ncoord_in" for its Nin
c attribute and the value of "ncoord_out" for its Nout attribute. If
c the inverse transformation is being applied, these values should
c be reversed.
f - If the forward coordinate transformation is being applied, the
f Mapping supplied must have the value of NCOORD_IN for its Nin
f attribute and the value of NCOORD_OUT for its Nout attribute. If
f the inverse transformation is being applied, these values should
f be reversed.
*--
*/
/* Local Variables: */
astDECLARE_GLOBALS /* Thread-specific data */
AstMapping *simple; /* Pointer to simplified Mapping */
double **out_ptr; /* Pointer to array of output data pointers */
int coord; /* Loop counter for coordinates */
int idim; /* Loop counter for coordinate dimensions */
int npoint; /* Number of points in the grid */
int64_t mpix; /* Number of points for testing */
/* Check the global error status. */
if ( !astOK ) return;
/* Get a pointer to a structure holding thread-specific global data values */
astGET_GLOBALS(this);
/* Calculate the number of points in the grid, and check that the lower and
upper bounds of the input grid are consistent. Report an error if any
pair is not. */
mpix = 1;
for ( idim = 0; idim < ncoord_in; idim++ ) {
if ( lbnd[ idim ] > ubnd[ idim ] ) {
astError( AST__GBDIN, "astTranGrid(%s): Lower bound of "
"input grid (%d) exceeds corresponding upper bound "
"(%d).", status, astGetClass( this ),
lbnd[ idim ], ubnd[ idim ] );
astError( AST__GBDIN, "Error in input dimension %d.", status,
idim + 1 );
break;
} else {
mpix *= ubnd[ idim ] - lbnd[ idim ] + 1;
}
}
/* Report an error if there are too many pixels in the input. */
npoint = mpix;
if ( astOK && npoint != mpix ) {
astError( AST__EXSPIX, "astTranGrid(%s): Supplied grid "
"contains too many points (%g): must be fewer than %d.",
status, astGetClass( this ), (double) mpix, INT_MAX/ncoord_out );
}
mpix = outdim*ncoord_out;
if ( astOK && (int) mpix != mpix ) {
astError( AST__EXSPIX, "astTranGrid(%s): Supplied output array "
"contains too many pixels (%g): must be fewer than %d.",
status, astGetClass( this ), (double) mpix, INT_MAX );
}
/* Validate the mapping and numbers of points/coordinates. */
ValidateMapping( this, forward, npoint, ncoord_in, ncoord_out,
"astTranGrid", status );
/* Check that the positional accuracy tolerance supplied is valid and
report an error if necessary. */
if ( astOK && ( tol < 0.0 ) ) {
astError( AST__PATIN, "astTranGrid(%s): Invalid positional "
"accuracy tolerance (%.*g pixel).", status,
astGetClass( this ), DBL_DIG, tol );
astError( AST__PATIN, "This value should not be less than zero." , status);
}
/* Check that the initial scale size in grid points supplied is valid and
report an error if necessary. */
if ( astOK && ( maxpix < 0 ) ) {
astError( AST__SSPIN, "astTranGrid(%s): Invalid initial scale "
"size in grid points (%d).", status, astGetClass( this ), maxpix );
astError( AST__SSPIN, "This value should not be less than zero." , status);
}
/* Validate the output array dimension argument. */
if ( astOK && ( outdim < npoint ) ) {
astError( AST__DIMIN, "astTranGrid(%s): The output array dimension value "
"(%d) is invalid.", status, astGetClass( this ), outdim );
astError( AST__DIMIN, "This should not be less than the number of "
"grid points being transformed (%d).", status, npoint );
}
/* If there are sufficient pixels to make it worthwhile, simplify the
Mapping supplied to improve performance. Otherwise, just clone the
Mapping pointer. Note we save a pointer to the original Mapping so
that lower-level functions can use it if they need to report an error. */
simple = NULL;
unsimplified_mapping = this;
if ( astOK ) {
if ( npoint > 1024 ) {
simple = astSimplify( this );
/* Report an error if the required transformation of this simplified
Mapping is not defined. */
if( astOK ) {
if ( forward && !astGetTranForward( simple ) ) {
astError( AST__TRNND, "astTranGrid(%s): A forward coordinate "
"transformation is not defined by the %s supplied.", status,
astGetClass( unsimplified_mapping ),
astGetClass( unsimplified_mapping ) );
} else if ( !forward && !astGetTranInverse( simple ) ) {
astError( AST__TRNND, "astTranGrid(%s): An inverse coordinate "
"transformation is not defined by the %s supplied.", status,
astGetClass( unsimplified_mapping ),
astGetClass( unsimplified_mapping ) );
}
}
} else {
simple = astClone( this );
}
/* Allocate memory to hold the array of output data pointers. */
out_ptr = astMalloc( sizeof( double * ) * (size_t) ncoord_out );
/* Initialise the output data pointers to point into the "out" array. */
if ( astOK ) {
for ( coord = 0; coord < ncoord_out; coord++ ) {
out_ptr[ coord ] = out + coord * outdim;
}
/* If required, temporarily invert the Mapping. */
if( !forward ) astInvert( simple );
/* Perform the transformation. */
TranGridAdaptively( simple, ncoord_in, lbnd, ubnd, lbnd, ubnd, tol,
maxpix, ncoord_out, out_ptr, status );
/* If required, uninvert the Mapping. */
if( !forward ) astInvert( simple );
}
/* Free the memory used for the data pointers. */
out_ptr = astFree( out_ptr );
/* Annul the pointer to the simplified/cloned Mapping. */
simple = astAnnul( simple );
}
}
static void TranGridAdaptively( AstMapping *this, int ncoord_in,
const int *lbnd_in, const int *ubnd_in,
const int lbnd[], const int ubnd[],
double tol, int maxpix, int ncoord_out,
double *out[], int *status ){
/*
* Name:
* TranGridAdaptively
* Purpose:
* Transform grid positions adaptively.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void TranGridAdaptively( AstMapping *this, int ncoord_in,
* const int *lbnd_in, const int *ubnd_in,
* const int lbnd[], const int ubnd[],
* double tol, int maxpix, int ncoord_out,
* double *out[] )
* Class Membership:
* Mapping member function.
* Description:
* This function transforms grid points within a specified section of a
* rectangular grid (with any number of dimensions) using the forward
* transformation of the specified Mapping.
*
* This function is very similar to TranGridWithBlocking and TranGridSection
* which lie below it in the calling hierarchy. However, this function
* also attempts to adapt to the Mapping supplied and to sub-divide the
* section being transformed into smaller sections within which a linear
* approximation to the Mapping may be used. This reduces the number of
* Mapping evaluations, thereby improving efficiency particularly when
* complicated Mappings are involved.
* Parameters:
* this
* Pointer to the Mapping to be applied. The forward transformation
* is used.
* ncoord_in
* The number of coordinates being supplied for each box corner
* (i.e. the number of dimensions of the space in which the
* input points reside).
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the whole input grid, its extent along a
* particular (i'th) dimension being (ubnd_in[i] - lbnd_in[i] +
* 1). They also define the input grid's coordinate system, with
* each pixel being of unit extent along each dimension with
* integral coordinate values at its centre.
* lbnd
* Pointer to an array of integers, with "ncoord_in" elements,
* containing the coordinates of the centre of the first pixel
* in the input grid along each dimension.
* ubnd
* Pointer to an array of integers, with "ncoord_in" elements,
* containing the coordinates of the centre of the last pixel in
* the input grid along each dimension.
*
* Note that "lbnd" and "ubnd" together define the shape
* and size of the input grid, its extent along a particular
* (j'th) dimension being ubnd[j]-lbnd[j]+1 (assuming the
* index "j" to be zero-based). They also define
* the input grid's coordinate system, each pixel having unit
* extent along each dimension with integral coordinate values
* at its centre.
* tol
* The maximum tolerable geometrical distortion which may be
* introduced as a result of approximating non-linear Mappings
* by a set of piece-wise linear transformations. This should be
* expressed as a displacement in pixels in the output grid's
* coordinate system.
*
* If piece-wise linear approximation is not required, a value
* of zero may be given. This will ensure that the Mapping is
* used without any approximation, but may increase execution
* time.
*
* If the value is too high, discontinuities between the linear
* approximations used in adjacent panel will be higher. If this
* is a problem, reduce the tolerance value used.
* maxpix
* A value which specifies an initial scale size (in grid points)
* for the adaptive algorithm which approximates non-linear Mappings
* with piece-wise linear transformations. Normally, this should
* be a large value (larger than any dimension of the region of
* the input grid being used). In this case, a first attempt to
* approximate the Mapping by a linear transformation will be
* made over the entire input region.
*
* If a smaller value is used, the input region will first be
* divided into sub-regions whose size does not exceed "maxpix"
* grid points in any dimension. Only at this point will attempts
* at approximation commence.
*
* This value may occasionally be useful in preventing false
* convergence of the adaptive algorithm in cases where the
* Mapping appears approximately linear on large scales, but has
* irregularities (e.g. holes) on smaller scales. A value of,
* say, 50 to 100 grid points can also be employed as a safeguard
* in general-purpose software, since the effect on performance is
* minimal.
*
* If too small a value is given, it will have the effect of
* inhibiting linear approximation altogether (equivalent to
* setting "tol" to zero). Although this may degrade
* performance, accurate results will still be obtained.
* ncoord_out
* The number of dimensions of the space in which the output points
* reside.
* out
* Pointer to an array with "ndim_out" elements. Element [i] of
* this array is a pointer to an array in which to store the
* transformed values for output axis "i". The points are ordered
* such that the first axis of the input grid changes most rapidly.
* For example, if the input grid is 2-dimensional and extends from
* (2,-1) to (3,1), the output points will be stored in the order
* (2,-1), (3, -1), (2,0), (3,0), (2,1), (3,1).
*/
/* Local Variables: */
double *flbnd; /* Array holding floating point lower bounds */
double *fubnd; /* Array holding floating point upper bounds */
double *linear_fit; /* Pointer to array of fit coefficients */
int *hi; /* Pointer to array of section upper bounds */
int *lo; /* Pointer to array of section lower bounds */
int coord_in; /* Loop counter for input coordinates */
int dim; /* Output section dimension size */
int dimx; /* Dimension with maximum section extent */
int divide; /* Sub-divide the output section? */
int i; /* Loop count */
int isLinear; /* Is the transformation linear? */
int mxdim; /* Largest output section dimension size */
int npix; /* Number of pixels in output section */
int npoint; /* Number of points for obtaining a fit */
int nvertex; /* Number of vertices of output section */
int toobig; /* Section too big (must sub-divide)? */
int toosmall; /* Section too small to sub-divide? */
/* Check the global error status. */
if ( !astOK ) return;
/* Further initialisation. */
npix = 1;
mxdim = 0;
dimx = 1;
nvertex = 1;
/* Loop through the input grid dimensions. */
for ( coord_in = 0; coord_in < ncoord_in; coord_in++ ) {
/* Obtain the extent in each dimension of the input section which is
to be rebinned, and calculate the total number of pixels it contains. */
dim = ubnd[ coord_in ] - lbnd[ coord_in ] + 1;
npix *= dim;
/* Find the maximum dimension size of this input section and note which
dimension has this size. */
if ( dim > mxdim ) {
mxdim = dim;
dimx = coord_in;
}
/* Calculate how many vertices the output section has. */
nvertex *= 2;
}
/* Calculate how many sample points will be needed (by the astLinearApprox
function) to obtain a linear fit to the Mapping's forward transformation. */
npoint = 1 + 4 * ncoord_in + 2 * nvertex;
/* If the number of pixels in the input section is not at least 4
times this number, we will probably not save significant time by
attempting to obtain a linear fit, so note that the input section
is too small. */
toosmall = ( npix < ( 4 * npoint ) );
/* Note if the maximum dimension of the input section exceeds the
user-supplied scale factor. */
toobig = ( maxpix < mxdim );
/* Assume the Mapping is significantly non-linear before deciding
whether to sub-divide the output section. */
linear_fit = NULL;
/* If the output section is too small to be worth obtaining a linear
fit, or if the accuracy tolerance is zero, we will not
sub-divide. This means that the Mapping will be used to transform
each pixel's coordinates and no linear approximation will be
used. */
if ( toosmall || ( tol == 0.0 ) ) {
divide = 0;
/* Otherwise, if the largest input section dimension exceeds the
scale length given, we will sub-divide. This offers the possibility
of obtaining a linear approximation to the Mapping over a reduced
range of input coordinates (which will be handled by a recursive
invocation of this function). */
} else if ( toobig ) {
divide = 1;
/* If neither of the above apply, then attempt to fit a linear
approximation to the forward transformation of the Mapping over
the range of coordinates covered by the input section. We need to
temporarily copy the integer bounds into floating point arrays to
use astLinearApprox. */
} else {
/* Allocate memory for floating point bounds and for the coefficient array */
flbnd = astMalloc( sizeof( double )*(size_t) ncoord_in );
fubnd = astMalloc( sizeof( double )*(size_t) ncoord_in );
linear_fit = astMalloc( sizeof( double )*
(size_t) ( ncoord_out*( ncoord_in + 1 ) ) );
if( astOK ) {
/* Copy the bounds into these arrays, and change them so that they refer
to the lower and upper edges of the cell rather than the centre. This
is essential if one of the axes is spanned by a single cell, since
otherwise the upper and lower bounds would be identical. */
for( i = 0; i < ncoord_in; i++ ) {
flbnd[ i ] = (double) lbnd[ i ] - 0.5;
fubnd[ i ] = (double) ubnd[ i ] + 0.5;
}
/* Get the linear approximation to the forward transformation. */
isLinear = astLinearApprox( this, flbnd, fubnd, tol, linear_fit );
/* Free the coeff array if the inverse transformation is not linear. */
if( !isLinear ) linear_fit = astFree( linear_fit );
} else {
linear_fit = astFree( linear_fit );
}
/* Free resources */
flbnd = astFree( flbnd );
fubnd = astFree( fubnd );
/* If a linear fit was obtained, we will use it and therefore do not
wish to sub-divide further. Otherwise, we sub-divide in the hope
that this may result in a linear fit next time. */
divide = !linear_fit;
}
/* If no sub-division is required, perform the transformation (in a
memory-efficient manner, since the section we are rebinning might
still be very large). This will use the linear fit, if obtained
above. */
if ( astOK ) {
if ( !divide ) {
TranGridWithBlocking( this, linear_fit, ncoord_in, lbnd_in,
ubnd_in, lbnd, ubnd, ncoord_out, out, status );
/* Otherwise, allocate workspace to perform the sub-division. */
} else {
lo = astMalloc( sizeof( int ) * (size_t) ncoord_in );
hi = astMalloc( sizeof( int ) * (size_t) ncoord_in );
if ( astOK ) {
/* Initialise the bounds of a new input section to match the original
input section. */
for ( coord_in = 0; coord_in < ncoord_in; coord_in++ ) {
lo[ coord_in ] = lbnd[ coord_in ];
hi[ coord_in ] = ubnd[ coord_in ];
}
/* Replace the upper bound of the section's largest dimension with the
mid-point of the section along this dimension, rounded downwards. */
hi[ dimx ] =
(int) floor( 0.5 * (double) ( lbnd[ dimx ] + ubnd[ dimx ] ) );
/* Rebin the resulting smaller section using a recursive invocation
of this function. */
TranGridAdaptively( this, ncoord_in, lbnd_in, ubnd_in, lo, hi,
tol, maxpix, ncoord_out, out, status );
/* Now set up a second section which covers the remaining half of the
original input section. */
lo[ dimx ] = hi[ dimx ] + 1;
hi[ dimx ] = ubnd[ dimx ];
/* If this section contains pixels, transform it in the same way. */
if ( lo[ dimx ] <= hi[ dimx ] ) {
TranGridAdaptively( this, ncoord_in, lbnd_in, ubnd_in, lo, hi,
tol, maxpix, ncoord_out, out, status );
}
}
/* Free the workspace. */
lo = astFree( lo );
hi = astFree( hi );
}
}
/* If coefficients for a linear fit were obtained, then free the space
they occupy. */
if ( linear_fit ) linear_fit = astFree( linear_fit );
}
static void TranGridSection( AstMapping *this, const double *linear_fit,
int ndim_in, const int *lbnd_in,
const int *ubnd_in, const int *lbnd,
const int *ubnd, int ndim_out, double *out[], int *status ){
/*
* Name:
* TranGridSection
* Purpose:
* Transform grid points within a section of a rectangular grid.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void TranGridSection( AstMapping *this, const double *linear_fit,
* int ndim_in, const int *lbnd_in,
* const int *ubnd_in, const int *lbnd,
* const int *ubnd, int ndim_out, double *out[] )
* Class Membership:
* Mapping member function.
* Description:
* This function transforms grid points within a specified section of a
* rectangular grid (with any number of dimensions) using a specified
* Mapping or, alternatively, a linear approximation fitted to the
* Mapping's forward transformation.
* Parameters:
* this
* Pointer to a Mapping, whose forward transformation may be
* used to transform the coordinates of points in the input
* grid.
*
* The number of input coordintes for the Mapping (Nin
* attribute) should match the value of "ndim_in" (below), and
* the number of output coordinates (Nout attribute) should
* match the value of "ndim_out".
* linear_fit
* Pointer to an optional array of double which contains the
* coefficients of a linear fit which approximates the above
* Mapping's forward coordinate transformation. If this is
* supplied, it will be used in preference to the above Mapping
* when transforming coordinates. This may be used to enhance
* performance in cases where evaluation of the Mapping's
* forward transformation is expensive. If no linear fit is
* available, a NULL pointer should be supplied.
*
* The way in which the fit coefficients are stored in this
* array and the number of array elements are as defined by the
* astLinearApprox function.
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input data grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input data grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the input data grid, its extent along a
* particular (i'th) dimension being (ubnd_in[i] - lbnd_in[i] +
* 1). They also define the input grid's coordinate system, with
* each pixel being of unit extent along each dimension with
* integral coordinate values at its centre.
* lbnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the first pixel in the
* section of the input data grid which is to be rebinned.
* ubnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the last pixel in the
* section of the input data grid which is to be rebinned.
*
* Note that "lbnd" and "ubnd" define the shape and position of
* the section of the input grid which is to be rebinned. This section
* should lie wholly within the extent of the input grid (as defined
* by the "lbnd_out" and "ubnd_out" arrays). Regions of the input
* grid lying outside this section will be ignored.
* ndim_out
* The number of dimensions in the output grid. This should be
* at least one.
* out
* Pointer to an array with "ndim_out" elements. Element [i] of
* this array is a pointer to an array in which to store the
* transformed values for output axis "i". The points are ordered
* such that the first axis of the input grid changes most rapidly.
* For example, if the input grid is 2-dimensional and extends from
* (2,-1) to (3,1), the output points will be stored in the order
* (2,-1), (3, -1), (2,0), (3,0), (2,1), (3,1).
* Notes:
* - This function does not take steps to limit memory usage if the
* grids supplied are large. To resample large grids in a more
* memory-efficient way, the ResampleWithBlocking function should
* be used.
*/
/* Local Variables: */
AstPointSet *pset_in; /* Input PointSet for transformation */
AstPointSet *pset_out; /* Output PointSet for transformation */
const double *grad; /* Pointer to gradient matrix of linear fit */
const double *zero; /* Pointer to zero point array of fit */
double **ptr_in; /* Pointer to input PointSet coordinates */
double **ptr_out; /* Pointer to output PointSet coordinates */
double *accum; /* Pointer to array of accumulated sums */
double x1; /* Interim x coordinate value */
double xx1; /* Initial x coordinate value */
double y1; /* Interim y coordinate value */
double yy1; /* Initial y coordinate value */
int *dim; /* Pointer to array of output pixel indices */
int *offset; /* Pointer to array of output pixel offsets */
int *stride; /* Pointer to array of output grid strides */
int coord_in; /* Loop counter for input dimensions */
int coord_out; /* Loop counter for output dimensions */
int done; /* All pixel indices done? */
int i1; /* Interim offset into "accum" array */
int i2; /* Final offset into "accum" array */
int idim; /* Loop counter for dimensions */
int ix; /* Loop counter for output x coordinate */
int iy; /* Loop counter for output y coordinate */
int npoint; /* Number of output points (pixels) */
int off1; /* Interim pixel offset into output array */
int off2; /* Interim pixel offset into output array */
int off; /* Final pixel offset into output array */
int point; /* Counter for output points (pixels ) */
int s; /* Temporary variable for strides */
/* Check the global error status. */
if ( !astOK ) return;
/* Further initialisation. */
pset_in = NULL;
ptr_in = NULL;
ptr_out = NULL;
pset_out = NULL;
/* Calculate the number of input points, as given by the product of
the input grid dimensions. */
for ( npoint = 1, coord_in = 0; coord_in < ndim_in; coord_in++ ) {
npoint *= ubnd[ coord_in ] - lbnd[ coord_in ] + 1;
}
/* Allocate workspace. */
offset = astMalloc( sizeof( int ) * (size_t) npoint );
stride = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
/* Calculate the stride for each input grid dimension. */
off = 0;
s = 1;
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
stride[ coord_in ] = s;
s *= ubnd_in[ coord_in ] - lbnd_in[ coord_in ] + 1;
}
/* A linear fit to the Mapping is available. */
/* ========================================= */
if ( linear_fit ) {
/* If a linear fit to the Mapping has been provided, then obtain
pointers to the array of gradients and zero-points comprising the
fit. */
grad = linear_fit + ndim_out;
zero = linear_fit;
/* Create a PointSet to hold the output grid coordinates and obtain an
array of pointers to its coordinate data. */
pset_out = astPointSet( npoint, ndim_out, "", status );
ptr_out = astGetPoints( pset_out );
if ( astOK ) {
/* Initialise the count of input points. */
point = 0;
/* Handle the 1-dimensional case optimally. */
/* ---------------------------------------- */
if ( ( ndim_in == 1 ) && ( ndim_out == 1 ) ) {
/* Loop through the pixels of the input grid and transform their x
coordinates into the output grid's coordinate system using the
linear fit supplied. Store the results in the PointSet created
above. */
off = lbnd[ 0 ] - lbnd_in[ 0 ];
xx1 = zero[ 0 ] + grad[ 0 ] * (double) lbnd[ 0 ];
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_out[ 0 ][ point ] = xx1;
xx1 += grad[ 0 ];
offset[ point++ ] = off++;
}
/* Handle the 2-dimensional case optimally. */
/* ---------------------------------------- */
} else if ( ( ndim_in == 2 ) && ( ndim_out == 2 ) ) {
/* Loop through the range of y coordinates in the input grid and
calculate interim values of the output coordinates using the linear
fit supplied. */
x1 = zero[ 0 ] + grad[ 1 ] * (double) ( lbnd[ 1 ] - 1 );
y1 = zero[ 1 ] + grad[ 3 ] * (double) ( lbnd[ 1 ] - 1 );
off1 = stride[ 1 ] * ( lbnd[ 1 ] - lbnd_in[ 1 ] - 1 ) - lbnd_in[ 0 ];
for ( iy = lbnd[ 1 ]; iy <= ubnd[ 1 ]; iy++ ) {
x1 += grad[ 1 ];
y1 += grad[ 3 ];
/* Also calculate an interim pixel offset into the input array. */
off1 += stride[ 1 ];
/* Now loop through the range of input x coordinates and calculate
the final values of the input coordinates, storing the results in
the PointSet created above. */
xx1 = x1 + grad[ 0 ] * (double) lbnd[ 0 ];
yy1 = y1 + grad[ 2 ] * (double) lbnd[ 0 ];
off = off1 + lbnd[ 0 ];
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_out[ 0 ][ point ] = xx1;
xx1 += grad[ 0 ];
ptr_out[ 1 ][ point ] = yy1;
yy1 += grad[ 2 ];
/* Also calculate final pixel offsets into the input array. */
offset[ point++ ] = off++;
}
}
/* Handle other numbers of dimensions. */
/* ----------------------------------- */
} else {
/* Allocate workspace. */
accum = astMalloc( sizeof( double ) *
(size_t) ( ndim_in * ndim_out ) );
dim = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
/* Initialise an array of pixel indices for the input grid which refer to the
first pixel which we will rebin. Also calculate the offset of this pixel
within the input array. */
off = 0;
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
dim[ coord_in ] = lbnd[ coord_in ];
off += stride[ coord_in ] *
( dim[ coord_in ] - lbnd_in[ coord_in ] );
}
/* To calculate each output grid coordinate we must perform a matrix
multiply on the input grid coordinates (using the gradient matrix)
and then add the zero points. However, since we will usually only
be altering one input coordinate at a time (the least
significant), we can avoid the full matrix multiply by accumulating
partial sums for the most significant input coordinates and only
altering those sums which need to change each time. The zero points
never change, so we first fill the "most significant" end of the
"accum" array with these. */
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
accum[ ( coord_out + 1 ) * ndim_in - 1 ] =
zero[ coord_out ];
}
coord_in = ndim_in - 1;
/* Now loop to process each input pixel. */
for ( done = 0; !done; point++ ) {
/* To generate the output coordinate that corresponds to the current
input pixel, we work down from the most significant dimension
whose index has changed since the previous pixel we considered
(given by "coord_in"). For each affected dimension, we accumulate
in "accum" the matrix sum (including the zero point) for that
dimension and all higher input dimensions. We must accumulate a
separate set of sums for each output coordinate we wish to
produce. (Note that for the first pixel we process, all dimensions
are considered "changed", so we start by initialising the whole
"accum" array.) */
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
i1 = coord_out * ndim_in;
for ( idim = coord_in; idim >= 1; idim-- ) {
i2 = i1 + idim;
accum[ i2 - 1 ] = accum[ i2 ] +
dim[ idim ] * grad[ i2 ];
}
/* The output coordinate for each dimension is given by the accumulated
sum for input dimension zero (giving the sum over all input
dimensions). We do not store this in the "accum" array, but assign
the result directly to the coordinate array of the PointSet created
earlier. */
ptr_out[ coord_out ][ point ] = accum[ i1 ] +
dim[ 0 ] * grad[ i1 ];
}
/* Store the offset of the current pixel in the input array. */
offset[ point ] = off;
/* Now update the array of pixel indices to refer to the next input pixel. */
coord_in = 0;
do {
/* The least significant index which currently has less than its maximum
value is incremented by one. The offset into the input array is updated
accordingly. */
if ( dim[ coord_in ] < ubnd[ coord_in ] ) {
dim[ coord_in ]++;
off += stride[ coord_in ];
break;
/* Any less significant indices which have reached their maximum value
are returned to their minimum value and the input pixel offset is
decremented appropriately. */
} else {
dim[ coord_in ] = lbnd[ coord_in ];
off -= stride[ coord_in ] *
( ubnd[ coord_in ] - lbnd[ coord_in ] );
/* All the output pixels have been processed once the most significant
pixel index has been returned to its minimum value. */
done = ( ++coord_in == ndim_in );
}
} while ( !done );
}
}
/* Free the workspace. */
accum = astFree( accum );
dim = astFree( dim );
}
}
/* No linear fit to the Mapping is available. */
/* ========================================== */
} else {
/* Create a PointSet to hold the coordinates of the input pixels and
obtain a pointer to its coordinate data. */
pset_in = astPointSet( npoint, ndim_in, "", status );
ptr_in = astGetPoints( pset_in );
if ( astOK ) {
/* Initialise the count of input points. */
point = 0;
/* Handle the 1-dimensional case optimally. */
/* ---------------------------------------- */
if ( ndim_in == 1 && ndim_out == 1 ) {
/* Loop through the required range of input x coordinates, assigning
the coordinate values to the PointSet created above. Also store a
pixel offset into the input array. */
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_in[ 0 ][ point ] = (double) ix;
offset[ point++ ] = ix - lbnd_in[ 0 ];
}
/* Handle the 2-dimensional case optimally. */
/* ---------------------------------------- */
} else if ( ndim_in == 2 && ndim_out == 2 ) {
/* Loop through the required range of input y coordinates,
calculating an interim pixel offset into the input array. */
off1 = stride[ 1 ] * ( lbnd[ 1 ] - lbnd_in[ 1 ] - 1 )
- lbnd_in[ 0 ];
for ( iy = lbnd[ 1 ]; iy <= ubnd[ 1 ]; iy++ ) {
off1 += stride[ 1 ];
/* Loop through the required range of input x coordinates, assigning
the coordinate values to the PointSet created above. Also store a
final pixel offset into the input array. */
off2 = off1 + lbnd[ 0 ];
for ( ix = lbnd[ 0 ]; ix <= ubnd[ 0 ]; ix++ ) {
ptr_in[ 0 ][ point ] = (double) ix;
ptr_in[ 1 ][ point ] = (double) iy;
offset[ point++ ] = off2++;
}
}
/* Handle other numbers of dimensions. */
/* ----------------------------------- */
} else {
/* Allocate workspace. */
dim = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
/* Initialise an array of pixel indices for the input grid which
refer to the first pixel to be rebinned. Also calculate the offset
of this pixel within the input array. */
off = 0;
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
dim[ coord_in ] = lbnd[ coord_in ];
off += stride[ coord_in ] *
( dim[ coord_in ] - lbnd_in[ coord_in ] );
}
/* Loop to generate the coordinates of each input pixel. */
for ( done = 0; !done; point++ ) {
/* Copy each pixel's coordinates into the PointSet created above. */
for ( coord_in = 0; coord_in < ndim_in; coord_in++ ) {
ptr_in[ coord_in ][ point ] =
(double) dim[ coord_in ];
}
/* Store the offset of the pixel in the input array. */
offset[ point ] = off;
/* Now update the array of pixel indices to refer to the next input
pixel. */
coord_in = 0;
do {
/* The least significant index which currently has less than its
maximum value is incremented by one. The offset into the input
array is updated accordingly. */
if ( dim[ coord_in ] < ubnd[ coord_in ] ) {
dim[ coord_in ]++;
off += stride[ coord_in ];
break;
/* Any less significant indices which have reached their maximum value
are returned to their minimum value and the input pixel offset is
decremented appropriately. */
} else {
dim[ coord_in ] = lbnd[ coord_in ];
off -= stride[ coord_in ] *
( ubnd[ coord_in ] - lbnd[ coord_in ] );
/* All the input pixels have been processed once the most significant
pixel index has been returned to its minimum value. */
done = ( ++coord_in == ndim_in );
}
} while ( !done );
}
}
/* Free the workspace. */
dim = astFree( dim );
}
/* When all the input pixel coordinates have been generated, use the
Mapping's forward transformation to generate the output coordinates
from them. Obtain an array of pointers to the resulting coordinate
data. */
pset_out = astTransform( this, pset_in, 1, NULL );
ptr_out = astGetPoints( pset_out );
}
/* Annul the PointSet containing the input coordinates. */
pset_in = astAnnul( pset_in );
}
}
/* Copy the output coordinates into the correct positions within the
supplied "out" array. */
/* ================================================================= */
if( astOK ) {
for ( coord_out = 0; coord_out < ndim_out; coord_out++ ) {
for ( point = 0; point < npoint; point++ ) {
out[ coord_out ][ offset[ point ] ] = ptr_out[ coord_out ][ point ];
}
}
}
/* Annul the PointSet used to hold output coordinates. */
pset_out = astAnnul( pset_out );
/* Free the workspace. */
offset = astFree( offset );
stride = astFree( stride );
}
static void TranGridWithBlocking( AstMapping *this, const double *linear_fit,
int ndim_in, const int *lbnd_in,
const int *ubnd_in, const int *lbnd,
const int *ubnd, int ndim_out,
double *out[], int *status ){
/*
* Name:
* TranGridWithBlocking
* Purpose:
* Transforms positions in a section of a grid in a memory-efficient way.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void TranGridWithBlocking( AstMapping *this, const double *linear_fit,
* int ndim_in, const int *lbnd_in,
* const int *ubnd_in, const int *lbnd,
* const int *ubnd, int ndim_out,
* double *out[], int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function transforms positions within a specified section of a
* rectangular grid (with any number of dimensions) using the forward
* transformation of the supplied Mapping.
*
* This function is very similar to TranGridSection, except that in
* order to limit memory usage and to ensure locality of reference,
* it divides the input grid up into "blocks" which have a limited
* extent along each input dimension. Each block, which will not
* contain more than a pre-determined maximum number of pixels, is
* then passed to TranGridSection for transformation.
* Parameters:
* this
* Pointer to a Mapping, whose forward transformation may be
* used to transform the coordinates of pixels in the input
* grid into associated positions in the output grid.
*
* The number of input coordintes for the Mapping (Nin
* attribute) should match the value of "ndim_in" (below), and
* the number of output coordinates (Nout attribute) should
* match the value of "ndim_out".
* linear_fit
* Pointer to an optional array of double which contains the
* coefficients of a linear fit which approximates the above
* Mapping's forward coordinate transformation. If this is
* supplied, it will be used in preference to the above Mapping
* when transforming coordinates. This may be used to enhance
* performance in cases where evaluation of the Mapping's
* forward transformation is expensive. If no linear fit is
* available, a NULL pointer should be supplied.
*
* The way in which the fit coefficients are stored in this
* array and the number of array elements are as defined by the
* astLinearApprox function.
* ndim_in
* The number of dimensions in the input grid. This should be at
* least one.
* lbnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the first
* pixel in the input grid along each dimension.
* ubnd_in
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the centre of the last
* pixel in the input grid along each dimension.
*
* Note that "lbnd_in" and "ubnd_in" together define the shape
* and size of the whole input grid, its extent along a
* particular (i'th) dimension being (ubnd_in[i] - lbnd_in[i] +
* 1). They also define the input grid's coordinate system, with
* each pixel being of unit extent along each dimension with
* integral coordinate values at its centre.
* lbnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the first pixel in the
* section of the input data grid which is to be transformed.
* ubnd
* Pointer to an array of integers, with "ndim_in" elements.
* This should give the coordinates of the last pixel in the
* section of the input data grid which is to be transformed.
*
* Note that "lbnd" and "ubnd" define the shape and position of the
* section of the input grid which is to be transformed.
* ndim_out
* The number of dimensions in the output grid. This should be
* at least one.
* out
* Pointer to an array with "ndim_out" elements. Element [i] of
* this array is a pointer to an array in which to store the
* transformed values for output axis "i". The points are ordered
* such that the first axis of the input grid changes most rapidly.
* For example, if the input grid is 2-dimensional and extends from
* (2,-1) to (3,1), the output points will be stored in the order
* (2,-1), (3, -1), (2,0), (3,0), (2,1), (3,1).
* status
* Pointer to the inherited status variable.
*/
/* Local Constants: */
const int mxpix = 2 * 1024; /* Maximum number of pixels in a block (this
relatively small number seems to give best
performance) */
/* Local Variables: */
int *dim_block; /* Pointer to array of block dimensions */
int *lbnd_block; /* Pointer to block lower bound array */
int *ubnd_block; /* Pointer to block upper bound array */
int dim; /* Dimension size */
int done; /* All blocks rebinned? */
int hilim; /* Upper limit on maximum block dimension */
int idim; /* Loop counter for dimensions */
int lolim; /* Lower limit on maximum block dimension */
int mxdim_block; /* Maximum block dimension */
int npix; /* Number of pixels in block */
/* Check the global error status. */
if ( !astOK ) return;
/* Allocate workspace. */
lbnd_block = astMalloc( sizeof( int ) * (size_t) ndim_in );
ubnd_block = astMalloc( sizeof( int ) * (size_t) ndim_in );
dim_block = astMalloc( sizeof( int ) * (size_t) ndim_in );
if ( astOK ) {
/* Find the optimum block size. */
/* ---------------------------- */
/* We first need to find the maximum extent which a block of input
pixels may have in each dimension. We determine this by taking the
input grid extent in each dimension and then limiting the maximum
dimension size until the resulting number of pixels is sufficiently
small. This approach allows the block shape to approximate (or
match) the input grid shape when appropriate. */
/* First loop to calculate the total number of input pixels and the
maximum input dimension size. */
npix = 1;
mxdim_block = 0;
for ( idim = 0; idim < ndim_in; idim++ ) {
dim = ubnd[ idim ] - lbnd[ idim ] + 1;
npix *= dim;
if ( mxdim_block < dim ) mxdim_block = dim;
}
/* If the number of input pixels is too large for a single block, we
perform iterations to determine the optimum upper limit on a
block's dimension size. Initialise the limits on this result. */
if ( npix > mxpix ) {
lolim = 1;
hilim = mxdim_block;
/* Loop to perform a binary chop, searching for the best result until
the lower and upper limits on the result converge to adjacent
values. */
while ( ( hilim - lolim ) > 1 ) {
/* Form a new estimate from the mid-point of the previous limits. */
mxdim_block = ( hilim + lolim ) / 2;
/* See how many pixels a block contains if its maximum dimension is
limited to this new value. */
for ( npix = 1, idim = 0; idim < ndim_in; idim++ ) {
dim = ubnd[ idim ] - lbnd[ idim ] + 1;
npix *= ( dim < mxdim_block ) ? dim : mxdim_block;
}
/* Update the appropriate limit, according to whether the number of
pixels is too large or too small. */
*( ( npix <= mxpix ) ? &lolim : &hilim ) = mxdim_block;
}
/* When iterations have converged, obtain the maximum limit on the
dimension size of a block which results in no more than the maximum
allowed number of pixels per block. However, ensure that all block
dimensions are at least 2. */
mxdim_block = lolim;
}
if ( mxdim_block < 2 ) mxdim_block = 2;
/* Calculate the block dimensions by applying this limit to the output
grid dimensions. */
for ( idim = 0; idim < ndim_in; idim++ ) {
dim = ubnd[ idim ] - lbnd[ idim ] + 1;
dim_block[ idim ] = ( dim < mxdim_block ) ? dim : mxdim_block;
/* Also initialise the lower and upper bounds of the first block of
output grid pixels to be rebinned, ensuring that this does not
extend outside the grid itself. */
lbnd_block[ idim ] = lbnd[ idim ];
ubnd_block[ idim ] = MinI( lbnd[ idim ] + dim_block[ idim ] - 1,
ubnd[ idim ], status );
}
/* Transform each block of input grid positions. */
/* --------------------------------------------- */
/* Loop to generate the extent of each block of input grid positions and to
transform them. */
done = 0;
while ( !done && astOK ) {
/* Rebin the current block, accumulating the sum of bad pixels produced. */
TranGridSection( this, linear_fit, ndim_in, lbnd_in, ubnd_in,
lbnd_block, ubnd_block, ndim_out, out, status );
/* Update the block extent to identify the next block of input pixels. */
idim = 0;
do {
/* We find the least significant dimension where the upper bound of
the block has not yet reached the upper bound of the region of the
input grid which we are rebinning. The block's position is then
incremented by one block extent along this dimension, checking that
the resulting extent does not go outside the region being rebinned. */
if ( ubnd_block[ idim ] < ubnd[ idim ] ) {
lbnd_block[ idim ] = MinI( lbnd_block[ idim ] +
dim_block[ idim ], ubnd[ idim ], status );
ubnd_block[ idim ] = MinI( lbnd_block[ idim ] +
dim_block[ idim ] - 1,
ubnd[ idim ], status );
break;
/* If any less significant dimensions are found where the upper bound
of the block has reached its maximum value, we reset the block to
its lowest position. */
} else {
lbnd_block[ idim ] = lbnd[ idim ];
ubnd_block[ idim ] = MinI( lbnd[ idim ] + dim_block[ idim ] - 1,
ubnd[ idim ], status );
/* All the blocks have been processed once the position along the most
significant dimension has been reset. */
done = ( ++idim == ndim_in );
}
} while ( !done );
}
}
/* Free the workspace. */
lbnd_block = astFree( lbnd_block );
ubnd_block = astFree( ubnd_block );
dim_block = astFree( dim_block );
}
static void TranN( AstMapping *this, int npoint,
int ncoord_in, int indim, const double *in,
int forward,
int ncoord_out, int outdim, double *out, int *status ) {
/*
*++
* Name:
c astTranN
f AST_TRANN
* Purpose:
* Transform N-dimensional coordinates.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astTranN( AstMapping *this, int npoint,
c int ncoord_in, int indim, const double *in,
c int forward,
c int ncoord_out, int outdim, double *out )
f CALL AST_TRANN( THIS, NPOINT,
f NCOORD_IN, INDIM, IN,
f FORWARD, NCOORD_OUT, OUTDIM, OUT, STATUS )
* Class Membership:
* Mapping method.
* Description:
c This function applies a Mapping to transform the coordinates of
f This routine applies a Mapping to transform the coordinates of
* a set of points in an arbitrary number of dimensions. It is the
* appropriate routine to use if the coordinates are not purely 1-
* or 2-dimensional and are stored in a single array (which they
* need not fill completely).
c
c If the coordinates are not stored in a single array, then the
c astTranP function might be more suitable.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping to be applied.
c npoint
f NPOINT = INTEGER (Given)
* The number of points to be transformed.
c ncoord_in
f NCOORD_IN = INTEGER (Given)
* The number of coordinates being supplied for each input point
* (i.e. the number of dimensions of the space in which the
* input points reside).
c indim
f INDIM = INTEGER (Given)
c The number of elements along the second dimension of the "in"
f The number of elements along the first dimension of the IN
* array (which contains the input coordinates). This value is
* required so that the coordinate values can be correctly
* located if they do not entirely fill this array. The value
c given should not be less than "npoint".
f given should not be less than NPOINT.
c in
f IN( INDIM, NCOORD_IN ) = DOUBLE PRECISION (Given)
c The address of the first element in a 2-dimensional array of
c shape "[ncoord_in][indim]",
c containing the coordinates of the input (untransformed)
c points. These should be stored such that the value of
c coordinate number "coord" for input point number "point" is
c found in element "in[coord][point]".
f An array containing the coordinates of the input
f (untransformed) points. These should be stored such that the
f value of coordinate number COORD for input point number POINT
f is found in element IN(POINT,COORD).
c forward
f FORWARD = LOGICAL (Given)
c A non-zero value indicates that the Mapping's forward
c coordinate transformation is to be applied, while a zero
c value indicates that the inverse transformation should be
c used.
f A .TRUE. value indicates that the Mapping's forward
f coordinate transformation is to be applied, while a .FALSE.
f value indicates that the inverse transformation should be
f used.
c ncoord_out
f NCOORD_OUT = INTEGER (Given)
* The number of coordinates being generated by the Mapping for
* each output point (i.e. the number of dimensions of the
* space in which the output points reside). This need not be
c the same as "ncoord_in".
f the same as NCOORD_IN.
c outdim
f OUTDIM = INTEGER (Given)
c The number of elements along the second dimension of the "out"
f The number of elements along the first dimension of the OUT
* array (which will contain the output coordinates). This value
* is required so that the coordinate values can be correctly
* located if they will not entirely fill this array. The value
c given should not be less than "npoint".
f given should not be less than NPOINT.
c out
f OUT( OUTDIM, NCOORD_OUT ) = DOUBLE PRECISION (Returned)
c The address of the first element in a 2-dimensional array of
c shape "[ncoord_out][outdim]", into
c which the coordinates of the output (transformed) points will
c be written. These will be stored such that the value of
c coordinate number "coord" for output point number "point"
c will be found in element "out[coord][point]".
f An array into which the coordinates of the output
f (transformed) points will be written. These will be stored
f such that the value of coordinate number COORD for output
f point number POINT will be found in element OUT(POINT,COORD).
f STATUS = INTEGER (Given and Returned)
f The global status.
* Notes:
c - If the forward coordinate transformation is being applied, the
c Mapping supplied must have the value of "ncoord_in" for its Nin
c attribute and the value of "ncoord_out" for its Nout attribute. If
c the inverse transformation is being applied, these values should
c be reversed.
f - If the forward coordinate transformation is being applied, the
f Mapping supplied must have the value of NCOORD_IN for its Nin
f attribute and the value of NCOORD_OUT for its Nout attribute. If
f the inverse transformation is being applied, these values should
f be reversed.
*--
*/
/* Local Variables: */
AstPointSet *in_points; /* Pointer to input PointSet */
AstPointSet *out_points; /* Pointer to output PointSet */
const double **in_ptr; /* Pointer to array of input data pointers */
double **out_ptr; /* Pointer to array of output data pointers */
int coord; /* Loop counter for coordinates */
/* Check the global error status. */
if ( !astOK ) return;
/* Validate the mapping and numbers of points/coordinates. */
ValidateMapping( this, forward, npoint, ncoord_in, ncoord_out, "astTranN", status );
/* Also validate the input array dimension argument. */
if ( astOK && ( indim < npoint ) ) {
astError( AST__DIMIN, "astTranN(%s): The input array dimension value "
"(%d) is invalid.", status, astGetClass( this ), indim );
astError( AST__DIMIN, "This should not be less than the number of "
"points being transformed (%d).", status, npoint );
}
/* Similarly, validate the output array dimension argument. */
if ( astOK && ( outdim < npoint ) ) {
astError( AST__DIMIN, "astTranN(%s): The output array dimension value "
"(%d) is invalid.", status, astGetClass( this ), outdim );
astError( AST__DIMIN, "This should not be less than the number of "
"points being transformed (%d).", status, npoint );
}
/* Allocate memory to hold the arrays of input and output data
pointers. */
if ( astOK ) {
in_ptr = (const double **) astMalloc( sizeof( const double * ) *
(size_t) ncoord_in );
out_ptr = astMalloc( sizeof( double * ) * (size_t) ncoord_out );
#ifdef DEBUG
{ int i, ns;
ns = ncoord_out*outdim;
for( i = 0; i < ns; i++ ) out[ i ] = 0.0;
}
#endif
/* Initialise the input data pointers to locate the coordinate data in
the "in" array. */
if ( astOK ) {
for ( coord = 0; coord < ncoord_in; coord++ ) {
in_ptr[ coord ] = in + coord * indim;
}
/* Similarly initialise the output data pointers to point into the
"out" array. */
for ( coord = 0; coord < ncoord_out; coord++ ) {
out_ptr[ coord ] = out + coord * outdim;
}
/* Create PointSets to describe the input and output points. */
in_points = astPointSet( npoint, ncoord_in, "", status );
out_points = astPointSet( npoint, ncoord_out, "", status );
/* Associate the data pointers with the PointSets (note we must
explicitly remove the "const" qualifier from the input data here,
although they will not be modified). */
astSetPoints( in_points, (double **) in_ptr );
astSetPoints( out_points, out_ptr );
/* Apply the required transformation to the coordinates. */
(void) astTransform( this, in_points, forward, out_points );
/* If the Mapping's Report attribute is set, report the effect the
Mapping has had on the coordinates. */
if ( astGetReport( this ) ) astReportPoints( this, forward,
in_points, out_points );
/* Delete the two PointSets. */
in_points = astDelete( in_points );
out_points = astDelete( out_points );
}
/* Free the memory used for the data pointers. */
in_ptr = (const double **) astFree( (void *) in_ptr );
out_ptr = astFree( out_ptr );
}
}
static void TranP( AstMapping *this, int npoint,
int ncoord_in, const double *ptr_in[],
int forward, int ncoord_out, double *ptr_out[], int *status ) {
/*
c++
* Name:
* astTranP
* Purpose:
* Transform N-dimensional coordinates held in separate arrays.
* Type:
* Public virtual function.
* Synopsis:
* #include "mapping.h"
* void astTranP( AstMapping *this, int npoint,
* int ncoord_in, const double *ptr_in[],
* int forward, int ncoord_out, double *ptr_out[] )
* Class Membership:
* Mapping method.
* Description:
* This function applies a Mapping to transform the coordinates of
* a set of points in an arbitrary number of dimensions. It is the
* appropriate routine to use if the coordinates are not purely 1-
* or 2-dimensional and are stored in separate arrays, since each
* coordinate array is located by supplying a separate pointer to
* it.
*
* If the coordinates are stored in a single (2-dimensional) array,
* then the astTranN function might be more suitable.
* Parameters:
* this
* Pointer to the Mapping to be applied.
* npoint
* The number of points to be transformed.
* ncoord_in
* The number of coordinates being supplied for each input point
* (i.e. the number of dimensions of the space in which the
* input points reside).
* ptr_in
* An array of pointers to double, with "ncoord_in"
* elements. Element "ptr_in[coord]" should point at the first
* element of an array of double (with "npoint" elements) which
* contain the values of coordinate number "coord" for each
* input (untransformed) point. The value of coordinate number
* "coord" for input point number "point" is therefore given by
* "ptr_in[coord][point]" (assuming both indices are
* zero-based).
* forward
* A non-zero value indicates that the Mapping's forward
* coordinate transformation is to be applied, while a zero
* value indicates that the inverse transformation should be
* used.
* ncoord_out
* The number of coordinates being generated by the Mapping for
* each output point (i.e. the number of dimensions of the space
* in which the output points reside). This need not be the same
* as "ncoord_in".
* ptr_out
* An array of pointers to double, with "ncoord_out"
* elements. Element "ptr_out[coord]" should point at the first
* element of an array of double (with "npoint" elements) into
* which the values of coordinate number "coord" for each output
* (transformed) point will be written. The value of coordinate
* number "coord" for output point number "point" will therefore
* be found in "ptr_out[coord][point]".
* Notes:
* - If the forward coordinate transformation is being applied, the
* Mapping supplied must have the value of "ncoord_in" for its Nin
* attribute and the value of "ncoord_out" for its Nout
* attribute. If the inverse transformation is being applied, these
* values should be reversed.
* - This routine is not available in the Fortran 77 interface to
* the AST library.
c--
*/
/* Local Variables: */
AstPointSet *in_points; /* Pointer to input PointSet */
AstPointSet *out_points; /* Pointer to output PointSet */
/* Check the global error status. */
if ( !astOK ) return;
/* Validate the Mapping and number of points/coordinates. */
ValidateMapping( this, forward, npoint, ncoord_in, ncoord_out, "astTranP", status );
/* Create PointSets to describe the input and output points. */
if ( astOK ) {
in_points = astPointSet( npoint, ncoord_in, "", status );
out_points = astPointSet( npoint, ncoord_out, "", status );
/* Associate the data pointers with the PointSets (note we must
explicitly remove the "const" qualifier from the input data here,
although they will not be modified). */
astSetPoints( in_points, (double **) ptr_in );
astSetPoints( out_points, ptr_out );
/* Apply the required transformation to the coordinates. */
(void) astTransform( this, in_points, forward, out_points );
/* If the Mapping's Report attribute is set, report the effect the
Mapping has had on the coordinates. */
if ( astGetReport( this ) ) astReportPoints( this, forward,
in_points, out_points );
/* Delete the two PointSets. */
in_points = astDelete( in_points );
out_points = astDelete( out_points );
}
}
static AstPointSet *Transform( AstMapping *this, AstPointSet *in,
int forward, AstPointSet *out, int *status ) {
/*
*+
* Name:
* astTransform
* Purpose:
* Transform a set of points.
* Type:
* Protected virtual function.
* Synopsis:
* #include "mapping.h"
* AstPointSet *astTransform( AstMapping *this, AstPointSet *in,
* int forward, AstPointSet *out )
* Class Membership:
* Mapping method.
* Description:
* This function takes a Mapping and a set of points encapsulated
* in a PointSet, and applies either the forward or inverse
* coordinate transformation (if defined by the Mapping) to the
* points.
* Parameters:
* this
* Pointer to the Mapping. The nature of the coordinate
* transformation will depend on the class of Mapping
* supplied. Note that there is no constructor for the Mapping
* class itself, so this object should be from a derived class.
* in
* Pointer to the PointSet holding the input coordinate data.
* forward
* A non-zero value indicates that the forward coordinate
* transformation should be applied, while a zero value requests
* the inverse transformation.
* out
* Pointer to a PointSet which will hold the transformed
* (output) coordinate values. A NULL value may also be given,
* in which case a new PointSet will be created by this
* function.
* Returned Value:
* Pointer to the output (possibly new) PointSet.
* Notes:
* - An error will result if the Mapping supplied does not define
* the requested coordinate transformation (either forward or
* inverse).
* - The number of coordinate values per point in the input
* PointSet must match the number of input coordinates for the
* Mapping being applied (or number of output coordinates if the
* inverse transformation is requested).
* - If an output PointSet is supplied, it must have space for
* sufficient number of points and coordinate values per point to
* accommodate the result (e.g. the number of Mapping output
* coordinates, or number of input coordinates if the inverse
* transformation is requested). Any excess space will be ignored.
* - A null pointer will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
*/
/* Local Variables: */
AstPointSet *result; /* Pointer to output PointSet */
int def; /* Coordinate transformation defined? */
int ncoord_in; /* Number of input PointSet coordinates */
int ncoord_out; /* Number of coordinates in output PointSet */
int nin; /* Number of input Mapping coordinates */
int nout; /* Number of output Mapping coordinates */
int npoint; /* Number of points to transform */
int npoint_out; /* Number of points in output PointSet */
/* Check the global error status. */
if ( !astOK ) return NULL;
/* Initialise. */
result = NULL;
/* Determine if a coordinate transformation is defined for the requested
direction. */
def = forward ? astGetTranForward( this ) : astGetTranInverse( this );
/* Report an error if the transformation is not defined. */
if ( astOK && !def ) {
astError( AST__TRNND, "astTransform(%s): %s coordinate transformation "
"is not defined by the %s supplied.", status, astGetClass( this ),
forward ? "A forward" : "An inverse", astGetClass( this ) );
}
/* Obtain the effective number of input and output coordinate values for the
transformation to be performed, taking account of the transformation
direction required. Note we use Mapping methods to obtain these values, as
this will take account of whether the Mapping has been inverted. */
nin = forward ? astGetNin( this ) : astGetNout( this );
nout = forward ? astGetNout( this ) : astGetNin( this );
/* Obtain the number of input points to transform and the number of coordinate
values per input point. */
npoint = astGetNpoint( in );
ncoord_in = astGetNcoord( in );
/* If OK, check that the number of input coordinates matches the number
required by the mapping. Report an error if these numbers do not match. */
if ( astOK && ( ncoord_in != nin ) ) {
astError( AST__NCPIN, "astTransform(%s): Bad number of coordinate "
"values (%d) in input %s.", status, astGetClass( this ), ncoord_in,
astGetClass( in ) );
astError( AST__NCPIN, "The %s given requires %d coordinate value(s) for "
"each input point.", status, astGetClass( this ), nin );
}
/* If still OK, and a non-NULL pointer has been given for the output PointSet,
then obtain the number of points and number of coordinates per point for
this PointSet. */
if ( astOK && out ) {
npoint_out = astGetNpoint( out );
ncoord_out = astGetNcoord( out );
/* Check that the dimensions of this PointSet are adequate to accommodate the
output coordinate values and report an error if they are not. */
if ( astOK ) {
if ( npoint_out < npoint ) {
astError( AST__NOPTS, "astTransform(%s): Too few points (%d) in "
"output %s.", status, astGetClass( this ), npoint_out,
astGetClass( out ) );
astError( AST__NOPTS, "The %s needs space to hold %d transformed "
"point(s).", status, astGetClass( this ), npoint );
} else if ( ncoord_out < nout ) {
astError( AST__NOCTS, "astTransform(%s): Too few coordinate "
"values per point (%d) in output %s.", status,
astGetClass( this ), ncoord_out, astGetClass( out ) );
astError( AST__NOCTS, "The %s supplied needs space to store %d "
"coordinate value(s) per transformed point.", status,
astGetClass( this ), nout );
}
}
}
/* If all the validation stages are passed successfully, and a NULL output
pointer was given, then create a new PointSet to encapsulate the output
coordinate data. */
if ( astOK ) {
if ( !out ) {
result = astPointSet( npoint, nout, "", status );
/* Otherwise, use the PointSet supplied. */
} else {
result = out;
}
}
/* Return a pointer to the output PointSet. Note that we do not actually
transform (or even copy) the coordinates. This is left for derived classes
to implement. */
return result;
}
/*
*++
* Name:
c astUinterp
f AST_UINTERP
* Purpose:
* Perform sub-pixel interpolation on a grid of data.
* Type:
* Fictitious function.
* Synopsis:
c #include "mapping.h"
c void astUinterp( int ndim_in, const int lbnd_in[], const int ubnd_in[],
c const <Xtype> in[], const <Xtype> in_var[],
c int npoint, const int offset[],
c const double *const coords[], const double params[],
c int flags, <Xtype> badval,
c <Xtype> out[], <Xtype> out_var[], int *nbad )
f CALL AST_UINTERP( NDIM_IN, LBND_IN, UBND_IN, IN, IN_VAR,
f NPOINT, OFFSET, COORDS, PARAMS, FLAGS, BADVAL,
f OUT, OUT_VAR, NBAD, STATUS )
* Class Membership:
* Mapping member function.
* Description:
c This is a fictitious function which does not actually
c exist. Instead, this description constitutes a template so that
c you may implement a function with this interface for yourself
c (and give it any name you wish). A pointer to such a function
c may be passed via the "finterp" parameter of the astResample<X>
c functions (q.v.) in order to perform sub-pixel interpolation
c during resampling of gridded data (you must also set the
c "interp" parameter of astResample<X> to the value
c AST__UINTERP). This allows you to use your own interpolation
c algorithm in addition to those which are pre-defined.
f This is a fictitious routine which does not actually
f exist. Instead, this description constitutes a template so that
f you may implement a routine with this interface for yourself
f (and give it any name you wish). Such a routine
f may be passed via the FINTERP argument of the AST_RESAMPLE<X>
f functions (q.v.) in order to perform sub-pixel interpolation
f during resampling of gridded data (you must also set the
f INTERP argument of AST_RESAMPLE<X> to the value
f AST__UINTERP). This allows you to use your own interpolation
f algorithm in addition to those which are pre-defined.
*
c The function interpolates an input grid of data (and,
f The routine interpolates an input grid of data (and,
* optionally, processes associated statistical variance estimates)
* at a specified set of points.
* Parameters:
c ndim_in
f NDIM_IN = INTEGER (Given)
* The number of dimensions in the input grid. This will be at
* least one.
c lbnd_in
f LBND_IN( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the centre of the first pixel
* in the input grid along each dimension.
c ubnd_in
f UBND_IN( NDIM_IN ) = INTEGER (Given)
c Pointer to an array of integers, with "ndim_in" elements,
f An array
* containing the coordinates of the centre of the last pixel in
* the input grid along each dimension.
*
c Note that "lbnd_in" and "ubnd_in" together define the shape,
f Note that LBND_IN and UBND_IN together define the shape,
* size and coordinate system of the input grid in the same
c way as they do in astResample<X>.
f way as they do in AST_RESAMPLE<X>.
c in
f IN( * ) = <Xtype> (Given)
c Pointer to an array, with one element for each pixel in the
f An array, with one element for each pixel in the
* input grid, containing the input data. This will be the same
c array as was passed to astResample<X> via the "in" parameter.
f array as was passed to AST_RESAMPLE<X> via the IN argument.
* The numerical type of this array should match that of the
* data being processed.
c in_var
f IN_VAR( * ) = <Xtype> (Given)
c Pointer to an optional second array with the same size and
c type as the "in" array. If given, this will contain the set
c of variance values associated with the input data and will be
c the same array as was passed to astResample<X> via the
c "in_var" parameter.
f An optional second array with the same size and type as the
f IN array. This will only be given if the AST__USEVAR flag is
f set via the FLAGS argument (below). If given, it will contain
f the set of variance values associated with the input data and
f will be the same array as was passed to AST_RESAMPLE<X> via
f the IN_VAR argument.
*
c If no variance values are being processed, this will be a
c NULL pointer.
f If the AST__USEVAR flag is not set, then no variance values
f are being processed. In this case, this array of variance
f values may be a dummy (e.g. one-element) array and should not
f be used.
c npoint
f NPOINT = INTEGER (Given)
* The number of points at which the input grid is to be
* interpolated. This will be at least one.
c offset
f OFFSET( NPOINT ) = INTEGER (Given)
c Pointer to an array of integers with "npoint" elements. For
c each interpolation point, this will contain the zero-based
c index in the "out" (and "out_var") array(s) at which the
c interpolated value (and its variance, if required) should be
c stored. For example, the interpolated value for point number
c "point" should be stored in "out[offset[point]]" (assuming
c the index "point" is zero-based).
f For each interpolation point, this array will contain the
f offset from the start of the OUT (and OUT_VAR) array(s) at
f which the interpolated value (and its variance, if required)
f should be stored. For example, the interpolated value for
f point number POINT should be stored in OUT(1+OFFSET(POINT)).
c coords
f COORDS( NPOINT, NDIM_IN ) = DOUBLE PRECISION (Given)
c An array of pointers to double, with "ndim_in"
c elements. Element "coords[coord]" will point at the first
c element of an array of double (with "npoint" elements) which
c contains the values of coordinate number "coord" for each
c interpolation point. The value of coordinate number "coord"
c for interpolation point number "point" is therefore given by
c "coords[coord][point]" (assuming both indices are
c zero-based).
f A 2-dimensional array containing the coordinates of the
f points at which interpolation should be performed. These will
f be stored so that coordinate number COORD for interpolation
f point number POINT is found in element COORDS(POINT,COORD).
*
* If any interpolation point has any of its coordinates equal
c to the value AST__BAD (as defined in the "ast.h" header
f to the value AST__BAD (as defined in the AST_PAR include
* file), then the corresponding output data (and variance)
c should either be set to the value given by "badval",
f should either be set to the value given by BADVAL,
* or left unchanged, depending on whether the AST__NOBAD flag is
c specified by "flags".
f specified by FLAGS.
c params
f PARAMS( * ) = DOUBLE PRECISION (Given)
c This will be a pointer to the same array as was given via the
c "params" parameter of astResample<X>. You may use this to
f This will be the same array as was given via the
f PARAMS argument of AST_RESAMPLE<X>. You may use this to
* pass any additional parameter values required by your
* interpolation algorithm.
c flags
f FLAGS = INTEGER (Given)
c This will be the same value as was given via the "flags"
c parameter of astResample<X>. You may test this value to
f This will be the same value as was given via the FLAGS
f argument of AST_RESAMPLE<X>. You may test this value to
* provide additional control over the operation of your
* resampling algorithm. Note that the special flag values
* AST__URESAMP1, 2, 3 & 4 are reserved for you to use for your
* own purposes and will not clash with other pre-defined flag
c values (see astResample<X>).
f values (see AST_RESAMPLE<X>).
c badval
f BADVAL = <Xtype> (Given)
c This will be the same value as was given via the "badval"
c parameter of astResample<X>, and will have the same numerical
c type as the data being processed (i.e. as elements of the
c "in" array). It should be used to test for bad pixels in the
c input grid (but only if the AST__USEBAD flag is set via the
c "flags" parameter) and (unless the AST__NOBAD flag is set in
c "flags") for identifying bad output values in
c the "out" (and "out_var") array(s).
f This will be the same value as was given for the BADVAL
f argument of AST_RESAMPLE<X>, and will have the same numerical
f type as the data being processed (i.e. as elements of the IN
f array). It should be used to test for bad pixels in the
f input grid (but only if the AST__USEBAD flag is set via the
f FLAGS argument) and (unless the AST__NOBAD flag is set in
f FLAGS) for identifying bad output values in the OUT (and
f OUT_VAR) array(s).
c out
f OUT( * ) = <Xtype> (Returned)
c Pointer to an array with the same numerical type as the "in"
f An array with the same numerical type as the IN
* array, into which the interpolated data values should be
* returned. Note that details of the storage order and number
* of dimensions of this array are not required, since the
c "offset" array contains all necessary information about where
f OFFSET array contains all necessary information about where
* each returned value should be stored.
*
c In general, not all elements of this array (or the "out_var"
f In general, not all elements of this array (or the OUT_VAR
* array below) may be used in any particular invocation of the
c function. Those which are not used should be returned
f routine. Those which are not used should be returned
* unchanged.
c out_var
f OUT_VAR( * ) = <Xtype> (Returned)
c Pointer to an optional array with the same type and size as
c the "out" array, into which variance estimates for the
c resampled values should be returned. This array will only be
c given if the "in_var" array has also been given.
f An optional array with the same type and size as the OUT
f array, into which variance estimates for the resampled values
f should be returned. This array will only be given if the
f AST__USEVAR flag is set via the FLAGS argument.
*
c If given, it is addressed in exactly the same way (via the
c "offset" array) as the "out" array. The values returned
c should be estimates of the statistical variance of the
c corresponding values in the "out" array, on the assumption
c that all errors in input data values are statistically
c independent and that their variance estimates may simply be
c summed (with appropriate weighting factors).
f If given, it is addressed in exactly the same way (via the
f OFFSET array) as the OUT array. The values returned should be
f estimates of the statistical variance of the corresponding
f values in the OUT array, on the assumption that all errors in
f input data values are statistically independent and that
f their variance estimates may simply be summed (with
f appropriate weighting factors).
*
c If no output variance estimates are required, a NULL pointer
c will be given.
f If the AST__USEVAR flag is not set, then variance values are
f not being processed. In this case, this array may be a dummy
f (e.g. one-element) array and should not be used.
c nbad
f NBAD = INTEGER (Returned)
c Pointer to an int in which to return the number of interpolation
c points at
f This should return the number of interpolation points at
* which no valid interpolated value could be obtained. The maximum
c value that should be returned is "npoint", and the minimum is
f value that should be returned is NPOINT, and the minimum is
* zero (indicating that all output values were successfully
* obtained).
f STATUS = INTEGER (Given and Returned)
f The global status.
* Notes:
* - The data type <Xtype> indicates the numerical type of the data
c being processed, as for astResample<X>.
f being processed, as for AST_RESAMPLE<X>.
c - This function will typically be invoked more than once for each
c invocation of astResample<X>.
f - This routine will typically be invoked more than once for each
f invocation of AST_RESAMPLE<X>.
c - If an error occurs within this function, it should use
c astSetStatus to set the AST error status to an error value.
c This will cause an immediate return from astResample<X>. The error
c value AST__UINER is available for this purpose, but other values may
c also be used (e.g. if you wish to distinguish different types of
c error).
f - If an error occurs within this routine, it should set the
f STATUS argument to an error value before returning. This will
f cause an immediate return from AST_RESAMPLE<X>. The error value
f AST__UINER is available for this purpose, but other values may also
f be used (e.g. if you wish to distinguish different types of error).
f The AST__UINER error value is defined in the AST_ERR include file.
*--
*/
/* Note the above is just a description to act as a template. The
function does not actually exist. */
/*
*++
* Name:
c astUkern1
f AST_UKERN1
* Purpose:
* 1-dimensional sub-pixel interpolation kernel.
* Type:
* Fictitious function.
* Synopsis:
c #include "mapping.h"
c void astUkern1( double offset, const double params[], int flags,
c double *value )
f CALL AST_UKERN1( OFFSET, PARAMS, FLAGS, VALUE, STATUS )
* Class Membership:
* Mapping member function.
* Description:
c This is a fictitious function which does not actually
c exist. Instead, this description constitutes a template so that
c you may implement a function with this interface for yourself
c (and give it any name you wish). A pointer to such a function
c may be passed via the "finterp" parameter of the astResample<X>
c functions (q.v.) in order to supply a 1-dimensional
c interpolation kernel to the algorithm which performs sub-pixel
c interpolation during resampling of gridded data (you must also
c set the "interp" parameter of astResample<X> to the value
c AST__UKERN1). This allows you to use your own interpolation
c kernel in addition to those which are pre-defined.
f This is a fictitious routine which does not actually
f exist. Instead, this description constitutes a template so that
f you may implement a routine with this interface for yourself
f (and give it any name you wish). Such a routine
f may be passed via the FINTERP argument of the AST_RESAMPLE<X>
f functions (q.v.) in order to supply a 1-dimensional
f interpolation kernel to the algorithm which performs sub-pixel
f interpolation during resampling of gridded data (you must also
f set the INTERP argument of AST_RESAMPLE<X> to the value
f AST__UKERN1). This allows you to use your own interpolation
f kernel in addition to those which are pre-defined.
*
c The function calculates the value of a 1-dimensional sub-pixel
f The routine calculates the value of a 1-dimensional sub-pixel
* interpolation kernel. This determines how the weight given to
* neighbouring pixels in calculating an interpolated value depends
* on the pixel's offset from the interpolation point. In more than
* one dimension, the weight assigned to a pixel is formed by
* evaluating this 1-dimensional kernel using the offset along each
* dimension in turn. The product of the returned values is then
* used as the pixel weight.
* Parameters:
c offset
f OFFSET = DOUBLE PRECISION (Given)
* This will be the offset of the pixel from the interpolation
* point, measured in pixels. This value may be positive or
* negative, but for most practical interpolation schemes its
* sign should be ignored.
c params
f PARAMS( * ) = DOUBLE PRECISION (Given)
c This will be a pointer to the same array as was given via the
c "params" parameter of astResample<X>. You may use this to
f This will be the same array as was given via the
f PARAMS argument of AST_RESAMPLE<X>. You may use this to
* pass any additional parameter values required by your kernel,
c but note that "params[0]" will already have been used to specify
f but note that PARAMS(1) will already have been used to specify
* the number of neighbouring pixels which contribute to the
* interpolated value.
c flags
f FLAGS = INTEGER (Given)
c This will be the same value as was given via the "flags"
c parameter of astResample<X>. You may test this value to
f This will be the same value as was given via the FLAGS
f argument of AST_RESAMPLE<X>. You may test this value to
* provide additional control over the operation of your
c function. Note that the special flag values AST__URESAMP1, 2,
f routine. Note that the special flag values AST__URESAMP1, 2,
* 3 & 4 are reserved for you to use for your own purposes and
* will not clash with other pre-defined flag
c values (see astResample<X>).
f values (see AST_RESAMPLE<X>).
c value
f VALUE = DOUBLE PRECISION (Returned)
c Pointer to a double to receive the calculated kernel value,
f The calculated kernel value,
* which may be positive or negative.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Notes:
* - Not all functions make good interpolation kernels. In general,
* acceptable kernels tend to be symmetrical about zero, to have a
* positive peak (usually unity) at zero, and to evaluate to zero
* whenever the pixel offset has any other integral value (this
* ensures that the interpolated values pass through the original
* data). An interpolation kernel may or may not have regions with
* negative values. You should consult a good book on image
* processing for more details.
c - If an error occurs within this function, it should use
c astSetStatus to set the AST error status to an error value.
c This will cause an immediate return from astResample<X>. The error
c value AST__UK1ER is available for this purpose, but other values may
c also be used (e.g. if you wish to distinguish different types of
c error).
f - If an error occurs within this routine, it should set the
f STATUS argument to an error value before returning. This will
f cause an immediate return from AST_RESAMPLE<X>. The error value
f AST__UK1ER is available for this purpose, but other values may also
f be used (e.g. if you wish to distinguish different types of error).
f The AST__UK1ER error value is defined in the AST_ERR include file.
*--
*/
/* Note the above is just a description to act as a template. The
function does not actually exist. */
static double UphillSimplex( const MapData *mapdata, double acc, int maxcall,
const double dx[], double xmax[], double *err,
int *ncall, int *status ) {
/*
* Name:
* UphillSimplex
* Purpose:
* Find a function maximum using a modification of the simplex method.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* double UphillSimplex( const MapData *mapdata, double acc, int maxcall,
* const double dx[], double xmax[], double *err,
* int *ncall, int *status );
* Class Membership:
* Mapping member function.
* Description:
* This function applies a modification of the simplex method to
* find a local maximum in the value returned by a Mapping
* function. The modification used allows the method to cope with
* coordinate constraints and (equivalently) regions where the
* function returns "bad" values. The method is robust and not
* susceptible to overflow, so is suitable for applying to Mapping
* functions of unknown form.
* Parameters:
* mapdata
* Pointer to a MapData structure which describes the Mapping
* function, its coordinate constraints, etc.
* acc
* The accuracy required in the value of the maximum.
* maxcall
* The maximum number of Mapping function evaluations to use.
* dx
* Pointer to an array of double containing an offset along each
* input coordinate for the Mapping function supplied. These
* offsets will be used to construct the initial simplex
* (i.e. they are the initial "step lengths" for each
* coordinate) and may be positive or negative.
* xmax
* Pointer to an array of double which contains the coordinates
* of an initial estimate of the location of the maximum. On
* exit, this will be updated to contain the best estimate of
* the location of the maximum as generated by this function.
* err
* Pointer to a double in which to return an estimate of the
* error in the value of the maximum found. For normal
* convergence, this should be no larger than "acc". However, if
* the maximum number of Mapping function evaluations is
* reached, the returned value may be larger than this, although
* it should still be valid. In such cases, re-starting the
* algorithm at the new location returned in "xmax" may be
* advisable.
* ncall
* Pointer to an int in which the number of Mapping function
* evaluations will be returned.
* status
* Pointer to the inherited status variable.
* Returned Value:
* An estimate of the Mapping function value at the local maximum.
* Notes:
* - The function may return before the requested accuracy has been
* met and before all Mapping function evaluations have been
* made. This signifies that an excessive number of function values
* have been needed outside the coordinate constraints. This is
* only likely if the function is unable to make progress near such
* a constraint, in which case the algorithm should probably be
* re-started.
* - A value of AST__BAD will be returned if no maximum could be
* found. This means that all the Mapping function evaluations
* performed returned a value of AST__BAD.
* - A value of AST__BAD will also be returned and no useful
* information about a solution will be produced if this routine is
* invoked with the global error status set, or if it should fail
* for any reason.
*/
/* Local Constants: */
const double factor = 3.0; /* Simplex contraction/expansion factor */
/* Local Variables: */
double *f; /* Pointer to array of function values */
double *x; /* Pointer to array of vertex coordinates */
double *xnew; /* Pointer to workspace array */
double fnew; /* New function value */
double fsave; /* Saved function value */
double offset; /* Coordinate difference between vertices */
double range; /* Range of simplex values */
double result; /* Value to return */
double tmp; /* Temporary store for coordinate */
int coord; /* Loop counter for coordinates */
int hi; /* Index of best vertex */
int lo; /* Index of worst vertex */
int ncalla; /* Number of function calls attempted */
int ncoord; /* Number of function dimensions */
int nextlo; /* Index of second worst vertex */
int nvertex; /* Number of simplex vertices */
int vertex; /* Loop counter for vertices */
/* Initialise. */
result = AST__BAD;
/* Check the global error status. */
if ( !astOK ) return result;
/* Further initialisation. */
*err = DBL_MAX;
*ncall = 0;
/* Obtain the number of input coordinates for the Mapping function and
calculate the number of simplex vertices. */
ncoord = mapdata->nin;
nvertex = ncoord + 1;
/* Allocate workspace. */
f = astMalloc( sizeof( double ) * (size_t) nvertex );
x = astMalloc( sizeof( double ) * (size_t) ( ncoord * nvertex ) );
xnew = astMalloc( sizeof( double ) * (size_t) ncoord );
if ( astOK ) {
/* Loop to set up an initial simplex. */
for ( vertex = 0; vertex < nvertex; vertex++ ) {
for ( coord = 0; coord < ncoord; coord++ ) {
tmp = xmax[ coord ];
/* Displace each point (except the first) the required amount along
one of the axes to generate the coordinates of the simplex
vertices. */
if ( coord == ( vertex - 1 ) ) tmp += dx[ coord ];
x[ vertex * ncoord + coord ] = tmp;
}
/* Evaluate the Mapping function at each vertex. */
f[ vertex ] = MapFunction( mapdata, &x[ vertex * ncoord ], ncall, status );
if ( f[ vertex ] == AST__BAD ) f[ vertex ] = -DBL_MAX;
}
/* Initialise the number of times we attempt to call the Mapping
function (not necessarily the same as the number of times it was
actually called, which is stored in *ncall). */
ncalla = nvertex;
/* Loop until convergence is reached or an error occurs. */
while( astOK ) {
/* Initialise the index of the lowest vertex of the simplex, the next
lowest vertex and the highest vertex. */
lo = ( f[ 0 ] < f[ 1 ] ) ? 0 : 1;
nextlo = 1 - lo;
hi = 0;
/* Loop to inspect each vertex and update these values. Ensure that in
the case of equal vertices, the first one is taken to be the
highest. This makes the maximisation stable (so that if no better
maximum can be found, the original position is returned rather than
a nearby position that yields the same function value). */
for ( vertex = 0; vertex < nvertex; vertex++ ) {
if ( f[ vertex ] <= f[ lo ] ) {
nextlo = lo;
lo = vertex;
} else if ( ( f[ vertex ] <= f[ nextlo ] ) && ( vertex != lo ) ) {
nextlo = vertex;
}
if ( f[ vertex ] > f[ hi ] ) hi = vertex;
}
/* Estimate the error on the result as the difference between the
highest and lowest simplex vertices. */
if ( ( f[ hi ] == -DBL_MAX ) || ( f[ lo ] == -DBL_MAX ) ) {
range = DBL_MAX;
} else {
range = f[ hi ] - f[ lo ];
}
/* Test for convergence. Ideally, the accuracy criterion should have
been met. However, also quit if the maximum number of Mapping
function evaluations has been reached, or the number of points at
which function values have been requested reaches three times this
limit (this latter number will typically be larger because points
lying outside the coordinate constraints do not result in the
Mapping function being evaluated). */
if ( range <= fabs( acc ) ||
( *ncall >= maxcall ) || ( ncalla >= ( 3 * maxcall ) ) ) {
/* If quitting, return the coordinates and function value at the best
simplex vertex, and the error estimate. */
for ( coord = 0; coord < ncoord; coord++ ) {
xmax[ coord ] = x[ hi * ncoord + coord ];
}
result = ( f[ hi ] == -DBL_MAX ) ? AST__BAD : f[ hi ];
*err = range;
break;
}
/* If performing another iteration, first try reflecting the worst
vertex through the opposite face of the simplex. Check for
errors. */
fnew = NewVertex( mapdata, lo, -1.0, x, f, ncall, xnew, status );
ncalla++;
if ( astOK ) {
/* If this results in a point lying in a forbiddden region (either
outside the coordinate constraints or where the Mapping function
yields bad coordinate values), then we must make a departure from
the standard simplex algorithm. This is because the inability to
make forward progress in this case can cause the simplex to
repeatedly contract about each face (except one) in turn. This
mechanism normally results in lateral contraction as the simplex
attempts to squeeze through a narrow gap which is impeding
progress. However, in this case there is no gap to get through, so
the lateral contraction can eventually make the simplex become
degenerate (due to rounding). This prevents it from expanding
laterally again and exploring the region adjacent to the constraint
boundary once it has become small enough. */
if ( fnew == AST__BAD ) {
/* To overcome this, we instead contract the worst simplex vertex
towards the best vertex (this has the cumulative effect of
contracting the simplex without changing its shape). First find the
offset in each coordinate between these two vertices. */
for ( coord = 0; coord < ncoord; coord++ ) {
offset = x[ lo * ncoord + coord ] - x[ hi * ncoord + coord ];
/* Scale the offset to obtain the new coordinate. */
x[ lo * ncoord + coord ] = x[ hi * ncoord + coord ] +
offset / factor;
/* If the distance between the two vertices has not decreased, we are
in a region where rounding errors prevent them approaching each
other any more closely, so simply set them equal. */
if ( fabs( x[ lo * ncoord + coord ] -
x[ hi * ncoord + coord ] ) >= fabs( offset ) ) {
x[ lo * ncoord + coord ] = x[ hi * ncoord + coord ];
}
}
/* Evaluate the Mapping function at the new vertex. */
f[ lo ] = MapFunction( mapdata, &x[ lo * ncoord ], ncall, status );
if ( f[ lo ] == AST__BAD ) f[ lo ] = -DBL_MAX;
ncalla++;
/* We now return to the standard simplex algorithm. If the new vertex
is a new maximum, then see if more of the same is even better by
trying to expand the best vertex away from the opposite face. */
} else if ( fnew >= f[ hi ] ) {
fnew = NewVertex( mapdata, lo, factor, x, f, ncall, xnew, status );
ncalla++;
/* Otherwise, if the new vertex was no improvement on the second
worst, then try contracting the worst vertex towards the opposite
face. */
} else if ( fnew <= f[ nextlo ] ) {
fsave = f[ lo ];
fnew = NewVertex( mapdata, lo, 1.0 / factor, x, f, ncall, xnew, status );
ncalla++;
/* If this didn't result in any improvement, then contract the entire
simplex towards the best vertex. Use the same approach as earlier
to protect against rounding so that all the simplex vertices will
eventually coalesce if this process is repeated enough times. */
if ( astOK && ( fnew <= fsave ) ) {
for ( vertex = 0; vertex < nvertex; vertex++ ) {
if ( vertex != hi ) {
for ( coord = 0; coord < ncoord; coord++ ) {
offset = x[ vertex * ncoord + coord ] -
x[ hi * ncoord + coord ];
x[ vertex * ncoord + coord ] =
x[ hi * ncoord + coord ] + offset / factor;
if ( fabs( x[ vertex * ncoord + coord ] -
x[ hi * ncoord + coord ] ) >=
fabs( offset ) ) {
x[ vertex * ncoord + coord ] =
x[ hi * ncoord + coord ];
}
}
/* Evaluate the Mapping function at each new vertex. */
f[ vertex ] = MapFunction( mapdata,
&x[ vertex * ncoord ],
ncall, status );
if ( f[ vertex ] == AST__BAD ) f[ vertex ] = -DBL_MAX;
ncalla++;
}
}
}
}
}
}
}
/* Free workspace. */
f = astFree( f );
x = astFree( x );
xnew = astFree( xnew );
/* If an error occurred, clear the returned result. */
if ( !astOK ) result = AST__BAD;
/* Return the result. */
return result;
}
static void ValidateMapping( AstMapping *this, int forward,
int npoint, int ncoord_in, int ncoord_out,
const char *method, int *status ) {
/*
* Name:
* ValidateMapping
* Purpose:
* Validate a Mapping for use to transform coordinates.
* Type:
* Private function.
* Synopsis:
* #include "mapping.h"
* void ValidateMapping( AstMapping *this, int forward,
* int npoint, int ncoord_in, int ncoord_out,
* const char *method, int *status )
* Class Membership:
* Mapping member function.
* Description:
* This function checks that a Mapping is suitable for transforming
* a set of points. It also checks that the number of points and
* the number of coordinate values per point is valid. If an error
* is detected, the global error status is set and an error report
* made. Otherwise, the function returns without further action.
* Parameters:
* this
* Pointer to the Mapping.
* forward
* A non-zero value indicates that the forward coordinate
* transformation is to be checked, while a zero value requests
* the inverse transformation.
* npoint
* The number of points being transformed.
* ncoord_in
* The number of coordinates associated with each input point.
* ncoord_out
* The number of coordinates associated with each output point.
* method
* Pointer to a null terminated character string containing the
* name of the method which invoked this function to validate a
* Mapping. This is used solely for constructing error messages.
* status
* Pointer to the inherited status variable.
*/
/* Local Variables: */
int nin; /* Mapping Nin attribute value */
int nout; /* Mapping Nout attribute value */
/* Check the global error status. */
if ( !astOK ) return;
/* Report an error if the requested transformation is not defined. */
if ( !( forward ? astGetTranForward( this ) : astGetTranInverse( this ) )
&& astOK ) {
astError( AST__TRNND, "%s(%s): %s coordinate transformation "
"is not defined by the %s supplied.", status, method,
astGetClass( this ),
( forward ? "A forward" : "An inverse" ),
astGetClass( this ) );
}
/* Obtain the effective values of the Nin and Nout attributes for the
Mapping. */
nin = forward ? astGetNin( this ) : astGetNout( this );
nout = forward ? astGetNout( this ) : astGetNin( this );
/* If OK, check that the number of input coordinates matches the
number required by the Mapping. Report an error if these numbers do
not match. */
if ( astOK && ( ncoord_in != nin ) ) {
astError( AST__NCPIN, "%s(%s): Bad number of input coordinate values "
"(%d).", status, method, astGetClass( this ), ncoord_in );
astError( AST__NCPIN, "The %s given requires %d coordinate value%s for "
"each input point.", status, astGetClass( this ), nin,
( nin == 1 ) ? "" : "s" );
}
/* If OK, also check that the number of output coordinates matches the
number required by the Mapping. Report an error if these numbers do
not match. */
if ( astOK && ( ncoord_out != nout ) ) {
astError( AST__NCPIN, "%s(%s): Bad number of output coordinate values "
"(%d).", status, method, astGetClass( this ), ncoord_out );
astError( AST__NCPIN, "The %s given generates %s%d coordinate value%s "
"for each output point.", status, astGetClass( this ),
( nout < ncoord_out ) ? "only " : "", nout,
( nout == 1 ) ? "" : "s" );
}
/* Check that the number of points being transformed is not negative
and report an error if necessary. */
if ( astOK && ( npoint < 0 ) ) {
astError( AST__NPTIN, "%s(%s): Number of points to be transformed (%d) "
"is invalid.", status, method, astGetClass( this ), npoint );
}
}
/* Functions which access class attributes. */
/* ---------------------------------------- */
/* Implement member functions to access the attributes associated with
this class using the macros defined for this purpose in the
"object.h" file. */
/*
*att++
* Name:
* Invert
* Purpose:
* Mapping inversion flag.
* Type:
* Public attribute.
* Synopsis:
* Integer (boolean).
* Description:
* This attribute controls which one of a Mapping's two possible
* coordinate transformations is considered the "forward"
* transformation (the other being the "inverse"
* transformation). If the attribute value is zero (the default),
* the Mapping's behaviour will be the same as when it was first
* created. However, if it is non-zero, its two transformations
* will be inter-changed, so that the Mapping displays the inverse
* of its original behaviour.
*
* Inverting the boolean sense of the Invert attribute will cause
* the values of a Mapping's Nin and Nout attributes to be
* interchanged. The values of its TranForward and TranInverse
* attributes will also be interchanged. This operation may be
c performed with the astInvert function.
f performed with the AST_INVERT routine.
* Applicability:
* Mapping
* All Mappings have this attribute.
* UnitMap
* The value of the Invert attribute has no effect on the
* behaviour of a UnitMap.
* FrameSet
* Inverting the boolean sense of the Invert attribute for a
* FrameSet will cause its base and current Frames (and its Base
* and Current attributes) to be interchanged. This, in turn,
* may affect other properties and attributes of the FrameSet
* (such as Nin, Nout, Naxes, TranForward, TranInverse,
* etc.). The Invert attribute of a FrameSet is not itself
* affected by selecting a new base or current Frame.
*att--
*/
/* This ia a boolean value (0 or 1) with a value of CHAR_MAX when
undefined but yielding a default of zero. */
astMAKE_CLEAR(Mapping,Invert,invert,CHAR_MAX)
astMAKE_GET(Mapping,Invert,int,0,( ( this->invert == CHAR_MAX ) ?
0 : this->invert ))
astMAKE_SET(Mapping,Invert,int,invert,( (this->flags&=~AST__ISSIMPLE_FLAG),(value!=0) ))
astMAKE_TEST(Mapping,Invert,( this->invert != CHAR_MAX ))
/*
*att++
* Name:
* IsLinear
* Purpose:
* Is the Mapping linear?
* Type:
* Public attribute.
* Synopsis:
* Integer (boolean), read-only.
* Description:
* This attribute indicates whether a Mapping is an instance of a
* class that always represents a linear transformation. Note, some
* Mapping classes can represent linear or non-linear transformations
* (the MathMap class for instance). Such classes have a zero value for
* the IsLinear attribute. Specific instances of such classes can be
* tested for linearity using the
* astLinearApprox function.
* AST_LINEARAPPROX routine.
* Applicability:
* Mapping
* All Mappings have this attribute.
* CmpMap
* The IsLinear value for a CmpMap is determined by the classes
* of the encapsulated Mappings. For instance, a CmpMap that combines
* a ZoomMap and a ShiftMap will have a non-zero value for its IsLinear
* attribute, but a CmpMap that contains a MathMap will have a
* value of zero for its IsLinear attribute.
* Frame
* The IsLinear value for a Frame is 1 (since a Frame is equivalent
* to a UnitMap).
* FrameSet
* The IsLinear value for a FrameSet is obtained from the Mapping
* from the base Frame to the current Frame.
*att--
*/
/*
*att++
* Name:
* IsSimple
* Purpose:
* Has the Mapping been simplified?
* Type:
* Public attribute.
* Synopsis:
* Integer (boolean), read-only.
* Description:
* This attribute indicates whether a Mapping has been simplified
* by the
c astSimplify
f AST_SIMPLIFY
* method. If the IsSimple value is non-zero, then the Mapping has
* been simplified and so there is nothing to be gained by simplifying
* it again. Indeed, the
c astSimplify
f AST_SIMPLIFY
* method will immediately return the Mapping unchanged if the IsSimple
* attribute indicates that the Mapping has already been simplified.
* Applicability:
* Mapping
* All Mappings have this attribute.
* Frame
* All classes of Frame return zero for the IsSimple attribute.
* This is because changes can be made to a Frame which affect the
* Mapping represented by the Frame, and so there can be no
* guarantee that the Mapping may not need re-simplifying. Most
* non-Frame Mappings, on the other hand, are immutable and so when
* they are simplified it is certain that they weill remain in a
* simple state.
*att--
*/
astMAKE_GET(Mapping,IsSimple,int,0,((this->flags)&AST__ISSIMPLE_FLAG))
/*
*att++
* Name:
* Nin
* Purpose:
* Number of input coordinates for a Mapping.
* Type:
* Public attribute.
* Synopsis:
* Integer, read-only.
* Description:
* This attribute gives the number of coordinate values required to
* specify an input point for a Mapping (i.e. the number of
* dimensions of the space in which the Mapping's input points
* reside).
* Applicability:
* Mapping
* All Mappings have this attribute.
* CmpMap
* If a CmpMap's component Mappings are joined in series, then
* its Nin attribute is equal to the Nin attribute of the first
* component (or to the Nout attribute of the second component
* if the the CmpMap's Invert attribute is non-zero).
*
* If a CmpMap's component Mappings are joined in parallel, then
* its Nin attribute is given by the sum of the Nin attributes
* of each component (or to the sum of their Nout attributes if
* the CmpMap's Invert attribute is non-zero).
* Frame
* The Nin attribute for a Frame is always equal to the number
* of Frame axes (Naxes attribute).
* FrameSet
* The Nin attribute of a FrameSet is equal to the number of
* axes (Naxes attribute) of its base Frame (as specified by the
* FrameSet's Base attribute). The Nin attribute value may
* therefore change if a new base Frame is selected.
*att--
*/
/*
*att++
* Name:
* Nout
* Purpose:
* Number of output coordinates for a Mapping.
* Type:
* Public attribute.
* Synopsis:
* Integer, read-only.
* Description:
* This attribute gives the number of coordinate values generated
* by a Mapping to specify each output point (i.e. the number of
* dimensions of the space in which the Mapping's output points
* reside).
* Applicability:
* Mapping
* All Mappings have this attribute.
* CmpMap
* If a CmpMap's component Mappings are joined in series, then
* its Nout attribute is equal to the Nout attribute of the
* second component (or to the Nin attribute of the first
* component if the the CmpMap's Invert attribute is non-zero).
*
* If a CmpMap's component Mappings are joined in parallel, then
* its Nout attribute is given by the sum of the Nout attributes
* of each component (or to the sum of their Nin attributes if
* the CmpMap's Invert attribute is non-zero).
* Frame
* The Nout attribute for a Frame is always equal to the number
* of Frame axes (Naxes attribute).
* FrameSet
* The Nout attribute of a FrameSet is equal to the number of
* FrameSet axes (Naxes attribute) which, in turn, is equal to
* the Naxes attribute of the FrameSet's current Frame (as
* specified by the Current attribute). The Nout attribute value
* may therefore change if a new current Frame is selected.
*att--
*/
/*
*att++
* Name:
* Report
* Purpose:
* Report transformed coordinates?
* Type:
* Public attribute.
* Synopsis:
* Integer (boolean).
* Description:
* This attribute controls whether coordinate values are reported
* whenever a Mapping is used to transform a set of points. If its
* value is zero (the default), no report is made. However, if it
* is non-zero, the coordinates of each point are reported (both
* before and after transformation) by writing them to standard
* output.
*
* This attribute is provided as an aid to debugging, and to avoid
* having to report values explicitly in simple programs.
* Applicability:
* Mapping
* All Mappings have this attribute.
* CmpMap
* When applied to a compound Mapping (CmpMap), only the Report
* attribute of the CmpMap, and not those of its component
* Mappings, is used. Coordinate information is never reported
* for the component Mappings individually, only for the
* complete CmpMap.
* Frame
* When applied to any Frame, the formatting capabilities of the
c Frame (as provided by the astFormat function) will be used to
f Frame (as provided by the AST_FORMAT function) will be used to
* format the reported coordinates.
* FrameSet
* When applied to any FrameSet, the formatting capabilities of
* the base and current Frames will be used (as above) to
* individually format the input and output coordinates, as
* appropriate. The Report attribute of a FrameSet is not itself
* affected by selecting a new base or current Frame, but the
* resulting formatting capabilities may be.
* Notes:
* - Unlike most other attributes, the value of the Report
* attribute is not transferred when a Mapping is copied. Instead,
* its value is undefined (and therefore defaults to zero) in any
* copy. Similarly, it becomes undefined in any external
c representation of a Mapping produced by the astWrite function.
f representation of a Mapping produced by the AST_WRITE routine.
*att--
*/
/* This ia a boolean value (0 or 1) with a value of CHAR_MAX when
undefined but yielding a default of zero. */
astMAKE_CLEAR(Mapping,Report,report,CHAR_MAX)
astMAKE_GET(Mapping,Report,int,0,( ( this->report == CHAR_MAX ) ?
0 : this->report ))
astMAKE_SET(Mapping,Report,int,report,( value != 0 ))
astMAKE_TEST(Mapping,Report,( this->report != CHAR_MAX ))
/*
*att++
* Name:
* TranForward
* Purpose:
* Forward transformation defined?
* Type:
* Public attribute.
* Synopsis:
* Integer (boolean), read-only.
* Description:
* This attribute indicates whether a Mapping is able to transform
* coordinates in the "forward" direction (i.e. converting input
* coordinates into output coordinates). If this attribute is
* non-zero, the forward transformation is available. Otherwise, it
* is not.
* Applicability:
* Mapping
* All Mappings have this attribute.
* CmpMap
* The TranForward attribute value for a CmpMap is given by the
* boolean AND of the value for each component Mapping.
* FrameSet
* The TranForward attribute of a FrameSet applies to the
* transformation which converts between the FrameSet's base
* Frame and its current Frame (as specified by the Base and
* Current attributes). This value is given by the boolean AND
* of the TranForward values which apply to each of the
* individual sub-Mappings required to perform this conversion.
* The TranForward attribute value for a FrameSet may therefore
* change if a new Base or Current Frame is selected.
* Notes:
* - An error will result if a Mapping with a TranForward value of
* zero is used to transform coordinates in the forward direction.
*att--
*/
/*
*att++
* Name:
* TranInverse
* Purpose:
* Inverse transformation defined?
* Type:
* Public attribute.
* Synopsis:
* Integer (boolean), readonly.
* Description:
* This attribute indicates whether a Mapping is able to transform
* coordinates in the "inverse" direction (i.e. converting output
* coordinates back into input coordinates). If this attribute is
* non-zero, the inverse transformation is available. Otherwise, it
* is not.
* Applicability:
* Mapping
* All Mappings have this attribute.
* CmpMap
* The TranInverse attribute value for a CmpMap is given by the
* boolean AND of the value for each component Mapping.
* FrameSet
* The TranInverse attribute of a FrameSet applies to the
* transformation which converts between the FrameSet's current
* Frame and its base Frame (as specified by the Current and
* Base attributes). This value is given by the boolean AND of
* the TranInverse values which apply to each of the individual
* sub-Mappings required to perform this conversion.
* The TranInverse attribute value for a FrameSet may therefore
* change if a new Base or Current Frame is selected.
* Notes:
* - An error will result if a Mapping with a TranInverse value of
* zero is used to transform coordinates in the inverse direction.
*att--
*/
/* Copy constructor. */
/* ----------------- */
static void Copy( const AstObject *objin, AstObject *objout, int *status ) {
/*
* Name:
* Copy
* Purpose:
* Copy constructor for Mapping objects.
* Type:
* Private function.
* Synopsis:
* void Copy( const AstObject *objin, AstObject *objout, int *status )
* Description:
* This function implements the copy constructor for Mapping objects.
* Parameters:
* objin
* Pointer to the Mapping to be copied.
* objout
* Pointer to the Mapping being constructed.
* status
* Pointer to the inherited status variable.
* Notes:
* - This constructor exists simply to ensure that the "Report"
* attribute is cleared in any copy made of a Mapping.
*/
/* Local Variables: */
AstMapping *out; /* Pointer to output Mapping */
/* Check the global error status. */
if ( !astOK ) return;
/* Obtain a pointer to the output Mapping. */
out = (AstMapping *) objout;
/* Clear the output Report attribute. */
out->report = CHAR_MAX;
}
/* Destructor. */
/* ----------- */
static void Delete( AstObject *obj, int *status ) {
/*
* Name:
* Delete
* Purpose:
* Destructor for Mapping objects.
* Type:
* Private function.
* Synopsis:
* void Delete( AstObject *obj, int *status )
* Description:
* This function implements the destructor for Mapping objects.
* Parameters:
* obj
* Pointer to the Mapping to be deleted.
* status
* Pointer to the inherited status variable.
* Notes:
* - This destructor does nothing and exists only to maintain a
* one-to-one correspondence between destructors and copy
* constructors.
*/
/* Return without action. */
}
/* Dump function. */
/* -------------- */
static void Dump( AstObject *this_object, AstChannel *channel, int *status ) {
/*
* Name:
* Dump
* Purpose:
* Dump function for Mapping objects.
* Type:
* Private function.
* Synopsis:
* void Dump( AstObject *this, AstChannel *channel, int *status )
* Description:
* This function implements the Dump function which writes out data
* for the Mapping class to an output Channel.
* Parameters:
* this
* Pointer to the Mapping whose data are being written.
* channel
* Pointer to the Channel to which the data are being written.
* status
* Pointer to the inherited status variable.
*/
/* Local Variables: */
AstMapping *this; /* Pointer to the Mapping structure */
int invert; /* Mapping inverted? */
int ival; /* Integer value */
int set; /* Attribute value set? */
/* Check the global error status. */
if ( !astOK ) return;
/* Obtain a pointer to the Mapping structure. */
this = (AstMapping *) this_object;
/* Write out values representing the instance variables for the
Mapping class. Accompany these with appropriate comment strings,
possibly depending on the values being written.*/
/* In the case of attributes, we first use the appropriate (private)
Test... member function to see if they are set. If so, we then use
the (private) Get... function to obtain the value to be written
out.
For attributes which are not set, we use the astGet... method to
obtain the value instead. This will supply a default value
(possibly provided by a derived class which over-rides this method)
which is more useful to a human reader as it corresponds to the
actual default attribute value. Since "set" will be zero, these
values are for information only and will not be read back. */
/* Determine if the Mapping is inverted. The output values
(e.g. number of input and output coordinates) will refer to the
Mapping ***before*** this inversion flag is applied, but we need it
when using (e.g.) the astGetNin/astGetNout methods to determine
which one will return the required value. */
invert = astGetInvert( this );
/* (NB. there is a subtle point here that dictates the extent to which
this inversion flag can be used... All use of methods (such as
astGetInvert, which might be over-ridden by derived classes) must
be restricted to determining the values of "unset" output
quantities only (below). This is because when re-loading the
Mapping, the derived classes will not have been loaded at the point
when these values are re-read - hence any value whose
interpretation depends on these methods cannot be reliably
recovered.) */
/* Nin. */
/* ---- */
/* Use the instance variable directly to avoid the effect of the
Invert attribute on the private member function. Treat zero as the
default. */
set = ( this->nin != 0 );
ival = set ? this->nin : ( !invert ? astGetNin( this ) :
astGetNout( this ) );
astWriteInt( channel, "Nin", set, 0, ival,
"Number of input coordinates" );
/* Nout. */
/* ----- */
/* Use the instance variable directly. Treat zero as the default. */
set = ( this->nout != this->nin );
ival = set ? this->nout : ( !invert ? astGetNout( this ) :
astGetNin( this ) );
astWriteInt( channel, "Nout", set, 0, ival,
"Number of output coordinates" );
/* IsSimple. */
/* --------- */
ival = astGetIsSimple( this );
astWriteInt( channel, "IsSimp", ival, 0, ival,
ival ? "Mapping has been simplified" :
"Mapping has not been simplified" );
/* Invert. */
/* ------- */
set = TestInvert( this, status );
ival = set ? GetInvert( this, status ) : astGetInvert( this );
astWriteInt( channel, "Invert", set, 0, ival,
ival ? "Mapping inverted" :
"Mapping not inverted" );
/* TranForward. */
/* ------------ */
/* Use the instance variable directly. Treat 1 as the default. */
set = ( this->tran_forward == 0 );
ival = set ? this->tran_forward : ( !invert ? astGetTranForward( this ) :
astGetTranInverse( this ) );
astWriteInt( channel, "Fwd", set, 0, ival,
ival ? "Forward transformation defined" :
"Forward transformation not defined" );
/* TranInverse. */
/* ------------ */
/* Use the instance variable directly. Treat 1 as the default. */
set = ( this->tran_inverse == 0 );
ival = set ? this->tran_inverse : ( !invert ? astGetTranInverse( this ) :
astGetTranForward( this ) );
astWriteInt( channel, "Inv", set, 0, ival,
ival ? "Inverse transformation defined" :
"Inverse transformation not defined" );
/* Report. */
/* ------- */
set = TestReport( this, status );
ival = set ? GetReport( this, status ) : astGetReport( this );
astWriteInt( channel, "Report", set, 0, ival,
ival ? "Report coordinate transformations" :
"Don't report coordinate transformations" );
}
/* Standard class functions. */
/* ========================= */
/* Implement the astIsAMapping and astCheckMapping functions using the macros
defined for this purpose in the "object.h" header file. */
astMAKE_ISA(Mapping,Object)
astMAKE_CHECK(Mapping)
AstMapping *astInitMapping_( void *mem, size_t size, int init,
AstMappingVtab *vtab, const char *name,
int nin, int nout,
int tran_forward, int tran_inverse, int *status ) {
/*
*+
* Name:
* astInitMapping
* Purpose:
* Initialise a Mapping.
* Type:
* Protected function.
* Synopsis:
* #include "mapping.h"
* AstMapping *astInitMapping( void *mem, size_t size, int init,
* AstMappingVtab *vtab, const char *name,
* int nin, int nout,
* int tran_forward, int tran_inverse )
* Class Membership:
* Mapping initialiser.
* Description:
* This function is provided for use by class implementations to initialise
* a new Mapping object. It allocates memory (if necessary) to accommodate
* the Mapping plus any additional data associated with the derived class.
* It then initialises a Mapping structure at the start of this memory. If
* the "init" flag is set, it also initialises the contents of a virtual
* function table for a Mapping at the start of the memory passed via the
* "vtab" parameter.
* Parameters:
* mem
* A pointer to the memory in which the Mapping is to be initialised.
* This must be of sufficient size to accommodate the Mapping data
* (sizeof(Mapping)) plus any data used by the derived class. If a value
* of NULL is given, this function will allocate the memory itself using
* the "size" parameter to determine its size.
* size
* The amount of memory used by the Mapping (plus derived class data).
* This will be used to allocate memory if a value of NULL is given for
* the "mem" parameter. This value is also stored in the Mapping
* structure, so a valid value must be supplied even if not required for
* allocating memory.
* init
* A logical flag indicating if the Mapping's virtual function table is
* to be initialised. If this value is non-zero, the virtual function
* table will be initialised by this function.
* vtab
* Pointer to the start of the virtual function table to be associated
* with the new Mapping.
* name
* Pointer to a constant null-terminated character string which contains
* the name of the class to which the new object belongs (it is this
* pointer value that will subsequently be returned by the astGetClass
* method).
* nin
* The number of coordinate values per input point.
* nout
* The number of coordinate vales per output point.
* tran_forward
* A non-zero value indicates that the Mapping will be able to
* transform coordinates in the forward direction. A zero value
* indicates that it will not.
* tran_inverse
* A non-zero value indicates that the Mapping will be able to
* transform coordinates in the inverse direction. A zero value
* indicates that it will not.
* Returned Value:
* A pointer to the new Mapping.
* Notes:
* - The Mappings produced by this function implement all the basic methods
* defined by the Mapping class. However, their astTransform method does not
* actually perform any coordinate transformation (although it performs all
* necessary argument validation and creates an output PointSet if
* necessary, leaving its coordinate values undefined).
* - This means that Mappings produced by this function are of limited use
* on their own, but may easily be extended by a derived class simply by
* over-riding the astTransform method to add the necessary coordinate
* arithmetic.
* - A null pointer will be returned if this function is invoked with the
* global error status set, or if it should fail for any reason.
*-
*/
/* Local Variables: */
AstMapping *new; /* Pointer to new Mapping */
/* Check the global status. */
if ( !astOK ) return NULL;
/* If necessary, initialise the virtual function table. */
if ( init ) astInitMappingVtab( vtab, name );
/* Initialise. */
new = NULL;
/* Check the initialisation values for validity, reporting an error if
necessary. */
if ( nin < 0 ) {
astError( AST__BADNI, "astInitMapping(%s): Bad number of input "
"coordinates (%d).", status, name, nin );
astError( AST__BADNI, "This number should be zero or more." , status);
} else if ( nout < 0 ) {
astError( AST__BADNO, "astInitMapping(%s): Bad number of output "
"coordinates (%d).", status, name, nout );
astError( AST__BADNI, "This number should be zero or more." , status);
}
/* Initialise an Object structure (the parent class) as the first component
within the Mapping structure, allocating memory if necessary. */
new = (AstMapping *) astInitObject( mem, size, 0,
(AstObjectVtab *) vtab, name );
if ( astOK ) {
/* Initialise the Mapping data. */
/* ---------------------------- */
/* Store the numbers of input and output coordinates. */
new->nin = nin;
new->nout = nout;
/* Store the flags indicating which coordinate transformations are
defined (constrain these values to 0 or 1). */
new->tran_forward = ( tran_forward != 0 );
new->tran_inverse = ( tran_inverse != 0 );
/* Initialise other attributes to their undefined values. */
new->invert = CHAR_MAX;
new->report = CHAR_MAX;
new->flags = 0;
/* If an error occurred, clean up by deleting the new object. */
if ( !astOK ) new = astDelete( new );
}
/* Return a pointer to the new object. */
return new;
}
AstMapping *astLoadMapping_( void *mem, size_t size,
AstMappingVtab *vtab, const char *name,
AstChannel *channel, int *status ) {
/*
*+
* Name:
* astLoadMapping
* Purpose:
* Load a Mapping.
* Type:
* Protected function.
* Synopsis:
* #include "mapping.h"
* AstMapping *astLoadMapping( void *mem, size_t size,
* AstMappingVtab *vtab, const char *name,
* AstChannel *channel )
* Class Membership:
* Mapping loader.
* Description:
* This function is provided to load a new Mapping using data read
* from a Channel. It first loads the data used by the parent class
* (which allocates memory if necessary) and then initialises a
* Mapping structure in this memory, using data read from the input
* Channel.
*
* If the "init" flag is set, it also initialises the contents of a
* virtual function table for a Mapping at the start of the memory
* passed via the "vtab" parameter.
* Parameters:
* mem
* A pointer to the memory into which the Mapping is to be
* loaded. This must be of sufficient size to accommodate the
* Mapping data (sizeof(Mapping)) plus any data used by derived
* classes. If a value of NULL is given, this function will
* allocate the memory itself using the "size" parameter to
* determine its size.
* size
* The amount of memory used by the Mapping (plus derived class
* data). This will be used to allocate memory if a value of
* NULL is given for the "mem" parameter. This value is also
* stored in the Mapping structure, so a valid value must be
* supplied even if not required for allocating memory.
*
* If the "vtab" parameter is NULL, the "size" value is ignored
* and sizeof(AstMapping) is used instead.
* vtab
* Pointer to the start of the virtual function table to be
* associated with the new Mapping. If this is NULL, a pointer
* to the (static) virtual function table for the Mapping class
* is used instead.
* name
* Pointer to a constant null-terminated character string which
* contains the name of the class to which the new object
* belongs (it is this pointer value that will subsequently be
* returned by the astGetClass method).
*
* If the "vtab" parameter is NULL, the "name" value is ignored
* and a pointer to the string "Mapping" is used instead.
* Returned Value:
* A pointer to the new Mapping.
* Notes:
* - A null pointer will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*-
*/
/* Local Variables: */
astDECLARE_GLOBALS /* Pointer to thread-specific global data */
AstMapping *new; /* Pointer to the new Mapping */
/* Initialise. */
new = NULL;
/* Check the global error status. */
if ( !astOK ) return new;
/* Get a pointer to the thread specific global data structure. */
astGET_GLOBALS(channel);
/* If a NULL virtual function table has been supplied, then this is
the first loader to be invoked for this Mapping. In this case the
Mapping belongs to this class, so supply appropriate values to be
passed to the parent class loader (and its parent, etc.). */
if ( !vtab ) {
size = sizeof( AstMapping );
vtab = &class_vtab;
name = "Mapping";
/* If required, initialise the virtual function table for this class. */
if ( !class_init ) {
astInitMappingVtab( vtab, name );
class_init = 1;
}
}
/* Invoke the parent class loader to load data for all the ancestral
classes of the current one, returning a pointer to the resulting
partly-built Mapping. */
new = astLoadObject( mem, size, (AstObjectVtab *) vtab, name,
channel );
if ( astOK ) {
/* Read input data. */
/* ================ */
/* Request the input Channel to read all the input data appropriate to
this class into the internal "values list". */
astReadClassData( channel, "Mapping" );
/* Now read each individual data item from this list and use it to
initialise the appropriate instance variable(s) for this class. */
/* In the case of attributes, we first read the "raw" input value,
supplying the "unset" value as the default. If a "set" value is
obtained, we then use the appropriate (private) Set... member
function to validate and set the value properly. */
/* Initialise bitwise flags to zero. */
new->flags = 0;
/* Nin. */
/* ---- */
new->nin = astReadInt( channel, "nin", 0 );
if ( new->nin < 0 ) new->nin = 0;
/* Nout. */
/* ----- */
new->nout = astReadInt( channel, "nout", new->nin );
if ( new->nout < 0 ) new->nout = 0;
/* Invert. */
/* ------- */
new->invert = astReadInt( channel, "invert", CHAR_MAX );
if ( TestInvert( new, status ) ) SetInvert( new, new->invert, status );
/* IsSimple. */
/* --------- */
if( astReadInt( channel, "issimp", 0 ) ) new->flags |= AST__ISSIMPLE_FLAG;
/* TranForward. */
/* ------------ */
new->tran_forward = ( astReadInt( channel, "fwd", 1 ) != 0 );
/* TranInverse. */
/* ------------ */
new->tran_inverse = ( astReadInt( channel, "inv", 1 ) != 0 );
/* Report. */
/* ------- */
new->report = astReadInt( channel, "report", CHAR_MAX );
if ( TestReport( new, status ) ) SetReport( new, new->report, status );
/* If an error occurred, clean up by deleting the new Mapping. */
if ( !astOK ) new = astDelete( new );
}
/* Return the new Mapping pointer. */
return new;
}
/* Virtual function interfaces. */
/* ============================ */
/* These provide the external interface to the virtual functions
defined by this class. Each simply checks the global error status
and then locates and executes the appropriate member function,
using the function pointer stored in the object's virtual function
table (this pointer is located using the astMEMBER macro defined in
"object.h").
Note that the member function may not be the one defined here, as
it may have been over-ridden by a derived class. However, it should
still have the same interface. */
void astDecompose_( AstMapping *this, AstMapping **map1, AstMapping **map2,
int *series, int *invert1, int *invert2, int *status ) {
if ( !astOK ) return;
(**astMEMBER(this,Mapping,Decompose))( this, map1, map2, series, invert1, invert2, status );
}
int astGetNin_( AstMapping *this, int *status ) {
if ( !astOK ) return 0;
return (**astMEMBER(this,Mapping,GetNin))( this, status );
}
int astGetNout_( AstMapping *this, int *status ) {
if ( !astOK ) return 0;
return (**astMEMBER(this,Mapping,GetNout))( this, status );
}
int astGetIsLinear_( AstMapping *this, int *status ) {
if ( !astOK ) return 0;
return (**astMEMBER(this,Mapping,GetIsLinear))( this, status );
}
int astGetTranForward_( AstMapping *this, int *status ) {
if ( !astOK ) return 0;
return (**astMEMBER(this,Mapping,GetTranForward))( this, status );
}
int astGetTranInverse_( AstMapping *this, int *status ) {
if ( !astOK ) return 0;
return (**astMEMBER(this,Mapping,GetTranInverse))( this, status );
}
void astInvert_( AstMapping *this, int *status ) {
if ( !astOK ) return;
(**astMEMBER(this,Mapping,Invert))( this, status );
}
void astMapBox_( AstMapping *this,
const double lbnd_in[], const double ubnd_in[], int forward,
int coord_out, double *lbnd_out, double *ubnd_out,
double xl[], double xu[], int *status ) {
if ( !astOK ) return;
(**astMEMBER(this,Mapping,MapBox))( this, lbnd_in, ubnd_in, forward,
coord_out, lbnd_out, ubnd_out, xl, xu, status );
}
int astMapList_( AstMapping *this, int series, int invert, int *nmap,
AstMapping ***map_list, int **invert_list, int *status ) {
if ( !astOK ) return 0;
return (**astMEMBER(this,Mapping,MapList))( this, series, invert,
nmap, map_list, invert_list, status );
}
int *astMapSplit_( AstMapping *this, int nin, const int *in, AstMapping **map,
int *status ){
int *result = NULL;
AstMapping *tmap;
if( map ) *map = NULL;
if ( !astOK ) return NULL;
result = (**astMEMBER(this,Mapping,MapSplit))( this, nin, in, &tmap, status );
if( tmap ) {
*map = astCopy( tmap );
tmap = astAnnul( tmap );
}
return result;
}
int astMapMerge_( AstMapping *this, int where, int series, int *nmap,
AstMapping ***map_list, int **invert_list, int *status ) {
if ( !astOK || astDoNotSimplify( this ) ) return -1;
return (**astMEMBER(this,Mapping,MapMerge))( this, where, series, nmap,
map_list, invert_list, status );
}
int astDoNotSimplify_( AstMapping *this, int *status ) {
if ( !astOK ) return 0;
return (**astMEMBER(this,Mapping,DoNotSimplify))( this, status );
}
void astReportPoints_( AstMapping *this, int forward,
AstPointSet *in_points, AstPointSet *out_points, int *status ) {
if ( !astOK ) return;
(**astMEMBER(this,Mapping,ReportPoints))( this, forward,
in_points, out_points, status );
}
#define MAKE_RESAMPLE_(X,Xtype) \
int astResample##X##_( AstMapping *this, int ndim_in, const int *lbnd_in, \
const int *ubnd_in, const Xtype *in, \
const Xtype *in_var, int interp, \
void (* finterp)( void ), const double *params, \
int flags, double tol, int maxpix, Xtype badval, \
int ndim_out, \
const int *lbnd_out, const int *ubnd_out, \
const int *lbnd, const int *ubnd, Xtype *out, \
Xtype *out_var, int *status ) { \
if ( !astOK ) return 0; \
return (**astMEMBER(this,Mapping,Resample##X))( this, ndim_in, lbnd_in, \
ubnd_in, in, in_var, \
interp, finterp, params, \
flags, tol, maxpix, \
badval, ndim_out, \
lbnd_out, ubnd_out, \
lbnd, ubnd, \
out, out_var, status ); \
}
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_RESAMPLE_(LD,long double)
#endif
MAKE_RESAMPLE_(D,double)
MAKE_RESAMPLE_(F,float)
MAKE_RESAMPLE_(L,long int)
MAKE_RESAMPLE_(UL,unsigned long int)
MAKE_RESAMPLE_(I,int)
MAKE_RESAMPLE_(UI,unsigned int)
MAKE_RESAMPLE_(K,INT_BIG)
MAKE_RESAMPLE_(UK,UINT_BIG)
MAKE_RESAMPLE_(S,short int)
MAKE_RESAMPLE_(US,unsigned short int)
MAKE_RESAMPLE_(B,signed char)
MAKE_RESAMPLE_(UB,unsigned char)
#undef MAKE_RESAMPLE_
#define MAKE_REBIN_(X,Xtype) \
void astRebin##X##_( AstMapping *this, double wlim, int ndim_in, const int *lbnd_in, \
const int *ubnd_in, const Xtype *in, \
const Xtype *in_var, int interp, \
const double *params, \
int flags, double tol, int maxpix, Xtype badval, \
int ndim_out, \
const int *lbnd_out, const int *ubnd_out, \
const int *lbnd, const int *ubnd, Xtype *out, \
Xtype *out_var, int *status ) { \
if ( !astOK ) return; \
(**astMEMBER(this,Mapping,Rebin##X))( this, wlim, ndim_in, lbnd_in, \
ubnd_in, in, in_var, \
interp, params, \
flags, tol, maxpix, \
badval, ndim_out, \
lbnd_out, ubnd_out, \
lbnd, ubnd, \
out, out_var, status ); \
}
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_REBIN_(LD,long double)
#endif
MAKE_REBIN_(D,double)
MAKE_REBIN_(F,float)
MAKE_REBIN_(I,int)
MAKE_REBIN_(B,signed char)
MAKE_REBIN_(UB,unsigned char)
#undef MAKE_REBIN_
#define MAKE_REBINSEQ_(X,Xtype) \
void astRebinSeq##X##_( AstMapping *this, double wlim, int ndim_in, const int *lbnd_in, \
const int *ubnd_in, const Xtype *in, \
const Xtype *in_var, int interp, \
const double *params, \
int flags, double tol, int maxpix, Xtype badval, \
int ndim_out, \
const int *lbnd_out, const int *ubnd_out, \
const int *lbnd, const int *ubnd, Xtype *out, \
Xtype *out_var, double *weights, int64_t *nused, \
int *status ) { \
if ( !astOK ) return; \
(**astMEMBER(this,Mapping,RebinSeq##X))( this, wlim, ndim_in, lbnd_in, \
ubnd_in, in, in_var, \
interp, params, \
flags, tol, maxpix, \
badval, ndim_out, \
lbnd_out, ubnd_out, \
lbnd, ubnd, out, out_var, \
weights, nused, status ); \
}
#if HAVE_LONG_DOUBLE /* Not normally implemented */
MAKE_REBINSEQ_(LD,long double)
#endif
MAKE_REBINSEQ_(D,double)
MAKE_REBINSEQ_(F,float)
MAKE_REBINSEQ_(I,int)
MAKE_REBINSEQ_(B,signed char)
MAKE_REBINSEQ_(UB,unsigned char)
#undef MAKE_REBINSEQ_
double astRate_( AstMapping *this, double *at, int ax1, int ax2, int *status ){
astDECLARE_GLOBALS
if ( !astOK ) return AST__BAD;
astGET_GLOBALS(this);
if( ax1 < 0 || ax1 >= astGetNout( this ) ) {
astError( AST__AXIIN, "astRate(%s): Invalid output index (%d) "
"specified - should be in the range 1 to %d.", status,
astGetClass( this ), ax1 + 1, astGetNout( this ) );
} else if( ax2 < 0 || ax2 >= astGetNin( this ) ) {
astError( AST__AXIIN, "astRate(%s): Invalid input index (%d) "
"specified - should be in the range 1 to %d.", status,
astGetClass( this ), ax2 + 1, astGetNin( this ) );
}
if( rate_disabled ) {
return ( at[ ax2 ] != AST__BAD ) ? 1.0 : AST__BAD;
} else {
return (**astMEMBER(this,Mapping,Rate))( this, at, ax1, ax2, status );
}
}
AstMapping *astRemoveRegions_( AstMapping *this, int *status ) {
if ( !astOK ) return NULL;
return (**astMEMBER(this,Mapping,RemoveRegions))( this, status );
}
AstMapping *astSimplify_( AstMapping *this, int *status ) {
AstMapping *result;
if ( !astOK ) return NULL;
if( !astGetIsSimple( this ) && !astDoNotSimplify( this ) ) {
result = (**astMEMBER(this,Mapping,Simplify))( this, status );
if( result ) result->flags |= AST__ISSIMPLE_FLAG; /* Indicate simplification has been done */
} else {
result = astClone( this );
}
return result;
}
AstPointSet *astTransform_( AstMapping *this, AstPointSet *in,
int forward, AstPointSet *out, int *status ) {
AstPointSet *result;
if ( !astOK ) return NULL;
result = (**astMEMBER(this,Mapping,Transform))( this, in, forward, out, status );
(void) astReplaceNaN( result );
return result;
}
void astTran1_( AstMapping *this, int npoint, const double xin[],
int forward, double xout[], int *status ) {
if ( !astOK ) return;
(**astMEMBER(this,Mapping,Tran1))( this, npoint, xin, forward, xout, status );
}
void astTran2_( AstMapping *this,
int npoint, const double xin[], const double yin[],
int forward, double xout[], double yout[], int *status ) {
if ( !astOK ) return;
(**astMEMBER(this,Mapping,Tran2))( this, npoint, xin, yin,
forward, xout, yout, status );
}
void astTranGrid_( AstMapping *this, int ncoord_in, const int lbnd[],
const int ubnd[], double tol, int maxpix, int forward,
int ncoord_out, int outdim, double *out, int *status ) {
if ( !astOK ) return;
(**astMEMBER(this,Mapping,TranGrid))( this, ncoord_in, lbnd, ubnd, tol,
maxpix, forward, ncoord_out, outdim,
out, status );
}
void astTranN_( AstMapping *this, int npoint,
int ncoord_in, int indim, const double *in,
int forward, int ncoord_out, int outdim, double *out, int *status ) {
if ( !astOK ) return;
(**astMEMBER(this,Mapping,TranN))( this, npoint,
ncoord_in, indim, in,
forward, ncoord_out, outdim, out, status );
}
void astTranP_( AstMapping *this, int npoint,
int ncoord_in, const double *ptr_in[],
int forward, int ncoord_out, double *ptr_out[], int *status ) {
if ( !astOK ) return;
(**astMEMBER(this,Mapping,TranP))( this, npoint,
ncoord_in, ptr_in,
forward, ncoord_out, ptr_out, status );
}
int astLinearApprox_( AstMapping *this, const double *lbnd,
const double *ubnd, double tol, double *fit, int *status ){
if ( !astOK ) return 0;
return (**astMEMBER(this,Mapping,LinearApprox))( this, lbnd, ubnd, tol, fit, status );
}
int astQuadApprox_( AstMapping *this, const double lbnd[2],
const double ubnd[2], int nx, int ny, double *fit,
double *rms, int *status ){
if ( !astOK ) return 0;
return (**astMEMBER(this,Mapping,QuadApprox))( this, lbnd, ubnd, nx,
ny, fit, rms, status );
}
/* Public Interface Function Prototypes. */
/* ------------------------------------- */
/* The following functions have public prototypes only (i.e. no
protected prototypes), so we must provide local prototypes for use
within this module. */
void DecomposeId_( AstMapping *, AstMapping **, AstMapping **, int *, int *, int *, int * );
void MapBoxId_( AstMapping *, const double [], const double [], int, int, double *, double *, double [], double [], int * );
double astRateId_( AstMapping *, double *, int, int, int * );
void astMapSplitId_( AstMapping *, int, const int *, int *, AstMapping **,
int * );
/* Special interface function implementations. */
/* ------------------------------------------- */
void astDecomposeId_( AstMapping *this, AstMapping **map1,
AstMapping **map2, int *series, int *invert1,
int *invert2, int *status ) {
/*
*++
* Name:
c astDecompose
f AST_DECOMPOSE
* Purpose:
* Decompose a Mapping into two component Mappings.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astDecompose( AstMapping *this, AstMapping **map1,
c AstMapping **map2, int *series, int *invert1,
c int *invert2 )
f CALL AST_DECOMPOSE( THIS, MAP1, MAP2, SERIES, INVERT1, INVERT2, STATUS )
* Class Membership:
* Mapping method.
* Description:
c This function returns pointers to two Mappings which, when applied
f This routine returns pointers to two Mappings which, when applied
* either in series or parallel, are equivalent to the supplied Mapping.
*
* Since the Frame class inherits from the Mapping class, Frames can
* be considered as special types of Mappings and so this method can
* be used to decompose either CmpMaps or CmpFrames.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping.
c map1
f MAP1 = INTEGER (Returned)
c Address of a location to receive a pointer to first component
f A pointer to first component
* Mapping.
c map2
f MAP2 = INTEGER (Returned)
c Address of a location to receive a pointer to second component
f A pointer to second component
* Mapping.
c series
f SERIES = LOGICAL (Returned)
c Address of a location to receive a value indicating if the
c component Mappings are applied in series or parallel. A non-zero
c value means that the supplied Mapping is equivalent to applying map1
c followed by map2 in series. A zero value means that the supplied
c Mapping is equivalent to applying map1 to the lower numbered axes
c and map2 to the higher numbered axes, in parallel.
f Indicates if the
f component Mappings are applied in series or parallel. A .TRUE.
f value means that the supplied Mapping is equivalent to applying MAP1
f followed by MAP2 in series. A zero value means that the supplied
f Mapping is equivalent to applying MAP1 to the lower numbered axes
f and MAP2 to the higher numbered axes, in parallel.
c invert1
f INVERT1 = INTEGER (Returned)
c The value of the Invert attribute to be used with map1.
f The value of the Invert attribute to be used with MAP1.
c invert2
f INVERT2 = INTEGER (Returned)
c The value of the Invert attribute to be used with map2.
f The value of the Invert attribute to be used with MAP2.
* Applicability:
* CmpMap
c If the supplied Mapping is a CmpMap, then map1 and map2 will be
f If the supplied Mapping is a CmpMap, then MAP1 and MAP2 will be
* returned holding pointers to the component Mappings used to
* create the CmpMap, either in series or parallel. Note, changing
* the Invert attribute of either of the component Mappings using
* the returned pointers will have no effect on the supplied CmpMap.
* This is because the CmpMap remembers and uses the original settings
* of the Invert attributes (that is, the values of the Invert
* attributes when the CmpMap was first created). These are the
c Invert values which are returned in invert1 and invert2.
f Invert values which are returned in INVERT1 and INVERT2.
* TranMap
c If the supplied Mapping is a TranMap, then map1 and map2 will be
f If the supplied Mapping is a TranMap, then MAP1 and MAP2 will be
* returned holding pointers to the forward and inverse Mappings
* represented by the TranMap (zero will be returned for
c series).
f SERIES).
* Note, changing the Invert attribute of
* either of the component Mappings using the returned pointers will
* have no effect on the supplied TranMap. This is because the TranMap
* remembers and uses the original settings of the Invert attributes
* (that is, the values of the Invert attributes when the TranMap was
* first created). These are the
c Invert values which are returned in invert1 and invert2.
f Invert values which are returned in INVERT1 and INVERT2.
* Mapping
c For any class of Mapping other than a CmpMap, map1 will be
c returned holding a clone of the supplied Mapping pointer, and map2
c will be returned holding a NULL pointer. Invert1 will be returned
c holding the current value of the Invert attribute for the supplied
c Mapping, and invert2 will be returned holding zero.
f For any class of Mapping other than a CmpMap, MAP1 will be
f returned holding a clone of the supplied Mapping pointer, and MAP2
f will be returned holding AST__NULL. INVERT1 will be returned
f holding the current value of the Invert attribute for the supplied
f Mapping, and INVERT2 will be returned holding zero.
* CmpFrame
c If the supplied Mapping is a CmpFrame, then map1 and map2 will be
f If the supplied Mapping is a CmpFrame, then MAP1 and MAP2 will be
* returned holding pointers to the component Frames used to
* create the CmpFrame. The component Frames are considered to be in
* applied in parallel.
* Frame
c For any class of Frame other than a CmpFrame, map1 will be
c returned holding a clone of the supplied Frame pointer, and map2
c will be returned holding a NULL pointer.
f For any class of Frame other than a CmpFrame, MAP1 will be
f returned holding a clone of the supplied Frame pointer, and MAP2
f will be returned holding AST__NULL.
* Notes:
* - The returned Invert values should be used in preference to the
* current values of the Invert attribute in map1 and map2. This is
* because the attributes may have changed value since the Mappings
* were combined.
* - Any changes made to the component Mappings using the returned
* pointers will be reflected in the supplied Mapping.
*--
* Implementation Notes:
* This function implements the public interface for the
* astDecompose method. It is identical to astDecompose_ except for
* the following:
*
* - ID values are returned via the "map1" and "map2" parameters
* instead of true C pointers. This is required because this
* conversion cannot be performed by the macro that invokes the
* function.
*/
/* Check the global error status. */
if ( !astOK ) return;
/* Invoke the normal astDecompose_ function to decompose the Mapping. */
astDecompose( this, map1, map2, series, invert1, invert2 );
/* If required, return ID values for the component Mappings. */
if ( map1 ) *map1 = astMakeId( *map1 );
if ( map2 ) *map2 = astMakeId( *map2 );
}
void astMapBoxId_( AstMapping *this,
const double lbnd_in[], const double ubnd_in[],
int forward, int coord_out,
double *lbnd_out, double *ubnd_out,
double xl[], double xu[], int *status ) {
/*
*++
* Name:
c astMapBox
f AST_MAPBOX
* Purpose:
* Find a bounding box for a Mapping.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astMapBox( AstMapping *this,
c const double lbnd_in[], const double ubnd_in[],
c int forward, int coord_out,
c double *lbnd_out, double *ubnd_out,
c double xl[], double xu[] );
f CALL AST_MAPBOX( THIS, LBND_IN, UBND_IN, FORWARD, COORD_OUT,
f LBND_OUT, UBND_OUT, XL, XU, STATUS )
* Class Membership:
* Mapping method.
* Description:
c This function allows you to find the "bounding box" which just
c encloses another box after it has been transformed by a Mapping
c (using either its forward or inverse transformation). A typical
c use might be to calculate the size of an image after being
c transformed by a Mapping.
f This routine allows you to find the "bounding box" which just
f encloses another box after it has been transformed by a Mapping
f (using either its forward or inverse transformation). A typical
f use might be to calculate the size of an image after being
f transformed by a Mapping.
*
c The function works on one dimension at a time. When supplied
c with the lower and upper bounds of a rectangular region (box) of
c input coordinate space, it finds the lowest and highest values
c taken by a nominated output coordinate within that
c region. Optionally, it also returns the input coordinates where
c these bounding values are attained. It should be used repeatedly
c to obtain the extent of the bounding box in more than one
c dimension.
f The routine works on one dimension at a time. When supplied with
f the lower and upper bounds of a rectangular region (box) of
f input coordinate space, it finds the lowest and highest values
f taken by a nominated output coordinate within that region. It
f also returns the input coordinates where these bounding values
f are attained. It should be used repeatedly to obtain the extent
f of the bounding box in more than one dimension.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping.
c lbnd_in
f LBND_IN( * ) = DOUBLE PRECISION (Given)
c Pointer to an array of double, with one element for each
c Mapping input coordinate. This should contain the lower bound
c of the input box in each input dimension.
f An array with one element for each Mapping input
f coordinate. This should contain the lower bound of the input
f box in each input dimension.
c ubnd_in
f UBND_IN( * ) = DOUBLE PRECISION (Given)
c Pointer to an array of double, with one element for each
c Mapping input coordinate. This should contain the upper bound
c of the input box in each input dimension.
f An array with one element for each Mapping input
f coordinate. This should contain the upper bound of the input
f box in each input dimension.
*
* Note that it is permissible for the upper bound to be less
* than the corresponding lower bound, as the values will simply
* be swapped before use.
c forward
f FORWARD = LOGICAL (Given)
c If this value is non-zero, then the Mapping's forward
c transformation will be used to transform the input
c box. Otherwise, its inverse transformation will be used.
f If this value is .TRUE., then the Mapping's forward
f transformation will be used to transform the input
f box. Otherwise, its inverse transformation will be used.
*
c (If the inverse transformation is selected, then references
c to "input" and "output" coordinates in this description
c should be transposed. For example, the size of the "lbnd_in"
c and "ubnd_in" arrays should match the number of output
c coordinates, as given by the Mapping's Nout
c attribute. Similarly, the "coord_out" parameter, below,
c should nominate one of the Mapping's input coordinates.)
f (If the inverse transformation is selected, then references
f to "input" and "output" coordinates in this description
f should be transposed. For example, the size of the LBND_IN
f and UBND_IN arrays should match the number of output
f coordinates, as given by the Mapping's Nout attribute.
f Similarly, the COORD_OUT argument, below, should nominate one
f of the Mapping's input coordinates.)
c coord_out
f COORD_OUT = INTEGER (Given)
* The index of the output coordinate for which the lower and
* upper bounds are required. This value should be at least one,
* and no larger than the number of Mapping output coordinates.
c lbnd_out
f LBND_OUT = DOUBLE PRECISION (Returned)
c Pointer to a double in which to return the lowest value taken
c by the nominated output coordinate within the specified
c region of input coordinate space.
f The lowest value taken by the nominated output coordinate
f within the specified region of input coordinate space.
c ubnd_out
f UBND_OUT = DOUBLE PRECISION (Returned)
c Pointer to a double in which to return the highest value
c taken by the nominated output coordinate within the specified
c region of input coordinate space.
f The highest value taken by the nominated output coordinate
f within the specified region of input coordinate space.
c xl
f XL( * ) = DOUBLE PRECISION (Returned)
c An optional pointer to an array of double, with one element
c for each Mapping input coordinate. If given, this array will
c be filled with the coordinates of an input point (although
c not necessarily a unique one) for which the nominated output
c coordinate attains the lower bound value returned in
c "*lbnd_out".
c
c If these coordinates are not required, a NULL pointer may be
c supplied.
f An array with one element for each Mapping input
f coordinate. This will return the coordinates of an input
f point (although not necessarily a unique one) for which the
f nominated output coordinate attains the lower bound value
f returned in LBND_OUT.
c xu
f XU( * ) = DOUBLE PRECISION (Returned)
c An optional pointer to an array of double, with one element
c for each Mapping input coordinate. If given, this array will
c be filled with the coordinates of an input point (although
c not necessarily a unique one) for which the nominated output
c coordinate attains the upper bound value returned in
c "*ubnd_out".
c
c If these coordinates are not required, a NULL pointer may be
c supplied.
f An array with one element for each Mapping input
f coordinate. This will return the coordinates of an input
f point (although not necessarily a unique one) for which the
f nominated output coordinate attains the upper bound value
f returned in UBND_OUT.
f STATUS = INTEGER (Given and Returned)
f The global status.
* Notes:
* - Any input points which are transformed by the Mapping to give
* output coordinates containing the value AST__BAD are regarded as
* invalid and are ignored. They will make no contribution to
* determining the output bounds, even although the nominated
* output coordinate might still have a valid value at such points.
c - An error will occur if the required output bounds cannot be
c found. Typically, this might happen if all the input points
c which the function considers turn out to be invalid (see
c above). The number of points considered before generating such
c an error is quite large, so this is unlikely to occur by
c accident unless valid points are restricted to a very small
c subset of the input coordinate space.
f - An error will occur if the required output bounds cannot be
f found. Typically, this might happen if all the input points
f which the routine considers turn out to be invalid (see
f above). The number of points considered before generating such
f an error is quite large, so this is unlikely to occur by
f accident unless valid points are restricted to a very small
f subset of the input coordinate space.
c - The values returned via "lbnd_out", "ubnd_out", "xl" and "xu"
c will be set to the value AST__BAD if this function should fail
c for any reason. Their initial values on entry will not be
c altered if the function is invoked with the AST error status
c set.
f - The values returned via LBND_OUT, UBND_OUT, XL and XU will be
f set to the value AST__BAD if this routine should fail for any
f reason. Their initial values on entry will not be altered if the
f routine is invoked with STATUS set to an error value.
*--
* Implementation Notes:
* This function implements the public interface for the astMapBox
* method. It is identical to astMapBox_ except that the nominated
* output coordinate given in "coord_out" is decremented by one
* before use. This is to allow the public interface to use
* one-based coordinate numbering (internally, zero-based
* coordinate numbering is used).
*/
/* Check the global error status. */
if ( !astOK ) return;
/* Invoke the protected version of this function with the "coord_out"
value decremented. */
astMapBox( this, lbnd_in, ubnd_in, forward, coord_out - 1,
lbnd_out, ubnd_out, xl, xu );
}
double astRateId_( AstMapping *this, double *at, int ax1, int ax2, int *status ){
/*
*++
* Name:
c astRate
f AST_RATE
* Purpose:
* Calculate the rate of change of a Mapping output.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c double astRate( AstMapping *this, double *at, int ax1, int ax2 )
f RESULT = AST_RATE( THIS, AT, AX1, AX2, STATUS )
* Class Membership:
* Mapping method.
* Description:
c This function
f This routine
* evaluates the rate of change of a specified output of the supplied
* Mapping with respect to a specified input, at a specified input
* position.
*
* The result is estimated by interpolating the function using a
* fourth order polynomial in the neighbourhood of the specified
* position. The size of the neighbourhood used is chosen to minimise
* the RMS residual per unit length between the interpolating
* polynomial and the supplied Mapping function. This method produces
* good accuracy but can involve evaluating the Mapping 100 or more
* times.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping to be applied.
c at
f AT( * ) = DOUBLE PRECISION (Given)
c The address of an
f An
* array holding the axis values at the position at which the rate
* of change is to be evaluated. The number of elements in this
* array should equal the number of inputs to the Mapping.
c ax1
f AX1 = INTEGER (Given)
* The index of the Mapping output for which the rate of change is to
* be found (output numbering starts at 1 for the first output).
c ax2
f AX2 = INTEGER (Given)
* The index of the Mapping input which is to be varied in order to
* find the rate of change (input numbering starts at 1 for the first
* input).
f STATUS = INTEGER (Given and Returned)
f The global status.
* Returned Value:
c astRate()
f AST_RATE = DOUBLE PRECISION
c The rate of change of Mapping output "ax1" with respect to input
c "ax2", evaluated at "at", or AST__BAD if the value cannot be
c calculated.
f The rate of change of Mapping output AX1 with respect to input
f AX2, evaluated at AT, or AST__BAD if the value cannot be
f calculated.
* Notes:
* - A value of AST__BAD will be returned if this function is invoked
* with the global error status set, or if it should fail for any
* reason.
*--
* Implementation Notes:
* This function implements the public interface for the astRate
* method. It is identical to astRate_ except that the nominated
* coordinates given in "ax1" and "ax2" are decremented by one
* before use. This is to allow the public interface to use
* one-based coordinate numbering (internally, zero-based
* coordinate numbering is used).
*/
/* Check the global error status. */
if ( !astOK ) return AST__BAD;
/* Invoke the protected version of this function with the axis indices
decremented. */
return astRate( this, at, ax1 - 1, ax2 - 1 );
}
void astMapSplitId_( AstMapping *this, int nin, const int *in, int *out,
AstMapping **map, int *status ){
/*
*++
* Name:
c astMapSplit
f AST_MAPSPLIT
* Purpose:
* Split a Mapping up into parallel component Mappings.
* Type:
* Public virtual function.
* Synopsis:
c #include "mapping.h"
c void astMapSplit( AstMapping *this, int nin, const int *in, int *out,
c AstMapping **map )
f CALL AST_MAPSPLIT( THIS, NIN, IN, OUT, MAP, STATUS )
* Class Membership:
* Mapping method.
* Description:
c This function
f This routine
* creates a new Mapping which connects specified inputs within a
* supplied Mapping to the corresponding outputs of the supplied Mapping.
* This is only possible if the specified inputs correspond to some
* subset of the Mapping outputs. That is, there must exist a subset of
* the Mapping outputs for which each output depends only on the selected
* Mapping inputs, and not on any of the inputs which have not been
* selected. Also, any output which is not in this subset must not depend
* on any of the selected inputs. If these conditions are not met by the
* supplied Mapping, then
c a NULL
f an AST__NULL
* Mapping pointer is returned.
* Parameters:
c this
f THIS = INTEGER (Given)
* Pointer to the Mapping to be split.
c nin
f NIN = INTEGER (Given)
c The number of inputs to pick from "this".
f The number of inputs to pick from THIS.
c in
f IN( NIN ) = INTEGER (Given)
c Pointer to an
f An
* array holding the indices within the supplied Mapping of the inputs
* which are to be picked from the Mapping.
c This array should have "nin" elements.
* If "Nin" is the number of inputs of the supplied Mapping, then each
* element should have a value in the range 1 to Nin.
c out
f OUT( * ) = INTEGER (Returned)
c Pointer to an
f An
* array in which to return the indices of the outputs of the supplied
* Mapping which are fed by the picked inputs. A value of one is
* used to refer to the first Mapping output. The supplied array should
* have a length at least equal to the number of outputs in the
* supplied Mapping. The number of values stored in the array on
* exit will equal the number of outputs in the returned Mapping.
* The i'th element in the returned array holds the index within
* the supplied Mapping which corresponds to the i'th output of
* the returned Mapping.
c map
f MAP = INTEGER (Returned)
c Address of a location at which to return a pointer to the
f The
* returned Mapping. This Mapping will have
c "nin" inputs (the number of outputs may be different to "nin"). NULL
f NIN inputs (the number of outputs may be different to NIN). AST__NULL
* is returned if the supplied Mapping has no subset of outputs which
* depend only on the selected inputs. The returned Mapping is a
* deep copy of the required parts of the supplied Mapping.
* Notes:
* - If this
c function
f routine
* is invoked with the global error status set, or if it should fail for
* any reason, then
c a NULL value
f AST__NULL
* will be returned for
c the "map" pointer.
f MAP.
*--
* Implementation Notes:
* - This function implements the astMapSplit method available via the
* public interface to the Mapping class and uses 1-based axis indices.
* The protected interface method is provided by the astMapSplit function
* and uses zero-based axis indices. Also, an ID value is returned for
* "map" rather than a pointer.
*/
/* Local Variables: */
int *in_zero; /* Pointer to array of zero-based input indices */
int *result; /* Pointer to array of zero-based output indices*/
int i; /* Axis index */
int nout; /* No of outputs */
/* Initialise */
*map = NULL;
/* Check the global error status. */
if ( !astOK ) return;
/* Decrement the axis indices by 1. */
in_zero = astMalloc( sizeof( int )*(size_t) nin );
if( in_zero ) {
for( i = 0; i < nin; i++ ) in_zero[ i ] = in[ i ] - 1;
/* Invoked the protected astMapSplit functon. */
result = astMapSplit( this, nin, in_zero, map );
/* If succesful, copy the output axes to the supplied array. */
if( result ) {
nout = astGetNout( *map );
for( i = 0; i < nout; i++ ) out[ i ] = result[ i ] + 1;
/* Free resurces. */
result = astFree( result );
}
in_zero = astFree( in_zero );
}
/* Free the returned Mapping if an error has occurred. */
if( !astOK ) *map = astAnnul( *map );
/* Return an ID value for the Mapping. */
*map = astMakeId( *map );
}
|