moab::AdjSides< CORNERS >::Side Struct Reference

List of all members.

Public Member Functions
bool	skin () const
	Side (const EntityHandle *array, int idx, EntityHandle adj, unsigned short)
	Side (const EntityHandle *array, int idx, EntityHandle adj, unsigned short, const short *indices)
bool	operator== (const Side &other) const
Public Attributes
EntityHandle	handles [CORNERS-1]
	side vertices, except for implicit one
EntityHandle	adj_elem
	element that this is a side of, or zero

---

Detailed Description

template<unsigned CORNERS>
struct moab::AdjSides< CORNERS >::Side

This struct is used to for a reduced representation of element "sides" adjacent to a give vertex. As such, it a) does not store the initial vertex that all sides are adjacent to b) orders the remaining vertices in a specific way for fast comparison.

For edge elements, only the opposite vertex is stored. For triangle elements, only the other two vertices are stored, and they are stored with the smaller of those two handles first. For quad elements, only the other three vertices are stored. They are stored such that the vertex opposite the implicit (not stored) vertex is always in slot 1. The other two vertices (in slots 0 and 2) are ordered such that the handle of the one in slot 0 is smaller than the handle in slot 2.

For each side, the adj_elem field is used to store the element that it is a side of as long as the element is considered to be on the skin. The adj_elem field is cleared (set to zero) to indicate that this side is no longer considered to be on the skin (and is the side of more than one element.)

Definition at line 1212 of file Skinner.cpp.

---

Constructor & Destructor Documentation

template<unsigned CORNERS>

moab::AdjSides< CORNERS >::Side::Side	(	const EntityHandle *	array,
		int	idx,
		EntityHandle	adj,
		unsigned	short
	)		[inline]

construct from connectivity of side

Parameters:

array	The connectivity of the element side.
idx	The index of the implicit vertex (contained in all sides in the list.)
adj	The element that this is a side of.

Definition at line 1223 of file Skinner.cpp.

      : adj_elem(adj) /*, elem_side(side)*/ 
    {
      switch (CORNERS) {
        default:
          assert(false);
          break;
        case 4: handles[2] = array[(idx+3)%CORNERS];
        case 3: handles[1] = array[(idx+2)%CORNERS];
        case 2: handles[0] = array[(idx+1)%CORNERS];
      }
      if (CORNERS == 3 && handles[1] > handles[0])
        std::swap( handles[0], handles[1] );
      if (CORNERS == 4 && handles[2] > handles[0])
        std::swap( handles[0], handles[2] );
    }

template<unsigned CORNERS>

moab::AdjSides< CORNERS >::Side::Side	(	const EntityHandle *	array,
		int	idx,
		EntityHandle	adj,
		unsigned	short,
		const short *	indices
	)		[inline]

construct from connectivity of parent element

Parameters:

array	The connectivity of the parent element
idx	The index of the implicit vertex (contained in all sides in the list.) This is an index into 'indices', not 'array'.
adj	The element that this is a side of.
indices	The indices into 'array' at which the vertices representing the side occur.

Definition at line 1250 of file Skinner.cpp.

      : adj_elem(adj) /*, elem_side(side)*/ 
    {
      switch (CORNERS) {
        default:
          assert(false);
          break;
        case 4: handles[2] = array[indices[(idx+3)%CORNERS]];
        case 3: handles[1] = array[indices[(idx+2)%CORNERS]];
        case 2: handles[0] = array[indices[(idx+1)%CORNERS]];
      }
      if (CORNERS == 3 && handles[1] > handles[0])
        std::swap( handles[0], handles[1] );
      if (CORNERS == 4 && handles[2] > handles[0])
        std::swap( handles[0], handles[2] );
    }

---

Member Function Documentation

template<unsigned CORNERS>

bool moab::AdjSides< CORNERS >::Side::operator==

(

const Side &

other

)

const [inline]

Definition at line 1271 of file Skinner.cpp.

    {
      switch (CORNERS) {
        default:
          assert(false);
          return false;
        case 4:
          return handles[0] == other.handles[0] 
              && handles[1] == other.handles[1]
              && handles[2] == other.handles[2];
        case 3:
          return handles[0] == other.handles[0] 
              && handles[1] == other.handles[1];
        case 2:
          return handles[0] == other.handles[0];
      }
    }

template<unsigned CORNERS>

bool moab::AdjSides< CORNERS >::Side::skin

(

)

const [inline]

Definition at line 1215 of file Skinner.cpp.

{ return 0 != adj_elem; }

---

Member Data Documentation

template<unsigned CORNERS>

EntityHandle moab::AdjSides< CORNERS >::Side::adj_elem

element that this is a side of, or zero

Definition at line 1214 of file Skinner.cpp.

template<unsigned CORNERS>

EntityHandle moab::AdjSides< CORNERS >::Side::handles[CORNERS-1]

side vertices, except for implicit one

Definition at line 1213 of file Skinner.cpp.

---

The documentation for this struct was generated from the following file:

• Skinner.cpp