deal.II version GIT relicensing-2173-gae8fc9d14b 2024-11-24 06:40:00+00:00
\(\newcommand{\dealvcentcolon}{\mathrel{\mathop{:}}}\) \(\newcommand{\dealcoloneq}{\dealvcentcolon\mathrel{\mkern-1.2mu}=}\) \(\newcommand{\jump}[1]{\left[\!\left[ #1 \right]\!\right]}\) \(\newcommand{\average}[1]{\left\{\!\left\{ #1 \right\}\!\right\}}\)
Loading...
Searching...
No Matches
Functions
mapping_cartesian.cc File Reference
#include <deal.II/base/array_view.h>
#include <deal.II/base/memory_consumption.h>
#include <deal.II/base/qprojector.h>
#include <deal.II/base/quadrature.h>
#include <deal.II/base/signaling_nan.h>
#include <deal.II/base/tensor.h>
#include <deal.II/dofs/dof_accessor.h>
#include <deal.II/fe/fe_values.h>
#include <deal.II/fe/mapping_cartesian.h>
#include <deal.II/grid/tria.h>
#include <deal.II/grid/tria_iterator.h>
#include <deal.II/lac/full_matrix.h>
#include <algorithm>
#include <cmath>
#include <memory>
#include "mapping_cartesian.inst"

Go to the source code of this file.

Functions

static ::ExceptionBaseExcCellNotCartesian ()
 
template<typename CellType >
bool is_cartesian (const CellType &cell)
 

Function Documentation

◆ is_cartesian()

template<typename CellType >
bool is_cartesian ( const CellType &  cell)

Return whether the incoming cell is of Cartesian shape. This is determined by checking if the smallest BoundingBox that encloses the cell has the same vertices as the cell itself.

Definition at line 52 of file mapping_cartesian.cc.