Skip to content
Snippets Groups Projects
Commit 8ee80a96 authored by Sander, Oliver's avatar Sander, Oliver
Browse files

Switch to modern style of GeometryType construction

parent 4a37faa6
No related branches found
No related tags found
No related merge requests found
Pipeline #1209 failed
...@@ -66,7 +66,7 @@ void testWeightSet(const std::vector<TargetSpace>& corners, ...@@ -66,7 +66,7 @@ void testWeightSet(const std::vector<TargetSpace>& corners,
int quadOrder = 3; int quadOrder = 3;
const Dune::QuadratureRule<double, dim>& quad const Dune::QuadratureRule<double, dim>& quad
= Dune::QuadratureRules<double, dim>::rule(GeometryType(GeometryType::simplex,dim), quadOrder); = Dune::QuadratureRules<double, dim>::rule(GeometryTypes::simplex(dim), quadOrder);
for (size_t pt=0; pt<quad.size(); pt++) { for (size_t pt=0; pt<quad.size(); pt++) {
......
...@@ -40,15 +40,12 @@ void test() ...@@ -40,15 +40,12 @@ void test()
PQkLocalFiniteElementCache<double,double,domainDim,1> feCache; PQkLocalFiniteElementCache<double,double,domainDim,1> feCache;
typedef typename PQkLocalFiniteElementCache<double,double,domainDim,1>::FiniteElementType LocalFiniteElement; typedef typename PQkLocalFiniteElementCache<double,double,domainDim,1>::FiniteElementType LocalFiniteElement;
GeometryType simplex;
simplex.makeSimplex(domainDim);
for (int i=0; i<numIndices; i++, ++index) { for (int i=0; i<numIndices; i++, ++index) {
for (int j=0; j<domainDim+1; j++) for (int j=0; j<domainDim+1; j++)
coefficients[j] = testPoints[index[j]]; coefficients[j] = testPoints[index[j]];
LocalGfeTestFunctionFiniteElement<LocalFiniteElement,TargetSpace> testFunctionSet(feCache.get(simplex),coefficients); LocalGfeTestFunctionFiniteElement<LocalFiniteElement,TargetSpace> testFunctionSet(feCache.get(GeometryTypes::simplex(domainDim)),coefficients);
FieldVector<double,domainDim> stupidTestPoint(0); FieldVector<double,domainDim> stupidTestPoint(0);
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment