MAIA bb96820c
Multiphysics at AIA
Loading...
Searching...
No Matches
geometryintersection.h File Reference

Go to the source code of this file.

Classes

class  GeometryIntersection< nDim_ >
 
class  GeometryIntersection< nDim_ >::surfBase
 
class  GeometryIntersection< nDim_ >::polyVertex
 
class  GeometryIntersection< nDim_ >::polyEdgeBase
 
class  GeometryIntersection< nDim_ >::polyEdge2D
 
class  GeometryIntersection< nDim_ >::polyEdge3D
 
class  GeometryIntersection< nDim_ >::polyFace
 
class  GeometryIntersection< nDim_ >::polyMultiFace
 
class  GeometryIntersection< nDim_ >::polyCutCellBase
 
class  GeometryIntersection< nDim_ >::polyCutCell2D
 
class  GeometryIntersection< nDim_ >::polyCutCell3D
 
class  GeometryIntersection< nDim_ >::splitCartesianFace
 
class  GeometryIntersection< nDim_ >::cellWithSplitFace
 
class  GeometryIntersection< nDim_ >::CsgVector
 
class  GeometryIntersection< nDim_ >::CsgVertex
 
class  GeometryIntersection< nDim_ >::CsgPlane
 
class  GeometryIntersection< nDim_ >::CsgPolygon
 
class  GeometryIntersection< nDim_ >::CsgNode
 
class  GeometryIntersection< nDim_ >::Csg
 
class  lvlJumpCandidates< nDim >
 
class  CutCell< nDim >
 
class  CutCandidate< nDim >
 

Functions

template<typename T , std::size_t n>
constexpr std::array< T, n > make_array (const T v)
 
template<typename T , std::size_t n, std::size_t m>
constexpr std::array< std::array< T, m >, n > make_array (const T v)
 

Function Documentation

◆ make_array() [1/2]

template<typename T , std::size_t n>
constexpr std::array< T, n > make_array ( const T  v)
constexpr

Definition at line 37 of file geometryintersection.h.

37 {
38 std::array<T, n> a{};
39 a.fill(v);
40 return a;
41}
Definition: contexttypes.h:19

◆ make_array() [2/2]

template<typename T , std::size_t n, std::size_t m>
constexpr std::array< std::array< T, m >, n > make_array ( const T  v)
constexpr

Definition at line 45 of file geometryintersection.h.

45 {
46 std::array<std::array<T, m>, n> a{};
47 for(std::size_t i = 0; i < n; i++) {
48 for(std::size_t j = 0; j < m; j++) {
49 a[i][j] = v;
50 }
51 }
52 return a;
53}