This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 12]

shards::Array< Scalar, Order, Tag1, Tag2, Tag3, Tag4, Tag5, Tag6, Tag7, Tag8 >	The preferred multi-dimensional Array interface with compile-time user-defined dimension ordinates
shards::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
shards::Array< Scalar, Order, void, void, void, void, void, void, void, void >
shards::Array< Scalar, RankZero, void, void, void, void, void, void, void, void >	Specialization for an array with Rank = 0
shards::ArrayDimTag	Abstract base class for array dimension tags supplied to the Array template class
shards::ArrayDimension	An anonymous array dimension tag, which is NOT the recommended usage
shards::Beam< NodeCount >	Topological traits: Dimension = 2, Edges = 1, Vertices = 2, and Nodes = 2 or 3
shards::BitAnd< n, i >	Bitwise-and into an array
shards::BitOr< n, i >	Bitwise-or into an array
shards::CellTopology	Provide input checked access (in debug mode) to cell topology data and a procedure to create custom cell topologies
CellTopologyData	A simple 'C' struct of cell topology attributes
CellTopologyData_Permutation	Array of node permutations
CellTopologyData_Subcell	Subcell information
shards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >	Compile-time traits for a cell topology
shards::CellTopologyTraits< 0, 0, 0 >
shards::Node	Topological traits: Dimension = 0, Vertices = 0, Nodes = 0
shards::CellTopologyTraits< 0, 1, 1 >
shards::Particle	Topological traits: Dimension = 0, Vertices = 1, Nodes = 1
shards::Compare< n, i >	Lexicographical comparison of two arrays
shards::Copy< n, i >	Copy into an array
shards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >::edge< Ord, J >	Edge subcell information
shards::Hexahedron< NodeCount >	Topological traits: Dimension = 3, Sides = 6, Edges = 12, Vertices = 8, and Nodes = 8, 20, or 27
shards::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
shards::IndexListAt< List, J >	Access member of compile-time list of indices. Defines enum { value = Jth member };
shards::IndexListLength< List >	Length of list. Defines enum { value };
shards::InnerProduct< n, i >	Inner product of two arrays
shards::Line< NodeCount >	Topological traits: Dimension = 1, Vertices = 2, Nodes = 2 or 3
shards::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
shards::Max< n, i >	Take maximum value of each member of two arrays
shards::Min< n, i >	Take minimum value of each member of two arrays
shards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >::permutation< Perm, J >	Node permutations for proper subcells
shards::Prod< n, i >	Scale into an array
shards::Pyramid< NodeCount >	Topological traits: Dimension = 3, Sides = 5, Edges = 8, Vertices = 5, and Nodes = 5, 13, or 14
shards::Quadrilateral< NodeCount >	Topological traits: Dimension = 2, Edges = 4, Vertices = 4, and Nodes = 4, 8, or 9
shards::SameType< T1, T2 >	Member enum { value = ... }; is true if T1 and T2 are the same type
shards::ShellLine< NodeCount >	Topological traits: Dimension = 2, Edges = 2, Vertices = 2, and Nodes = 2 or 3
shards::ShellQuadrilateral< NodeCount >	Topological traits: Dimension = 2, Sides = 2, Edges = 4, Vertices = 4, and Nodes = 4, 8, or 9
shards::ShellTriangle< NodeCount >	Topological traits: Dimension = 3, Sides = 2, Edges = 3, Vertices = 3, and Nodes = 3 or 6
shards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >::side< Ord, J >	Side subcell information
shards::CellTopologyTraits< Dimension, Number_Vertex, Number_Node, EdgeList, EdgeMaps, FaceList, FaceMaps, PermutationMaps, PermutationPolarity >::subcell< Dim, Ord, J >	Subcell information
shards::Sum< n, i >	Sum into an array
shards::Tetrahedron< NodeCount >	Topological traits: Dimension = 3, Sides = 4, Edges = 6, Vertices = 4, and Nodes = 4 or 10
shards::Triangle< NodeCount >	Topological traits: Dimension = 2, Edges = 3, Vertices = 3, and Nodes = 3 or 6
shards::TypeList< Value, Tail >	A link within a linked list of types
shards::TypeListAppend< ListA, T >	Member typedef ... type ; is defined by appending T to the end of ListA
shards::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
shards::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
shards::TypeListCount< ListType, TestValue >	Member enum { value = ... }; is the number of occurances of TestValue within ListType
shards::TypeListDisjoint< ListA, ListB >	Member enum { value = ... }; is true if all members of ListA are not a member ListB
shards::TypeListEraseAt< ListType, ordinal >	Member typedef ... type ; is defined by erasing member at ordinal from ListType
shards::TypeListFirst< ListType >	Member typedef ... type ; is the first member of ListType
shards::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
shards::TypeListJoin< ListA, ListB >	Member typedef ... type ; is defined by joining ListB to the end of ListA
shards::TypeListLast< ListType >	Member typedef ... type ; is the last member of ListType
shards::TypeListLength< ListType >	Member enum { value = ... }; is the length of the type list
shards::TypeListMember< ListType, TestValue >	Member enum { value = ... }; is true if TestValue is a member of ListType
shards::TypeListUnique< ListType >	Member enum { value = ... }; is true if each member of ListType appears exactly once
shards::Wedge< NodeCount >	Topological traits: Dimension = 3, Sides = 5, Edges = 9, Vertices = 6, and Nodes = 6, 15, or 18