shards  Version of the Day
Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:
[detail level 12]
 Cshards::Array< Scalar, array_order, Tag1, Tag2, Tag3, Tag4, Tag5, Tag6, Tag7, Tag8 >The preferred multi-dimensional Array interface with compile-time user-defined dimension ordinates
 Cshards::Array< Scalar, array_order, void, void, void, void, void, void, void, void >The multi-dimensional Array interface with runtime user-defined dimension ordinates. Typically used when runtime-polymorphic arrays are passed to functions
 Cshards::Array< Scalar, Order, Tag1, Tag2, Tag3, Tag4, Tag5, Tag6, Tag7, Tag8 >
 Cshards::Array< Scalar, Order, void, void, void, void, void, void, void, void >
 Cshards::Array< Scalar, RankZero, void, void, void, void, void, void, void, void >Specialization for an array with Rank = 0
 Cshards::ArrayDimTagAbstract base class for array dimension tags supplied to the Array template class
 Cshards::ArrayDimensionAn anonymous array dimension tag, which is NOT the recommended usage
 Cshards::Beam< NodeCount >Topological traits: Dimension = 2, Edges = 1, Vertices = 2, and Nodes = 2 or 3
 Cshards::BitAnd< n, i >Bitwise-and into an array
 Cshards::BitOr< n, i >Bitwise-or into an array
 Cshards::CellTopologyProvide input checked access (in debug mode) to cell topology data and a procedure to create custom cell topologies
 CCellTopologyDataA simple 'C' struct of cell topology attributes
 CCellTopologyData_PermutationArray of node permutations
 CCellTopologyData_SubcellSubcell information
 Cshards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >Compile-time traits for a cell topology
 Cshards::CellTopologyTraits< 0, 0, 0 >
 Cshards::NodeTopological traits: Dimension = 0, Vertices = 0, Nodes = 0
 Cshards::CellTopologyTraits< 1, 1, 1 >
 Cshards::ParticleTopological traits: Dimension = 1, Vertices = 1, Nodes = 1
 Cshards::Compare< n, i >Lexicographical comparison of two arrays
 Cshards::Copy< n, i >Copy into an array
 Cshards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >::edge< Ord, J >Edge subcell information
 Cshards::Hexahedron< NodeCount >Topological traits: Dimension = 3, Sides = 6, Edges = 12, Vertices = 8, and Nodes = 8, 20, or 27
 Cshards::IndexList< I0, I1, I2, I3, I4, I5, I6, I7, I8, I9, I10, I11, I12, I13, I14, I15, I16, I17, I18, I19, I20, I21, I22, I23, I24, I25, I26, I27, I28, I29, I30, I31 >Compile-time list of indices
 Cshards::IndexListAt< List, J >Access member of compile-time list of indices.
Defines enum { value = Jth member };
 Cshards::IndexListLength< List >Length of list. Defines enum { value };
 Cshards::InnerProduct< n, i >Inner product of two arrays
 Cshards::Line< NodeCount >Topological traits: Dimension = 1, Vertices = 2, Nodes = 2 or 3
 Cshards::MakeTypeList< T00, T01, T02, T03, T04, T05, T06, T07, T08, T09, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21, T22, T23, T24, T25, T26, T27, T28, T29, T30, T31, T32, T33, T34, T35, T36, T37, T38, T39, T40, T41, T42, T43, T44, T45, T46, T47, T48, T49, T50, T51, T52, T53, T54, T55, T56, T57, T58, T59, T60, T61, T62, T63 >Member typedef ... type ; is a type list constructed from the template arguments
 Cshards::Max< n, i >Take maximum value of each member of two arrays
 Cshards::Min< n, i >Take minimum value of each member of two arrays
 Cshards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >::permutation< Perm, J >Node permutations for proper subcells
 Cshards::Prod< n, i >Scale into an array
 Cshards::Pyramid< NodeCount >Topological traits: Dimension = 3, Sides = 5, Edges = 8, Vertices = 5, and Nodes = 5, 13, or 14
 Cshards::Quadrilateral< NodeCount >Topological traits: Dimension = 2, Edges = 4, Vertices = 4, and Nodes = 4, 8, or 9
 Cshards::SameType< T1, T2 >Member enum { value = ... }; is true if T1 and T2 are the same type
 Cshards::ShellLine< NodeCount >Topological traits: Dimension = 2, Edges = 2, Vertices = 2, and Nodes = 2 or 3
 Cshards::ShellQuadrilateral< NodeCount >Topological traits: Dimension = 2, Sides = 2, Edges = 4, Vertices = 4, and Nodes = 4, 8, or 9
 Cshards::ShellTriangle< NodeCount >Topological traits: Dimension = 3, Sides = 2, Edges = 3, Vertices = 3, and Nodes = 3 or 6
 Cshards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >::side< Ord, J >Side subcell information
 Cshards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >::subcell< Dim, Ord, J >Subcell information
 Cshards::Sum< n, i >Sum into an array
 Cshards::Tetrahedron< NodeCount >Topological traits: Dimension = 3, Sides = 4, Edges = 6, Vertices = 4, and Nodes = 4 or 10
 Cshards::Triangle< NodeCount >Topological traits: Dimension = 2, Edges = 3, Vertices = 3, and Nodes = 3 or 6
 Cshards::TypeList< Value, Tail >A link within a linked list of types
 Cshards::TypeListAppend< ListA, T >Member typedef ... type ; is defined by appending T to the end of ListA
 Cshards::TypeListAt< ListType, ordinal >Member typedef ... type ; is the type of the member of ListType at location ordinal if ordinal is less than the type list length
 Cshards::TypeListClean< ListType >Member typedef ... type ; is defined by truncating ListType at the first occurance of TypeListEnd . Used by MakeTypeList to generate a clean type list
 Cshards::TypeListCount< ListType, TestValue >Member enum { value = ... }; is the number of occurances of TestValue within ListType
 Cshards::TypeListDisjoint< ListA, ListB >Member enum { value = ... }; is true if all members of ListA are not a member ListB
 Cshards::TypeListEraseAt< ListType, ordinal >Member typedef ... type ; is defined by erasing member at ordinal from ListType
 Cshards::TypeListFirst< ListType >Member typedef ... type ; is the first member of ListType
 Cshards::TypeListIndex< ListType, TestValue, ordinal >Member enum { value = ... }; is the location within ListType of occurance I of type TestValue . If this occurance does not exist then value = -1
 Cshards::TypeListJoin< ListA, ListB >Member typedef ... type ; is defined by joining ListB to the end of ListA
 Cshards::TypeListLast< ListType >Member typedef ... type ; is the last member of ListType
 Cshards::TypeListLength< ListType >Member enum { value = ... }; is the length of the type list
 Cshards::TypeListMember< ListType, TestValue >Member enum { value = ... }; is true if TestValue is a member of ListType
 Cshards::TypeListUnique< ListType >Member enum { value = ... }; is true if each member of ListType appears exactly once
 Cshards::Wedge< NodeCount >Topological traits: Dimension = 3, Sides = 5, Edges = 9, Vertices = 6, and Nodes = 6, 15, or 18