/usr/include/dune/grid/yaspgrid.hh is in libdune-grid-dev 2.5.1-1.
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 | // -*- tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*-
// vi: set et ts=4 sw=2 sts=2:
#ifndef DUNE_GRID_YASPGRID_HH
#define DUNE_GRID_YASPGRID_HH
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
// either include stdint.h or provide fallback for uint8_t
#if HAVE_STDINT_H
#include <stdint.h>
#else
typedef unsigned char uint8_t;
#endif
#include <dune/grid/common/backuprestore.hh>
#include <dune/grid/common/grid.hh> // the grid base classes
#include <dune/grid/common/capabilities.hh> // the capabilities
#include <dune/common/power.hh>
#include <dune/common/bigunsignedint.hh>
#include <dune/common/typetraits.hh>
#include <dune/common/reservedvector.hh>
#include <dune/common/parallel/collectivecommunication.hh>
#include <dune/common/parallel/mpihelper.hh>
#include <dune/common/deprecated.hh>
#include <dune/geometry/axisalignedcubegeometry.hh>
#include <dune/geometry/type.hh>
#include <dune/grid/common/indexidset.hh>
#include <dune/grid/common/datahandleif.hh>
#if HAVE_MPI
#include <dune/common/parallel/mpicollectivecommunication.hh>
#endif
/*! \file yaspgrid.hh
* YaspGrid stands for yet another structured parallel grid.
* It will implement the dune grid interface for structured grids
* with arbitrary overlap, parallel features with two overlap
* models, periodic boundaries and a fast implementation allowing on-the-fly computations.
*/
namespace Dune {
/* some sizes for building global ids
*/
const int yaspgrid_dim_bits = 24; // bits for encoding each dimension
const int yaspgrid_level_bits = 5; // bits for encoding level number
//************************************************************************
// forward declaration of templates
template<int dim, class Coordinates> class YaspGrid;
template<int mydim, int cdim, class GridImp> class YaspGeometry;
template<int codim, int dim, class GridImp> class YaspEntity;
template<int codim, class GridImp> class YaspEntityPointer;
template<int codim, class GridImp> class YaspEntitySeed;
template<int codim, PartitionIteratorType pitype, class GridImp> class YaspLevelIterator;
template<class GridImp> class YaspIntersectionIterator;
template<class GridImp> class YaspIntersection;
template<class GridImp> class YaspHierarchicIterator;
template<class GridImp, bool isLeafIndexSet> class YaspIndexSet;
template<class GridImp> class YaspGlobalIdSet;
template<class GridImp> class YaspPersistentContainerIndex;
} // namespace Dune
#include <dune/grid/yaspgrid/coordinates.hh>
#include <dune/grid/yaspgrid/torus.hh>
#include <dune/grid/yaspgrid/ygrid.hh>
#include <dune/grid/yaspgrid/yaspgridgeometry.hh>
#include <dune/grid/yaspgrid/yaspgridentity.hh>
#include <dune/grid/yaspgrid/yaspgridintersection.hh>
#include <dune/grid/yaspgrid/yaspgridintersectioniterator.hh>
#include <dune/grid/yaspgrid/yaspgridhierarchiciterator.hh>
#include <dune/grid/yaspgrid/yaspgridentityseed.hh>
#include <dune/grid/yaspgrid/yaspgridentitypointer.hh>
#include <dune/grid/yaspgrid/yaspgridleveliterator.hh>
#include <dune/grid/yaspgrid/yaspgridindexsets.hh>
#include <dune/grid/yaspgrid/yaspgrididset.hh>
#include <dune/grid/yaspgrid/yaspgridpersistentcontainer.hh>
namespace Dune {
template<int dim, class Coordinates>
struct YaspGridFamily
{
#if HAVE_MPI
typedef CollectiveCommunication<MPI_Comm> CCType;
#else
typedef CollectiveCommunication<No_Comm> CCType;
#endif
typedef GridTraits<dim, // dimension of the grid
dim, // dimension of the world space
Dune::YaspGrid<dim, Coordinates>,
YaspGeometry,YaspEntity,
YaspLevelIterator, // type used for the level iterator
YaspIntersection, // leaf intersection
YaspIntersection, // level intersection
YaspIntersectionIterator, // leaf intersection iter
YaspIntersectionIterator, // level intersection iter
YaspHierarchicIterator,
YaspLevelIterator, // type used for the leaf(!) iterator
YaspIndexSet< const YaspGrid< dim, Coordinates >, false >, // level index set
YaspIndexSet< const YaspGrid< dim, Coordinates >, true >, // leaf index set
YaspGlobalIdSet<const YaspGrid<dim, Coordinates> >,
bigunsignedint<dim*yaspgrid_dim_bits+yaspgrid_level_bits+dim>,
YaspGlobalIdSet<const YaspGrid<dim, Coordinates> >,
bigunsignedint<dim*yaspgrid_dim_bits+yaspgrid_level_bits+dim>,
CCType,
DefaultLevelGridViewTraits, DefaultLeafGridViewTraits,
YaspEntitySeed>
Traits;
};
#ifndef DOXYGEN
template<int dim, int codim>
struct YaspCommunicateMeta {
template<class G, class DataHandle>
static void comm (const G& g, DataHandle& data, InterfaceType iftype, CommunicationDirection dir, int level)
{
if (data.contains(dim,codim))
{
g.template communicateCodim<DataHandle,codim>(data,iftype,dir,level);
}
YaspCommunicateMeta<dim,codim-1>::comm(g,data,iftype,dir,level);
}
};
template<int dim>
struct YaspCommunicateMeta<dim,0> {
template<class G, class DataHandle>
static void comm (const G& g, DataHandle& data, InterfaceType iftype, CommunicationDirection dir, int level)
{
if (data.contains(dim,0))
g.template communicateCodim<DataHandle,0>(data,iftype,dir,level);
}
};
#endif
//************************************************************************
/*!
* \brief [<em> provides \ref Dune::Grid </em>]
* \brief Provides a distributed structured cube mesh.
* \ingroup GridImplementations
*
* YaspGrid stands for yet another structured parallel grid.
* It implements the dune grid interface for structured grids
* with arbitrary overlap (including zero),
* periodic boundaries, and a fast implementation allowing on-the-fly computations.
*
* YaspGrid supports three coordinate modes: \ref EquidistantCoordinates,
* \ref EquidistantOffsetCoordinates, and \ref Dune::TensorProductCoordinates.
*
* \tparam dim The dimension of the grid and its surrounding world
* \tparam Coordinates The coordinate mode of the grid.
*/
template<int dim, class Coordinates = EquidistantCoordinates<double, dim> >
class YaspGrid
: public GridDefaultImplementation<dim,dim,typename Coordinates::ctype,YaspGridFamily<dim, Coordinates> >
{
template<int, PartitionIteratorType, typename>
friend class YaspLevelIterator;
template<typename>
friend class YaspHierarchicIterator;
protected:
using GridDefaultImplementation<dim,dim,typename Coordinates::ctype,YaspGridFamily<dim, Coordinates> >::getRealImplementation;
public:
//! Type used for coordinates
typedef typename Coordinates::ctype ctype;
#if HAVE_MPI
typedef CollectiveCommunication<MPI_Comm> CollectiveCommunicationType;
#else
typedef CollectiveCommunication<No_Comm> CollectiveCommunicationType;
#endif
#ifndef DOXYGEN
typedef typename Dune::YGrid<Coordinates> YGrid;
typedef typename Dune::YGridList<Coordinates>::Intersection Intersection;
/** \brief A single grid level within a YaspGrid
*/
struct YGridLevel {
/** \brief Level number of this level grid */
int level() const
{
return level_;
}
Coordinates coords;
std::array<YGrid, dim+1> overlapfront;
std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power> overlapfront_data;
std::array<YGrid, dim+1> overlap;
std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power> overlap_data;
std::array<YGrid, dim+1> interiorborder;
std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power> interiorborder_data;
std::array<YGrid, dim+1> interior;
std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power> interior_data;
std::array<YGridList<Coordinates>,dim+1> send_overlapfront_overlapfront;
std::array<std::deque<Intersection>, StaticPower<2,dim>::power> send_overlapfront_overlapfront_data;
std::array<YGridList<Coordinates>,dim+1> recv_overlapfront_overlapfront;
std::array<std::deque<Intersection>, StaticPower<2,dim>::power> recv_overlapfront_overlapfront_data;
std::array<YGridList<Coordinates>,dim+1> send_overlap_overlapfront;
std::array<std::deque<Intersection>, StaticPower<2,dim>::power> send_overlap_overlapfront_data;
std::array<YGridList<Coordinates>,dim+1> recv_overlapfront_overlap;
std::array<std::deque<Intersection>, StaticPower<2,dim>::power> recv_overlapfront_overlap_data;
std::array<YGridList<Coordinates>,dim+1> send_interiorborder_interiorborder;
std::array<std::deque<Intersection>, StaticPower<2,dim>::power> send_interiorborder_interiorborder_data;
std::array<YGridList<Coordinates>,dim+1> recv_interiorborder_interiorborder;
std::array<std::deque<Intersection>, StaticPower<2,dim>::power> recv_interiorborder_interiorborder_data;
std::array<YGridList<Coordinates>,dim+1> send_interiorborder_overlapfront;
std::array<std::deque<Intersection>, StaticPower<2,dim>::power> send_interiorborder_overlapfront_data;
std::array<YGridList<Coordinates>,dim+1> recv_overlapfront_interiorborder;
std::array<std::deque<Intersection>, StaticPower<2,dim>::power> recv_overlapfront_interiorborder_data;
// general
YaspGrid<dim,Coordinates>* mg; // each grid level knows its multigrid
int overlapSize; // in mesh cells on this level
bool keepOverlap;
/** \brief The level number within the YaspGrid level hierarchy */
int level_;
};
//! define types used for arguments
typedef std::array<int, dim> iTupel;
typedef FieldVector<ctype, dim> fTupel;
// communication tag used by multigrid
enum { tag = 17 };
#endif
//! return reference to torus
const Torus<CollectiveCommunicationType, dim>& torus () const
{
return _torus;
}
//! return number of cells on finest level in given direction on all processors
int globalSize(int i) const
{
return levelSize(maxLevel(),i);
}
//! return number of cells on finest level on all processors
iTupel globalSize() const
{
return levelSize(maxLevel());
}
//! return size of the grid (in cells) on level l in direction i
int levelSize(int l, int i) const
{
return _coarseSize[i] * (1 << l);
}
//! return size vector of the grid (in cells) on level l
iTupel levelSize(int l) const
{
iTupel s;
for (int i=0; i<dim; ++i)
s[i] = levelSize(l,i);
return s;
}
//! return whether the grid is periodic in direction i
bool isPeriodic(int i) const
{
return _periodic[i];
}
bool getRefineOption() const
{
return keep_ovlp;
}
//! Iterator over the grid levels
typedef typename ReservedVector<YGridLevel,32>::const_iterator YGridLevelIterator;
//! return iterator pointing to coarsest level
YGridLevelIterator begin () const
{
return YGridLevelIterator(_levels,0);
}
//! return iterator pointing to given level
YGridLevelIterator begin (int i) const
{
if (i<0 || i>maxLevel())
DUNE_THROW(GridError, "level not existing");
return YGridLevelIterator(_levels,i);
}
//! return iterator pointing to one past the finest level
YGridLevelIterator end () const
{
return YGridLevelIterator(_levels,maxLevel()+1);
}
// static method to create the default load balance strategy
static const YLoadBalanceDefault<dim>* defaultLoadbalancer()
{
static YLoadBalanceDefault<dim> lb;
return & lb;
}
protected:
/** \brief Make a new YGridLevel structure
*
* \param coords the coordinate container
* \param periodic indicate periodicity for each direction
* \param o_interior origin of interior (non-overlapping) cell decomposition
* \param overlap to be used on this grid level
*/
void makelevel (const Coordinates& coords, std::bitset<dim> periodic, iTupel o_interior, int overlap)
{
YGridLevel& g = _levels.back();
g.overlapSize = overlap;
g.mg = this;
g.level_ = maxLevel();
g.coords = coords;
g.keepOverlap = keep_ovlp;
// set the inserting positions in the corresponding arrays of YGridLevelStructure
typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator overlapfront_it = g.overlapfront_data.begin();
typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator overlap_it = g.overlap_data.begin();
typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator interiorborder_it = g.interiorborder_data.begin();
typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator interior_it = g.interior_data.begin();
typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
send_overlapfront_overlapfront_it = g.send_overlapfront_overlapfront_data.begin();
typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
recv_overlapfront_overlapfront_it = g.recv_overlapfront_overlapfront_data.begin();
typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
send_overlap_overlapfront_it = g.send_overlap_overlapfront_data.begin();
typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
recv_overlapfront_overlap_it = g.recv_overlapfront_overlap_data.begin();
typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
send_interiorborder_interiorborder_it = g.send_interiorborder_interiorborder_data.begin();
typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
recv_interiorborder_interiorborder_it = g.recv_interiorborder_interiorborder_data.begin();
typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
send_interiorborder_overlapfront_it = g.send_interiorborder_overlapfront_data.begin();
typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
recv_overlapfront_interiorborder_it = g.recv_overlapfront_interiorborder_data.begin();
// have a null array for constructor calls around
std::array<int,dim> n;
std::fill(n.begin(), n.end(), 0);
// determine origin of the grid with overlap and store whether an overlap area exists in direction i.
std::bitset<dim> ovlp_low(0ULL);
std::bitset<dim> ovlp_up(0ULL);
iTupel o_overlap;
iTupel s_overlap;
// determine at where we have overlap and how big the size of the overlap partition is
for (int i=0; i<dim; i++)
{
// the coordinate container has been contructed to hold the entire grid on
// this processor, including overlap. this is the element size.
s_overlap[i] = g.coords.size(i);
//in the periodic case there is always overlap
if (periodic[i])
{
o_overlap[i] = o_interior[i]-overlap;
ovlp_low[i] = true;
ovlp_up[i] = true;
}
else
{
//check lower boundary
if (o_interior[i] - overlap < 0)
o_overlap[i] = 0;
else
{
o_overlap[i] = o_interior[i] - overlap;
ovlp_low[i] = true;
}
//check upper boundary
if (o_overlap[i] + g.coords.size(i) < globalSize(i))
ovlp_up[i] = true;
}
}
for (unsigned int codim = 0; codim < dim + 1; codim++)
{
// set the begin iterator for the corresponding ygrids
g.overlapfront[codim].setBegin(overlapfront_it);
g.overlap[codim].setBegin(overlap_it);
g.interiorborder[codim].setBegin(interiorborder_it);
g.interior[codim].setBegin(interior_it);
g.send_overlapfront_overlapfront[codim].setBegin(send_overlapfront_overlapfront_it);
g.recv_overlapfront_overlapfront[codim].setBegin(recv_overlapfront_overlapfront_it);
g.send_overlap_overlapfront[codim].setBegin(send_overlap_overlapfront_it);
g.recv_overlapfront_overlap[codim].setBegin(recv_overlapfront_overlap_it);
g.send_interiorborder_interiorborder[codim].setBegin(send_interiorborder_interiorborder_it);
g.recv_interiorborder_interiorborder[codim].setBegin(recv_interiorborder_interiorborder_it);
g.send_interiorborder_overlapfront[codim].setBegin(send_interiorborder_overlapfront_it);
g.recv_overlapfront_interiorborder[codim].setBegin(recv_overlapfront_interiorborder_it);
// find all combinations of unit vectors that span entities of the given codimension
for (unsigned int index = 0; index < (1<<dim); index++)
{
// check whether the given shift is of our codimension
std::bitset<dim> r(index);
if (r.count() != dim-codim)
continue;
// get an origin and a size array for subsequent modification
std::array<int,dim> origin(o_overlap);
std::array<int,dim> size(s_overlap);
// build overlapfront
// we have to extend the element size by one in all directions without shift.
for (int i=0; i<dim; i++)
if (!r[i])
size[i]++;
*overlapfront_it = YGridComponent<Coordinates>(origin, r, &g.coords, size, n, size);
// build overlap
for (int i=0; i<dim; i++)
{
if (!r[i])
{
if (ovlp_low[i])
{
origin[i]++;
size[i]--;
}
if (ovlp_up[i])
size[i]--;
}
}
*overlap_it = YGridComponent<Coordinates>(origin,size,*overlapfront_it);
// build interiorborder
for (int i=0; i<dim; i++)
{
if (ovlp_low[i])
{
origin[i] += overlap;
size[i] -= overlap;
if (!r[i])
{
origin[i]--;
size[i]++;
}
}
if (ovlp_up[i])
{
size[i] -= overlap;
if (!r[i])
size[i]++;
}
}
*interiorborder_it = YGridComponent<Coordinates>(origin,size,*overlapfront_it);
// build interior
for (int i=0; i<dim; i++)
{
if (!r[i])
{
if (ovlp_low[i])
{
origin[i]++;
size[i]--;
}
if (ovlp_up[i])
size[i]--;
}
}
*interior_it = YGridComponent<Coordinates>(origin, size, *overlapfront_it);
intersections(*overlapfront_it,*overlapfront_it,*send_overlapfront_overlapfront_it, *recv_overlapfront_overlapfront_it);
intersections(*overlap_it,*overlapfront_it,*send_overlap_overlapfront_it, *recv_overlapfront_overlap_it);
intersections(*interiorborder_it,*interiorborder_it,*send_interiorborder_interiorborder_it,*recv_interiorborder_interiorborder_it);
intersections(*interiorborder_it,*overlapfront_it,*send_interiorborder_overlapfront_it,*recv_overlapfront_interiorborder_it);
// advance all iterators pointing to the next insertion point
++overlapfront_it;
++overlap_it;
++interiorborder_it;
++interior_it;
++send_overlapfront_overlapfront_it;
++recv_overlapfront_overlapfront_it;
++send_overlap_overlapfront_it;
++recv_overlapfront_overlap_it;
++send_interiorborder_interiorborder_it;
++recv_interiorborder_interiorborder_it;
++send_interiorborder_overlapfront_it;
++recv_overlapfront_interiorborder_it;
}
// set end iterators in the corresonding ygrids
g.overlapfront[codim].finalize(overlapfront_it);
g.overlap[codim].finalize(overlap_it);
g.interiorborder[codim].finalize(interiorborder_it);
g.interior[codim].finalize(interior_it);
g.send_overlapfront_overlapfront[codim].finalize(send_overlapfront_overlapfront_it,g.overlapfront[codim]);
g.recv_overlapfront_overlapfront[codim].finalize(recv_overlapfront_overlapfront_it,g.overlapfront[codim]);
g.send_overlap_overlapfront[codim].finalize(send_overlap_overlapfront_it,g.overlapfront[codim]);
g.recv_overlapfront_overlap[codim].finalize(recv_overlapfront_overlap_it,g.overlapfront[codim]);
g.send_interiorborder_interiorborder[codim].finalize(send_interiorborder_interiorborder_it,g.overlapfront[codim]);
g.recv_interiorborder_interiorborder[codim].finalize(recv_interiorborder_interiorborder_it,g.overlapfront[codim]);
g.send_interiorborder_overlapfront[codim].finalize(send_interiorborder_overlapfront_it,g.overlapfront[codim]);
g.recv_overlapfront_interiorborder[codim].finalize(recv_overlapfront_interiorborder_it,g.overlapfront[codim]);
}
}
#ifndef DOXYGEN
/** \brief special data structure to communicate ygrids
* Historically, this was needed because Ygrids had virtual functions and
* a communicated virtual function table pointer introduced a bug. After the
* change to tensorproductgrid, the dynamic polymorphism was removed, still this
* is kept because it allows to communicate ygrids, that only have index, but no
* coordinate information. This is sufficient, because all communicated YGrids are
* intersected with a local grid, which has coordinate information.
*/
struct mpifriendly_ygrid {
mpifriendly_ygrid ()
{
std::fill(origin.begin(), origin.end(), 0);
std::fill(size.begin(), size.end(), 0);
}
mpifriendly_ygrid (const YGridComponent<Coordinates>& grid)
: origin(grid.origin()), size(grid.size())
{}
iTupel origin;
iTupel size;
};
#endif
/** \brief Construct list of intersections with neighboring processors
*
* \param recvgrid the grid stored in this processor
* \param sendgrid the subgrid to be sent to neighboring processors
* \param sendlist the deque to fill with send intersections
* \param recvlist the deque to fill with recv intersections
* \returns two lists: Intersections to be sent and Intersections to be received
*/
void intersections(const YGridComponent<Coordinates>& sendgrid, const YGridComponent<Coordinates>& recvgrid,
std::deque<Intersection>& sendlist, std::deque<Intersection>& recvlist)
{
iTupel size = globalSize();
// the exchange buffers
std::vector<YGridComponent<Coordinates> > send_recvgrid(_torus.neighbors());
std::vector<YGridComponent<Coordinates> > recv_recvgrid(_torus.neighbors());
std::vector<YGridComponent<Coordinates> > send_sendgrid(_torus.neighbors());
std::vector<YGridComponent<Coordinates> > recv_sendgrid(_torus.neighbors());
// new exchange buffers to send simple struct without virtual functions
std::vector<mpifriendly_ygrid> mpifriendly_send_recvgrid(_torus.neighbors());
std::vector<mpifriendly_ygrid> mpifriendly_recv_recvgrid(_torus.neighbors());
std::vector<mpifriendly_ygrid> mpifriendly_send_sendgrid(_torus.neighbors());
std::vector<mpifriendly_ygrid> mpifriendly_recv_sendgrid(_torus.neighbors());
// fill send buffers; iterate over all neighboring processes
// non-periodic case is handled automatically because intersection will be zero
for (typename Torus<CollectiveCommunicationType,dim>::ProcListIterator i=_torus.sendbegin(); i!=_torus.sendend(); ++i)
{
// determine if we communicate with this neighbor (and what)
bool skip = false;
iTupel coord = _torus.coord(); // my coordinates
iTupel delta = i.delta(); // delta to neighbor
iTupel nb = coord; // the neighbor
for (int k=0; k<dim; k++) nb[k] += delta[k];
iTupel v; // grid movement
std::fill(v.begin(), v.end(), 0);
for (int k=0; k<dim; k++)
{
if (nb[k]<0)
{
if (_periodic[k])
v[k] += size[k];
else
skip = true;
}
if (nb[k]>=_torus.dims(k))
{
if (_periodic[k])
v[k] -= size[k];
else
skip = true;
}
// neither might be true, then v=0
}
// store moved grids in send buffers
if (!skip)
{
send_sendgrid[i.index()] = sendgrid.move(v);
send_recvgrid[i.index()] = recvgrid.move(v);
}
else
{
send_sendgrid[i.index()] = YGridComponent<Coordinates>();
send_recvgrid[i.index()] = YGridComponent<Coordinates>();
}
}
// issue send requests for sendgrid being sent to all neighbors
for (typename Torus<CollectiveCommunicationType,dim>::ProcListIterator i=_torus.sendbegin(); i!=_torus.sendend(); ++i)
{
mpifriendly_send_sendgrid[i.index()] = mpifriendly_ygrid(send_sendgrid[i.index()]);
_torus.send(i.rank(), &mpifriendly_send_sendgrid[i.index()], sizeof(mpifriendly_ygrid));
}
// issue recv requests for sendgrids of neighbors
for (typename Torus<CollectiveCommunicationType,dim>::ProcListIterator i=_torus.recvbegin(); i!=_torus.recvend(); ++i)
_torus.recv(i.rank(), &mpifriendly_recv_sendgrid[i.index()], sizeof(mpifriendly_ygrid));
// exchange the sendgrids
_torus.exchange();
// issue send requests for recvgrid being sent to all neighbors
for (typename Torus<CollectiveCommunicationType,dim>::ProcListIterator i=_torus.sendbegin(); i!=_torus.sendend(); ++i)
{
mpifriendly_send_recvgrid[i.index()] = mpifriendly_ygrid(send_recvgrid[i.index()]);
_torus.send(i.rank(), &mpifriendly_send_recvgrid[i.index()], sizeof(mpifriendly_ygrid));
}
// issue recv requests for recvgrid of neighbors
for (typename Torus<CollectiveCommunicationType,dim>::ProcListIterator i=_torus.recvbegin(); i!=_torus.recvend(); ++i)
_torus.recv(i.rank(), &mpifriendly_recv_recvgrid[i.index()], sizeof(mpifriendly_ygrid));
// exchange the recvgrid
_torus.exchange();
// process receive buffers and compute intersections
for (typename Torus<CollectiveCommunicationType,dim>::ProcListIterator i=_torus.recvbegin(); i!=_torus.recvend(); ++i)
{
// what must be sent to this neighbor
Intersection send_intersection;
mpifriendly_ygrid yg = mpifriendly_recv_recvgrid[i.index()];
recv_recvgrid[i.index()] = YGridComponent<Coordinates>(yg.origin,yg.size);
send_intersection.grid = sendgrid.intersection(recv_recvgrid[i.index()]);
send_intersection.rank = i.rank();
send_intersection.distance = i.distance();
if (!send_intersection.grid.empty()) sendlist.push_front(send_intersection);
Intersection recv_intersection;
yg = mpifriendly_recv_sendgrid[i.index()];
recv_sendgrid[i.index()] = YGridComponent<Coordinates>(yg.origin,yg.size);
recv_intersection.grid = recvgrid.intersection(recv_sendgrid[i.index()]);
recv_intersection.rank = i.rank();
recv_intersection.distance = i.distance();
if(!recv_intersection.grid.empty()) recvlist.push_back(recv_intersection);
}
}
protected:
typedef const YaspGrid<dim,Coordinates> GridImp;
void init()
{
Yasp::BinomialTable<dim>::init();
Yasp::EntityShiftTable<Yasp::calculate_entity_shift<dim>,dim>::init();
Yasp::EntityShiftTable<Yasp::calculate_entity_move<dim>,dim>::init();
indexsets.push_back( std::make_shared< YaspIndexSet<const YaspGrid<dim, Coordinates>, false > >(*this,0) );
boundarysegmentssize();
}
void boundarysegmentssize()
{
// sizes of local macro grid
std::array<int, dim> sides;
{
for (int i=0; i<dim; i++)
{
sides[i] =
((begin()->overlap[0].dataBegin()->origin(i) == 0)+
(begin()->overlap[0].dataBegin()->origin(i) + begin()->overlap[0].dataBegin()->size(i)
== levelSize(0,i)));
}
}
nBSegments = 0;
for (int k=0; k<dim; k++)
{
int offset = 1;
for (int l=0; l<dim; l++)
{
if (l==k) continue;
offset *= begin()->overlap[0].dataBegin()->size(l);
}
nBSegments += sides[k]*offset;
}
}
public:
// define the persistent index type
typedef bigunsignedint<dim*yaspgrid_dim_bits+yaspgrid_level_bits+dim> PersistentIndexType;
//! the GridFamily of this grid
typedef YaspGridFamily<dim, Coordinates> GridFamily;
// the Traits
typedef typename YaspGridFamily<dim, Coordinates>::Traits Traits;
// need for friend declarations in entity
typedef YaspIndexSet<YaspGrid<dim, Coordinates>, false > LevelIndexSetType;
typedef YaspIndexSet<YaspGrid<dim, Coordinates>, true > LeafIndexSetType;
typedef YaspGlobalIdSet<YaspGrid<dim, Coordinates> > GlobalIdSetType;
/** Standard constructor for an equidistant YaspGrid
* @param L extension of the domain
* @param s number of cells on coarse mesh in each direction
* @param periodic tells if direction is periodic or not
* @param overlap size of overlap on coarsest grid (same in all directions)
* @param comm the collective communication object for this grid. An MPI communicator can be given here.
* @param lb pointer to an overloaded YLoadBalance instance
*/
YaspGrid (Dune::FieldVector<ctype, dim> L,
std::array<int, dim> s,
std::bitset<dim> periodic = std::bitset<dim>(0ULL),
int overlap = 1,
CollectiveCommunicationType comm = CollectiveCommunicationType(),
const YLoadBalance<dim>* lb = defaultLoadbalancer())
: ccobj(comm), _torus(comm,tag,s,lb), leafIndexSet_(*this),
_L(L), _periodic(periodic), _coarseSize(s), _overlap(overlap),
keep_ovlp(true), adaptRefCount(0), adaptActive(false)
{
// check whether YaspGrid has been given the correct template parameter
static_assert(std::is_same<Coordinates,EquidistantCoordinates<ctype,dim> >::value,
"YaspGrid coordinate container template parameter and given constructor values do not match!");
_levels.resize(1);
iTupel o;
std::fill(o.begin(), o.end(), 0);
iTupel o_interior(o);
iTupel s_interior(s);
_torus.partition(_torus.rank(),o,s,o_interior,s_interior);
#if HAVE_MPI
// check whether the grid is large enough to be overlapping
for (int i=0; i<dim; i++)
{
// find out whether the grid is too small to
int toosmall = (s_interior[i] <= overlap) && // interior is very small
(periodic[i] || (s_interior[i] != s[i])); // there is an overlap in that direction
// communicate the result to all those processes to have all processors error out if one process failed.
int global = 0;
MPI_Allreduce(&toosmall, &global, 1, MPI_INT, MPI_LOR, comm);
if (global)
DUNE_THROW(Dune::GridError,"YaspGrid is too small to be overlapping");
}
#endif // #if HAVE_MPI
fTupel h(L);
for (int i=0; i<dim; i++)
h[i] /= s[i];
iTupel s_overlap(s_interior);
for (int i=0; i<dim; i++)
{
if ((o_interior[i] - overlap > 0) || (periodic[i]))
s_overlap[i] += overlap;
if ((o_interior[i] + s_interior[i] + overlap <= _coarseSize[i]) || (periodic[i]))
s_overlap[i] += overlap;
}
EquidistantCoordinates<ctype,dim> cc(h,s_overlap);
// add level
makelevel(cc,periodic,o_interior,overlap);
init();
}
/** Constructor for an equidistant YaspGrid with non-trivial origin
* @param lowerleft Lower left corner of the domain
* @param upperright Upper right corner of the domain
* @param s number of cells on coarse mesh in each direction
* @param periodic tells if direction is periodic or not
* @param overlap size of overlap on coarsest grid (same in all directions)
* @param comm the collective communication object for this grid. An MPI communicator can be given here.
* @param lb pointer to an overloaded YLoadBalance instance
*/
YaspGrid (Dune::FieldVector<ctype, dim> lowerleft,
Dune::FieldVector<ctype, dim> upperright,
std::array<int, dim> s,
std::bitset<dim> periodic = std::bitset<dim>(0ULL),
int overlap = 1,
CollectiveCommunicationType comm = CollectiveCommunicationType(),
const YLoadBalance<dim>* lb = defaultLoadbalancer())
: ccobj(comm), _torus(comm,tag,s,lb), leafIndexSet_(*this),
_L(upperright - lowerleft),
_periodic(periodic), _coarseSize(s), _overlap(overlap),
keep_ovlp(true), adaptRefCount(0), adaptActive(false)
{
// check whether YaspGrid has been given the correct template parameter
static_assert(std::is_same<Coordinates,EquidistantOffsetCoordinates<ctype,dim> >::value,
"YaspGrid coordinate container template parameter and given constructor values do not match!");
_levels.resize(1);
iTupel o;
std::fill(o.begin(), o.end(), 0);
iTupel o_interior(o);
iTupel s_interior(s);
_torus.partition(_torus.rank(),o,s,o_interior,s_interior);
#if HAVE_MPI
// check whether the grid is large enough to be overlapping
for (int i=0; i<dim; i++)
{
// find out whether the grid is too small to
int toosmall = (s_interior[i] <= overlap) && // interior is very small
(periodic[i] || (s_interior[i] != s[i])); // there is an overlap in that direction
// communicate the result to all those processes to have all processors error out if one process failed.
int global = 0;
MPI_Allreduce(&toosmall, &global, 1, MPI_INT, MPI_LOR, comm);
if (global)
DUNE_THROW(Dune::GridError,"YaspGrid is too small to be overlapping");
}
#endif // #if HAVE_MPI
Dune::FieldVector<ctype,dim> extension(upperright);
Dune::FieldVector<ctype,dim> h;
for (int i=0; i<dim; i++)
{
extension[i] -= lowerleft[i];
h[i] = extension[i] / s[i];
}
iTupel s_overlap(s_interior);
for (int i=0; i<dim; i++)
{
if ((o_interior[i] - overlap > 0) || (periodic[i]))
s_overlap[i] += overlap;
if ((o_interior[i] + s_interior[i] + overlap <= _coarseSize[i]) || (periodic[i]))
s_overlap[i] += overlap;
}
EquidistantOffsetCoordinates<ctype,dim> cc(lowerleft,h,s_overlap);
// add level
makelevel(cc,periodic,o_interior,overlap);
init();
}
/** @brief Standard constructor for a tensorproduct YaspGrid
* @param coords coordinate vectors to be used for coarse grid
* @param periodic tells if direction is periodic or not
* @param overlap size of overlap on coarsest grid (same in all directions)
* @param comm the collective communication object for this grid. An MPI communicator can be given here.
* @param lb pointer to an overloaded YLoadBalance instance
*/
YaspGrid (std::array<std::vector<ctype>, dim> coords,
std::bitset<dim> periodic = std::bitset<dim>(0ULL),
int overlap = 1,
CollectiveCommunicationType comm = CollectiveCommunicationType(),
const YLoadBalance<dim>* lb = defaultLoadbalancer())
: ccobj(comm), _torus(comm,tag,Dune::Yasp::sizeArray<dim>(coords),lb),
leafIndexSet_(*this), _periodic(periodic), _overlap(overlap),
keep_ovlp(true), adaptRefCount(0), adaptActive(false)
{
if (!Dune::Yasp::checkIfMonotonous(coords))
DUNE_THROW(Dune::GridError,"Setup of a tensorproduct grid requires monotonous sequences of coordinates.");
// check whether YaspGrid has been given the correct template parameter
static_assert(std::is_same<Coordinates,TensorProductCoordinates<ctype,dim> >::value,
"YaspGrid coordinate container template parameter and given constructor values do not match!");
_levels.resize(1);
//determine sizes of vector to correctly construct torus structure and store for later size requests
for (int i=0; i<dim; i++) {
_coarseSize[i] = coords[i].size() - 1;
_L[i] = coords[i][_coarseSize[i]] - coords[i][0];
}
iTupel o;
std::fill(o.begin(), o.end(), 0);
iTupel o_interior(o);
iTupel s_interior(_coarseSize);
_torus.partition(_torus.rank(),o,_coarseSize,o_interior,s_interior);
#if HAVE_MPI
// check whether the grid is large enough to be overlapping
for (int i=0; i<dim; i++)
{
// find out whether the grid is too small to
int toosmall = (s_interior[i] <= overlap) && // interior is very small
(periodic[i] || (s_interior[i] != _coarseSize[i])); // there is an overlap in that direction
// communicate the result to all those processes to have all processors error out if one process failed.
int global = 0;
MPI_Allreduce(&toosmall, &global, 1, MPI_INT, MPI_LOR, comm);
if (global)
DUNE_THROW(Dune::GridError,"YaspGrid is too small to be overlapping");
}
#endif // #if HAVE_MPI
std::array<std::vector<ctype>,dim> newcoords;
std::array<int, dim> offset(o_interior);
// find the relevant part of the coords vector for this processor and copy it to newcoords
for (int i=0; i<dim; ++i)
{
//define iterators on coords that specify the coordinate range to be used
typename std::vector<ctype>::iterator begin = coords[i].begin() + o_interior[i];
typename std::vector<ctype>::iterator end = begin + s_interior[i] + 1;
// check whether we are not at the physical boundary. In that case overlap is a simple
// extension of the coordinate range to be used
if (o_interior[i] - overlap > 0)
{
begin = begin - overlap;
offset[i] -= overlap;
}
if (o_interior[i] + s_interior[i] + overlap < _coarseSize[i])
end = end + overlap;
//copy the selected part in the new coord vector
newcoords[i].resize(end-begin);
std::copy(begin, end, newcoords[i].begin());
// check whether we are at the physical boundary and a have a periodic grid.
// In this case the coordinate vector has to be tweaked manually.
if ((periodic[i]) && (o_interior[i] + s_interior[i] + overlap >= _coarseSize[i]))
{
// we need to add the first <overlap> cells to the end of newcoords
typename std::vector<ctype>::iterator it = coords[i].begin();
for (int j=0; j<overlap; ++j)
newcoords[i].push_back(newcoords[i].back() - *it + *(++it));
}
if ((periodic[i]) && (o_interior[i] - overlap <= 0))
{
offset[i] -= overlap;
// we need to add the last <overlap> cells to the begin of newcoords
typename std::vector<ctype>::iterator it = coords[i].end() - 1;
for (int j=0; j<overlap; ++j)
newcoords[i].insert(newcoords[i].begin(), newcoords[i].front() - *it + *(--it));
}
}
TensorProductCoordinates<ctype,dim> cc(newcoords, offset);
// add level
makelevel(cc,periodic,o_interior,overlap);
init();
}
private:
/** @brief Constructor for a tensorproduct YaspGrid with only coordinate
* information on this processor
* @param comm MPI communicator where this mesh is distributed to
* @param coords coordinate vectors to be used for coarse grid
* @param periodic tells if direction is periodic or not
* @param overlap size of overlap on coarsest grid (same in all directions)
* @param coarseSize the coarse size of the global grid
* @param lb pointer to an overloaded YLoadBalance instance
*
* @warning The construction of overlapping coordinate ranges is
* an error-prone procedure. For this reason, it is kept private.
* You can safely use it through BackupRestoreFacility. All other
* use is not supported for the moment.
*/
YaspGrid (std::array<std::vector<ctype>, dim> coords,
std::bitset<dim> periodic,
int overlap,
CollectiveCommunicationType comm,
std::array<int,dim> coarseSize,
const YLoadBalance<dim>* lb = defaultLoadbalancer())
: ccobj(comm), _torus(comm,tag,coarseSize,lb), leafIndexSet_(*this),
_periodic(periodic), _coarseSize(coarseSize), _overlap(overlap),
keep_ovlp(true), adaptRefCount(0), adaptActive(false)
{
// check whether YaspGrid has been given the correct template parameter
static_assert(std::is_same<Coordinates,TensorProductCoordinates<ctype,dim> >::value,
"YaspGrid coordinate container template parameter and given constructor values do not match!");
if (!Dune::Yasp::checkIfMonotonous(coords))
DUNE_THROW(Dune::GridError,"Setup of a tensorproduct grid requires monotonous sequences of coordinates.");
for (int i=0; i<dim; i++)
_L[i] = coords[i][coords[i].size() - 1] - coords[i][0];
_levels.resize(1);
std::array<int,dim> o;
std::fill(o.begin(), o.end(), 0);
std::array<int,dim> o_interior(o);
std::array<int,dim> s_interior(coarseSize);
_torus.partition(_torus.rank(),o,coarseSize,o_interior,s_interior);
// get offset by modifying o_interior according to overlap
std::array<int,dim> offset(o_interior);
for (int i=0; i<dim; i++)
if ((periodic[i]) || (o_interior[i] > 0))
offset[i] -= overlap;
TensorProductCoordinates<ctype,dim> cc(coords, offset);
// add level
makelevel(cc,periodic,o_interior,overlap);
init();
}
// the backup restore facility needs to be able to use above constructor
friend struct BackupRestoreFacility<YaspGrid<dim,Coordinates> >;
// do not copy this class
YaspGrid(const YaspGrid&);
public:
/*! Return maximum level defined in this grid. Levels are numbered
0 ... maxlevel with 0 the coarsest level.
*/
int maxLevel() const
{
return _levels.size()-1;
}
//! refine the grid refCount times.
void globalRefine (int refCount)
{
if (refCount < -maxLevel())
DUNE_THROW(GridError, "Only " << maxLevel() << " levels left. " <<
"Coarsening " << -refCount << " levels requested!");
// If refCount is negative then coarsen the grid
for (int k=refCount; k<0; k++)
{
// create an empty grid level
YGridLevel empty;
_levels.back() = empty;
// reduce maxlevel
_levels.pop_back();
indexsets.pop_back();
}
// If refCount is positive refine the grid
for (int k=0; k<refCount; k++)
{
// access to coarser grid level
YGridLevel& cg = _levels[maxLevel()];
std::bitset<dim> ovlp_low(0ULL), ovlp_up(0ULL);
for (int i=0; i<dim; i++)
{
if (cg.overlap[0].dataBegin()->origin(i) > 0 || _periodic[i])
ovlp_low[i] = true;
if (cg.overlap[0].dataBegin()->max(i) + 1 < globalSize(i) || _periodic[i])
ovlp_up[i] = true;
}
Coordinates newcont(cg.coords.refine(ovlp_low, ovlp_up, cg.overlapSize, keep_ovlp));
int overlap = (keep_ovlp) ? 2*cg.overlapSize : cg.overlapSize;
//determine new origin
iTupel o_interior;
for (int i=0; i<dim; i++)
o_interior[i] = 2*cg.interior[0].dataBegin()->origin(i);
// add level
_levels.resize(_levels.size() + 1);
makelevel(newcont,_periodic,o_interior,overlap);
indexsets.push_back( std::make_shared<YaspIndexSet<const YaspGrid<dim,Coordinates>, false > >(*this,maxLevel()) );
}
}
/**
\brief set options for refinement
@param keepPhysicalOverlap [true] keep the physical size of the overlap, [false] keep the number of cells in the overlap. Default is [true].
*/
void refineOptions (bool keepPhysicalOverlap)
{
keep_ovlp = keepPhysicalOverlap;
}
/** \brief Marks an entity to be refined/coarsened in a subsequent adapt.
\param[in] refCount Number of subdivisions that should be applied. Negative value means coarsening.
\param[in] e Entity to Entity that should be refined
\return true if Entity was marked, false otherwise.
\note
- On yaspgrid marking one element will mark all other elements of the level as well
- If refCount is lower than refCount of a previous mark-call, nothing is changed
*/
bool mark( int refCount, const typename Traits::template Codim<0>::Entity & e )
{
assert(adaptActive == false);
if (e.level() != maxLevel()) return false;
adaptRefCount = std::max(adaptRefCount, refCount);
return true;
}
/** \brief returns adaptation mark for given entity
\param[in] e Entity for which adaptation mark should be determined
\return int adaptation mark, here the default value 0 is returned
*/
int getMark ( const typename Traits::template Codim<0>::Entity &e ) const
{
return ( e.level() == maxLevel() ) ? adaptRefCount : 0;
}
//! map adapt to global refine
bool adapt ()
{
globalRefine(adaptRefCount);
return (adaptRefCount > 0);
}
//! returns true, if the grid will be coarsened
bool preAdapt ()
{
adaptActive = true;
adaptRefCount = comm().max(adaptRefCount);
return (adaptRefCount < 0);
}
//! clean up some markers
void postAdapt()
{
adaptActive = false;
adaptRefCount = 0;
}
//! one past the end on this level
template<int cd, PartitionIteratorType pitype>
typename Traits::template Codim<cd>::template Partition<pitype>::LevelIterator lbegin (int level) const
{
return levelbegin<cd,pitype>(level);
}
//! Iterator to one past the last entity of given codim on level for partition type
template<int cd, PartitionIteratorType pitype>
typename Traits::template Codim<cd>::template Partition<pitype>::LevelIterator lend (int level) const
{
return levelend<cd,pitype>(level);
}
//! version without second template parameter for convenience
template<int cd>
typename Traits::template Codim<cd>::template Partition<All_Partition>::LevelIterator lbegin (int level) const
{
return levelbegin<cd,All_Partition>(level);
}
//! version without second template parameter for convenience
template<int cd>
typename Traits::template Codim<cd>::template Partition<All_Partition>::LevelIterator lend (int level) const
{
return levelend<cd,All_Partition>(level);
}
//! return LeafIterator which points to the first entity in maxLevel
template<int cd, PartitionIteratorType pitype>
typename Traits::template Codim<cd>::template Partition<pitype>::LeafIterator leafbegin () const
{
return levelbegin<cd,pitype>(maxLevel());
}
//! return LeafIterator which points behind the last entity in maxLevel
template<int cd, PartitionIteratorType pitype>
typename Traits::template Codim<cd>::template Partition<pitype>::LeafIterator leafend () const
{
return levelend<cd,pitype>(maxLevel());
}
//! return LeafIterator which points to the first entity in maxLevel
template<int cd>
typename Traits::template Codim<cd>::template Partition<All_Partition>::LeafIterator leafbegin () const
{
return levelbegin<cd,All_Partition>(maxLevel());
}
//! return LeafIterator which points behind the last entity in maxLevel
template<int cd>
typename Traits::template Codim<cd>::template Partition<All_Partition>::LeafIterator leafend () const
{
return levelend<cd,All_Partition>(maxLevel());
}
// \brief obtain Entity from EntitySeed. */
template <typename Seed>
typename Traits::template Codim<Seed::codimension>::Entity
entity(const Seed& seed) const
{
const int codim = Seed::codimension;
YGridLevelIterator g = begin(this->getRealImplementation(seed).level());
typedef typename Traits::template Codim<Seed::codimension>::Entity Entity;
typedef YaspEntity<codim,dim,const YaspGrid> EntityImp;
typedef typename YGrid::Iterator YIterator;
return Entity(EntityImp(g,YIterator(g->overlapfront[codim],this->getRealImplementation(seed).coord(),this->getRealImplementation(seed).offset())));
}
//! return size (= distance in graph) of overlap region
int overlapSize (int level, int codim) const
{
YGridLevelIterator g = begin(level);
return g->overlapSize;
}
//! return size (= distance in graph) of overlap region
int overlapSize (int codim) const
{
YGridLevelIterator g = begin(maxLevel());
return g->overlapSize;
}
//! return size (= distance in graph) of ghost region
int ghostSize (int level, int codim) const
{
return 0;
}
//! return size (= distance in graph) of ghost region
int ghostSize (int codim) const
{
return 0;
}
//! number of entities per level and codim in this process
int size (int level, int codim) const
{
YGridLevelIterator g = begin(level);
// sum over all components of the codimension
int count = 0;
typedef typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator DAI;
for (DAI it = g->overlapfront[codim].dataBegin(); it != g->overlapfront[codim].dataEnd(); ++it)
count += it->totalsize();
return count;
}
//! number of leaf entities per codim in this process
int size (int codim) const
{
return size(maxLevel(),codim);
}
//! number of entities per level and geometry type in this process
int size (int level, GeometryType type) const
{
return (type.isCube()) ? size(level,dim-type.dim()) : 0;
}
//! number of leaf entities per geometry type in this process
int size (GeometryType type) const
{
return size(maxLevel(),type);
}
//! \brief returns the number of boundary segments within the macro grid
size_t numBoundarySegments () const
{
return nBSegments;
}
//! \brief returns the size of the physical domain
const Dune::FieldVector<ctype, dim>& domainSize () const {
return _L;
}
/*! The new communication interface
communicate objects for all codims on a given level
*/
template<class DataHandleImp, class DataType>
void communicate (CommDataHandleIF<DataHandleImp,DataType> & data, InterfaceType iftype, CommunicationDirection dir, int level) const
{
YaspCommunicateMeta<dim,dim>::comm(*this,data,iftype,dir,level);
}
/*! The new communication interface
communicate objects for all codims on the leaf grid
*/
template<class DataHandleImp, class DataType>
void communicate (CommDataHandleIF<DataHandleImp,DataType> & data, InterfaceType iftype, CommunicationDirection dir) const
{
YaspCommunicateMeta<dim,dim>::comm(*this,data,iftype,dir,this->maxLevel());
}
/*! The new communication interface
communicate objects for one codim
*/
template<class DataHandle, int codim>
void communicateCodim (DataHandle& data, InterfaceType iftype, CommunicationDirection dir, int level) const
{
// check input
if (!data.contains(dim,codim)) return; // should have been checked outside
// data types
typedef typename DataHandle::DataType DataType;
// access to grid level
YGridLevelIterator g = begin(level);
// find send/recv lists or throw error
const YGridList<Coordinates>* sendlist = 0;
const YGridList<Coordinates>* recvlist = 0;
if (iftype==InteriorBorder_InteriorBorder_Interface)
{
sendlist = &g->send_interiorborder_interiorborder[codim];
recvlist = &g->recv_interiorborder_interiorborder[codim];
}
if (iftype==InteriorBorder_All_Interface)
{
sendlist = &g->send_interiorborder_overlapfront[codim];
recvlist = &g->recv_overlapfront_interiorborder[codim];
}
if (iftype==Overlap_OverlapFront_Interface || iftype==Overlap_All_Interface)
{
sendlist = &g->send_overlap_overlapfront[codim];
recvlist = &g->recv_overlapfront_overlap[codim];
}
if (iftype==All_All_Interface)
{
sendlist = &g->send_overlapfront_overlapfront[codim];
recvlist = &g->recv_overlapfront_overlapfront[codim];
}
// change communication direction?
if (dir==BackwardCommunication)
std::swap(sendlist,recvlist);
int cnt;
// Size computation (requires communication if variable size)
std::vector<int> send_size(sendlist->size(),-1); // map rank to total number of objects (of type DataType) to be sent
std::vector<int> recv_size(recvlist->size(),-1); // map rank to total number of objects (of type DataType) to be recvd
std::vector<size_t*> send_sizes(sendlist->size(),static_cast<size_t*>(0)); // map rank to array giving number of objects per entity to be sent
std::vector<size_t*> recv_sizes(recvlist->size(),static_cast<size_t*>(0)); // map rank to array giving number of objects per entity to be recvd
// define type to iterate over send and recv lists
typedef typename YGridList<Coordinates>::Iterator ListIt;
if (data.fixedSize(dim,codim))
{
// fixed size: just take a dummy entity, size can be computed without communication
cnt=0;
for (ListIt is=sendlist->begin(); is!=sendlist->end(); ++is)
{
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
it(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg)));
send_size[cnt] = is->grid.totalsize() * data.size(*it);
cnt++;
}
cnt=0;
for (ListIt is=recvlist->begin(); is!=recvlist->end(); ++is)
{
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
it(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg)));
recv_size[cnt] = is->grid.totalsize() * data.size(*it);
cnt++;
}
}
else
{
// variable size case: sender side determines the size
cnt=0;
for (ListIt is=sendlist->begin(); is!=sendlist->end(); ++is)
{
// allocate send buffer for sizes per entitiy
size_t *buf = new size_t[is->grid.totalsize()];
send_sizes[cnt] = buf;
// loop over entities and ask for size
int i=0; size_t n=0;
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
it(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg)));
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
itend(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg,true)));
for ( ; it!=itend; ++it)
{
buf[i] = data.size(*it);
n += buf[i];
i++;
}
// now we know the size for this rank
send_size[cnt] = n;
// hand over send request to torus class
torus().send(is->rank,buf,is->grid.totalsize()*sizeof(size_t));
cnt++;
}
// allocate recv buffers for sizes and store receive request
cnt=0;
for (ListIt is=recvlist->begin(); is!=recvlist->end(); ++is)
{
// allocate recv buffer
size_t *buf = new size_t[is->grid.totalsize()];
recv_sizes[cnt] = buf;
// hand over recv request to torus class
torus().recv(is->rank,buf,is->grid.totalsize()*sizeof(size_t));
cnt++;
}
// exchange all size buffers now
torus().exchange();
// release send size buffers
cnt=0;
for (ListIt is=sendlist->begin(); is!=sendlist->end(); ++is)
{
delete[] send_sizes[cnt];
send_sizes[cnt] = 0;
cnt++;
}
// process receive size buffers
cnt=0;
for (ListIt is=recvlist->begin(); is!=recvlist->end(); ++is)
{
// get recv buffer
size_t *buf = recv_sizes[cnt];
// compute total size
size_t n=0;
for (int i=0; i<is->grid.totalsize(); ++i)
n += buf[i];
// ... and store it
recv_size[cnt] = n;
++cnt;
}
}
// allocate & fill the send buffers & store send request
std::vector<DataType*> sends(sendlist->size(), static_cast<DataType*>(0)); // store pointers to send buffers
cnt=0;
for (ListIt is=sendlist->begin(); is!=sendlist->end(); ++is)
{
// allocate send buffer
DataType *buf = new DataType[send_size[cnt]];
// remember send buffer
sends[cnt] = buf;
// make a message buffer
MessageBuffer<DataType> mb(buf);
// fill send buffer; iterate over cells in intersection
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
it(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg)));
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
itend(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg,true)));
for ( ; it!=itend; ++it)
data.gather(mb,*it);
// hand over send request to torus class
torus().send(is->rank,buf,send_size[cnt]*sizeof(DataType));
cnt++;
}
// allocate recv buffers and store receive request
std::vector<DataType*> recvs(recvlist->size(),static_cast<DataType*>(0)); // store pointers to send buffers
cnt=0;
for (ListIt is=recvlist->begin(); is!=recvlist->end(); ++is)
{
// allocate recv buffer
DataType *buf = new DataType[recv_size[cnt]];
// remember recv buffer
recvs[cnt] = buf;
// hand over recv request to torus class
torus().recv(is->rank,buf,recv_size[cnt]*sizeof(DataType));
cnt++;
}
// exchange all buffers now
torus().exchange();
// release send buffers
cnt=0;
for (ListIt is=sendlist->begin(); is!=sendlist->end(); ++is)
{
delete[] sends[cnt];
sends[cnt] = 0;
cnt++;
}
// process receive buffers and delete them
cnt=0;
for (ListIt is=recvlist->begin(); is!=recvlist->end(); ++is)
{
// get recv buffer
DataType *buf = recvs[cnt];
// make a message buffer
MessageBuffer<DataType> mb(buf);
// copy data from receive buffer; iterate over cells in intersection
if (data.fixedSize(dim,codim))
{
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
it(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg)));
size_t n=data.size(*it);
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
itend(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg,true)));
for ( ; it!=itend; ++it)
data.scatter(mb,*it,n);
}
else
{
int i=0;
size_t *sbuf = recv_sizes[cnt];
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
it(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg)));
typename Traits::template Codim<codim>::template Partition<All_Partition>::LevelIterator
itend(YaspLevelIterator<codim,All_Partition,GridImp>(g, typename YGrid::Iterator(is->yg,true)));
for ( ; it!=itend; ++it)
data.scatter(mb,*it,sbuf[i++]);
delete[] sbuf;
}
// delete buffer
delete[] buf; // hier krachts !
cnt++;
}
}
// The new index sets from DDM 11.07.2005
const typename Traits::GlobalIdSet& globalIdSet() const
{
return theglobalidset;
}
const typename Traits::LocalIdSet& localIdSet() const
{
return theglobalidset;
}
const typename Traits::LevelIndexSet& levelIndexSet(int level) const
{
if (level<0 || level>maxLevel()) DUNE_THROW(RangeError, "level out of range");
return *(indexsets[level]);
}
const typename Traits::LeafIndexSet& leafIndexSet() const
{
return leafIndexSet_;
}
/*! @brief return a collective communication object
*/
const CollectiveCommunicationType& comm () const
{
return ccobj;
}
private:
// number of boundary segments of the level 0 grid
int nBSegments;
// Index classes need access to the real entity
friend class Dune::YaspIndexSet<const Dune::YaspGrid<dim, Coordinates>, true >;
friend class Dune::YaspIndexSet<const Dune::YaspGrid<dim, Coordinates>, false >;
friend class Dune::YaspGlobalIdSet<const Dune::YaspGrid<dim, Coordinates> >;
friend class Dune::YaspPersistentContainerIndex<const Dune::YaspGrid<dim, Coordinates> >;
friend class Dune::YaspIntersectionIterator<const Dune::YaspGrid<dim, Coordinates> >;
friend class Dune::YaspIntersection<const Dune::YaspGrid<dim, Coordinates> >;
friend class Dune::YaspEntity<0, dim, const Dune::YaspGrid<dim, Coordinates> >;
template <int codim_, class GridImp_>
friend class Dune::YaspEntityPointer;
template<int codim_, int dim_, class GridImp_, template<int,int,class> class EntityImp_>
friend class Entity;
template<class DT>
class MessageBuffer {
public:
// Constructor
MessageBuffer (DT *p)
{
a=p;
i=0;
j=0;
}
// write data to message buffer, acts like a stream !
template<class Y>
void write (const Y& data)
{
static_assert(( std::is_same<DT,Y>::value ), "DataType mismatch");
a[i++] = data;
}
// read data from message buffer, acts like a stream !
template<class Y>
void read (Y& data) const
{
static_assert(( std::is_same<DT,Y>::value ), "DataType mismatch");
data = a[j++];
}
private:
DT *a;
int i;
mutable int j;
};
//! one past the end on this level
template<int cd, PartitionIteratorType pitype>
YaspLevelIterator<cd,pitype,GridImp> levelbegin (int level) const
{
YGridLevelIterator g = begin(level);
if (level<0 || level>maxLevel()) DUNE_THROW(RangeError, "level out of range");
if (pitype==Interior_Partition)
return YaspLevelIterator<cd,pitype,GridImp>(g,g->interior[cd].begin());
if (pitype==InteriorBorder_Partition)
return YaspLevelIterator<cd,pitype,GridImp>(g,g->interiorborder[cd].begin());
if (pitype==Overlap_Partition)
return YaspLevelIterator<cd,pitype,GridImp>(g,g->overlap[cd].begin());
if (pitype<=All_Partition)
return YaspLevelIterator<cd,pitype,GridImp>(g,g->overlapfront[cd].begin());
if (pitype==Ghost_Partition)
return levelend <cd, pitype> (level);
DUNE_THROW(GridError, "YaspLevelIterator with this codim or partition type not implemented");
}
//! Iterator to one past the last entity of given codim on level for partition type
template<int cd, PartitionIteratorType pitype>
YaspLevelIterator<cd,pitype,GridImp> levelend (int level) const
{
YGridLevelIterator g = begin(level);
if (level<0 || level>maxLevel()) DUNE_THROW(RangeError, "level out of range");
if (pitype==Interior_Partition)
return YaspLevelIterator<cd,pitype,GridImp>(g,g->interior[cd].end());
if (pitype==InteriorBorder_Partition)
return YaspLevelIterator<cd,pitype,GridImp>(g,g->interiorborder[cd].end());
if (pitype==Overlap_Partition)
return YaspLevelIterator<cd,pitype,GridImp>(g,g->overlap[cd].end());
if (pitype<=All_Partition || pitype == Ghost_Partition)
return YaspLevelIterator<cd,pitype,GridImp>(g,g->overlapfront[cd].end());
DUNE_THROW(GridError, "YaspLevelIterator with this codim or partition type not implemented");
}
CollectiveCommunicationType ccobj;
Torus<CollectiveCommunicationType,dim> _torus;
std::vector< std::shared_ptr< YaspIndexSet<const YaspGrid<dim,Coordinates>, false > > > indexsets;
YaspIndexSet<const YaspGrid<dim,Coordinates>, true> leafIndexSet_;
YaspGlobalIdSet<const YaspGrid<dim,Coordinates> > theglobalidset;
Dune::FieldVector<ctype, dim> _L;
iTupel _s;
std::bitset<dim> _periodic;
iTupel _coarseSize;
ReservedVector<YGridLevel,32> _levels;
int _overlap;
bool keep_ovlp;
int adaptRefCount;
bool adaptActive;
};
//! Output operator for multigrids
template <int d, class CC>
std::ostream& operator<< (std::ostream& s, const YaspGrid<d,CC>& grid)
{
int rank = grid.torus().rank();
s << "[" << rank << "]:" << " YaspGrid maxlevel=" << grid.maxLevel() << std::endl;
s << "Printing the torus: " <<std::endl;
s << grid.torus() << std::endl;
for (typename YaspGrid<d,CC>::YGridLevelIterator g=grid.begin(); g!=grid.end(); ++g)
{
s << "[" << rank << "]: " << std::endl;
s << "[" << rank << "]: " << "==========================================" << std::endl;
s << "[" << rank << "]: " << "level=" << g->level() << std::endl;
for (int codim = 0; codim < d + 1; ++codim)
{
s << "[" << rank << "]: " << "overlapfront[" << codim << "]: " << g->overlapfront[codim] << std::endl;
s << "[" << rank << "]: " << "overlap[" << codim << "]: " << g->overlap[codim] << std::endl;
s << "[" << rank << "]: " << "interiorborder[" << codim << "]: " << g->interiorborder[codim] << std::endl;
s << "[" << rank << "]: " << "interior[" << codim << "]: " << g->interior[codim] << std::endl;
typedef typename YGridList<CC>::Iterator I;
for (I i=g->send_overlapfront_overlapfront[codim].begin();
i!=g->send_overlapfront_overlapfront[codim].end(); ++i)
s << "[" << rank << "]: " << " s_of_of[" << codim << "] to rank "
<< i->rank << " " << i->grid << std::endl;
for (I i=g->recv_overlapfront_overlapfront[codim].begin();
i!=g->recv_overlapfront_overlapfront[codim].end(); ++i)
s << "[" << rank << "]: " << " r_of_of[" << codim << "] to rank "
<< i->rank << " " << i->grid << std::endl;
for (I i=g->send_overlap_overlapfront[codim].begin();
i!=g->send_overlap_overlapfront[codim].end(); ++i)
s << "[" << rank << "]: " << " s_o_of[" << codim << "] to rank "
<< i->rank << " " << i->grid << std::endl;
for (I i=g->recv_overlapfront_overlap[codim].begin();
i!=g->recv_overlapfront_overlap[codim].end(); ++i)
s << "[" << rank << "]: " << " r_of_o[" << codim << "] to rank "
<< i->rank << " " << i->grid << std::endl;
for (I i=g->send_interiorborder_interiorborder[codim].begin();
i!=g->send_interiorborder_interiorborder[codim].end(); ++i)
s << "[" << rank << "]: " << " s_ib_ib[" << codim << "] to rank "
<< i->rank << " " << i->grid << std::endl;
for (I i=g->recv_interiorborder_interiorborder[codim].begin();
i!=g->recv_interiorborder_interiorborder[codim].end(); ++i)
s << "[" << rank << "]: " << " r_ib_ib[" << codim << "] to rank "
<< i->rank << " " << i->grid << std::endl;
for (I i=g->send_interiorborder_overlapfront[codim].begin();
i!=g->send_interiorborder_overlapfront[codim].end(); ++i)
s << "[" << rank << "]: " << " s_ib_of[" << codim << "] to rank "
<< i->rank << " " << i->grid << std::endl;
for (I i=g->recv_overlapfront_interiorborder[codim].begin();
i!=g->recv_overlapfront_interiorborder[codim].end(); ++i)
s << "[" << rank << "]: " << " r_of_ib[" << codim << "] to rank "
<< i->rank << " " << i->grid << std::endl;
}
}
s << std::endl;
return s;
}
namespace Capabilities
{
/** \struct hasEntity
\ingroup YaspGrid
*/
/** \struct hasBackupRestoreFacilities
\ingroup YaspGrid
*/
template<int dim, class Coordinates>
struct hasBackupRestoreFacilities< YaspGrid<dim, Coordinates> >
{
static const bool v = true;
};
/** \brief YaspGrid has only one geometry type for codim 0 entities
\ingroup YaspGrid
*/
template<int dim, class Coordinates>
struct hasSingleGeometryType< YaspGrid<dim, Coordinates> >
{
static const bool v = true;
static const unsigned int topologyId = Impl::CubeTopology< dim >::type::id;
};
/** \brief YaspGrid is a Cartesian grid
\ingroup YaspGrid
*/
template<int dim, class Coordinates>
struct isCartesian< YaspGrid<dim, Coordinates> >
{
static const bool v = true;
};
/** \brief YaspGrid has entities for all codimensions
\ingroup YaspGrid
*/
template<int dim, class Coordinates, int codim>
struct hasEntity< YaspGrid<dim, Coordinates>, codim>
{
static const bool v = true;
};
/** \brief YaspGrid can communicate on all codimensions
* \ingroup YaspGrid
*/
template<int dim, int codim, class Coordinates>
struct canCommunicate< YaspGrid< dim, Coordinates>, codim >
{
static const bool v = true;
};
/** \brief YaspGrid is levelwise conforming
\ingroup YaspGrid
*/
template<int dim, class Coordinates>
struct isLevelwiseConforming< YaspGrid<dim, Coordinates> >
{
static const bool v = true;
};
/** \brief YaspGrid is leafwise conforming
\ingroup YaspGrid
*/
template<int dim, class Coordinates>
struct isLeafwiseConforming< YaspGrid<dim, Coordinates> >
{
static const bool v = true;
};
}
} // end namespace
// Include the specialization of the StructuredGridFactory class for YaspGrid
#include <dune/grid/yaspgrid/structuredyaspgridfactory.hh>
// Include the specialization of the BackupRestoreFacility class for YaspGrid
#include <dune/grid/yaspgrid/backuprestore.hh>
#endif
|