/usr/include/trilinos/Shards_CellTopologyTraits.hpp is in libtrilinos-shards-dev 12.12.1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 | /*
//@HEADER
// ************************************************************************
//
// Shards : Shared Discretization Tools
// Copyright 2008 Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Carter Edwards (hcedwar@sandia.gov),
// Pavel Bochev (pbboche@sandia.gov), or
// Denis Ridzal (dridzal@sandia.gov).
//
// ************************************************************************
//@HEADER
*/
#ifndef Shards_CellTopologyTraits_hpp
#define Shards_CellTopologyTraits_hpp
#include <Shards_TypeList.hpp>
#include <Shards_IndexList.hpp>
#include <Shards_CellTopologyData.h>
namespace shards {
/** \addtogroup shards_package_cell_topology
* \{
*/
/**
* \brief Return a CellTopology singleton for the given cell topology traits.
*/
template< class Traits >
const CellTopologyData * getCellTopologyData();
template< unsigned Dimension ,
unsigned Number_Vertex ,
unsigned Number_Node ,
class EdgeList = TypeListEnd ,
class EdgeMaps = TypeListEnd ,
class FaceList = TypeListEnd ,
class FaceMaps = TypeListEnd ,
class PermutationMaps = TypeListEnd ,
class PermutationPolarity = IndexList<> >
struct CellTopologyTraits ;
struct Node ;
//----------------------------------------------------------------------
//----------------------------------------------------------------------
// Implementation details for a much of this file ...
#ifndef DOXYGEN_COMPILE
template< class CellTop , class CellMap , unsigned Index , bool Good >
struct SubcellNodeIndex ;
template< class CellTop , class CellMap , unsigned Index >
struct SubcellNodeIndex< CellTop , CellMap , Index , false >
{ enum { value = ~0u }; };
template< class CellTop , class CellMap , unsigned Index >
struct SubcellNodeIndex< CellTop , CellMap , Index , true >
{
private:
typedef typename CellTop::template subcell<0> subcell_node ;
public:
enum { value = Index < subcell_node::count
? IndexListAt< CellMap , Index >::value : ~0u };
};
//----------------------------------------------------------------------
template< unsigned SubcellDim , unsigned SubcellOrd , unsigned NodeIndex ,
unsigned Dimension , unsigned Number_Vertex , unsigned Number_Node ,
class EdgeList , class EdgeMaps ,
class FaceList , class FaceMaps ,
class PermMaps , class Pol>
struct SubcellTopologyTraits ;
template< class ListType > struct TypeListHomogeneous ;
//----------------------------------------------------------------------
// Self-subcell reference
template<>
struct SubcellTopologyTraits<0,0,0,0,0,0,TypeListEnd,TypeListEnd,
TypeListEnd,TypeListEnd,
TypeListEnd,IndexList<> >
{
typedef CellTopologyTraits<0,0,0> topology ;
enum { count = 1 };
enum { node = ~0u };
enum { homogeneity = true };
};
template< unsigned NodeIndex ,
unsigned NV , unsigned NN ,
class EList , class EMaps ,
class FList , class FMaps ,
class PMaps , class Pol>
struct SubcellTopologyTraits<1,0,NodeIndex, 1,NV,NN,EList,EMaps,FList,FMaps,PMaps,Pol>
{
typedef CellTopologyTraits<1,NV,NN,EList,EMaps,FList,FMaps,PMaps,Pol> topology ;
enum { count = 1 };
enum { node = NodeIndex < NN ? NodeIndex : ~0u };
enum { homogeneity = true };
};
template< unsigned NodeIndex ,
unsigned NV , unsigned NN ,
class EList , class EMaps ,
class FList , class FMaps ,
class PMaps , class Pol>
struct SubcellTopologyTraits<2,0,NodeIndex, 2,NV,NN,EList,EMaps,FList,FMaps,PMaps,Pol>
{
typedef CellTopologyTraits<2,NV,NN,EList,EMaps,FList,FMaps,PMaps,Pol> topology ;
enum { count = 1 };
enum { node = NodeIndex < NN ? NodeIndex : ~0u };
enum { homogeneity = true };
};
template< unsigned NodeIndex ,
unsigned NV , unsigned NN ,
class EList , class EMaps ,
class FList , class FMaps ,
class PMaps , class Pol>
struct SubcellTopologyTraits<3,0,NodeIndex, 3,NV,NN,EList,EMaps,FList,FMaps,PMaps,Pol>
{
typedef CellTopologyTraits<3,NV,NN,EList,EMaps,FList,FMaps,PMaps,Pol> topology ;
enum { count = 1 };
enum { node = NodeIndex < NN ? NodeIndex : ~0u };
enum { homogeneity = true };
};
//----------------------------------------------------------------------
// Node-subcell reference:
template< unsigned SubcellOrd ,
unsigned D , unsigned NV , unsigned NN ,
class EList , class EMaps ,
class FList , class FMaps ,
class PMaps , class Pol>
struct SubcellTopologyTraits<0,SubcellOrd,0, D,NV,NN,EList,EMaps,FList,FMaps,PMaps,Pol>
{
typedef CellTopologyTraits<0,0,0> topology ;
enum { count = NN };
enum { node = SubcellOrd < NN ? SubcellOrd : ~0u };
enum { homogeneity = true };
};
// Edge-subcell reference:
template< unsigned SubcellOrd , unsigned NodeIndex ,
unsigned D , unsigned NV , unsigned NN ,
class EList , class EMaps ,
class FList , class FMaps ,
class PMaps , class Pol>
struct SubcellTopologyTraits<1,SubcellOrd,NodeIndex,
D,NV,NN,EList,EMaps,FList,FMaps,PMaps,Pol>
{
private:
typedef typename TypeListAt<EMaps,SubcellOrd>::type node_map ;
public:
typedef typename TypeListAt<EList,SubcellOrd>::type topology ;
enum { count = TypeListLength<EList>::value };
enum { node = SubcellNodeIndex< topology , node_map , NodeIndex ,
SubcellOrd < count >::value };
enum { homogeneity = TypeListHomogeneous<EList>::value };
};
// Face-subcell reference:
template< unsigned SubcellOrd , unsigned NodeIndex ,
unsigned D , unsigned NV , unsigned NN ,
class EList , class EMaps ,
class FList , class FMaps ,
class PMaps , class Pol>
struct SubcellTopologyTraits< 2, SubcellOrd, NodeIndex,
D,NV,NN,EList,EMaps,FList,FMaps,PMaps,Pol >
{
private:
typedef typename TypeListAt<FMaps,SubcellOrd>::type node_map ;
public:
typedef typename TypeListAt<FList,SubcellOrd>::type topology ;
enum { count = TypeListLength<FList>::value };
enum { node = SubcellNodeIndex< topology , node_map , NodeIndex ,
SubcellOrd < count >::value };
enum { homogeneity = TypeListHomogeneous<FList>::value };
};
//----------------------------------------------------------------------
// Only partially specialized subcell references are valid.
template< unsigned SubcellDim , unsigned SubcellOrd , unsigned NodeIndex ,
unsigned Dimension ,
unsigned Number_Vertex , unsigned Number_Node ,
class EdgeList , class EdgeMaps ,
class FaceList , class FaceMaps ,
class PermMaps , class Pol >
struct SubcellTopologyTraits
{
typedef void topology ;
enum { count = 0 };
enum { node = ~0u };
enum { homogeneity = false };
};
//----------------------------------------------------------------------
template<>
struct TypeListHomogeneous<TypeListEnd> {
enum { value = true };
};
template< class T >
struct TypeListHomogeneous< TypeList<T,TypeListEnd> > {
enum { value = true };
};
template< class T , class Tail >
struct TypeListHomogeneous< TypeList< T, TypeList< T , Tail > > > {
enum { value = TypeListHomogeneous< TypeList<T,Tail> >::value };
};
template< class ListType >
struct TypeListHomogeneous
{
enum { value = false };
};
//----------------------------------------------------------------------
template< unsigned I , unsigned J > struct AssertEqual ;
template< unsigned I > struct AssertEqual<I,I> { enum { OK = true }; };
#endif /* DOXYGEN_COMPILE */
//----------------------------------------------------------------------
/** \brief Compile-time traits for a cell topology. */
template< unsigned Dimension , unsigned Number_Vertex , unsigned Number_Node ,
class EdgeList , class EdgeMaps ,
class FaceList , class FaceMaps ,
class PermutationMaps ,
class PermutationPolarity >
struct CellTopologyTraits
{
/** \brief The <em> self </em> type for the traits */
typedef CellTopologyTraits< Dimension, Number_Vertex, Number_Node,
EdgeList, EdgeMaps, FaceList, FaceMaps,
PermutationMaps, PermutationPolarity > Traits ;
enum {
/** \brief Topological dimension */
dimension = Dimension ,
/** \brief Number of vertices */
vertex_count = Number_Vertex ,
/** \brief Number of nodes (a.k.a. Cell^0 subcells). */
node_count = Number_Node ,
/** \brief Number of edges (a.k.a. Cell^1 subcells). */
edge_count = TypeListLength<EdgeList>::value ,
#ifndef DOXYGEN_COMPILE
face_count = TypeListLength<FaceList>::value ,
#endif
/** \brief Number of sides (a.k.a. Cell^(D-1) subcells). */
side_count = Dimension == 3 ? face_count : (
Dimension == 2 ? edge_count : 0 ),
/** \brief Unique key for this topology.
*
* Uniqueness assumes that extended topology nodes (non-vertex nodes)
* are placed regularly throughout the cell topology. For example,
* if any edge has an interior node then all edges have an interior node.
* If this assumption is violated then the key cannot guarantee uniqueness.
*/
key = ( dimension << 28 /* 4 bits, max 7 */ ) |
( face_count << 22 /* 6 bits, max 63 */ ) |
( edge_count << 16 /* 6 bits, max 63 */ ) |
( vertex_count << 10 /* 6 bits, max 63 */ ) |
( node_count /* 10 bits, max 1023 */ ) };
/** \brief Subcell information
*
* - <b> subcell<Dim>::count </b> Number of subcells of this dimension
* - <b> subcell<Dim>::homogeneity </b> Homogeneous subcells of this dim
* - <b> subcell<Dim,Ord>::topology </b> topology of the subcell
* - <b> subcell<Dim,Ord,J>::node </b> node ordinal of subcell's node J
*/
template< unsigned Dim, unsigned Ord = 0, unsigned J = 0 >
struct subcell :
public SubcellTopologyTraits< Dim , Ord , J ,
dimension , vertex_count , node_count ,
EdgeList , EdgeMaps ,
FaceList , FaceMaps ,
PermutationMaps, PermutationPolarity > {};
/** \brief Side subcell information
*
* - <b> side<>::count </b> Number of sides
* - <b> side<>::homogeneity </b> Homogeneous sides
* - <b> side<Ord>::topology </b> topology of the side
* - <b> side<Ord,J>::node </b> node ordinal of side's node J
*/
template< unsigned Ord = 0 , unsigned J = 0 >
struct side :
public SubcellTopologyTraits< ( 1 < dimension ? dimension - 1 : 4 ) ,
Ord , J ,
dimension , vertex_count , node_count ,
EdgeList , EdgeMaps ,
FaceList , FaceMaps ,
TypeListEnd , IndexList<> > {};
/** \brief Edge subcell information
*
* - <b> edge<>::count </b> Number of edge
* - <b> edge<>::homogeneity </b> Homogeneous edges
* - <b> edge<Ord>::topology </b> topology of the edge
* - <b> edge<Ord,J>::node </b> node ordinal of edge's node J
*/
template< unsigned Ord = 0 , unsigned J = 0 >
struct edge :
public SubcellTopologyTraits< ( 1 < dimension ? 1 : 4 ) , Ord , J ,
dimension , vertex_count , node_count ,
EdgeList , EdgeMaps ,
TypeListEnd , TypeListEnd ,
TypeListEnd , IndexList<> > {};
//--------------------------------------------------------------------
/** \brief Node permutations for proper subcells.
*
* ParentCell and SubCell are connected if every node of SubCell
* is also a node of ParentCell. However, the connection may be
* permuted.
*
* Let ParentCell be dimension D and SubCell be dimension dim < D.
* Let SubCell be connected as subcell Ord with permutation P.
*
* Then <b> ParentCell.node(K) == SubCell.node(J) </b> where:
* - SubCellTopology == ParentCellTopology::subcell<dim,Ord>::topology
* - K = ParentCellTopology::subcell<dim,Ord,JP>::node
* - JP = SubCellTopology::permutation<P,J>::node
* - J = SubCellTopology::permutation_inverse<P,JP>::node
*
* The permutation map for P == 0 is required to be identity.
*/
template< unsigned Perm , unsigned J = 0 >
struct permutation {
private:
typedef typename TypeListAt< PermutationMaps , Perm >::type node_map ;
public:
enum { node = J < node_count ? IndexListAt< node_map , J >::value : ~0u };
enum { polarity = IndexListAt< PermutationPolarity , Perm >::value };
};
template< unsigned Perm , unsigned J = 0 >
struct permutation_inverse {
private:
typedef typename TypeListAt< PermutationMaps , Perm >::type forward_map ;
typedef typename IndexListInverse< forward_map >::type node_map ;
public:
enum { node = J < node_count ? IndexListAt< node_map , J >::value : ~0u };
enum { polarity = IndexListAt< PermutationPolarity , Perm >::value };
};
enum { permutation_count = TypeListLength< PermutationMaps >::value };
//--------------------------------------------------------------------
private:
#ifndef DOXYGEN_COMPILE
enum { nedge_map = TypeListLength<EdgeMaps>::value ,
nface_map = TypeListLength<FaceMaps>::value ,
polarity_count = IndexListLength< PermutationPolarity >::value };
enum { OK_edge = AssertEqual< edge_count , nedge_map >::OK };
enum { OK_face = AssertEqual< face_count , nface_map >::OK };
enum { OK_dimen = AssertEqual< 0 , (dimension >> 3) >::OK };
enum { OK_faceN = AssertEqual< 0 , (face_count >> 6) >::OK };
enum { OK_edgeN = AssertEqual< 0 , (edge_count >> 6) >::OK };
enum { OK_vertN = AssertEqual< 0 , (vertex_count >> 6) >::OK };
enum { OK_nodeN = AssertEqual< 0 , (node_count >> 10) >::OK };
enum { OK_permN = AssertEqual< permutation_count, polarity_count >::OK };
#endif
};
/** \} */
} // namespace shards
#endif // Shards_CellTopologyTraits_hpp
|