Dune Core Modules (unstable)
cache.hh
3// SPDX-FileCopyrightInfo: Copyright © DUNE Project contributors, see file LICENSE.md in module root
93 std::conditional_t<isPyramid, LagrangePyramidLocalFiniteElement<Domain,Range,order>, UnknownToplogy> > > >;
A cache that stores Lagrange finite elements for the given dimension and order.
Definition: cache.hh:39
DynamicLagrangeLocalFiniteElementCache(unsigned int order)
Construct an empty cache.
Definition: cache.hh:44
const FiniteElementType & get(GeometryType type) const
Obtain the cached local finite-element.
Definition: cache.hh:55
Unique label for each type of entities that can occur in DUNE grids.
Definition: type.hh:114
constexpr bool isPyramid() const
Return true if entity is a pyramid.
Definition: type.hh:304
constexpr bool isPrism() const
Return true if entity is a prism.
Definition: type.hh:309
constexpr bool isCube() const
Return true if entity is a cube of any dimension.
Definition: type.hh:324
constexpr bool isSimplex() const
Return true if entity is a simplex of any dimension.
Definition: type.hh:319
Lagrange local finite elements for a given set of interpolation points.
Definition: lagrange.hh:66
A cache storing a compile time selection of local finite element implementations.
Definition: localfiniteelementvariantcache.hh:68
A cache that stores all available Pk/Qk like local finite elements for the given dimension and order ...
Definition: cache.hh:80
const FiniteElementType & get(GeometryType type) const
Obtain the cached local finite-element.
Definition: cache.hh:102
StaticLagrangeLocalFiniteElementCache(std::integral_constant< std::size_t, order >={})
Construct the local-finite element for the order specified as template parameter.
Definition: cache.hh:96
Convenience header that includes all implementations of Lagrange finite elements.
A unique label for each type of element that can occur in a grid.
Helper classes to provide indices for geometrytypes for use in a vector.
|
Legal Statements / Impressum |
Hosted by TU Dresden |
generated with Hugo v0.111.3
(Dec 21, 23:30, 2024)