3 #ifndef DUNE_GRID_YASPGRID_HH 4 #define DUNE_GRID_YASPGRID_HH 10 #include <type_traits> 22 #include <dune/common/hybridutilities.hh> 23 #include <dune/common/power.hh> 24 #include <dune/common/bigunsignedint.hh> 25 #include <dune/common/typetraits.hh> 26 #include <dune/common/reservedvector.hh> 27 #include <dune/common/parallel/collectivecommunication.hh> 28 #include <dune/common/parallel/mpihelper.hh> 29 #include <dune/common/deprecated.hh> 30 #include <dune/geometry/axisalignedcubegeometry.hh> 31 #include <dune/geometry/type.hh> 37 #include <dune/common/parallel/mpicollectivecommunication.hh> 58 template<
int dim,
class Coordinates>
class YaspGrid;
60 template<
int codim,
int dim,
class Gr
idImp>
class YaspEntity;
88 template<
int dim,
class Coordinates>
92 typedef CollectiveCommunication<MPI_Comm>
CCType;
94 typedef CollectiveCommunication<No_Comm>
CCType;
105 YaspIntersectionIterator,
109 YaspIndexSet< const YaspGrid< dim, Coordinates >,
true >,
111 bigunsignedint<dim*yaspgrid_dim_bits+yaspgrid_level_bits+dim>,
112 YaspGlobalIdSet<const YaspGrid<dim, Coordinates> >,
113 bigunsignedint<dim*yaspgrid_dim_bits+yaspgrid_level_bits+dim>,
121 template<
int dim,
int codim>
122 struct YaspCommunicateMeta {
123 template<
class G,
class DataHandle>
126 if (data.contains(dim,codim))
128 g.template communicateCodim<DataHandle,codim>(data,iftype,dir,level);
130 YaspCommunicateMeta<dim,codim-1>::comm(g,data,iftype,dir,level);
135 struct YaspCommunicateMeta<dim,0> {
136 template<
class G,
class DataHandle>
139 if (data.contains(dim,0))
140 g.template communicateCodim<DataHandle,0>(data,iftype,dir,level);
162 template<
int dim,
class Coordinates = Equ
idistantCoordinates<
double, dim> >
167 template<
int, PartitionIteratorType,
typename>
179 typedef typename Coordinates::ctype
ctype;
202 std::array<YGrid, dim+1> overlapfront;
203 std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power> overlapfront_data;
204 std::array<YGrid, dim+1>
overlap;
205 std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power> overlap_data;
206 std::array<YGrid, dim+1> interiorborder;
207 std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power> interiorborder_data;
209 std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power> interior_data;
211 std::array<YGridList<Coordinates>,dim+1> send_overlapfront_overlapfront;
212 std::array<std::deque<Intersection>, StaticPower<2,dim>::power> send_overlapfront_overlapfront_data;
213 std::array<YGridList<Coordinates>,dim+1> recv_overlapfront_overlapfront;
214 std::array<std::deque<Intersection>, StaticPower<2,dim>::power> recv_overlapfront_overlapfront_data;
216 std::array<YGridList<Coordinates>,dim+1> send_overlap_overlapfront;
217 std::array<std::deque<Intersection>, StaticPower<2,dim>::power> send_overlap_overlapfront_data;
218 std::array<YGridList<Coordinates>,dim+1> recv_overlapfront_overlap;
219 std::array<std::deque<Intersection>, StaticPower<2,dim>::power> recv_overlapfront_overlap_data;
221 std::array<YGridList<Coordinates>,dim+1> send_interiorborder_interiorborder;
222 std::array<std::deque<Intersection>, StaticPower<2,dim>::power> send_interiorborder_interiorborder_data;
223 std::array<YGridList<Coordinates>,dim+1> recv_interiorborder_interiorborder;
224 std::array<std::deque<Intersection>, StaticPower<2,dim>::power> recv_interiorborder_interiorborder_data;
226 std::array<YGridList<Coordinates>,dim+1> send_interiorborder_overlapfront;
227 std::array<std::deque<Intersection>, StaticPower<2,dim>::power> send_interiorborder_overlapfront_data;
228 std::array<YGridList<Coordinates>,dim+1> recv_overlapfront_interiorborder;
229 std::array<std::deque<Intersection>, StaticPower<2,dim>::power> recv_overlapfront_interiorborder_data;
241 typedef std::array<int, dim> iTupel;
242 typedef FieldVector<ctype, dim> fTupel;
257 return levelSize(maxLevel(),i);
263 return levelSize(maxLevel());
269 return _coarseSize[i] * (1 << l);
276 for (
int i=0; i<dim; ++i)
277 s[i] = levelSize(l,i);
298 return YGridLevelIterator(_levels,0);
302 YGridLevelIterator
begin (
int i)
const 304 if (i<0 || i>maxLevel())
305 DUNE_THROW(
GridError,
"level not existing");
306 return YGridLevelIterator(_levels,i);
310 YGridLevelIterator
end ()
const 312 return YGridLevelIterator(_levels,maxLevel()+1);
330 void makelevel (
const Coordinates& coords, std::bitset<dim> periodic, iTupel o_interior,
int overlap)
332 YGridLevel& g = _levels.back();
335 g.level_ = maxLevel();
337 g.keepOverlap = keep_ovlp;
340 typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator overlapfront_it = g.overlapfront_data.begin();
341 typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator overlap_it = g.overlap_data.begin();
342 typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator interiorborder_it = g.interiorborder_data.begin();
343 typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator interior_it = g.interior_data.begin();
345 typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
346 send_overlapfront_overlapfront_it = g.send_overlapfront_overlapfront_data.begin();
347 typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
348 recv_overlapfront_overlapfront_it = g.recv_overlapfront_overlapfront_data.begin();
350 typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
351 send_overlap_overlapfront_it = g.send_overlap_overlapfront_data.begin();
352 typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
353 recv_overlapfront_overlap_it = g.recv_overlapfront_overlap_data.begin();
355 typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
356 send_interiorborder_interiorborder_it = g.send_interiorborder_interiorborder_data.begin();
357 typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
358 recv_interiorborder_interiorborder_it = g.recv_interiorborder_interiorborder_data.begin();
360 typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
361 send_interiorborder_overlapfront_it = g.send_interiorborder_overlapfront_data.begin();
362 typename std::array<std::deque<Intersection>, StaticPower<2,dim>::power>::iterator
363 recv_overlapfront_interiorborder_it = g.recv_overlapfront_interiorborder_data.begin();
366 std::array<int,dim> n;
367 std::fill(n.begin(), n.end(), 0);
370 std::bitset<dim> ovlp_low(0ULL);
371 std::bitset<dim> ovlp_up(0ULL);
377 for (
int i=0; i<dim; i++)
381 s_overlap[i] = g.coords.size(i);
386 o_overlap[i] = o_interior[i]-
overlap;
393 if (o_interior[i] - overlap < 0)
397 o_overlap[i] = o_interior[i] -
overlap;
402 if (o_overlap[i] + g.coords.size(i) < globalSize(i))
407 for (
unsigned int codim = 0; codim < dim + 1; codim++)
410 g.overlapfront[codim].setBegin(overlapfront_it);
411 g.overlap[codim].setBegin(overlap_it);
412 g.interiorborder[codim].setBegin(interiorborder_it);
413 g.interior[codim].setBegin(interior_it);
414 g.send_overlapfront_overlapfront[codim].setBegin(send_overlapfront_overlapfront_it);
415 g.recv_overlapfront_overlapfront[codim].setBegin(recv_overlapfront_overlapfront_it);
416 g.send_overlap_overlapfront[codim].setBegin(send_overlap_overlapfront_it);
417 g.recv_overlapfront_overlap[codim].setBegin(recv_overlapfront_overlap_it);
418 g.send_interiorborder_interiorborder[codim].setBegin(send_interiorborder_interiorborder_it);
419 g.recv_interiorborder_interiorborder[codim].setBegin(recv_interiorborder_interiorborder_it);
420 g.send_interiorborder_overlapfront[codim].setBegin(send_interiorborder_overlapfront_it);
421 g.recv_overlapfront_interiorborder[codim].setBegin(recv_overlapfront_interiorborder_it);
424 for (
unsigned int index = 0; index < (1<<dim); index++)
427 std::bitset<dim> r(index);
428 if (r.count() != dim-codim)
432 std::array<int,dim> origin(o_overlap);
433 std::array<int,dim> size(s_overlap);
437 for (
int i=0; i<dim; i++)
443 for (
int i=0; i<dim; i++)
459 for (
int i=0; i<dim; i++)
481 for (
int i=0; i<dim; i++)
496 intersections(*overlapfront_it,*overlapfront_it,*send_overlapfront_overlapfront_it, *recv_overlapfront_overlapfront_it);
497 intersections(*overlap_it,*overlapfront_it,*send_overlap_overlapfront_it, *recv_overlapfront_overlap_it);
498 intersections(*interiorborder_it,*interiorborder_it,*send_interiorborder_interiorborder_it,*recv_interiorborder_interiorborder_it);
499 intersections(*interiorborder_it,*overlapfront_it,*send_interiorborder_overlapfront_it,*recv_overlapfront_interiorborder_it);
506 ++send_overlapfront_overlapfront_it;
507 ++recv_overlapfront_overlapfront_it;
508 ++send_overlap_overlapfront_it;
509 ++recv_overlapfront_overlap_it;
510 ++send_interiorborder_interiorborder_it;
511 ++recv_interiorborder_interiorborder_it;
512 ++send_interiorborder_overlapfront_it;
513 ++recv_overlapfront_interiorborder_it;
517 g.overlapfront[codim].finalize(overlapfront_it);
518 g.overlap[codim].finalize(overlap_it);
519 g.interiorborder[codim].finalize(interiorborder_it);
520 g.interior[codim].finalize(interior_it);
521 g.send_overlapfront_overlapfront[codim].finalize(send_overlapfront_overlapfront_it,g.overlapfront[codim]);
522 g.recv_overlapfront_overlapfront[codim].finalize(recv_overlapfront_overlapfront_it,g.overlapfront[codim]);
523 g.send_overlap_overlapfront[codim].finalize(send_overlap_overlapfront_it,g.overlapfront[codim]);
524 g.recv_overlapfront_overlap[codim].finalize(recv_overlapfront_overlap_it,g.overlapfront[codim]);
525 g.send_interiorborder_interiorborder[codim].finalize(send_interiorborder_interiorborder_it,g.overlapfront[codim]);
526 g.recv_interiorborder_interiorborder[codim].finalize(recv_interiorborder_interiorborder_it,g.overlapfront[codim]);
527 g.send_interiorborder_overlapfront[codim].finalize(send_interiorborder_overlapfront_it,g.overlapfront[codim]);
528 g.recv_overlapfront_interiorborder[codim].finalize(recv_overlapfront_interiorborder_it,g.overlapfront[codim]);
541 struct mpifriendly_ygrid {
544 std::fill(origin.begin(), origin.end(), 0);
545 std::fill(size.begin(), size.end(), 0);
564 std::deque<Intersection>& sendlist, std::deque<Intersection>& recvlist)
566 iTupel size = globalSize();
569 std::vector<YGridComponent<Coordinates> > send_recvgrid(_torus.neighbors());
570 std::vector<YGridComponent<Coordinates> > recv_recvgrid(_torus.neighbors());
571 std::vector<YGridComponent<Coordinates> > send_sendgrid(_torus.neighbors());
572 std::vector<YGridComponent<Coordinates> > recv_sendgrid(_torus.neighbors());
575 std::vector<mpifriendly_ygrid> mpifriendly_send_recvgrid(_torus.neighbors());
576 std::vector<mpifriendly_ygrid> mpifriendly_recv_recvgrid(_torus.neighbors());
577 std::vector<mpifriendly_ygrid> mpifriendly_send_sendgrid(_torus.neighbors());
578 std::vector<mpifriendly_ygrid> mpifriendly_recv_sendgrid(_torus.neighbors());
586 iTupel coord = _torus.coord();
587 iTupel delta = i.delta();
589 for (
int k=0; k<dim; k++) nb[k] += delta[k];
591 std::fill(v.begin(), v.end(), 0);
593 for (
int k=0; k<dim; k++)
602 if (nb[k]>=_torus.dims(k))
615 send_sendgrid[i.index()] = sendgrid.
move(v);
616 send_recvgrid[i.index()] = recvgrid.
move(v);
628 mpifriendly_send_sendgrid[i.index()] = mpifriendly_ygrid(send_sendgrid[i.index()]);
629 _torus.send(i.rank(), &mpifriendly_send_sendgrid[i.index()],
sizeof(mpifriendly_ygrid));
634 _torus.recv(i.rank(), &mpifriendly_recv_sendgrid[i.index()],
sizeof(mpifriendly_ygrid));
642 mpifriendly_send_recvgrid[i.index()] = mpifriendly_ygrid(send_recvgrid[i.index()]);
643 _torus.send(i.rank(), &mpifriendly_send_recvgrid[i.index()],
sizeof(mpifriendly_ygrid));
648 _torus.recv(i.rank(), &mpifriendly_recv_recvgrid[i.index()],
sizeof(mpifriendly_ygrid));
657 Intersection send_intersection;
658 mpifriendly_ygrid yg = mpifriendly_recv_recvgrid[i.index()];
660 send_intersection.grid = sendgrid.
intersection(recv_recvgrid[i.index()]);
661 send_intersection.rank = i.rank();
662 send_intersection.distance = i.distance();
663 if (!send_intersection.grid.empty()) sendlist.push_front(send_intersection);
665 Intersection recv_intersection;
666 yg = mpifriendly_recv_sendgrid[i.index()];
668 recv_intersection.grid = recvgrid.
intersection(recv_sendgrid[i.index()]);
669 recv_intersection.rank = i.rank();
670 recv_intersection.distance = i.distance();
671 if(!recv_intersection.grid.empty()) recvlist.push_back(recv_intersection);
682 boundarysegmentssize();
688 std::array<int, dim> sides;
690 for (
int i=0; i<dim; i++)
693 ((begin()->overlap[0].dataBegin()->origin(i) == 0)+
694 (begin()->overlap[0].dataBegin()->origin(i) + begin()->overlap[0].dataBegin()->size(i)
699 for (
int k=0; k<dim; k++)
702 for (
int l=0; l<dim; l++)
705 offset *= begin()->overlap[0].dataBegin()->size(l);
707 nBSegments += sides[k]*offset;
735 std::array<int, dim> s,
736 std::bitset<dim> periodic = std::bitset<dim>(0ULL),
738 CollectiveCommunicationType comm = CollectiveCommunicationType(),
740 : ccobj(comm), _torus(comm,tag,s,lb), leafIndexSet_(*this),
741 _L(L), _periodic(periodic), _coarseSize(s), _overlap(
overlap),
742 keep_ovlp(true), adaptRefCount(0), adaptActive(false)
746 "YaspGrid coordinate container template parameter and given constructor values do not match!");
751 std::fill(o.begin(), o.end(), 0);
752 iTupel o_interior(o);
753 iTupel s_interior(s);
755 _torus.partition(_torus.rank(),o,s,o_interior,s_interior);
759 for (
int i=0; i<dim; i++)
762 int toosmall = (s_interior[i] / 2 <=
overlap) &&
763 (periodic[i] || (s_interior[i] != s[i]));
766 MPI_Allreduce(&toosmall, &global, 1, MPI_INT, MPI_LOR, comm);
770 #endif // #if HAVE_MPI 773 for (
int i=0; i<dim; i++)
776 iTupel s_overlap(s_interior);
777 for (
int i=0; i<dim; i++)
779 if ((o_interior[i] -
overlap > 0) || (periodic[i]))
781 if ((o_interior[i] + s_interior[i] +
overlap <= _coarseSize[i]) || (periodic[i]))
788 makelevel(cc,periodic,o_interior,
overlap);
803 Dune::FieldVector<ctype, dim> upperright,
804 std::array<int, dim> s,
805 std::bitset<dim> periodic = std::bitset<dim>(0ULL),
807 CollectiveCommunicationType comm = CollectiveCommunicationType(),
809 : ccobj(comm), _torus(comm,tag,s,lb), leafIndexSet_(*this),
810 _L(upperright - lowerleft),
811 _periodic(periodic), _coarseSize(s), _overlap(
overlap),
812 keep_ovlp(true), adaptRefCount(0), adaptActive(false)
816 "YaspGrid coordinate container template parameter and given constructor values do not match!");
821 std::fill(o.begin(), o.end(), 0);
822 iTupel o_interior(o);
823 iTupel s_interior(s);
825 _torus.partition(_torus.rank(),o,s,o_interior,s_interior);
829 for (
int i=0; i<dim; i++)
832 int toosmall = (s_interior[i] / 2 <=
overlap) &&
833 (periodic[i] || (s_interior[i] != s[i]));
836 MPI_Allreduce(&toosmall, &global, 1, MPI_INT, MPI_LOR, comm);
840 #endif // #if HAVE_MPI 842 Dune::FieldVector<ctype,dim> extension(upperright);
843 Dune::FieldVector<ctype,dim> h;
844 for (
int i=0; i<dim; i++)
846 extension[i] -= lowerleft[i];
847 h[i] = extension[i] / s[i];
850 iTupel s_overlap(s_interior);
851 for (
int i=0; i<dim; i++)
853 if ((o_interior[i] -
overlap > 0) || (periodic[i]))
855 if ((o_interior[i] + s_interior[i] +
overlap <= _coarseSize[i]) || (periodic[i]))
862 makelevel(cc,periodic,o_interior,
overlap);
874 YaspGrid (std::array<std::vector<ctype>, dim> coords,
875 std::bitset<dim> periodic = std::bitset<dim>(0ULL),
877 CollectiveCommunicationType comm = CollectiveCommunicationType(),
879 : ccobj(comm), _torus(comm,tag,
Dune::Yasp::
sizeArray<dim>(coords),lb),
880 leafIndexSet_(*this), _periodic(periodic), _overlap(
overlap),
881 keep_ovlp(true), adaptRefCount(0), adaptActive(false)
884 DUNE_THROW(
Dune::GridError,
"Setup of a tensorproduct grid requires monotonous sequences of coordinates.");
888 "YaspGrid coordinate container template parameter and given constructor values do not match!");
893 for (
int i=0; i<dim; i++) {
894 _coarseSize[i] = coords[i].size() - 1;
895 _L[i] = coords[i][_coarseSize[i]] - coords[i][0];
899 std::fill(o.begin(), o.end(), 0);
900 iTupel o_interior(o);
901 iTupel s_interior(_coarseSize);
903 _torus.partition(_torus.rank(),o,_coarseSize,o_interior,s_interior);
907 for (
int i=0; i<dim; i++)
910 int toosmall = (s_interior[i] / 2 <=
overlap) &&
911 (periodic[i] || (s_interior[i] != _coarseSize[i]));
914 MPI_Allreduce(&toosmall, &global, 1, MPI_INT, MPI_LOR, comm);
918 #endif // #if HAVE_MPI 921 std::array<std::vector<ctype>,dim> newcoords;
922 std::array<int, dim> offset(o_interior);
925 for (
int i=0; i<dim; ++i)
928 typename std::vector<ctype>::iterator begin = coords[i].begin() + o_interior[i];
929 typename std::vector<ctype>::iterator end = begin + s_interior[i] + 1;
933 if (o_interior[i] -
overlap > 0)
938 if (o_interior[i] + s_interior[i] +
overlap < _coarseSize[i])
942 newcoords[i].resize(end-begin);
943 std::copy(begin, end, newcoords[i].begin());
947 if ((periodic[i]) && (o_interior[i] + s_interior[i] + overlap >= _coarseSize[i]))
950 typename std::vector<ctype>::iterator it = coords[i].begin();
952 newcoords[i].push_back(newcoords[i].back() - *it + *(++it));
955 if ((periodic[i]) && (o_interior[i] - overlap <= 0))
960 typename std::vector<ctype>::iterator it = coords[i].end() - 1;
962 newcoords[i].insert(newcoords[i].begin(), newcoords[i].
front() - *it + *(--it));
969 makelevel(cc,periodic,o_interior,
overlap);
989 YaspGrid (std::array<std::vector<ctype>, dim> coords,
990 std::bitset<dim> periodic,
992 CollectiveCommunicationType comm,
993 std::array<int,dim> coarseSize,
995 : ccobj(comm), _torus(comm,tag,coarseSize,lb), leafIndexSet_(*
this),
996 _periodic(periodic), _coarseSize(coarseSize), _overlap(overlap),
997 keep_ovlp(
true), adaptRefCount(0), adaptActive(
false)
1001 "YaspGrid coordinate container template parameter and given constructor values do not match!");
1004 DUNE_THROW(
Dune::GridError,
"Setup of a tensorproduct grid requires monotonous sequences of coordinates.");
1006 for (
int i=0; i<dim; i++)
1007 _L[i] = coords[i][coords[i].size() - 1] - coords[i][0];
1011 std::array<int,dim> o;
1012 std::fill(o.begin(), o.end(), 0);
1013 std::array<int,dim> o_interior(o);
1014 std::array<int,dim> s_interior(coarseSize);
1016 _torus.partition(_torus.rank(),o,coarseSize,o_interior,s_interior);
1019 std::array<int,dim> offset(o_interior);
1020 for (
int i=0; i<dim; i++)
1021 if ((periodic[i]) || (o_interior[i] > 0))
1027 makelevel(cc,periodic,o_interior,overlap);
1045 return _levels.size()-1;
1051 if (refCount < -maxLevel())
1052 DUNE_THROW(
GridError,
"Only " << maxLevel() <<
" levels left. " <<
1053 "Coarsening " << -refCount <<
" levels requested!");
1056 for (
int k=refCount; k<0; k++)
1060 _levels.back() = empty;
1064 indexsets.pop_back();
1068 for (
int k=0; k<refCount; k++)
1071 YGridLevel& cg = _levels[maxLevel()];
1073 std::bitset<dim> ovlp_low(0ULL), ovlp_up(0ULL);
1074 for (
int i=0; i<dim; i++)
1076 if (cg.overlap[0].dataBegin()->origin(i) > 0 || _periodic[i])
1078 if (cg.overlap[0].dataBegin()->max(i) + 1 < globalSize(i) || _periodic[i])
1082 Coordinates newcont(cg.coords.refine(ovlp_low, ovlp_up, cg.overlapSize, keep_ovlp));
1084 int overlap = (keep_ovlp) ? 2*cg.overlapSize : cg.overlapSize;
1088 for (
int i=0; i<dim; i++)
1089 o_interior[i] = 2*cg.interior[0].dataBegin()->origin(i);
1092 _levels.resize(_levels.size() + 1);
1093 makelevel(newcont,_periodic,o_interior,overlap);
1105 keep_ovlp = keepPhysicalOverlap;
1121 assert(adaptActive ==
false);
1122 if (e.level() != maxLevel())
return false;
1123 adaptRefCount =
std::max(adaptRefCount, refCount);
1135 return ( e.level() == maxLevel() ) ? adaptRefCount : 0;
1141 globalRefine(adaptRefCount);
1142 return (adaptRefCount > 0);
1149 adaptRefCount = comm().max(adaptRefCount);
1150 return (adaptRefCount < 0);
1156 adaptActive =
false;
1161 template<
int cd, PartitionIteratorType pitype>
1164 return levelbegin<cd,pitype>(level);
1168 template<
int cd, PartitionIteratorType pitype>
1171 return levelend<cd,pitype>(level);
1178 return levelbegin<cd,All_Partition>(level);
1185 return levelend<cd,All_Partition>(level);
1189 template<
int cd, PartitionIteratorType pitype>
1192 return levelbegin<cd,pitype>(maxLevel());
1196 template<
int cd, PartitionIteratorType pitype>
1199 return levelend<cd,pitype>(maxLevel());
1206 return levelbegin<cd,All_Partition>(maxLevel());
1213 return levelend<cd,All_Partition>(maxLevel());
1217 template <
typename Seed>
1221 const int codim = Seed::codimension;
1222 YGridLevelIterator g = begin(this->getRealImplementation(seed).level());
1228 return Entity(EntityImp(g,YIterator(g->overlapfront[codim],this->getRealImplementation(seed).coord(),this->getRealImplementation(seed).offset())));
1234 YGridLevelIterator g = begin(level);
1235 return g->overlapSize;
1241 YGridLevelIterator g = begin(maxLevel());
1242 return g->overlapSize;
1258 int size (
int level,
int codim)
const 1260 YGridLevelIterator g = begin(level);
1264 typedef typename std::array<YGridComponent<Coordinates>, StaticPower<2,dim>::power>::iterator DAI;
1265 for (DAI it = g->overlapfront[codim].dataBegin(); it != g->overlapfront[codim].dataEnd(); ++it)
1266 count += it->totalsize();
1274 return size(maxLevel(),codim);
1280 return (type.isCube()) ? size(level,dim-type.dim()) : 0;
1286 return size(maxLevel(),type);
1304 template<
class DataHandleImp,
class DataType>
1307 YaspCommunicateMeta<dim,dim>::comm(*
this,data,iftype,dir,level);
1314 template<
class DataHandleImp,
class DataType>
1317 YaspCommunicateMeta<dim,dim>::comm(*
this,data,iftype,dir,this->maxLevel());
1324 template<
class DataHandle,
int codim>
1328 if (!data.contains(dim,codim))
return;
1331 typedef typename DataHandle::DataType DataType;
1334 YGridLevelIterator g = begin(level);
1342 sendlist = &g->send_interiorborder_interiorborder[codim];
1343 recvlist = &g->recv_interiorborder_interiorborder[codim];
1347 sendlist = &g->send_interiorborder_overlapfront[codim];
1348 recvlist = &g->recv_overlapfront_interiorborder[codim];
1352 sendlist = &g->send_overlap_overlapfront[codim];
1353 recvlist = &g->recv_overlapfront_overlap[codim];
1357 sendlist = &g->send_overlapfront_overlapfront[codim];
1358 recvlist = &g->recv_overlapfront_overlapfront[codim];
1363 std::swap(sendlist,recvlist);
1368 std::vector<int> send_size(sendlist->
size(),-1);
1369 std::vector<int> recv_size(recvlist->
size(),-1);
1370 std::vector<size_t*> send_sizes(sendlist->
size(),
static_cast<size_t*
>(0));
1371 std::vector<size_t*> recv_sizes(recvlist->
size(),
static_cast<size_t*
>(0));
1376 if (data.fixedSize(dim,codim))
1380 for (ListIt is=sendlist->
begin(); is!=sendlist->
end(); ++is)
1384 send_size[cnt] = is->grid.totalsize() * data.size(*it);
1388 for (ListIt is=recvlist->
begin(); is!=recvlist->
end(); ++is)
1392 recv_size[cnt] = is->grid.totalsize() * data.size(*it);
1400 for (ListIt is=sendlist->
begin(); is!=sendlist->
end(); ++is)
1403 size_t *buf =
new size_t[is->grid.totalsize()];
1404 send_sizes[cnt] = buf;
1407 int i=0;
size_t n=0;
1412 for ( ; it!=itend; ++it)
1414 buf[i] = data.size(*it);
1423 torus().send(is->rank,buf,is->grid.totalsize()*
sizeof(size_t));
1429 for (ListIt is=recvlist->
begin(); is!=recvlist->
end(); ++is)
1432 size_t *buf =
new size_t[is->grid.totalsize()];
1433 recv_sizes[cnt] = buf;
1436 torus().recv(is->rank,buf,is->grid.totalsize()*
sizeof(size_t));
1445 for (ListIt is=sendlist->
begin(); is!=sendlist->
end(); ++is)
1447 delete[] send_sizes[cnt];
1448 send_sizes[cnt] = 0;
1454 for (ListIt is=recvlist->
begin(); is!=recvlist->
end(); ++is)
1457 size_t *buf = recv_sizes[cnt];
1461 for (
int i=0; i<is->grid.totalsize(); ++i)
1472 std::vector<DataType*> sends(sendlist->
size(),
static_cast<DataType*
>(0));
1474 for (ListIt is=sendlist->
begin(); is!=sendlist->
end(); ++is)
1477 DataType *buf =
new DataType[send_size[cnt]];
1483 MessageBuffer<DataType> mb(buf);
1490 for ( ; it!=itend; ++it)
1491 data.gather(mb,*it);
1494 torus().send(is->rank,buf,send_size[cnt]*
sizeof(DataType));
1499 std::vector<DataType*> recvs(recvlist->
size(),
static_cast<DataType*
>(0));
1501 for (ListIt is=recvlist->
begin(); is!=recvlist->
end(); ++is)
1504 DataType *buf =
new DataType[recv_size[cnt]];
1510 torus().recv(is->rank,buf,recv_size[cnt]*
sizeof(DataType));
1519 for (ListIt is=sendlist->
begin(); is!=sendlist->
end(); ++is)
1521 delete[] sends[cnt];
1528 for (ListIt is=recvlist->
begin(); is!=recvlist->
end(); ++is)
1531 DataType *buf = recvs[cnt];
1534 MessageBuffer<DataType> mb(buf);
1537 if (data.fixedSize(dim,codim))
1541 size_t n=data.size(*it);
1544 for ( ; it!=itend; ++it)
1545 data.scatter(mb,*it,n);
1550 size_t *sbuf = recv_sizes[cnt];
1555 for ( ; it!=itend; ++it)
1556 data.scatter(mb,*it,sbuf[i++]);
1569 return theglobalidset;
1574 return theglobalidset;
1579 if (level<0 || level>maxLevel()) DUNE_THROW(RangeError,
"level out of range");
1580 return *(indexsets[level]);
1585 return leafIndexSet_;
1590 const CollectiveCommunicationType&
comm ()
const 1610 template<int codim_, int dim_, class GridImp_, template<int,int,class> class EntityImp_>
1614 class MessageBuffer {
1617 MessageBuffer (DT *p)
1626 void write (
const Y& data)
1628 static_assert(( std::is_same<DT,Y>::value ),
"DataType mismatch");
1634 void read (Y& data)
const 1636 static_assert(( std::is_same<DT,Y>::value ),
"DataType mismatch");
1647 template<
int cd, PartitionIteratorType pitype>
1650 YGridLevelIterator g = begin(level);
1651 if (level<0 || level>maxLevel()) DUNE_THROW(RangeError,
"level out of range");
1662 return levelend <cd, pitype> (level);
1664 DUNE_THROW(
GridError,
"YaspLevelIterator with this codim or partition type not implemented");
1668 template<
int cd, PartitionIteratorType pitype>
1671 YGridLevelIterator g = begin(level);
1672 if (level<0 || level>maxLevel()) DUNE_THROW(RangeError,
"level out of range");
1683 DUNE_THROW(
GridError,
"YaspLevelIterator with this codim or partition type not implemented");
1686 CollectiveCommunicationType ccobj;
1690 std::vector< std::shared_ptr< YaspIndexSet<const YaspGrid<dim,Coordinates>,
false > > > indexsets;
1694 Dune::FieldVector<ctype, dim> _L;
1696 std::bitset<dim> _periodic;
1698 ReservedVector<YGridLevel,32> _levels;
1707 template <
int d,
class CC>
1708 std::ostream& operator<< (std::ostream& s, const YaspGrid<d,CC>& grid)
1710 int rank = grid.torus().rank();
1712 s <<
"[" << rank <<
"]:" <<
" YaspGrid maxlevel=" << grid.maxLevel() << std::endl;
1714 s <<
"Printing the torus: " <<std::endl;
1715 s << grid.torus() << std::endl;
1719 s <<
"[" << rank <<
"]: " << std::endl;
1720 s <<
"[" << rank <<
"]: " <<
"==========================================" << std::endl;
1721 s <<
"[" << rank <<
"]: " <<
"level=" << g->level() << std::endl;
1723 for (
int codim = 0; codim < d + 1; ++codim)
1725 s <<
"[" << rank <<
"]: " <<
"overlapfront[" << codim <<
"]: " << g->overlapfront[codim] << std::endl;
1726 s <<
"[" << rank <<
"]: " <<
"overlap[" << codim <<
"]: " << g->overlap[codim] << std::endl;
1727 s <<
"[" << rank <<
"]: " <<
"interiorborder[" << codim <<
"]: " << g->interiorborder[codim] << std::endl;
1728 s <<
"[" << rank <<
"]: " <<
"interior[" << codim <<
"]: " << g->interior[codim] << std::endl;
1731 for (I i=g->send_overlapfront_overlapfront[codim].begin();
1732 i!=g->send_overlapfront_overlapfront[codim].end(); ++i)
1733 s <<
"[" << rank <<
"]: " <<
" s_of_of[" << codim <<
"] to rank " 1734 << i->rank <<
" " << i->grid << std::endl;
1736 for (I i=g->recv_overlapfront_overlapfront[codim].begin();
1737 i!=g->recv_overlapfront_overlapfront[codim].end(); ++i)
1738 s <<
"[" << rank <<
"]: " <<
" r_of_of[" << codim <<
"] to rank " 1739 << i->rank <<
" " << i->grid << std::endl;
1741 for (I i=g->send_overlap_overlapfront[codim].begin();
1742 i!=g->send_overlap_overlapfront[codim].end(); ++i)
1743 s <<
"[" << rank <<
"]: " <<
" s_o_of[" << codim <<
"] to rank " 1744 << i->rank <<
" " << i->grid << std::endl;
1746 for (I i=g->recv_overlapfront_overlap[codim].begin();
1747 i!=g->recv_overlapfront_overlap[codim].end(); ++i)
1748 s <<
"[" << rank <<
"]: " <<
" r_of_o[" << codim <<
"] to rank " 1749 << i->rank <<
" " << i->grid << std::endl;
1751 for (I i=g->send_interiorborder_interiorborder[codim].begin();
1752 i!=g->send_interiorborder_interiorborder[codim].end(); ++i)
1753 s <<
"[" << rank <<
"]: " <<
" s_ib_ib[" << codim <<
"] to rank " 1754 << i->rank <<
" " << i->grid << std::endl;
1756 for (I i=g->recv_interiorborder_interiorborder[codim].begin();
1757 i!=g->recv_interiorborder_interiorborder[codim].end(); ++i)
1758 s <<
"[" << rank <<
"]: " <<
" r_ib_ib[" << codim <<
"] to rank " 1759 << i->rank <<
" " << i->grid << std::endl;
1761 for (I i=g->send_interiorborder_overlapfront[codim].begin();
1762 i!=g->send_interiorborder_overlapfront[codim].end(); ++i)
1763 s <<
"[" << rank <<
"]: " <<
" s_ib_of[" << codim <<
"] to rank " 1764 << i->rank <<
" " << i->grid << std::endl;
1766 for (I i=g->recv_overlapfront_interiorborder[codim].begin();
1767 i!=g->recv_overlapfront_interiorborder[codim].end(); ++i)
1768 s <<
"[" << rank <<
"]: " <<
" r_of_ib[" << codim <<
"] to rank " 1769 << i->rank <<
" " << i->grid << std::endl;
1778 namespace Capabilities
1788 template<
int dim,
class Coordinates>
1791 static const bool v =
true;
1797 template<
int dim,
class Coordinates>
1800 static const bool v =
true;
1801 static const unsigned int topologyId = Impl::CubeTopology< dim >::type::id;
1807 template<
int dim,
class Coordinates>
1810 static const bool v =
true;
1816 template<
int dim,
class Coordinates,
int codim>
1819 static const bool v =
true;
1826 template<
int dim,
class Coordinates,
int codim>
1829 static const bool v =
true;
1835 template<
int dim,
int codim,
class Coordinates>
1838 static const bool v =
true;
1844 template<
int dim,
class Coordinates>
1847 static const bool v =
true;
1853 template<
int dim,
class Coordinates>
1856 static const bool v =
true;
Include standard header files.
Definition: agrid.hh:58
Traits::template Codim< cd >::template Partition< All_Partition >::LeafIterator leafend() const
return LeafIterator which points behind the last entity in maxLevel
Definition: yaspgrid.hh:1211
const Torus< CollectiveCommunicationType, dim > & torus() const
return reference to torus
Definition: yaspgrid.hh:249
bool getRefineOption() const
Definition: yaspgrid.hh:287
void postAdapt()
clean up some markers
Definition: yaspgrid.hh:1154
void globalRefine(int refCount)
refine the grid refCount times.
Definition: yaspgrid.hh:1049
std::array< int, d > sizeArray(const std::array< std::vector< ct >, d > &v)
Definition: ygrid.hh:27
int size(int level, GeometryType type) const
number of entities per level and geometry type in this process
Definition: yaspgrid.hh:1278
Describes the minimal information necessary to create a fully functional YaspEntity.
Definition: yaspgrid.hh:61
a base class for the yaspgrid partitioning strategy The name might be irritating. It will probably ch...
Definition: partitioning.hh:23
IndexSet< const GridImp, LevelIndexSetImp > LevelIndexSet
The type of the level index set.
Definition: common/grid.hh:1131
level-wise, non-persistent, consecutive indices for YaspGrid
Coordinates::ctype ctype
Type used for coordinates.
Definition: yaspgrid.hh:179
Traits::template Codim< cd >::template Partition< All_Partition >::LeafIterator leafbegin() const
return LeafIterator which points to the first entity in maxLevel
Definition: yaspgrid.hh:1204
Describes the parallel communication interface class for MessageBuffers and DataHandles.
constexpr Front front
PartitionSet for the front partition.
Definition: partitionset.hh:279
int maxLevel() const
Definition: yaspgrid.hh:1043
Intersection of a mesh entity of codimension 0 ("element") with a "neighboring" element or with the d...
Definition: albertagrid/dgfparser.hh:26
A Traits struct that collects all associated types of one implementation.
Definition: common/grid.hh:414
Specialize with 'true' if the grid is a Cartesian grid. Cartesian grids satisfy the following propert...
Definition: common/capabilities.hh:45
void makelevel(const Coordinates &coords, std::bitset< dim > periodic, iTupel o_interior, int overlap)
Make a new YGridLevel structure.
Definition: yaspgrid.hh:330
Specialization of the PersistentContainer for YaspGrid.
CollectiveCommunication< MPI_Comm > CollectiveCommunicationType
Definition: yaspgrid.hh:181
interior and border entities
Definition: gridenums.hh:136
void init()
Definition: yaspgrid.hh:679
IndexSet< const GridImp, LeafIndexSetImp > LeafIndexSet
The type of the leaf index set.
Definition: common/grid.hh:1133
const YaspGrid< dim, Coordinates > GridImp
Definition: yaspgrid.hh:677
Implementation of Level- and LeafIndexSets for YaspGrid.
Definition: yaspgrid.hh:66
ProcListIterator sendbegin() const
first process in send list
Definition: torus.hh:341
Traits::template Codim< cd >::template Partition< All_Partition >::LevelIterator lend(int level) const
version without second template parameter for convenience
Definition: yaspgrid.hh:1183
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())
Definition: yaspgrid.hh:802
only interior entities
Definition: gridenums.hh:135
int ghostSize(int level, int codim) const
return size (= distance in graph) of ghost region
Definition: yaspgrid.hh:1246
the YaspEntity class and its specializations
YGridLevelIterator end() const
return iterator pointing to one past the finest level
Definition: yaspgrid.hh:310
int size(int level, int codim) const
number of entities per level and codim in this process
Definition: yaspgrid.hh:1258
Definition: yaspgrid.hh:89
send overlap, receive overlap and front entities
Definition: gridenums.hh:87
Specialize with 'true' if implementation guarantees conforming level grids. (default=false) ...
Definition: common/capabilities.hh:103
const int yaspgrid_dim_bits
Definition: yaspgrid.hh:51
specialize with 'true' for all codims that a grid provides an iterator for (default=false) ...
Definition: common/capabilities.hh:71
[ provides Dune::Grid ]
Definition: yaspgrid.hh:58
Traits::template Codim< cd >::template Partition< pitype >::LevelIterator lbegin(int level) const
one past the end on this level
Definition: yaspgrid.hh:1162
const int yaspgrid_level_bits
Definition: yaspgrid.hh:52
Container for equidistant coordinates in a YaspGrid.
Definition: coordinates.hh:26
implements a collection of multiple std::deque<Intersection> Intersections with neighboring processor...
Definition: ygrid.hh:820
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())
Definition: yaspgrid.hh:734
Definition: defaultgridview.hh:23
The YaspEntitySeed class.
const Traits::LocalIdSet & localIdSet() const
Definition: yaspgrid.hh:1572
Specialize with 'true' for if the codimension 0 entity of the grid has only one possible geometry typ...
Definition: common/capabilities.hh:24
Traits::template Codim< Seed::codimension >::Entity entity(const Seed &seed) const
Definition: yaspgrid.hh:1219
iTupel levelSize(int l) const
return size vector of the grid (in cells) on level l
Definition: yaspgrid.hh:273
int overlapSize(int codim) const
return size (= distance in graph) of overlap region
Definition: yaspgrid.hh:1239
CommDataHandleIF describes the features of a data handle for communication in parallel runs using the...
Definition: datahandleif.hh:75
const Traits::LevelIndexSet & levelIndexSet(int level) const
Definition: yaspgrid.hh:1577
YaspIndexSet< YaspGrid< dim, Coordinates >, false > LevelIndexSetType
Definition: yaspgrid.hh:722
The YaspGeometry class and its specializations.
constexpr Overlap overlap
PartitionSet for the overlap partition.
Definition: partitionset.hh:276
Wrapper class for entities.
Definition: common/entity.hh:63
Specialize with 'true' if implementation provides backup and restore facilities. (default=false) ...
Definition: common/capabilities.hh:121
YaspIntersectionIterator enables iteration over intersections with neighboring codim 0 entities...
Definition: yaspgrid.hh:63
This provides a YGrid, the elemental component of the yaspgrid implementation.
A traits struct that collects all associated types of one grid model.
Definition: common/grid.hh:1063
specialize with 'true' for all codims that a grid can communicate data on (default=false) ...
Definition: common/capabilities.hh:94
Definition: yaspgrid.hh:60
YGridLevelIterator begin() const
return iterator pointing to coarsest level
Definition: yaspgrid.hh:296
bool checkIfMonotonous(const std::array< std::vector< ctype >, dim > &coords)
Definition: coordinates.hh:361
const CollectiveCommunicationType & comm() const
return a collective communication object
Definition: yaspgrid.hh:1590
Coordinate container for a tensor product YaspGrid.
Definition: coordinates.hh:233
IdSet< const GridImp, GlobalIdSetImp, GIDType > GlobalIdSet
The type of the global id set.
Definition: common/grid.hh:1135
Specialize with 'true' for all codims that a grid implements entities for. (default=false) ...
Definition: common/capabilities.hh:55
ReservedVector< YGridLevel, 32 >::const_iterator YGridLevelIterator
Iterator over the grid levels.
Definition: yaspgrid.hh:293
Iterator over a collection o YGrids A YGrid::Iterator is the heart of an entity in YaspGrid...
Definition: ygrid.hh:591
Base class for exceptions in Dune grid modules.
Definition: exceptions.hh:16
only ghost entities
Definition: gridenums.hh:140
int size(int codim) const
number of leaf entities per codim in this process
Definition: yaspgrid.hh:1272
int levelSize(int l, int i) const
return size of the grid (in cells) on level l in direction i
Definition: yaspgrid.hh:267
int origin(int i) const
Return origin in direction i.
Definition: ygrid.hh:142
Definition: yaspgrid.hh:68
Specialization of the StructuredGridFactory class for YaspGrid.
bool preAdapt()
returns true, if the grid will be coarsened
Definition: yaspgrid.hh:1146
YaspHierarchicIterator enables iteration over son entities of codim 0.
Definition: yaspgrid.hh:65
send all and receive all entities
Definition: gridenums.hh:89
GeometryType
Type representing VTK's entity geometry types.
Definition: common.hh:178
Specialize with 'true' if implementation guarantees a conforming leaf grid. (default=false) ...
Definition: common/capabilities.hh:112
Traits::template Codim< cd >::template Partition< All_Partition >::LevelIterator lbegin(int level) const
version without second template parameter for convenience
Definition: yaspgrid.hh:1176
Iterates over entities of one grid level.
Definition: yaspgrid.hh:62
constexpr Interior interior
PartitionSet for the interior partition.
Definition: partitionset.hh:270
Implement the default load balance strategy of yaspgrid.
Definition: partitioning.hh:34
int size(GeometryType type) const
number of leaf entities per geometry type in this process
Definition: yaspgrid.hh:1284
int overlapSize(int level, int codim) const
return size (= distance in graph) of overlap region
Definition: yaspgrid.hh:1232
YaspIndexSet< YaspGrid< dim, Coordinates >, true > LeafIndexSetType
Definition: yaspgrid.hh:723
The general version that handles all codimensions but 0 and dim.
Definition: yaspgrid.hh:59
The YaspLevelIterator class.
Container for equidistant coordinates in a YaspGrid with non-trivial origin.
Definition: coordinates.hh:124
type describing an intersection with a neighboring processor
Definition: ygrid.hh:826
size_t numBoundarySegments() const
returns the number of boundary segments within the macro grid
Definition: yaspgrid.hh:1290
facility for writing and reading grids
Definition: common/backuprestore.hh:40
This provides container classes for the coordinates to be used in YaspGrid Upon implementation of the...
YaspGridFamily< dim, Coordinates > GridFamily
the GridFamily of this grid
Definition: yaspgrid.hh:717
bigunsignedint< dim *yaspgrid_dim_bits+yaspgrid_level_bits+dim > PersistentIndexType
Definition: yaspgrid.hh:714
persistent, globally unique Ids
Definition: yaspgrid.hh:67
iTupel globalSize() const
return number of cells on finest level on all processors
Definition: yaspgrid.hh:261
YaspIntersection provides data about intersection with neighboring codim 0 entities.
Definition: yaspgrid.hh:64
void communicate(CommDataHandleIF< DataHandleImp, DataType > &data, InterfaceType iftype, CommunicationDirection dir) const
Definition: yaspgrid.hh:1315
int max(const DofVectorPointer< int > &dofVector)
Definition: dofvector.hh:335
int getMark(const typename Traits::template Codim< 0 >::Entity &e) const
returns adaptation mark for given entity
Definition: yaspgrid.hh:1133
bool adapt()
map adapt to global refine
Definition: yaspgrid.hh:1139
reverse communication direction
Definition: gridenums.hh:170
void communicate(CommDataHandleIF< DataHandleImp, DataType > &data, InterfaceType iftype, CommunicationDirection dir, int level) const
Definition: yaspgrid.hh:1305
const Traits::LeafIndexSet & leafIndexSet() const
Definition: yaspgrid.hh:1583
int globalSize(int i) const
return number of cells on finest level in given direction on all processors
Definition: yaspgrid.hh:255
int size(int i) const
return size in direction i
Definition: ygrid.hh:195
int size() const
return the size of the container, this is the sum of the sizes of all deques
Definition: ygrid.hh:951
Definition: common/geometry.hh:24
send interior and border, receive all entities
Definition: gridenums.hh:86
void refineOptions(bool keepPhysicalOverlap)
set options for refinement
Definition: yaspgrid.hh:1103
ProcListIterator recvbegin() const
first process in receive list
Definition: torus.hh:353
GridTraits< dim, dim, Dune::YaspGrid< dim, Coordinates >, YaspGeometry, YaspEntity, YaspLevelIterator, YaspIntersection, YaspIntersection, YaspIntersectionIterator, YaspIntersectionIterator, YaspHierarchicIterator, YaspLevelIterator, YaspIndexSet< const YaspGrid< dim, Coordinates >, false >, YaspIndexSet< const YaspGrid< dim, Coordinates >, true >, 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
Definition: yaspgrid.hh:117
int ghostSize(int codim) const
return size (= distance in graph) of ghost region
Definition: yaspgrid.hh:1252
IdSet< const GridImp, LocalIdSetImp, LIDType > LocalIdSet
The type of the local id set.
Definition: common/grid.hh:1137
A set of traits classes to store static information about grid implementation.
InterfaceType
Parameter to be used for the communication functions.
Definition: gridenums.hh:84
send overlap, receive all entities
Definition: gridenums.hh:88
Traits::template Codim< cd >::template Partition< pitype >::LevelIterator lend(int level) const
Iterator to one past the last entity of given codim on level for partition type.
Definition: yaspgrid.hh:1169
void communicateCodim(DataHandle &data, InterfaceType iftype, CommunicationDirection dir, int level) const
Definition: yaspgrid.hh:1325
Iterator end() const
return iterator pointing to the end of the container
Definition: ygrid.hh:927
CollectiveCommunication< MPI_Comm > CCType
Definition: yaspgrid.hh:92
void intersections(const YGridComponent< Coordinates > &sendgrid, const YGridComponent< Coordinates > &recvgrid, std::deque< Intersection > &sendlist, std::deque< Intersection > &recvlist)
Construct list of intersections with neighboring processors.
Definition: yaspgrid.hh:563
YGridComponent< Coordinates > intersection(const YGridComponent< Coordinates > &r) const
Return YGridComponent of supergrid of self which is the intersection of self and another YGridCompone...
Definition: ygrid.hh:269
Provides base classes for index and id sets.
CommunicationDirection
Define a type for communication direction parameter.
Definition: gridenums.hh:168
static const YLoadBalanceDefault< dim > * defaultLoadbalancer()
Definition: yaspgrid.hh:316
interior, border, and overlap entities
Definition: gridenums.hh:137
const Dune::FieldVector< ctype, dim > & domainSize() const
returns the size of the physical domain
Definition: yaspgrid.hh:1296
all entities
Definition: gridenums.hh:139
Iterator begin() const
return iterator pointing to the begin of the container
Definition: ygrid.hh:921
Different resources needed by all grid implementations.
Traits::template Codim< cd >::template Partition< pitype >::LeafIterator leafend() const
return LeafIterator which points behind the last entity in maxLevel
Definition: yaspgrid.hh:1197
send/receive interior and border entities
Definition: gridenums.hh:85
YaspGlobalIdSet< YaspGrid< dim, Coordinates > > GlobalIdSetType
Definition: yaspgrid.hh:724
YaspGridFamily< dim, Coordinates >::Traits Traits
Definition: yaspgrid.hh:719
The YaspIntersection class.
YGridComponent< Coordinates > move(iTupel v) const
return grid moved by the vector v
Definition: ygrid.hh:261
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())
Standard constructor for a tensorproduct YaspGrid.
Definition: yaspgrid.hh:874
YGridLevelIterator begin(int i) const
return iterator pointing to given level
Definition: yaspgrid.hh:302
GridFamily::Traits::CollectiveCommunication CollectiveCommunication
A type that is a model of Dune::CollectiveCommunication. It provides a portable way for collective co...
Definition: common/grid.hh:519
unsigned char uint8_t
Definition: yaspgrid.hh:16
bool isPeriodic(int i) const
return whether the grid is periodic in direction i
Definition: yaspgrid.hh:282
The YaspIntersectionIterator class.
void boundarysegmentssize()
Definition: yaspgrid.hh:685
const Traits::GlobalIdSet & globalIdSet() const
Definition: yaspgrid.hh:1567
Definition: defaultgridview.hh:206
bool mark(int refCount, const typename Traits::template Codim< 0 >::Entity &e)
Marks an entity to be refined/coarsened in a subsequent adapt.
Definition: yaspgrid.hh:1119
This file provides the infrastructure for toroidal communication in YaspGrid.
Traits::template Codim< cd >::template Partition< pitype >::LeafIterator leafbegin() const
return LeafIterator which points to the first entity in maxLevel
Definition: yaspgrid.hh:1190
implements a collection of YGridComponents which form a codimension Entities of given codimension c n...
Definition: ygrid.hh:548