/usr/lib/petscdir/3.1/include/sieve/ISieve.hh is in libpetsc3.1-dev 3.1.dfsg-11ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 | #ifndef included_ALE_ISieve_hh
#define included_ALE_ISieve_hh
#ifndef included_ALE_hh
#include <ALE.hh>
#endif
#include <fstream>
//#define IMESH_NEW_LABELS
namespace ALE {
template<typename Point>
class OrientedPoint : public std::pair<Point, int> {
public:
OrientedPoint(const int o) : std::pair<Point, int>(o, o) {};
~OrientedPoint() {};
friend std::ostream& operator<<(std::ostream& stream, const OrientedPoint& point) {
stream << "(" << point.first << ", " << point.second << ")";
return stream;
};
};
template<typename Point_, typename Alloc_ = malloc_allocator<Point_> >
class Interval {
public:
typedef Point_ point_type;
typedef Alloc_ alloc_type;
public:
class const_iterator {
protected:
point_type _p;
public:
const_iterator(const point_type p): _p(p) {};
~const_iterator() {};
public:
const_iterator& operator=(const const_iterator& iter) {this->_p = iter._p; return *this;};
bool operator==(const const_iterator& iter) const {return this->_p == iter._p;};
bool operator!=(const const_iterator& iter) const {return this->_p != iter._p;};
const_iterator& operator++() {++this->_p; return *this;}
const_iterator& operator++(int) {
const_iterator tmp(*this);
++(*this);
return tmp;
};
const_iterator& operator--() {--this->_p; return *this;}
const_iterator& operator--(int) {
const_iterator tmp(*this);
--(*this);
return tmp;
};
point_type operator*() const {return this->_p;};
};
protected:
point_type _min, _max;
public:
Interval(): _min(point_type()), _max(point_type()) {};
Interval(const point_type& min, const point_type& max): _min(min), _max(max) {};
Interval(const Interval& interval): _min(interval.min()), _max(interval.max()) {};
template<typename Iterator>
Interval(Iterator& iterator) {
this->_min = *std::min_element(iterator.begin(), iterator.end());
this->_max = (*std::max_element(iterator.begin(), iterator.end()))+1;
}
public:
Interval& operator=(const Interval& interval) {_min = interval.min(); _max = interval.max(); return *this;}
friend std::ostream& operator<<(std::ostream& stream, const Interval& interval) {
stream << "(" << interval.min() << ", " << interval.max() << ")";
return stream;
}
public:
const_iterator begin() const {return const_iterator(this->_min);};
const_iterator end() const {return const_iterator(this->_max);};
size_t size() const {return this->_max - this->_min;};
size_t count(const point_type& p) const {return ((p >= _min) && (p < _max)) ? 1 : 0;};
point_type min() const {return this->_min;};
point_type max() const {return this->_max;};
bool hasPoint(const point_type& point) const {
if (point < this->_min || point >= this->_max) return false;
return true;
};
void checkPoint(const point_type& point) const {
if (point < this->_min || point >= this->_max) {
ostringstream msg;
msg << "Invalid point " << point << " not in " << *this << std::endl;
throw ALE::Exception(msg.str().c_str());
}
};
};
template<typename Source_, typename Target_>
struct SimpleArrow {
typedef Source_ source_type;
typedef Target_ target_type;
const source_type source;
const target_type target;
SimpleArrow(const source_type& s, const target_type& t) : source(s), target(t) {};
template<typename OtherSource_, typename OtherTarget_>
struct rebind {
typedef SimpleArrow<OtherSource_, OtherTarget_> other;
};
struct flip {
typedef SimpleArrow<target_type, source_type> other;
other arrow(const SimpleArrow& a) {return type(a.target, a.source);};
};
friend bool operator<(const SimpleArrow& x, const SimpleArrow& y) {
return ((x.source < y.source) || ((x.source == y.source) && (x.target < y.target)));
};
friend std::ostream& operator<<(std::ostream& os, const SimpleArrow& a) {
os << a.source << " ----> " << a.target;
return os;
}
};
namespace ISieveVisitor {
template<typename Sieve>
class NullVisitor {
public:
inline void visitArrow(const typename Sieve::arrow_type&) {};
inline void visitPoint(const typename Sieve::point_type&) {};
inline void visitArrow(const typename Sieve::arrow_type&, const int orientation) {};
inline void visitPoint(const typename Sieve::point_type&, const int orientation) {};
};
class PrintVisitor {
protected:
ostringstream& os;
const int rank;
public:
PrintVisitor(ostringstream& s, const int rank = 0) : os(s), rank(rank) {};
template<typename Arrow>
inline void visitArrow(const Arrow& arrow) const {
this->os << "["<<this->rank<<"]: " << arrow << std::endl;
}
template<typename Point>
inline void visitPoint(const Point&) const {}
};
class ReversePrintVisitor : public PrintVisitor {
public:
ReversePrintVisitor(ostringstream& s, const int rank) : PrintVisitor(s, rank) {};
template<typename Arrow>
inline void visitArrow(const Arrow& arrow) const {
this->os << "["<<this->rank<<"]: " << arrow.target << "<----" << arrow.source << std::endl;
}
template<typename Arrow>
inline void visitArrow(const Arrow& arrow, const int orientation) const {
this->os << "["<<this->rank<<"]: " << arrow.target << "<----" << arrow.source << ": " << orientation << std::endl;
}
template<typename Point>
inline void visitPoint(const Point&) const {}
template<typename Point>
inline void visitPoint(const Point&, const int) const {}
};
template<typename Sieve, typename Visitor = NullVisitor<Sieve> >
class PointRetriever {
public:
typedef typename Sieve::point_type point_type;
typedef typename Sieve::arrow_type arrow_type;
typedef std::pair<point_type,int> oriented_point_type;
protected:
const bool unique;
size_t i, o;
size_t skip, limit;
Visitor *visitor;
size_t size;
point_type *points;
oriented_point_type *oPoints;
protected:
inline virtual bool accept(const point_type& point) {return true;};
public:
PointRetriever() : unique(false), i(0), o(0), skip(0), limit(0) {
this->size = 0;
this->points = NULL;
this->oPoints = NULL;
};
PointRetriever(const size_t size, const bool unique = false) : unique(unique), i(0), o(0), skip(0), limit(0) {
static Visitor nV;
this->visitor = &nV;
this->points = NULL;
this->oPoints = NULL;
this->setSize(size);
};
PointRetriever(const size_t size, Visitor& v, const bool unique = false) : unique(unique), i(0), o(0), skip(0), limit(0), visitor(&v) {
this->points = NULL;
this->oPoints = NULL;
this->setSize(size);
};
virtual ~PointRetriever() {
delete [] this->points;
delete [] this->oPoints;
this->points = NULL;
this->oPoints = NULL;
};
inline void visitArrow(const arrow_type& arrow) {
this->visitor->visitArrow(arrow);
};
inline void visitArrow(const arrow_type& arrow, const int orientation) {
this->visitor->visitArrow(arrow, orientation);
};
inline void visitPoint(const point_type& point) {
if (i >= size) {
ostringstream msg;
msg << "Too many points (>" << size << ")for PointRetriever visitor";
throw ALE::Exception(msg.str().c_str());
}
if (this->accept(point)) {
if (this->unique) {
size_t p;
for(p = 0; p < i; ++p) {if (points[p] == point) break;}
if (p != i) return;
}
if ((i < this->skip) || ((this->limit) && (i >= this->limit))) {--this->skip; return;}
points[i++] = point;
this->visitor->visitPoint(point);
}
};
inline void visitPoint(const point_type& point, const int orientation) {
if (o >= size) {
ostringstream msg;
msg << "Too many ordered points (>" << size << ")for PointRetriever visitor";
throw ALE::Exception(msg.str().c_str());
}
if (this->accept(point)) {
if (this->unique) {
size_t p;
for(p = 0; p < i; ++p) {if (points[p] == point) break;}
if (p != i) return;
}
if ((i < this->skip) || ((this->limit) && (i >= this->limit))) {--this->skip; return;}
points[i++] = point;
oPoints[o++] = oriented_point_type(point, orientation);
this->visitor->visitPoint(point, orientation);
}
};
public:
size_t getSize() const {return this->i;}
const point_type *getPoints() const {return this->points;}
size_t getOrientedSize() const {return this->o;}
const oriented_point_type *getOrientedPoints() const {return this->oPoints;}
void clear() {this->i = this->o = 0;}
void setSize(const size_t s) {
if (this->points) {
delete [] this->points;
delete [] this->oPoints;
}
this->size = s;
this->points = new point_type[this->size];
this->oPoints = new oriented_point_type[this->size];
}
void setSkip(size_t s) {this->skip = s;};
void setLimit(size_t l) {this->limit = l;};
};
template<typename Sieve, typename Visitor = NullVisitor<Sieve> >
class NConeRetriever : public PointRetriever<Sieve,Visitor> {
public:
typedef PointRetriever<Sieve,Visitor> base_type;
typedef typename Sieve::point_type point_type;
typedef typename Sieve::arrow_type arrow_type;
typedef typename base_type::oriented_point_type oriented_point_type;
protected:
const Sieve& sieve;
protected:
inline virtual bool accept(const point_type& point) {
if (!this->sieve.getConeSize(point))
return true;
return false;
};
public:
NConeRetriever(const Sieve& s, const size_t size) : PointRetriever<Sieve,Visitor>(size, true), sieve(s) {};
NConeRetriever(const Sieve& s, const size_t size, Visitor& v) : PointRetriever<Sieve,Visitor>(size, v, true), sieve(s) {};
virtual ~NConeRetriever() {};
};
template<typename Mesh, typename Visitor = NullVisitor<typename Mesh::sieve_type> >
class MeshNConeRetriever : public PointRetriever<typename Mesh::sieve_type,Visitor> {
public:
typedef typename Mesh::Sieve Sieve;
typedef PointRetriever<Sieve,Visitor> base_type;
typedef typename Sieve::point_type point_type;
typedef typename Sieve::arrow_type arrow_type;
typedef typename base_type::oriented_point_type oriented_point_type;
protected:
const Mesh& mesh;
const int depth;
protected:
inline virtual bool accept(const point_type& point) {
if (this->mesh.depth(point) == this->depth)
return true;
return false;
};
public:
MeshNConeRetriever(const Mesh& m, const int depth, const size_t size) : PointRetriever<typename Mesh::Sieve,Visitor>(size, true), mesh(m), depth(depth) {};
MeshNConeRetriever(const Mesh& m, const int depth, const size_t size, Visitor& v) : PointRetriever<typename Mesh::Sieve,Visitor>(size, v, true), mesh(m), depth(depth) {};
virtual ~MeshNConeRetriever() {};
};
template<typename Sieve, typename Set, typename Renumbering>
class FilteredPointRetriever {
public:
typedef typename Sieve::point_type point_type;
typedef typename Sieve::arrow_type arrow_type;
typedef std::pair<point_type,int> oriented_point_type;
protected:
const Set& pointSet;
Renumbering& renumbering;
const size_t size;
size_t i, o;
bool renumber;
point_type *points;
oriented_point_type *oPoints;
public:
FilteredPointRetriever(const Set& s, Renumbering& r, const size_t size) : pointSet(s), renumbering(r), size(size), i(0), o(0), renumber(true) {
this->points = new point_type[this->size];
this->oPoints = new oriented_point_type[this->size];
};
~FilteredPointRetriever() {
delete [] this->points;
delete [] this->oPoints;
};
inline void visitArrow(const arrow_type& arrow) {};
inline void visitPoint(const point_type& point) {
if (i >= size) throw ALE::Exception("Too many points for FilteredPointRetriever visitor");
if (this->pointSet.find(point) == this->pointSet.end()) return;
if (renumber) {
points[i++] = this->renumbering[point];
} else {
points[i++] = point;
}
};
inline void visitArrow(const arrow_type& arrow, const int orientation) {};
inline void visitPoint(const point_type& point, const int orientation) {
if (o >= size) throw ALE::Exception("Too many points for FilteredPointRetriever visitor");
if (this->pointSet.find(point) == this->pointSet.end()) return;
if (renumber) {
points[i++] = this->renumbering[point];
oPoints[o++] = oriented_point_type(this->renumbering[point], orientation);
} else {
points[i++] = point;
oPoints[o++] = oriented_point_type(point, orientation);
}
};
public:
size_t getSize() const {return this->i;}
const point_type *getPoints() const {return this->points;}
size_t getOrientedSize() const {return this->o;}
const oriented_point_type *getOrientedPoints() const {return this->oPoints;}
void clear() {this->i = 0; this->o = 0;}
void useRenumbering(const bool renumber) {this->renumber = renumber;}
};
template<typename Sieve, int size, typename Visitor = NullVisitor<Sieve> >
class ArrowRetriever {
public:
typedef typename Sieve::point_type point_type;
typedef typename Sieve::arrow_type arrow_type;
typedef std::pair<arrow_type,int> oriented_arrow_type;
protected:
arrow_type arrows[size];
oriented_arrow_type oArrows[size];
size_t i, o;
Visitor *visitor;
public:
ArrowRetriever() : i(0), o(0) {
static Visitor nV;
this->visitor = &nV;
};
ArrowRetriever(Visitor& v) : i(0), o(0), visitor(&v) {};
inline void visitArrow(const typename Sieve::arrow_type& arrow) {
if (i >= size) throw ALE::Exception("Too many arrows for visitor");
arrows[i++] = arrow;
this->visitor->visitArrow(arrow);
};
inline void visitArrow(const typename Sieve::arrow_type& arrow, const int orientation) {
if (o >= size) throw ALE::Exception("Too many arrows for visitor");
oArrows[o++] = oriented_arrow_type(arrow, orientation);
this->visitor->visitArrow(arrow, orientation);
};
inline void visitPoint(const point_type& point) {
this->visitor->visitPoint(point);
};
inline void visitPoint(const point_type& point, const int orientation) {
this->visitor->visitPoint(point, orientation);
};
public:
size_t getSize() const {return this->i;}
const point_type *getArrows() const {return this->arrows;}
size_t getOrientedSize() const {return this->o;}
const oriented_arrow_type *getOrientedArrows() const {return this->oArrows;}
void clear() {this->i = this->o = 0;}
};
template<typename Sieve, typename Visitor>
class ConeVisitor {
protected:
const Sieve& sieve;
Visitor& visitor;
bool useSource;
public:
ConeVisitor(const Sieve& s, Visitor& v, bool useSource = false) : sieve(s), visitor(v), useSource(useSource) {};
inline void visitPoint(const typename Sieve::point_type& point) {
this->sieve.cone(point, visitor);
};
inline void visitArrow(const typename Sieve::arrow_type& arrow) {};
};
template<typename Sieve, typename Visitor>
class OrientedConeVisitor {
protected:
const Sieve& sieve;
Visitor& visitor;
bool useSource;
public:
OrientedConeVisitor(const Sieve& s, Visitor& v, bool useSource = false) : sieve(s), visitor(v), useSource(useSource) {};
inline void visitPoint(const typename Sieve::point_type& point) {
this->sieve.orientedCone(point, visitor);
};
inline void visitArrow(const typename Sieve::arrow_type& arrow) {};
};
template<typename Sieve, typename Visitor>
class SupportVisitor {
protected:
const Sieve& sieve;
Visitor& visitor;
bool useSource;
public:
SupportVisitor(const Sieve& s, Visitor& v, bool useSource = true) : sieve(s), visitor(v), useSource(useSource) {};
inline void visitPoint(const typename Sieve::point_type& point) {
this->sieve.support(point, visitor);
};
inline void visitArrow(const typename Sieve::arrow_type& arrow) {};
};
template<typename Sieve, typename Visitor = NullVisitor<Sieve> >
class TransitiveClosureVisitor {
public:
typedef Visitor visitor_type;
protected:
const Sieve& sieve;
Visitor& visitor;
bool isCone;
std::set<typename Sieve::point_type> seen;
public:
TransitiveClosureVisitor(const Sieve& s, Visitor& v) : sieve(s), visitor(v), isCone(true) {};
inline void visitPoint(const typename Sieve::point_type& point) const {};
inline void visitArrow(const typename Sieve::arrow_type& arrow) {
if (this->isCone) {
if (this->seen.find(arrow.target) == this->seen.end()) {
this->seen.insert(arrow.target);
this->visitor.visitPoint(arrow.target);
}
this->visitor.visitArrow(arrow);
if (this->seen.find(arrow.source) == this->seen.end()) {
if (this->sieve.getConeSize(arrow.source)) {
this->sieve.cone(arrow.source, *this);
} else {
this->seen.insert(arrow.source);
this->visitor.visitPoint(arrow.source);
}
}
} else {
if (this->seen.find(arrow.source) == this->seen.end()) {
this->seen.insert(arrow.source);
this->visitor.visitPoint(arrow.source);
}
this->visitor.visitArrow(arrow);
if (this->seen.find(arrow.target) == this->seen.end()) {
if (this->sieve.getSupportSize(arrow.target)) {
this->sieve.support(arrow.target, *this);
} else {
this->seen.insert(arrow.target);
this->visitor.visitPoint(arrow.target);
}
}
}
};
public:
bool getIsCone() const {return this->isCone;};
void setIsCone(const bool isCone) {this->isCone = isCone;};
const std::set<typename Sieve::point_type>& getPoints() const {return this->seen;};
void clear() {this->seen.clear();};
};
template<typename Sieve, typename Section>
class SizeVisitor {
protected:
const Section& section;
int size;
public:
SizeVisitor(const Section& s) : section(s), size(0) {};
inline void visitPoint(const typename Sieve::point_type& point) {
this->size += section.getConstrainedFiberDimension(point);
};
inline void visitArrow(const typename Sieve::arrow_type&) {};
public:
int getSize() {return this->size;};
};
template<typename Sieve, typename Section>
class SizeWithBCVisitor {
protected:
const Section& section;
int size;
public:
SizeWithBCVisitor(const Section& s) : section(s), size(0) {};
inline void visitPoint(const typename Sieve::point_type& point) {
this->size += section.getFiberDimension(point);
};
inline void visitArrow(const typename Sieve::arrow_type&) {};
public:
int getSize() {return this->size;};
};
template<typename Section>
class RestrictVisitor {
public:
typedef typename Section::value_type value_type;
protected:
const Section& section;
int size;
int i;
value_type *values;
bool allocated;
public:
RestrictVisitor(const Section& s, const int size) : section(s), size(size), i(0) {
this->values = new value_type[this->size];
this->allocated = true;
};
RestrictVisitor(const Section& s, const int size, value_type *values) : section(s), size(size), i(0) {
this->values = values;
this->allocated = false;
};
~RestrictVisitor() {if (this->allocated) {delete [] this->values;}};
template<typename Point>
inline void visitPoint(const Point& point, const int orientation) {
const int dim = section.getFiberDimension(point);
if (i+dim > size) {throw ALE::Exception("Too many values for RestrictVisitor.");}
const value_type *v = section.restrictPoint(point);
if (orientation >= 0) {
for(int d = 0; d < dim; ++d, ++i) {
this->values[i] = v[d];
}
} else {
for(int d = dim-1; d >= 0; --d, ++i) {
this->values[i] = v[d];
}
}
}
template<typename Arrow>
inline void visitArrow(const Arrow& arrow, const int orientation) {}
public:
const value_type *getValues() const {return this->values;};
int getSize() const {return this->i;};
int getMaxSize() const {return this->size;};
void ensureSize(const int size) {
this->clear();
if (size > this->size) {
this->size = size;
if (this->allocated) {delete [] this->values;}
this->values = new value_type[this->size];
this->allocated = true;
}
};
void clear() {this->i = 0;};
};
template<typename Section>
class UpdateVisitor {
public:
typedef typename Section::value_type value_type;
protected:
Section& section;
const value_type *values;
int i;
public:
UpdateVisitor(Section& s, const value_type *v) : section(s), values(v), i(0) {};
template<typename Point>
inline void visitPoint(const Point& point, const int orientation) {
const int dim = section.getFiberDimension(point);
this->section.updatePoint(point, &this->values[this->i], orientation);
this->i += dim;
}
template<typename Arrow>
inline void visitArrow(const Arrow& arrow, const int orientation) {}
void clear() {this->i = 0;};
};
template<typename Section>
class UpdateAllVisitor {
public:
typedef typename Section::value_type value_type;
protected:
Section& section;
const value_type *values;
int i;
public:
UpdateAllVisitor(Section& s, const value_type *v) : section(s), values(v), i(0) {};
template<typename Point>
inline void visitPoint(const Point& point, const int orientation) {
const int dim = section.getFiberDimension(point);
this->section.updatePointAll(point, &this->values[this->i], orientation);
this->i += dim;
}
template<typename Arrow>
inline void visitArrow(const Arrow& arrow, const int orientation) {}
void clear() {this->i = 0;};
};
template<typename Section>
class UpdateAddVisitor {
public:
typedef typename Section::value_type value_type;
protected:
Section& section;
const value_type *values;
int i;
public:
UpdateAddVisitor(Section& s, const value_type *v) : section(s), values(v), i(0) {};
template<typename Point>
inline void visitPoint(const Point& point, const int orientation) {
const int dim = section.getFiberDimension(point);
this->section.updateAddPoint(point, &this->values[this->i], orientation);
this->i += dim;
}
template<typename Arrow>
inline void visitArrow(const Arrow& arrow, const int orientation) {}
void clear() {this->i = 0;};
};
template<typename Section, typename Order, typename Value>
class IndicesVisitor {
public:
typedef Value value_type;
typedef typename Section::point_type point_type;
protected:
const Section& section;
// This can't be const because UniformSection can't have a const restrict(), because of stupid map semantics
Order& order;
int size;
int i, p;
// If false, constrained indices are returned as negative values. Otherwise, they are omitted
bool freeOnly;
// If true, it allows space for constrained variables (even if the indices are not returned) Wierd
bool skipConstraints;
value_type *values;
bool allocated;
point_type *points;
bool allocatedPoints;
protected:
void getUnconstrainedIndices(const point_type& p, const int orientation) {
if (i+section.getFiberDimension(p) > size) {throw ALE::Exception("Too many values for IndicesVisitor.");}
if (orientation >= 0) {
const int start = this->order.getIndex(p);
const int end = start + section.getFiberDimension(p);
for(int j = start; j < end; ++j, ++i) {
this->values[i] = j;
}
} else if (!section.getNumSpaces()) {
const int start = this->order.getIndex(p);
const int end = start + section.getFiberDimension(p);
for(int j = end-1; j >= start; --j, ++i) {
this->values[i] = j;
}
} else {
const int numSpaces = section.getNumSpaces();
int start = this->order.getIndex(p);
for(int space = 0; space < numSpaces; ++space) {
const int end = start + section.getFiberDimension(p, space);
for(int j = end-1; j >= start; --j, ++i) {
this->values[i] = j;
}
start = end;
}
}
};
void getConstrainedIndices(const point_type& p, const int orientation) {
const int cDim = this->section.getConstraintDimension(p);
if (i+cDim > size) {throw ALE::Exception("Too many values for IndicesVisitor.");}
typedef typename Section::bc_type::value_type index_type;
const index_type *cDof = this->section.getConstraintDof(p);
const int start = this->order.getIndex(p);
if (orientation >= 0) {
const int dim = this->section.getFiberDimension(p);
for(int j = start, cInd = 0, k = 0; k < dim; ++k) {
if ((cInd < cDim) && (k == cDof[cInd])) {
if (!freeOnly) values[i++] = -(k+1);
if (skipConstraints) ++j;
++cInd;
} else {
values[i++] = j++;
}
}
} else {
int offset = 0;
int cOffset = 0;
int k = -1;
for(int space = 0; space < section.getNumSpaces(); ++space) {
const int dim = this->section.getFiberDimension(p, space);
const int tDim = this->section.getConstrainedFiberDimension(p, space);
int cInd = (dim - tDim)-1;
k += dim;
for(int l = 0, j = start+tDim+offset; l < dim; ++l, --k) {
if ((cInd >= 0) && (k == cDof[cInd+cOffset])) {
if (!freeOnly) values[i++] = -(offset+l+1);
if (skipConstraints) --j;
--cInd;
} else {
values[i++] = --j;
}
}
k += dim;
offset += dim;
cOffset += dim - tDim;
}
}
};
public:
IndicesVisitor(const Section& s, Order& o, const int size, const bool unique = false) : section(s), order(o), size(size), i(0), p(0), freeOnly(false), skipConstraints(false) {
this->values = new value_type[this->size];
this->allocated = true;
if (unique) {
this->points = new point_type[this->size];
this->allocatedPoints = true;
} else {
this->points = NULL;
this->allocatedPoints = false;
}
};
IndicesVisitor(const Section& s, Order& o, const int size, value_type *values, const bool unique = false) : section(s), order(o), size(size), i(0), p(0), freeOnly(false), skipConstraints(false) {
this->values = values;
this->allocated = false;
if (unique) {
this->points = new point_type[this->size];
this->allocatedPoints = true;
} else {
this->points = NULL;
this->allocatedPoints = false;
}
};
~IndicesVisitor() {
if (this->allocated) {delete [] this->values;}
if (this->allocatedPoints) {delete [] this->points;}
};
inline void visitPoint(const point_type& point, const int orientation) {
if (p >= size) {
ostringstream msg;
msg << "Too many points (>" << size << ")for IndicesVisitor visitor";
throw ALE::Exception(msg.str().c_str());
}
if (points) {
int pp;
for(pp = 0; pp < p; ++pp) {if (points[pp] == point) break;}
if (pp != p) return;
points[p++] = point;
}
const int cDim = this->section.getConstraintDimension(point);
if (!cDim) {
this->getUnconstrainedIndices(point, orientation);
} else {
this->getConstrainedIndices(point, orientation);
}
}
template<typename Arrow>
inline void visitArrow(const Arrow& arrow, const int orientation) {}
public:
const value_type *getValues() const {return this->values;};
int getSize() const {return this->i;};
int getMaxSize() const {return this->size;};
void ensureSize(const int size) {
this->clear();
if (size > this->size) {
this->size = size;
if (this->allocated) {delete [] this->values;}
this->values = new value_type[this->size];
this->allocated = true;
if (this->allocatedPoints) {delete [] this->points;}
this->points = new point_type[this->size];
this->allocatedPoints = true;
}
};
void clear() {this->i = 0; this->p = 0;};
};
template<typename Sieve, typename Label>
class MarkVisitor {
protected:
Label& label;
int marker;
public:
MarkVisitor(Label& l, const int marker) : label(l), marker(marker) {};
inline void visitPoint(const typename Sieve::point_type& point) {
this->label.setCone(this->marker, point);
};
inline void visitArrow(const typename Sieve::arrow_type&) {};
};
};
template<typename Sieve>
class ISieveTraversal {
public:
typedef typename Sieve::point_type point_type;
public:
template<typename Visitor>
static void orientedClosure(const Sieve& sieve, const point_type& p, Visitor& v) {
typedef ISieveVisitor::PointRetriever<Sieve,Visitor> Retriever;
Retriever cV[2] = {Retriever(200,v), Retriever(200,v)};
int c = 0;
v.visitPoint(p, 0);
// Cone is guarateed to be ordered correctly
sieve.orientedCone(p, cV[c]);
while(cV[c].getOrientedSize()) {
const typename Retriever::oriented_point_type *cone = cV[c].getOrientedPoints();
const int coneSize = cV[c].getOrientedSize();
c = 1 - c;
for(int p = 0; p < coneSize; ++p) {
const typename Retriever::point_type& point = cone[p].first;
int pO = cone[p].second == 0 ? 1 : cone[p].second;
const int pConeSize = sieve.getConeSize(point);
if (pO < 0) {
if (pO == -pConeSize) {
sieve.orientedReverseCone(point, cV[c]);
} else {
const int numSkip = sieve.getConeSize(point) + pO;
cV[c].setSkip(cV[c].getSize()+numSkip);
cV[c].setLimit(cV[c].getSize()+pConeSize);
sieve.orientedReverseCone(point, cV[c]);
sieve.orientedReverseCone(point, cV[c]);
cV[c].setSkip(0);
cV[c].setLimit(0);
}
} else {
if (pO == 1) {
sieve.orientedCone(point, cV[c]);
} else {
const int numSkip = pO-1;
cV[c].setSkip(cV[c].getSize()+numSkip);
cV[c].setLimit(cV[c].getSize()+pConeSize);
sieve.orientedCone(point, cV[c]);
sieve.orientedCone(point, cV[c]);
cV[c].setSkip(0);
cV[c].setLimit(0);
}
}
}
cV[1-c].clear();
}
#if 0
// These contain arrows paired with orientations from the \emph{previous} arrow
Obj<orientedArrowArray> cone = new orientedArrowArray();
Obj<orientedArrowArray> base = new orientedArrowArray();
coneSet seen;
for(typename sieve_type::traits::coneSequence::iterator c_iter = initCone->begin(); c_iter != initCone->end(); ++c_iter) {
const arrow_type arrow(*c_iter, p);
cone->push_back(oriented_arrow_type(arrow, 1)); // Notice the orientation of leaf cells is always 1
closure->push_back(oriented_point_type(*c_iter, orientation->restrictPoint(arrow)[0])); // However, we return the actual arrow orientation
}
for(int i = 1; i < depth; ++i) {
Obj<orientedArrowArray> tmp = cone; cone = base; base = tmp;
cone->clear();
for(typename orientedArrowArray::iterator b_iter = base->begin(); b_iter != base->end(); ++b_iter) {
const arrow_type& arrow = b_iter->first; // This is an arrow considered in the previous round
const Obj<typename sieve_type::traits::coneSequence>& pCone = sieve->cone(arrow.source); // We are going to get the cone of this guy
typename arrow_section_type::value_type o = orientation->restrictPoint(arrow)[0]; // The orientation of arrow, which is our pO
if (b_iter->second < 0) { // This is the problem. The second orientation is carried up, being from the previous round
o = -(o+1);
}
if (o < 0) {
const int size = pCone->size();
if (o == -size) {
for(typename sieve_type::traits::coneSequence::reverse_iterator c_iter = pCone->rbegin(); c_iter != pCone->rend(); ++c_iter) {
if (seen.find(*c_iter) == seen.end()) {
const arrow_type newArrow(*c_iter, arrow.source);
int pointO = orientation->restrictPoint(newArrow)[0];
seen.insert(*c_iter);
cone->push_back(oriented_arrow_type(newArrow, o));
closure->push_back(oriented_point_type(*c_iter, pointO ? -(pointO+1): pointO));
}
}
} else {
const int numSkip = size + o;
int count = 0;
for(typename sieve_type::traits::coneSequence::reverse_iterator c_iter = pCone->rbegin(); c_iter != pCone->rend(); ++c_iter, ++count) {
if (count < numSkip) continue;
if (seen.find(*c_iter) == seen.end()) {
const arrow_type newArrow(*c_iter, arrow.source);
int pointO = orientation->restrictPoint(newArrow)[0];
seen.insert(*c_iter);
cone->push_back(oriented_arrow_type(newArrow, o));
closure->push_back(oriented_point_type(*c_iter, pointO ? -(pointO+1): pointO));
}
}
count = 0;
for(typename sieve_type::traits::coneSequence::reverse_iterator c_iter = pCone->rbegin(); c_iter != pCone->rend(); ++c_iter, ++count) {
if (count >= numSkip) break;
if (seen.find(*c_iter) == seen.end()) {
const arrow_type newArrow(*c_iter, arrow.source);
int pointO = orientation->restrictPoint(newArrow)[0];
seen.insert(*c_iter);
cone->push_back(oriented_arrow_type(newArrow, o));
closure->push_back(oriented_point_type(*c_iter, pointO ? -(pointO+1): pointO));
}
}
}
} else {
if (o == 1) {
for(typename sieve_type::traits::coneSequence::iterator c_iter = pCone->begin(); c_iter != pCone->end(); ++c_iter) {
if (seen.find(*c_iter) == seen.end()) {
const arrow_type newArrow(*c_iter, arrow.source);
seen.insert(*c_iter);
cone->push_back(oriented_arrow_type(newArrow, o));
closure->push_back(oriented_point_type(*c_iter, orientation->restrictPoint(newArrow)[0]));
}
}
} else {
const int numSkip = o-1;
int count = 0;
for(typename sieve_type::traits::coneSequence::iterator c_iter = pCone->begin(); c_iter != pCone->end(); ++c_iter, ++count) {
if (count < numSkip) continue;
if (seen.find(*c_iter) == seen.end()) {
const arrow_type newArrow(*c_iter, arrow.source);
seen.insert(*c_iter);
cone->push_back(oriented_arrow_type(newArrow, o));
closure->push_back(oriented_point_type(*c_iter, orientation->restrictPoint(newArrow)[0]));
}
}
count = 0;
for(typename sieve_type::traits::coneSequence::iterator c_iter = pCone->begin(); c_iter != pCone->end(); ++c_iter, ++count) {
if (count >= numSkip) break;
if (seen.find(*c_iter) == seen.end()) {
const arrow_type newArrow(*c_iter, arrow.source);
seen.insert(*c_iter);
cone->push_back(oriented_arrow_type(newArrow, o));
closure->push_back(oriented_point_type(*c_iter, orientation->restrictPoint(newArrow)[0]));
}
}
}
}
}
}
#endif
}
template<typename Visitor>
static void orientedStar(const Sieve& sieve, const point_type& p, Visitor& v) {
typedef ISieveVisitor::PointRetriever<Sieve,Visitor> Retriever;
Retriever sV[2] = {Retriever(200,v), Retriever(200,v)};
int s = 0;
v.visitPoint(p, 0);
// Support is guarateed to be ordered correctly
sieve.orientedSupport(p, sV[s]);
while(sV[s].getOrientedSize()) {
const typename Retriever::oriented_point_type *support = sV[s].getOrientedPoints();
const int supportSize = sV[s].getOrientedSize();
s = 1 - s;
for(int p = 0; p < supportSize; ++p) {
const typename Retriever::point_type& point = support[p].first;
int pO = support[p].second == 0 ? 1 : support[p].second;
const int pSupportSize = sieve.getSupportSize(point);
if (pO < 0) {
if (pO == -pSupportSize) {
sieve.orientedReverseSupport(point, sV[s]);
} else {
const int numSkip = sieve.getSupportSize(point) + pO;
sV[s].setSkip(sV[s].getSize()+numSkip);
sV[s].setLimit(sV[s].getSize()+pSupportSize);
sieve.orientedReverseSupport(point, sV[s]);
sieve.orientedReverseSupport(point, sV[s]);
sV[s].setSkip(0);
sV[s].setLimit(0);
}
} else {
if (pO == 1) {
sieve.orientedSupport(point, sV[s]);
} else {
const int numSkip = pO-1;
sV[s].setSkip(sV[s].getSize()+numSkip);
sV[s].setLimit(sV[s].getSize()+pSupportSize);
sieve.orientedSupport(point, sV[s]);
sieve.orientedSupport(point, sV[s]);
sV[s].setSkip(0);
sV[s].setLimit(0);
}
}
}
sV[1-s].clear();
}
}
};
namespace IFSieveDef {
template<typename PointType_>
class Sequence {
public:
typedef PointType_ point_type;
class const_iterator {
public:
// Standard iterator typedefs
typedef std::input_iterator_tag iterator_category;
typedef PointType_ value_type;
typedef int difference_type;
typedef value_type* pointer;
typedef value_type& reference;
protected:
const point_type *_data;
int _pos;
public:
const_iterator(const point_type data[], const int pos) : _data(data), _pos(pos) {};
virtual ~const_iterator() {};
public:
virtual bool operator==(const const_iterator& iter) const {return this->_pos == iter._pos;};
virtual bool operator!=(const const_iterator& iter) const {return this->_pos != iter._pos;};
virtual const value_type operator*() const {return this->_data[this->_pos];};
virtual const_iterator& operator++() {++this->_pos; return *this;};
virtual const_iterator operator++(int n) {
const_iterator tmp(*this);
++this->_pos;
return tmp;
};
};
typedef const_iterator iterator;
protected:
const point_type *_data;
int _begin;
int _end;
public:
Sequence(const point_type data[], const int begin, const int end) : _data(data), _begin(begin), _end(end) {};
virtual ~Sequence() {};
public:
virtual iterator begin() const {return iterator(_data, _begin);};
virtual iterator end() const {return iterator(_data, _end);};
size_t size() const {return(_end - _begin);}
void reset(const point_type data[], const int begin, const int end) {_data = data; _begin = begin; _end = end;};
};
}
// Interval Final Sieve
// This is just two CSR matrices that give cones and supports
// It is completely static and cannot be resized
// It will operator on visitors, rather than sequences (which are messy)
template<typename Point_, typename Allocator_ = malloc_allocator<Point_> >
class IFSieve : public ParallelObject {
public:
// Types
typedef IFSieve<Point_,Allocator_> this_type;
typedef Point_ point_type;
typedef SimpleArrow<point_type,point_type> arrow_type;
typedef typename arrow_type::source_type source_type;
typedef typename arrow_type::target_type target_type;
typedef int index_type;
// Allocators
typedef Allocator_ point_allocator_type;
typedef typename point_allocator_type::template rebind<index_type>::other index_allocator_type;
typedef typename point_allocator_type::template rebind<int>::other int_allocator_type;
// Interval
typedef Interval<point_type, point_allocator_type> chart_type;
// Dynamic structure
typedef std::map<point_type, std::vector<point_type> > newpoints_type;
// Iterator interface
typedef typename IFSieveDef::Sequence<point_type> coneSequence;
typedef typename IFSieveDef::Sequence<point_type> supportSequence;
// Compatibility types for SieveAlgorithms (until we rewrite for visitors)
typedef std::set<point_type> pointSet;
typedef ALE::array<point_type> pointArray;
typedef pointSet coneSet;
typedef pointSet supportSet;
typedef pointArray coneArray;
typedef pointArray supportArray;
protected:
// Arrow Containers
typedef index_type *offsets_type;
typedef point_type *cones_type;
typedef point_type *supports_type;
// Decorators
typedef int *orientations_type;
protected:
// Data
bool indexAllocated;
offsets_type coneOffsets;
offsets_type supportOffsets;
bool pointAllocated;
index_type maxConeSize;
index_type maxSupportSize;
index_type baseSize;
index_type capSize;
cones_type cones;
supports_type supports;
bool orientCones;
orientations_type coneOrientations;
chart_type chart;
int_allocator_type intAlloc;
index_allocator_type indexAlloc;
point_allocator_type pointAlloc;
newpoints_type newCones;
newpoints_type newSupports;
// Sequences
Obj<coneSequence> coneSeq;
Obj<supportSequence> supportSeq;
protected: // Memory Management
void createIndices() {
this->coneOffsets = indexAlloc.allocate(this->chart.size()+1);
this->coneOffsets -= this->chart.min();
for(index_type i = this->chart.min(); i <= this->chart.max(); ++i) {indexAlloc.construct(this->coneOffsets+i, index_type(0));}
this->supportOffsets = indexAlloc.allocate(this->chart.size()+1);
this->supportOffsets -= this->chart.min();
for(index_type i = this->chart.min(); i <= this->chart.max(); ++i) {indexAlloc.construct(this->supportOffsets+i, index_type(0));}
this->indexAllocated = true;
};
void destroyIndices(const chart_type& chart, offsets_type *coneOffsets, offsets_type *supportOffsets) {
if (*coneOffsets) {
for(index_type i = chart.min(); i <= chart.max(); ++i) {indexAlloc.destroy((*coneOffsets)+i);}
*coneOffsets += chart.min();
indexAlloc.deallocate(*coneOffsets, chart.size()+1);
*coneOffsets = NULL;
}
if (*supportOffsets) {
for(index_type i = chart.min(); i <= chart.max(); ++i) {indexAlloc.destroy((*supportOffsets)+i);}
*supportOffsets += chart.min();
indexAlloc.deallocate(*supportOffsets, chart.size()+1);
*supportOffsets = NULL;
}
};
void destroyIndices() {
this->destroyIndices(this->chart, &this->coneOffsets, &this->supportOffsets);
this->indexAllocated = false;
this->maxConeSize = -1;
this->maxSupportSize = -1;
this->baseSize = -1;
this->capSize = -1;
};
void createPoints() {
this->cones = pointAlloc.allocate(this->coneOffsets[this->chart.max()]-this->coneOffsets[this->chart.min()]);
for(index_type i = this->coneOffsets[this->chart.min()]; i < this->coneOffsets[this->chart.max()]; ++i) {pointAlloc.construct(this->cones+i, point_type(0));}
this->supports = pointAlloc.allocate(this->supportOffsets[this->chart.max()]-this->supportOffsets[this->chart.min()]);
for(index_type i = this->supportOffsets[this->chart.min()]; i < this->supportOffsets[this->chart.max()]; ++i) {pointAlloc.construct(this->supports+i, point_type(0));}
if (orientCones) {
this->coneOrientations = intAlloc.allocate(this->coneOffsets[this->chart.max()]-this->coneOffsets[this->chart.min()]);
for(index_type i = this->coneOffsets[this->chart.min()]; i < this->coneOffsets[this->chart.max()]; ++i) {intAlloc.construct(this->coneOrientations+i, 0);}
}
this->pointAllocated = true;
};
void destroyPoints(const chart_type& chart, const offsets_type coneOffsets, cones_type *cones, const offsets_type supportOffsets, supports_type *supports, orientations_type *coneOrientations) {
if (*cones) {
for(index_type i = coneOffsets[chart.min()]; i < coneOffsets[chart.max()]; ++i) {pointAlloc.destroy((*cones)+i);}
pointAlloc.deallocate(*cones, coneOffsets[chart.max()]-coneOffsets[chart.min()]);
*cones = NULL;
}
if (*supports) {
for(index_type i = supportOffsets[chart.min()]; i < supportOffsets[chart.max()]; ++i) {pointAlloc.destroy((*supports)+i);}
pointAlloc.deallocate(*supports, supportOffsets[chart.max()]-supportOffsets[chart.min()]);
*supports = NULL;
}
if (*coneOrientations) {
for(index_type i = coneOffsets[chart.min()]; i < coneOffsets[chart.max()]; ++i) {pointAlloc.destroy((*coneOrientations)+i);}
intAlloc.deallocate(*coneOrientations, coneOffsets[chart.max()]-coneOffsets[chart.min()]);
*coneOrientations = NULL;
}
};
void destroyPoints() {
this->destroyPoints(this->chart, this->coneOffsets, &this->cones, this->supportOffsets, &this->supports, &this->coneOrientations);
this->pointAllocated = false;
};
void prefixSum(const offsets_type array) {
for(index_type p = this->chart.min()+1; p <= this->chart.max(); ++p) {
array[p] = array[p] + array[p-1];
}
};
void calculateBaseAndCapSize() {
this->baseSize = 0;
for(point_type p = this->chart.min(); p < this->chart.max(); ++p) {
if (this->coneOffsets[p+1]-this->coneOffsets[p] > 0) {
++this->baseSize;
}
}
this->capSize = 0;
for(point_type p = this->chart.min(); p < this->chart.max(); ++p) {
if (this->supportOffsets[p+1]-this->supportOffsets[p] > 0) {
++this->capSize;
}
}
};
public:
IFSieve(const MPI_Comm comm, const int debug = 0) : ParallelObject(comm, debug), indexAllocated(false), coneOffsets(NULL), supportOffsets(NULL), pointAllocated(false), maxConeSize(-1), maxSupportSize(-1), baseSize(-1), capSize(-1), cones(NULL), supports(NULL), orientCones(true), coneOrientations(NULL) {
this->coneSeq = new coneSequence(NULL, 0, 0);
this->supportSeq = new supportSequence(NULL, 0, 0);
};
IFSieve(const MPI_Comm comm, const point_type& min, const point_type& max, const int debug = 0) : ParallelObject(comm, debug), indexAllocated(false), coneOffsets(NULL), supportOffsets(NULL), pointAllocated(false), maxConeSize(-1), maxSupportSize(-1), baseSize(-1), capSize(-1), cones(NULL), supports(NULL), orientCones(true), coneOrientations(NULL) {
this->setChart(chart_type(min, max));
this->coneSeq = new coneSequence(NULL, 0, 0);
this->supportSeq = new supportSequence(NULL, 0, 0);
};
~IFSieve() {
this->destroyPoints();
this->destroyIndices();
};
public: // Accessors
const chart_type& getChart() const {return this->chart;};
void setChart(const chart_type& chart) {
this->destroyPoints();
this->destroyIndices();
this->chart = chart;
this->createIndices();
};
index_type getMaxConeSize() const {
return this->maxConeSize;
};
index_type getMaxSupportSize() const {
return this->maxSupportSize;
};
bool baseContains(const point_type& p) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
if (this->coneOffsets[p+1]-this->coneOffsets[p] > 0) {
return true;
}
return false;
};
bool orientedCones() const {return this->orientCones;};
public: // Construction
index_type getConeSize(const point_type& p) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
return this->coneOffsets[p+1]-this->coneOffsets[p];
};
void setConeSize(const point_type& p, const index_type c) {
if (this->pointAllocated) {throw ALE::Exception("IFSieve points have already been allocated.");}
this->chart.checkPoint(p);
this->coneOffsets[p+1] = c;
this->maxConeSize = std::max(this->maxConeSize, c);
};
void addConeSize(const point_type& p, const index_type c) {
if (this->pointAllocated) {throw ALE::Exception("IFSieve points have already been allocated.");}
this->chart.checkPoint(p);
this->coneOffsets[p+1] += c;
this->maxConeSize = std::max(this->maxConeSize, this->coneOffsets[p+1]);
};
index_type getSupportSize(const point_type& p) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
return this->supportOffsets[p+1]-this->supportOffsets[p];
};
void setSupportSize(const point_type& p, const index_type s) {
if (this->pointAllocated) {throw ALE::Exception("IFSieve points have already been allocated.");}
this->chart.checkPoint(p);
this->supportOffsets[p+1] = s;
this->maxSupportSize = std::max(this->maxSupportSize, s);
};
void addSupportSize(const point_type& p, const index_type s) {
if (this->pointAllocated) {throw ALE::Exception("IFSieve points have already been allocated.");}
this->chart.checkPoint(p);
this->supportOffsets[p+1] += s;
this->maxSupportSize = std::max(this->maxSupportSize, this->supportOffsets[p+1]);
};
void allocate() {
if (this->pointAllocated) {throw ALE::Exception("IFSieve points have already been allocated.");}
this->prefixSum(this->coneOffsets);
this->prefixSum(this->supportOffsets);
this->createPoints();
this->calculateBaseAndCapSize();
}
// Purely for backwards compatibility
template<typename Color>
void addArrow(const point_type& p, const point_type& q, const Color c, const bool forceSupport = false) {
this->addArrow(p, q, forceSupport);
}
void addArrow(const point_type& p, const point_type& q, const bool forceSupport = false) {
if (!this->chart.hasPoint(q)) {
if (!this->newCones[q].size() && this->chart.hasPoint(q)) {
const index_type start = this->coneOffsets[q];
const index_type end = this->coneOffsets[q+1];
for(int c = start; c < end; ++c) {
this->newCones[q].push_back(this->cones[c]);
}
}
this->newCones[q].push_back(p);
}
if (!this->chart.hasPoint(p) || forceSupport) {
if (!this->newSupports[p].size() && this->chart.hasPoint(p)) {
const index_type start = this->supportOffsets[p];
const index_type end = this->supportOffsets[p+1];
for(int s = start; s < end; ++s) {
this->newSupports[p].push_back(this->supports[s]);
}
}
this->newSupports[p].push_back(q);
}
};
void reallocate() {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
if (!this->newCones.size() && !this->newSupports.size()) return;
const chart_type oldChart = this->chart;
offsets_type oldConeOffsets = this->coneOffsets;
offsets_type oldSupportOffsets = this->supportOffsets;
cones_type oldCones = this->cones;
supports_type oldSupports = this->supports;
orientations_type oldConeOrientations = this->coneOrientations;
point_type min = this->chart.min();
point_type max = this->chart.max()-1;
for(typename newpoints_type::const_iterator c_iter = this->newCones.begin(); c_iter != this->newCones.end(); ++c_iter) {
min = std::min(min, c_iter->first);
max = std::max(max, c_iter->first);
}
for(typename newpoints_type::const_iterator s_iter = this->newSupports.begin(); s_iter != this->newSupports.end(); ++s_iter) {
min = std::min(min, s_iter->first);
max = std::max(max, s_iter->first);
}
this->chart = chart_type(min, max+1);
this->createIndices();
// Copy sizes (converted from offsets)
for(point_type p = oldChart.min(); p < oldChart.max(); ++p) {
this->coneOffsets[p+1] = oldConeOffsets[p+1]-oldConeOffsets[p];
this->supportOffsets[p+1] = oldSupportOffsets[p+1]-oldSupportOffsets[p];
}
// Inject new sizes
for(typename newpoints_type::const_iterator c_iter = this->newCones.begin(); c_iter != this->newCones.end(); ++c_iter) {
this->coneOffsets[c_iter->first+1] = c_iter->second.size();
this->maxConeSize = std::max(this->maxConeSize, (int) c_iter->second.size());
}
for(typename newpoints_type::const_iterator s_iter = this->newSupports.begin(); s_iter != this->newSupports.end(); ++s_iter) {
this->supportOffsets[s_iter->first+1] = s_iter->second.size();
this->maxSupportSize = std::max(this->maxSupportSize, (int) s_iter->second.size());
}
this->prefixSum(this->coneOffsets);
this->prefixSum(this->supportOffsets);
this->createPoints();
this->calculateBaseAndCapSize();
// Copy cones and supports
for(point_type p = oldChart.min(); p < oldChart.max(); ++p) {
const index_type cStart = this->coneOffsets[p];
const index_type cOStart = oldConeOffsets[p];
const index_type cOEnd = oldConeOffsets[p+1];
const index_type sStart = this->supportOffsets[p];
const index_type sOStart = oldSupportOffsets[p];
const index_type sOEnd = oldSupportOffsets[p+1];
for(int cO = cOStart, c = cStart; cO < cOEnd; ++cO, ++c) {
this->cones[c] = oldCones[cO];
}
for(int sO = sOStart, s = sStart; sO < sOEnd; ++sO, ++s) {
this->supports[s] = oldSupports[sO];
}
if (this->orientCones) {
for(int cO = cOStart, c = cStart; cO < cOEnd; ++cO, ++c) {
this->coneOrientations[c] = oldConeOrientations[cO];
}
}
}
// Inject new cones and supports
for(typename newpoints_type::const_iterator c_iter = this->newCones.begin(); c_iter != this->newCones.end(); ++c_iter) {
index_type start = this->coneOffsets[c_iter->first];
for(typename std::vector<point_type>::const_iterator p_iter = c_iter->second.begin(); p_iter != c_iter->second.end(); ++p_iter) {
this->cones[start++] = *p_iter;
}
if (start != this->coneOffsets[c_iter->first+1]) throw ALE::Exception("Invalid size for new cone array");
}
for(typename newpoints_type::const_iterator s_iter = this->newSupports.begin(); s_iter != this->newSupports.end(); ++s_iter) {
index_type start = this->supportOffsets[s_iter->first];
for(typename std::vector<point_type>::const_iterator p_iter = s_iter->second.begin(); p_iter != s_iter->second.end(); ++p_iter) {
this->supports[start++] = *p_iter;
}
if (start != this->supportOffsets[s_iter->first+1]) throw ALE::Exception("Invalid size for new support array");
}
this->newCones.clear();
this->newSupports.clear();
this->destroyPoints(oldChart, oldConeOffsets, &oldCones, oldSupportOffsets, &oldSupports, &oldConeOrientations);
this->destroyIndices(oldChart, &oldConeOffsets, &oldSupportOffsets);
};
// Recalculate the support offsets and fill the supports
// This is used when an IFSieve is being used as a label
void recalculateLabel() {
ISieveVisitor::PointRetriever<IFSieve> v(1);
for(point_type p = this->getChart().min(); p < this->getChart().max(); ++p) {
this->supportOffsets[p+1] = 0;
}
this->maxSupportSize = 0;
for(point_type p = this->getChart().min(); p < this->getChart().max(); ++p) {
this->cone(p, v);
if (v.getSize()) {
this->supportOffsets[v.getPoints()[0]+1]++;
this->maxSupportSize = std::max(this->maxSupportSize, this->supportOffsets[v.getPoints()[0]+1]);
}
v.clear();
}
this->prefixSum(this->supportOffsets);
this->calculateBaseAndCapSize();
this->symmetrize();
};
void setCone(const point_type cone[], const point_type& p) {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->coneOffsets[p];
const index_type end = this->coneOffsets[p+1];
for(index_type c = start, i = 0; c < end; ++c, ++i) {
this->cones[c] = cone[i];
}
};
void setCone(const point_type cone, const point_type& p) {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->coneOffsets[p];
const index_type end = this->coneOffsets[p+1];
if (end - start != 1) {throw ALE::Exception("IFSieve setCone() called with too few points.");}
this->cones[start] = cone;
};
#if 0
template<typename PointSequence>
void setCone(const PointSequence& cone, const point_type& p) {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->coneOffsets[p];
const index_type end = this->coneOffsets[p+1];
if (cone.size() != end - start) {throw ALE::Exception("Invalid size for IFSieve cone.");}
typename PointSequence::iterator c_iter = cone.begin();
for(index_type c = start; c < end; ++c, ++c_iter) {
this->cones[c] = *c_iter;
}
};
#endif
void setSupport(const point_type& p, const point_type support[]) {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->supportOffsets[p];
const index_type end = this->supportOffsets[p+1];
for(index_type s = start, i = 0; s < end; ++s, ++i) {
this->supports[s] = support[i];
}
};
#if 0
template<typename PointSequence>
void setSupport(const point_type& p, const PointSequence& support) {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->supportOffsets[p];
const index_type end = this->supportOffsets[p+1];
if (support.size() != end - start) {throw ALE::Exception("Invalid size for IFSieve support.");}
typename PointSequence::iterator s_iter = support.begin();
for(index_type s = start; s < end; ++s, ++s_iter) {
this->supports[s] = *s_iter;
}
};
#endif
void setConeOrientation(const int coneOrientation[], const point_type& p) {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->coneOffsets[p];
const index_type end = this->coneOffsets[p+1];
for(index_type c = start, i = 0; c < end; ++c, ++i) {
this->coneOrientations[c] = coneOrientation[i];
}
};
void symmetrizeSizes(const int numCells, const int numCorners, const int cones[], const int offset = 0) {
for(point_type p = 0; p < numCells; ++p) {
const index_type start = p*numCorners;
const index_type end = (p+1)*numCorners;
for(index_type c = start; c < end; ++c) {
const point_type q = cones[c]+offset;
this->supportOffsets[q+1]++;
}
}
for(point_type p = numCells; p < this->chart.max(); ++p) {
this->maxSupportSize = std::max(this->maxSupportSize, this->supportOffsets[p+1]);
}
};
void symmetrize() {
index_type *offsets = indexAlloc.allocate(this->chart.size()+1);
offsets -= this->chart.min();
for(index_type i = this->chart.min(); i <= this->chart.max(); ++i) {indexAlloc.construct(offsets+i, index_type(0));}
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
for(point_type p = this->chart.min(); p < this->chart.max(); ++p) {
const index_type start = this->coneOffsets[p];
const index_type end = this->coneOffsets[p+1];
for(index_type c = start; c < end; ++c) {
const point_type q = this->cones[c];
this->chart.checkPoint(q);
this->supports[this->supportOffsets[q]+offsets[q]] = p;
++offsets[q];
}
}
for(index_type i = this->chart.min(); i <= this->chart.max(); ++i) {indexAlloc.destroy(offsets+i);}
indexAlloc.deallocate(offsets, this->chart.size()+1);
}
index_type getBaseSize() const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
return this->baseSize;
}
index_type getCapSize() const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
return this->capSize;
}
public: // Traversals
template<typename Visitor>
void roots(const Visitor& v) const {
this->roots(const_cast<Visitor&>(v));
}
template<typename Visitor>
void roots(Visitor& v) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
for(point_type p = this->chart.min(); p < this->chart.max(); ++p) {
if (this->coneOffsets[p+1] == this->coneOffsets[p]) {
if (this->supportOffsets[p+1]-this->supportOffsets[p] > 0) {
v.visitPoint(p);
}
}
}
}
template<typename Visitor>
void leaves(const Visitor& v) const {
this->leaves(const_cast<Visitor&>(v));
}
template<typename Visitor>
void leaves(Visitor& v) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
for(point_type p = this->chart.min(); p < this->chart.max(); ++p) {
if (this->supportOffsets[p+1] == this->supportOffsets[p]) {
if (this->coneOffsets[p+1]-this->coneOffsets[p] > 0) {
v.visitPoint(p);
}
}
}
}
template<typename Visitor>
void base(const Visitor& v) const {
this->base(const_cast<Visitor&>(v));
}
template<typename Visitor>
void base(Visitor& v) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
for(point_type p = this->chart.min(); p < this->chart.max(); ++p) {
if (this->coneOffsets[p+1]-this->coneOffsets[p] > 0) {
v.visitPoint(p);
}
}
}
template<typename Visitor>
void cap(const Visitor& v) const {
this->cap(const_cast<Visitor&>(v));
}
template<typename Visitor>
void cap(Visitor& v) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
for(point_type p = this->chart.min(); p < this->chart.max(); ++p) {
if (this->supportOffsets[p+1]-this->supportOffsets[p] > 0) {
v.visitPoint(p);
}
}
}
template<typename PointSequence, typename Visitor>
void cone(const PointSequence& points, Visitor& v) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
for(typename PointSequence::const_iterator p_iter = points.begin(); p_iter != points.end(); ++p_iter) {
const point_type p = *p_iter;
this->chart.checkPoint(p);
const index_type start = this->coneOffsets[p];
const index_type end = this->coneOffsets[p+1];
for(index_type c = start; c < end; ++c) {
v.visitArrow(arrow_type(this->cones[c], p));
v.visitPoint(this->cones[c]);
}
}
}
template<typename Visitor>
void cone(const point_type& p, Visitor& v) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->coneOffsets[p];
const index_type end = this->coneOffsets[p+1];
for(index_type c = start; c < end; ++c) {
v.visitArrow(arrow_type(this->cones[c], p));
v.visitPoint(this->cones[c]);
}
}
const Obj<coneSequence>& cone(const point_type& p) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
if (!this->chart.hasPoint(p)) {
this->coneSeq->reset(this->cones, 0, 0);
} else {
this->coneSeq->reset(this->cones, this->coneOffsets[p], this->coneOffsets[p+1]);
}
return this->coneSeq;
}
template<typename PointSequence, typename Visitor>
void support(const PointSequence& points, Visitor& v) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
for(typename PointSequence::const_iterator p_iter = points.begin(); p_iter != points.end(); ++p_iter) {
const point_type p = *p_iter;
this->chart.checkPoint(p);
const index_type start = this->supportOffsets[p];
const index_type end = this->supportOffsets[p+1];
for(index_type s = start; s < end; ++s) {
v.visitArrow(arrow_type(p, this->supports[s]));
v.visitPoint(this->supports[s]);
}
}
}
template<typename Visitor>
void support(const point_type& p, Visitor& v) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->supportOffsets[p];
const index_type end = this->supportOffsets[p+1];
for(index_type s = start; s < end; ++s) {
v.visitArrow(arrow_type(p, this->supports[s]));
v.visitPoint(this->supports[s]);
}
}
const Obj<supportSequence>& support(const point_type& p) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
if (!this->chart.hasPoint(p)) {
this->supportSeq->reset(this->supports, 0, 0);
} else {
this->supportSeq->reset(this->supports, this->supportOffsets[p], this->supportOffsets[p+1]);
}
return this->supportSeq;
}
template<typename Visitor>
void orientedCone(const point_type& p, Visitor& v) const {
if (!this->orientCones) {throw ALE::Exception("IFSieve cones have not been oriented.");}
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->coneOffsets[p];
const index_type end = this->coneOffsets[p+1];
for(index_type c = start; c < end; ++c) {
v.visitArrow(arrow_type(this->cones[c], p), this->coneOrientations[c]);
v.visitPoint(this->cones[c], this->coneOrientations[c]);
}
}
template<typename Visitor>
void orientedReverseCone(const point_type& p, Visitor& v) const {
if (!this->orientCones) {throw ALE::Exception("IFSieve cones have not been oriented.");}
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->coneOffsets[p];
const index_type end = this->coneOffsets[p+1];
for(index_type c = end-1; c >= start; --c) {
v.visitArrow(arrow_type(this->cones[c], p), this->coneOrientations[c]);
v.visitPoint(this->cones[c], this->coneOrientations[c] ? -(this->coneOrientations[c]+1): 0);
}
}
template<typename Visitor>
void orientedSupport(const point_type& p, Visitor& v) const {
//if (!this->orientCones) {throw ALE::Exception("IFSieve cones have not been oriented.");}
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->supportOffsets[p];
const index_type end = this->supportOffsets[p+1];
for(index_type s = start; s < end; ++s) {
//v.visitArrow(arrow_type(this->supports[s], p), this->supportOrientations[s]);
//v.visitPoint(this->supports[s], this->supportOrientations[s]);
v.visitArrow(arrow_type(this->supports[s], p), 0);
v.visitPoint(this->supports[s], 0);
}
}
template<typename Visitor>
void orientedReverseSupport(const point_type& p, Visitor& v) const {
//if (!this->orientCones) {throw ALE::Exception("IFSieve cones have not been oriented.");}
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
const index_type start = this->supportOffsets[p];
const index_type end = this->supportOffsets[p+1];
for(index_type s = end-1; s >= start; --s) {
//v.visitArrow(arrow_type(this->supports[s], p), this->supportOrientations[s]);
//v.visitPoint(this->supports[s], this->supportOrientations[s] ? -(this->supportOrientations[s]+1): 0);
v.visitArrow(arrow_type(this->supports[s], p), 0);
v.visitPoint(this->supports[s], 0);
}
}
// Currently does only 1 level
// Does not check for uniqueness
template<typename Visitor>
void meet(const point_type& p, const point_type& q, Visitor& v) const {
if (!this->pointAllocated) {throw ALE::Exception("IFSieve points have not been allocated.");}
this->chart.checkPoint(p);
this->chart.checkPoint(q);
const index_type startP = this->coneOffsets[p];
const index_type endP = this->coneOffsets[p+1];
const index_type startQ = this->coneOffsets[q];
const index_type endQ = this->coneOffsets[q+1];
for(index_type cP = startP; cP < endP; ++cP) {
const point_type& c1 = this->cones[cP];
for(index_type cQ = startQ; cQ < endQ; ++cQ) {
if (c1 == this->cones[cQ]) v.visitPoint(c1);
}
if (this->coneOffsets[c1+1] > this->coneOffsets[c1]) {throw ALE::Exception("Cannot handle multiple level meet()");}
}
}
// Currently does only 1 level
template<typename Sequence, typename Visitor>
void join(const Sequence& points, Visitor& v) const {
typedef std::set<point_type> pointSet;
pointSet intersect[2] = {pointSet(), pointSet()};
pointSet tmp;
int p = 0;
int c = 0;
for(typename Sequence::const_iterator p_iter = points.begin(); p_iter != points.end(); ++p_iter) {
this->chart.checkPoint(*p_iter);
tmp.insert(&this->supports[this->supportOffsets[*p_iter]], &this->supports[this->supportOffsets[(*p_iter)+1]]);
if (p == 0) {
intersect[1-c].insert(tmp.begin(), tmp.end());
p++;
} else {
std::set_intersection(intersect[c].begin(), intersect[c].end(), tmp.begin(), tmp.end(),
std::insert_iterator<pointSet>(intersect[1-c], intersect[1-c].begin()));
intersect[c].clear();
}
c = 1 - c;
tmp.clear();
}
for(typename pointSet::const_iterator p_iter = intersect[c].begin(); p_iter != intersect[c].end(); ++p_iter) {
v.visitPoint(*p_iter);
}
}
public: // Viewing
void view(const std::string& name, MPI_Comm comm = MPI_COMM_NULL) {
ostringstream txt;
int rank;
if (comm == MPI_COMM_NULL) {
comm = this->comm();
rank = this->commRank();
} else {
MPI_Comm_rank(comm, &rank);
}
if (name == "") {
if(rank == 0) {
txt << "viewing an IFSieve" << std::endl;
}
} else {
if(rank == 0) {
txt << "viewing IFSieve '" << name << "'" << std::endl;
}
}
if(rank == 0) {
txt << "cap --> base:" << std::endl;
}
ISieveVisitor::PrintVisitor pV(txt, rank);
this->cap(ISieveVisitor::SupportVisitor<IFSieve,ISieveVisitor::PrintVisitor>(*this, pV));
PetscSynchronizedPrintf(comm, txt.str().c_str());
PetscSynchronizedFlush(comm);
ostringstream txt2;
if(rank == 0) {
txt2 << "base <-- cap:" << std::endl;
}
ISieveVisitor::ReversePrintVisitor rV(txt2, rank);
this->base(ISieveVisitor::ConeVisitor<IFSieve,ISieveVisitor::ReversePrintVisitor>(*this, rV));
PetscSynchronizedPrintf(comm, txt2.str().c_str());
PetscSynchronizedFlush(comm);
if (orientCones) {
ostringstream txt3;
if(rank == 0) {
txt3 << "Orientation:" << std::endl;
}
ISieveVisitor::ReversePrintVisitor rV2(txt3, rank);
this->base(ISieveVisitor::OrientedConeVisitor<IFSieve,ISieveVisitor::ReversePrintVisitor>(*this, rV2));
PetscSynchronizedPrintf(comm, txt3.str().c_str());
PetscSynchronizedFlush(comm);
}
};
};
class ISieveConverter {
public:
template<typename Sieve, typename ISieve, typename Renumbering>
static void convertSieve(Sieve& sieve, ISieve& isieve, Renumbering& renumbering, bool renumber = true) {
// First construct a renumbering of the sieve points
const Obj<typename Sieve::baseSequence>& base = sieve.base();
const Obj<typename Sieve::capSequence>& cap = sieve.cap();
typename ISieve::point_type min = 0;
typename ISieve::point_type max = 0;
if (renumber) {
for(typename Sieve::baseSequence::iterator b_iter = base->begin(); b_iter != base->end(); ++b_iter) {
renumbering[*b_iter] = max++;
}
for(typename Sieve::baseSequence::iterator c_iter = cap->begin(); c_iter != cap->end(); ++c_iter) {
if (renumbering.find(*c_iter) == renumbering.end()) {
renumbering[*c_iter] = max++;
}
}
} else {
if (base->size()) {
min = *base->begin();
max = *base->begin();
} else if (cap->size()) {
min = *cap->begin();
max = *cap->begin();
}
for(typename Sieve::baseSequence::iterator b_iter = base->begin(); b_iter != base->end(); ++b_iter) {
min = std::min(min, *b_iter);
max = std::max(max, *b_iter);
}
for(typename Sieve::baseSequence::iterator c_iter = cap->begin(); c_iter != cap->end(); ++c_iter) {
min = std::min(min, *c_iter);
max = std::max(max, *c_iter);
}
if (base->size() || cap->size()) {
++max;
}
for(typename ISieve::point_type p = min; p < max; ++p) {
renumbering[p] = p;
}
}
// Create the ISieve
isieve.setChart(typename ISieve::chart_type(min, max));
// Set cone and support sizes
size_t maxSize = 0;
for(typename Sieve::baseSequence::iterator b_iter = base->begin(); b_iter != base->end(); ++b_iter) {
const Obj<typename Sieve::coneSequence>& cone = sieve.cone(*b_iter);
isieve.setConeSize(renumbering[*b_iter], cone->size());
maxSize = std::max(maxSize, cone->size());
}
for(typename Sieve::capSequence::iterator c_iter = cap->begin(); c_iter != cap->end(); ++c_iter) {
const Obj<typename Sieve::supportSequence>& support = sieve.support(*c_iter);
isieve.setSupportSize(renumbering[*c_iter], support->size());
maxSize = std::max(maxSize, support->size());
}
isieve.allocate();
// Fill up cones and supports
typename Sieve::point_type *points = new typename Sieve::point_type[maxSize];
for(typename Sieve::baseSequence::iterator b_iter = base->begin(); b_iter != base->end(); ++b_iter) {
const Obj<typename Sieve::coneSequence>& cone = sieve.cone(*b_iter);
int i = 0;
for(typename Sieve::coneSequence::iterator c_iter = cone->begin(); c_iter != cone->end(); ++c_iter, ++i) {
points[i] = renumbering[*c_iter];
}
isieve.setCone(points, renumbering[*b_iter]);
}
for(typename Sieve::capSequence::iterator c_iter = cap->begin(); c_iter != cap->end(); ++c_iter) {
const Obj<typename Sieve::supportSequence>& support = sieve.support(*c_iter);
int i = 0;
for(typename Sieve::supportSequence::iterator s_iter = support->begin(); s_iter != support->end(); ++s_iter, ++i) {
points[i] = renumbering[*s_iter];
}
isieve.setSupport(renumbering[*c_iter], points);
}
delete [] points;
}
template<typename Sieve, typename ISieve, typename Renumbering, typename ArrowSection>
static void convertOrientation(Sieve& sieve, ISieve& isieve, Renumbering& renumbering, ArrowSection *orientation) {
if (isieve.getMaxConeSize() < 0) return;
const Obj<typename Sieve::baseSequence>& base = sieve.base();
int *orientations = new int[isieve.getMaxConeSize()];
for(typename Sieve::baseSequence::iterator b_iter = base->begin(); b_iter != base->end(); ++b_iter) {
const Obj<typename Sieve::coneSequence>& cone = sieve.cone(*b_iter);
int i = 0;
for(typename Sieve::coneSequence::iterator c_iter = cone->begin(); c_iter != cone->end(); ++c_iter, ++i) {
typename ArrowSection::point_type arrow(*c_iter, *b_iter);
orientations[i] = orientation->restrictPoint(arrow)[0];
}
isieve.setConeOrientation(orientations, renumbering[*b_iter]);
}
delete [] orientations;
}
template<typename Section, typename ISection, typename Renumbering>
static void convertCoordinates(Section& coordinates, ISection& icoordinates, Renumbering& renumbering) {
const typename Section::chart_type& chart = coordinates.getChart();
typename ISection::point_type min = *chart.begin();
typename ISection::point_type max = *chart.begin();
for(typename Section::chart_type::const_iterator p_iter = chart.begin(); p_iter != chart.end(); ++p_iter) {
min = std::min(min, *p_iter);
max = std::max(max, *p_iter);
}
icoordinates.setChart(typename ISection::chart_type(min, max+1));
for(typename Section::chart_type::const_iterator p_iter = chart.begin(); p_iter != chart.end(); ++p_iter) {
icoordinates.setFiberDimension(*p_iter, coordinates.getFiberDimension(*p_iter));
}
icoordinates.allocatePoint();
for(typename Section::chart_type::const_iterator p_iter = chart.begin(); p_iter != chart.end(); ++p_iter) {
icoordinates.updatePoint(*p_iter, coordinates.restrictPoint(*p_iter));
}
}
template<typename IMesh, typename Label>
static void convertLabel(IMesh& imesh, const std::string& name, const Obj<Label>& oldLabel) {
const Obj<typename IMesh::label_type>& label = imesh.createLabel(name);
const typename IMesh::sieve_type::chart_type& chart = imesh.getSieve()->getChart();
int size = 0;
label->setChart(chart);
for(typename IMesh::point_type p = chart.min(); p < chart.max(); ++p) {
const int coneSize = oldLabel->cone(p)->size();
label->setConeSize(p, coneSize);
size += coneSize;
}
if (size) {label->setSupportSize(0, size);}
label->allocate();
for(typename IMesh::point_type p = chart.min(); p < chart.max(); ++p) {
const Obj<typename Label::coneSequence>& cone = oldLabel->cone(p);
if (cone->size()) {
label->setCone(*cone->begin(), p);
}
}
label->recalculateLabel();
}
template<typename Mesh, typename IMesh, typename Renumbering>
static void convertMesh(Mesh& mesh, IMesh& imesh, Renumbering& renumbering, bool renumber = true) {
convertSieve(*mesh.getSieve(), *imesh.getSieve(), renumbering, renumber);
imesh.stratify();
convertOrientation(*mesh.getSieve(), *imesh.getSieve(), renumbering, mesh.getArrowSection("orientation").ptr());
convertCoordinates(*mesh.getRealSection("coordinates"), *imesh.getRealSection("coordinates"), renumbering);
if (mesh.hasRealSection("normals")) {
convertCoordinates(*mesh.getRealSection("normals"), *imesh.getRealSection("normals"), renumbering);
}
const typename Mesh::labels_type& labels = mesh.getLabels();
std::string heightName("height");
std::string depthName("depth");
for(typename Mesh::labels_type::const_iterator l_iter = labels.begin(); l_iter != labels.end(); ++l_iter) {
#ifdef IMESH_NEW_LABELS
if ((l_iter->first != heightName) && (l_iter->first != depthName)) {
convertLabel(imesh, l_iter->first, l_iter->second);
}
#else
imesh.setLabel(l_iter->first, l_iter->second);
#endif
}
}
};
class ISieveSerializer {
public:
template<typename ISieve>
static void writeSieve(const std::string& filename, ISieve& sieve) {
std::ofstream fs;
if (sieve.commRank() == 0) {
fs.open(filename.c_str());
}
writeSieve(fs, sieve);
if (sieve.commRank() == 0) {
fs.close();
}
};
template<typename ISieve>
static void writeSieve(std::ofstream& fs, ISieve& sieve) {
typedef ISieveVisitor::PointRetriever<ISieve> Visitor;
const Obj<typename ISieve::chart_type>& chart = sieve.getChart();
typename ISieve::point_type min = chart->min();
typename ISieve::point_type max = chart->max();
PetscInt *mins = new PetscInt[sieve.commSize()];
PetscInt *maxs = new PetscInt[sieve.commSize()];
// Write sizes
if (sieve.commRank() == 0) {
// Write local
fs << min <<" "<< max << std::endl;
for(typename ISieve::point_type p = min; p < max; ++p) {
fs << sieve.getConeSize(p) << " " << sieve.getSupportSize(p) << std::endl;
}
// Receive and write remote
for(int pr = 1; pr < sieve.commSize(); ++pr) {
PetscInt minp, maxp;
PetscInt *sizes;
MPI_Status status;
PetscErrorCode ierr;
ierr = MPI_Recv(&minp, 1, MPIU_INT, pr, 1, sieve.comm(), &status);CHKERRXX(ierr);
ierr = MPI_Recv(&maxp, 1, MPIU_INT, pr, 1, sieve.comm(), &status);CHKERRXX(ierr);
ierr = PetscMalloc(2*(maxp - minp) * sizeof(PetscInt), &sizes);CHKERRXX(ierr);
ierr = MPI_Recv(sizes, (maxp - minp)*2, MPIU_INT, pr, 1, sieve.comm(), &status);CHKERRXX(ierr);
fs << minp <<" "<< maxp << std::endl;
for(PetscInt s = 0; s < maxp - minp; ++s) {
fs << sizes[s*2+0] << " " << sizes[s*2+1] << std::endl;
}
ierr = PetscFree(sizes);CHKERRXX(ierr);
mins[pr] = minp;
maxs[pr] = maxp;
}
} else {
// Send remote
//PetscInt min = chart->min();
//PetscInt max = chart->max();
PetscInt s = 0;
PetscInt *sizes;
PetscErrorCode ierr;
ierr = MPI_Send(&min, 1, MPIU_INT, 0, 1, sieve.comm());CHKERRXX(ierr);
ierr = MPI_Send(&max, 1, MPIU_INT, 0, 1, sieve.comm());CHKERRXX(ierr);
ierr = PetscMalloc((max - min)*2 * sizeof(PetscInt) + 1, &sizes);CHKERRXX(ierr);
for(typename ISieve::point_type p = min; p < max; ++p, ++s) {
sizes[s*2+0] = sieve.getConeSize(p);
sizes[s*2+1] = sieve.getSupportSize(p);
}
ierr = MPI_Send(sizes, (max - min)*2, MPIU_INT, 0, 1, sieve.comm());CHKERRXX(ierr);
ierr = PetscFree(sizes);CHKERRXX(ierr);
}
// Write covering
if (sieve.commRank() == 0) {
// Write local
Visitor pV(std::max(sieve.getMaxConeSize(), sieve.getMaxSupportSize())+1);
for(typename ISieve::point_type p = min; p < max; ++p) {
sieve.cone(p, pV);
const typename Visitor::point_type *cone = pV.getPoints();
const int cSize = pV.getSize();
if (cSize > 0) {
for(int c = 0; c < cSize; ++c) {
if (c) {fs << " ";}
fs << cone[c];
}
fs << std::endl;
}
pV.clear();
sieve.orientedCone(p, pV);
const typename Visitor::oriented_point_type *oCone = pV.getOrientedPoints();
const int oSize = pV.getOrientedSize();
if (oSize > 0) {
for(int c = 0; c < oSize; ++c) {
if (c) {fs << " ";}
fs << oCone[c].second;
}
fs << std::endl;
}
pV.clear();
sieve.support(p, pV);
const typename Visitor::point_type *support = pV.getPoints();
const int sSize = pV.getSize();
if (sSize > 0) {
for(int s = 0; s < sSize; ++s) {
if (s) {fs << " ";}
fs << support[s];
}
fs << std::endl;
}
pV.clear();
}
// Receive and write remote
for(int pr = 1; pr < sieve.commSize(); ++pr) {
PetscInt size;
PetscInt *data;
PetscInt off = 0;
MPI_Status status;
PetscErrorCode ierr;
ierr = MPI_Recv(&size, 1, MPIU_INT, pr, 1, sieve.comm(), &status);CHKERRXX(ierr);
ierr = PetscMalloc(size*sizeof(PetscInt), &data);CHKERRXX(ierr);
ierr = MPI_Recv(data, size, MPIU_INT, pr, 1, sieve.comm(), &status);CHKERRXX(ierr);
for(typename ISieve::point_type p = mins[pr]; p < maxs[pr]; ++p) {
PetscInt cSize = data[off++];
fs << cSize << std::endl;
if (cSize > 0) {
for(int c = 0; c < cSize; ++c) {
if (c) {fs << " ";}
fs << data[off++];
}
fs << std::endl;
}
PetscInt oSize = data[off++];
if (oSize > 0) {
for(int c = 0; c < oSize; ++c) {
if (c) {fs << " ";}
fs << data[off++];
}
fs << std::endl;
}
PetscInt sSize = data[off++];
fs << sSize << std::endl;
if (sSize > 0) {
for(int s = 0; s < sSize; ++s) {
if (s) {fs << " ";}
fs << data[off++];
}
fs << std::endl;
}
}
assert(off == size);
ierr = PetscFree(data);CHKERRXX(ierr);
}
} else {
// Send remote
Visitor pV(std::max(sieve.getMaxConeSize(), sieve.getMaxSupportSize())+1);
PetscInt totalConeSize = 0;
PetscInt totalSupportSize = 0;
for(typename ISieve::point_type p = min; p < max; ++p) {
totalConeSize += sieve.getConeSize(p);
totalSupportSize += sieve.getSupportSize(p);
}
PetscInt size = (sieve.getChart().size()+totalConeSize)*2 + sieve.getChart().size()+totalSupportSize;
PetscInt off = 0;
PetscInt *data;
PetscErrorCode ierr;
ierr = MPI_Send(&size, 1, MPIU_INT, 0, 1, sieve.comm());CHKERRXX(ierr);
// There is no nice way to make a generic MPI type here. Really sucky
ierr = PetscMalloc(size * sizeof(PetscInt), &data);CHKERRXX(ierr);
for(typename ISieve::point_type p = min; p < max; ++p) {
sieve.cone(p, pV);
const typename Visitor::point_type *cone = pV.getPoints();
const int cSize = pV.getSize();
data[off++] = cSize;
for(int c = 0; c < cSize; ++c) {
data[off++] = cone[c];
}
pV.clear();
sieve.orientedCone(p, pV);
const typename Visitor::oriented_point_type *oCone = pV.getOrientedPoints();
const int oSize = pV.getOrientedSize();
data[off++] = oSize;
for(int c = 0; c < oSize; ++c) {
data[off++] = oCone[c].second;
}
pV.clear();
sieve.support(p, pV);
const typename Visitor::point_type *support = pV.getPoints();
const int sSize = pV.getSize();
data[off++] = sSize;
for(int s = 0; s < sSize; ++s) {
data[off++] = support[s];
}
pV.clear();
}
ierr = MPI_Send(data, size, MPIU_INT, 0, 1, sieve.comm());CHKERRXX(ierr);
ierr = PetscFree(data);CHKERRXX(ierr);
}
delete [] mins;
delete [] maxs;
// Output renumbering
};
template<typename ISieve>
static void loadSieve(const std::string& filename, ISieve& sieve) {
std::ifstream fs;
if (sieve.commRank() == 0) {
fs.open(filename.c_str());
}
loadSieve(fs, sieve);
if (sieve.commRank() == 0) {
fs.close();
}
};
template<typename ISieve>
static void loadSieve(std::ifstream& fs, ISieve& sieve) {
typename ISieve::point_type min, max;
PetscInt *mins = new PetscInt[sieve.commSize()];
PetscInt *maxs = new PetscInt[sieve.commSize()];
PetscInt *totalConeSizes = new PetscInt[sieve.commSize()];
PetscInt *totalSupportSizes = new PetscInt[sieve.commSize()];
// Load sizes
if (sieve.commRank() == 0) {
// Load local
fs >> min;
fs >> max;
sieve.setChart(typename ISieve::chart_type(min, max));
for(typename ISieve::point_type p = min; p < max; ++p) {
typename ISieve::index_type coneSize, supportSize;
fs >> coneSize;
fs >> supportSize;
sieve.setConeSize(p, coneSize);
sieve.setSupportSize(p, supportSize);
}
// Load and send remote
for(int pr = 1; pr < sieve.commSize(); ++pr) {
PetscInt minp, maxp;
PetscInt *sizes;
PetscErrorCode ierr;
fs >> minp;
fs >> maxp;
ierr = MPI_Send(&minp, 1, MPIU_INT, pr, 1, sieve.comm());CHKERRXX(ierr);
ierr = MPI_Send(&maxp, 1, MPIU_INT, pr, 1, sieve.comm());CHKERRXX(ierr);
ierr = PetscMalloc((maxp - minp)*2 * sizeof(PetscInt), &sizes);CHKERRXX(ierr);
totalConeSizes[pr] = 0;
totalSupportSizes[pr] = 0;
for(PetscInt s = 0; s < maxp - minp; ++s) {
fs >> sizes[s*2+0];
fs >> sizes[s*2+1];
totalConeSizes[pr] += sizes[s*2+0];
totalSupportSizes[pr] += sizes[s*2+1];
}
ierr = MPI_Send(sizes, (maxp - minp)*2, MPIU_INT, pr, 1, sieve.comm());CHKERRXX(ierr);
ierr = PetscFree(sizes);CHKERRXX(ierr);
mins[pr] = minp;
maxs[pr] = maxp;
}
} else {
// Load remote
PetscInt s = 0;
PetscInt *sizes;
MPI_Status status;
PetscErrorCode ierr;
ierr = MPI_Recv(&min, 1, MPIU_INT, 0, 1, sieve.comm(), &status);CHKERRXX(ierr);
ierr = MPI_Recv(&max, 1, MPIU_INT, 0, 1, sieve.comm(), &status);CHKERRXX(ierr);
sieve.setChart(typename ISieve::chart_type(min, max));
ierr = PetscMalloc((max - min)*2 * sizeof(PetscInt), &sizes);CHKERRXX(ierr);
ierr = MPI_Recv(sizes, (max - min)*2, MPIU_INT, 0, 1, sieve.comm(), &status);CHKERRXX(ierr);
for(typename ISieve::point_type p = min; p < max; ++p, ++s) {
sieve.setConeSize(p, sizes[s*2+0]);
sieve.setSupportSize(p, sizes[s*2+1]);
}
ierr = PetscFree(sizes);CHKERRXX(ierr);
}
sieve.allocate();
// Load covering
if (sieve.commRank() == 0) {
// Load local
typename ISieve::index_type maxSize = std::max(sieve.getMaxConeSize(), sieve.getMaxSupportSize());
typename ISieve::point_type *points = new typename ISieve::point_type[maxSize];
for(typename ISieve::point_type p = min; p < max; ++p) {
typename ISieve::index_type coneSize = sieve.getConeSize(p);
typename ISieve::index_type supportSize = sieve.getSupportSize(p);
if (coneSize > 0) {
for(int c = 0; c < coneSize; ++c) {
fs >> points[c];
}
sieve.setCone(points, p);
if (sieve.orientedCones()) {
for(int c = 0; c < coneSize; ++c) {
fs >> points[c];
}
sieve.setConeOrientation(points, p);
}
}
if (supportSize > 0) {
for(int s = 0; s < supportSize; ++s) {
fs >> points[s];
}
sieve.setSupport(p, points);
}
}
delete [] points;
// Load and send remote
for(int pr = 1; pr < sieve.commSize(); ++pr) {
PetscInt size = (maxs[pr] - mins[pr])+totalConeSizes[pr]*2 + (maxs[pr] - mins[pr])+totalSupportSizes[pr];
PetscInt off = 0;
PetscInt *data;
PetscErrorCode ierr;
ierr = MPI_Send(&size, 1, MPIU_INT, pr, 1, sieve.comm());CHKERRXX(ierr);
// There is no nice way to make a generic MPI type here. Really sucky
ierr = PetscMalloc(size * sizeof(PetscInt), &data);CHKERRXX(ierr);
for(typename ISieve::point_type p = mins[pr]; p < maxs[pr]; ++p) {
PetscInt coneSize, supportSize;
fs >> coneSize;
data[off++] = coneSize;
if (coneSize > 0) {
for(int c = 0; c < coneSize; ++c) {
fs >> data[off++];
}
for(int c = 0; c < coneSize; ++c) {
fs >> data[off++];
}
}
fs >> supportSize;
data[off++] = supportSize;
if (supportSize > 0) {
for(int s = 0; s < supportSize; ++s) {
fs >> data[off++];
}
}
}
assert(off == size);
ierr = MPI_Send(data, size, MPIU_INT, pr, 1, sieve.comm());CHKERRXX(ierr);
ierr = PetscFree(data);CHKERRXX(ierr);
}
delete [] mins;
delete [] maxs;
} else {
// Load remote
PetscInt size;
PetscInt *data;
PetscInt off = 0;
MPI_Status status;
PetscErrorCode ierr;
ierr = MPI_Recv(&size, 1, MPIU_INT, 0, 1, sieve.comm(), &status);CHKERRXX(ierr);
ierr = PetscMalloc(size*sizeof(PetscInt), &data);CHKERRXX(ierr);
ierr = MPI_Recv(data, size, MPIU_INT, 0, 1, sieve.comm(), &status);CHKERRXX(ierr);
for(typename ISieve::point_type p = min; p < max; ++p) {
typename ISieve::index_type coneSize = sieve.getConeSize(p);
typename ISieve::index_type supportSize = sieve.getSupportSize(p);
PetscInt cs = data[off++];
assert(cs == coneSize);
if (coneSize > 0) {
sieve.setCone(&data[off], p);
off += coneSize;
if (sieve.orientedCones()) {
sieve.setConeOrientation(&data[off], p);
off += coneSize;
}
}
PetscInt ss = data[off++];
assert(ss == supportSize);
if (supportSize > 0) {
sieve.setSupport(p, &data[off]);
off += supportSize;
}
}
assert(off == size);
}
// Load renumbering
};
};
}
#endif
|