G+Smo
24.08.0
Geometry + Simulation Modules
|
Re-implements gsDomainIterator for iteration over all elements of a tensor product parameter domain.
See gsDomainIterator for more detailed documentation and an example of the typical use!!!
Public Types | |
typedef memory::shared_ptr < gsDomainIterator > | Ptr |
Shared pointer for gsDomainIterator. | |
typedef memory::unique_ptr < gsDomainIterator > | uPtr |
Unique pointer for gsDomainIterator. | |
Public Member Functions | |
virtual void | adjacent (const gsVector< bool > &, gsDomainIterator &) |
const gsVector< T > & | centerPoint () const |
Returns the center of the current element. More... | |
short_t | dim () const |
Return dimension of the elements. | |
T | getCellSize () const |
Return the diagonal of the element. | |
T | getMaxCellLength () const |
Return the length of the largest edge of the element. | |
T | getMinCellLength () const |
Return the length of the smallest edge of the element. | |
virtual const T | getPerpendicularCellSize () const |
Returns the perpendicular cell size of boundary iterator. More... | |
bool | good () const |
Is the iterator still pointing to a valid element? | |
size_t | id () const |
Returns the element id. | |
gsVector< unsigned, D > | index () const |
return the tensor index of the current element | |
const gsVector< T > & | lowerCorner () const |
Returns the lower corner of the current element. More... | |
bool | next () |
Proceeds to the next element. More... | |
bool | next (index_t increment) |
Proceeds to the next element (skipping increment elements). | |
virtual size_t | numElements () const |
Returns the number of elements. | |
void | reset () |
Resets the iterator so that it points to the first element. | |
const gsVector< T > & | upperCorner () const |
Returns the upper corner of the current element. More... | |
T | volume () const |
Return the volume of the element. | |
Public Attributes | |
gsVector< T > | center |
Coordinates of a central point in the element (in the parameter domain). | |
Protected Attributes | |
const gsBasis< T > * | m_basis |
The basis on which the domain iterator is defined. | |
bool | m_isGood |
Private Member Functions | |
void | update () |
|
inlinevirtualinherited |
Updates other with and adjacent element
|
inlineinherited |
Returns the center of the current element.
The current element is a d-dimensional hypercube. The coordinates of its upper corner is returned as a gsVector of length d.
E.g., if the current two-dimensional element is defined by [a,b]x[c,d], then [b,d] is returned (see also lowerCorner()).
|
inlinevirtualinherited |
Returns the perpendicular cell size of boundary iterator.
Only works for boundary iterators. Returns the length from the boundary side to the parallel side not on the boundary.
Reimplemented in gsTensorDomainBoundaryIterator< T, D, uiter >.
|
inlinevirtual |
Returns the lower corner of the current element.
The current element is a d-dimensional hypercube. The coordinates of its lower corner is returned as a gsVector of length d.
E.g., if the current two-dimensional element is defined by [a,b]x[c,d], then [a,c] is returned (see also upperCorner()).
Reimplemented from gsDomainIterator< T >.
|
inlinevirtual |
Proceeds to the next element.
The function returns true if there are still elements remaining that have not been treated.
For the typical usage of this function, see the example in the documentation of gsDomainIterator.
Implements gsDomainIterator< T >.
|
inlineprivate |
Computes lower, upper and center point of the current element, maps the reference quadrature nodes and weights to the current element, and computes the active functions.
|
inlinevirtual |
Returns the upper corner of the current element.
The current element is a d-dimensional hypercube. The coordinates of its upper corner is returned as a gsVector of length d.
E.g., if the current two-dimensional element is defined by [a,b]x[c,d], then [b,d] is returned (see also lowerCorner()).
Reimplemented from gsDomainIterator< T >.
|
protectedinherited |
Flag indicating whether the domain iterator is "good". If it is "good", the iterator can continue to the next element.