shards
Version of the Day

A simple 'C' struct of cell topology attributes. More...
#include <Shards_CellTopologyData.h>
Inherited by shards::CellTopologyManagedData.
Public Attributes  
struct CellTopologyData *  base 
Base, a.k.a. notextended, version of this topology where vertex_count == node_count.  
const char *  name 
Intuitive name for this topology.  
unsigned  key 
Unique key for this topology.  
unsigned  dimension 
Topological dimension.  
unsigned  vertex_count 
Number of vertices.  
unsigned  node_count 
Number of nodes (a.k.a. subcells). More...  
unsigned  edge_count 
Number of edges (a.k.a. boundary subcells).  
unsigned  side_count 
Number of sides (a.k.a. boundary subcells).  
unsigned  permutation_count 
Number of defined permutations.  
unsigned  subcell_homogeneity [4] 
Flag if the subcells of a given dimension are homogeneous.  
unsigned  subcell_count [4] 
Number of subcells of each dimension.  
struct CellTopologyData_Subcell *  subcell [4] 
Array of subcells of each dimension. More...  
struct CellTopologyData_Subcell *  side 
Array of side subcells of length side_count. More...  
struct CellTopologyData_Subcell *  edge 
Array of edges subcells of length edge_count. More...  
struct CellTopologyData_Permutation *  permutation 
Array of node permutations. More...  
struct CellTopologyData_Permutation *  permutation_inverse 
A simple 'C' struct of cell topology attributes.
The topology may be extended such that the number of nodes (subcells of dimension zero) is greater than the number of vertices. In this case the vertices must be ordered first.
Nodes, edges, and sides are subcells with a particular dimension. A cell has edges and sides only if its dimension is greater than one.
Definition at line 75 of file Shards_CellTopologyData.h.
unsigned CellTopologyData::node_count 
Number of nodes (a.k.a. subcells).
A topology is extended if node_count > vertex_count
Definition at line 97 of file Shards_CellTopologyData.h.
struct CellTopologyData_Subcell* CellTopologyData::subcell[4] 
Array of subcells of each dimension.
The length of each subcell array is subcell_count[Dim]
Definition at line 120 of file Shards_CellTopologyData.h.
struct CellTopologyData_Subcell* CellTopologyData::side 
Array of side subcells of length side_count.
The length of the side array is side_count
Definition at line 128 of file Shards_CellTopologyData.h.
struct CellTopologyData_Subcell* CellTopologyData::edge 
Array of edges subcells of length edge_count.
The length of the edge array is edge_count
Definition at line 136 of file Shards_CellTopologyData.h.
struct CellTopologyData_Permutation* CellTopologyData::permutation 
Array of node permutations.
Let ParentCell be dimension D and SubCell be dimension dim < D. Let SubCell be connected as subcell Ord with permutation P.
Then ParentCell.node(K) == SubCell.node(I) where:
The permutation map for P == 0 is required to be identity.
Definition at line 154 of file Shards_CellTopologyData.h.