DUNE PDELab (git)

p0.hh
1 // -*- tab-width: 4; indent-tabs-mode: nil -*-
2 #ifndef DUNE_PDELAB_CONSTRAINTS_P0_HH
3 #define DUNE_PDELAB_CONSTRAINTS_P0_HH
4 
5 #include "../common/geometrywrapper.hh"
6 #include <dune/typetree/typetree.hh>
7 
8 namespace Dune {
9  namespace PDELab {
10 
14 
17  : public TypeTree::LeafNode
18  {
19  public:
20  enum{doBoundary=false};
21  enum{doProcessor=true};
22  enum{doSkeleton=false};
23  enum{doVolume=false};
24 
26 
31  template<typename I, typename LFS, typename T>
33  const LFS& lfs, T& trafo) const
34  {
35  typename T::RowType empty;
36  typedef typename LFS::Traits::SizeType size_type;
37  for (size_type i=0; i<lfs.size(); i++){
38  trafo[lfs.dofIndex(i)] = empty;
39  }
40  }
41  };
43 
44  }
45 }
46 
47 #endif // DUNE_PDELAB_CONSTRAINTS_P0_HH
Wrap intersection.
Definition: geometrywrapper.hh:57
Parallel P0 constraints for overlapping grids.
Definition: p0.hh:18
void processor(const Dune::PDELab::IntersectionGeometry< I > &ig, const LFS &lfs, T &trafo) const
processor constraints
Definition: p0.hh:32
Base class for leaf nodes in a dune-typetree.
Definition: leafnode.hh:28
Dune namespace.
Definition: alignedallocator.hh:13
constexpr std::bool_constant<(sizeof...(II)==0)> empty(std::integer_sequence< T, II... >)
Checks whether the sequence is empty.
Definition: integersequence.hh:80
Creative Commons License   |  Legal Statements / Impressum  |  Hosted by TU Dresden  |  generated with Hugo v0.80.0 (May 16, 22:29, 2024)