iterate over the points of some corner range More...
#include <dune/grid/io/file/vtk/pointiterator.hh>
Inheritance diagram for Dune::VTK::PointIterator< CellIterator, IS >:
Public Types | |
| typedef VTK::Corner< typename std::remove_const< typename std::iterator_traits< CellIterator >::value_type >::type > | Corner |
| typedef PointIterator< CellIterator, IS > | DerivedType |
| typedef const Corner | Value |
| typedef Value & | Reference |
| typedef std::iterator_traits< CellIterator >::difference_type | DifferenceType |
Public Member Functions | |
| Reference | dereference () const |
| bool | isDereferencable () const |
| bool | equals (const DerivedType &other) const |
| void | increment () |
| PointIterator (const CellIterator &cellit, const CellIterator &cellend, const IS &is_) | |
| construct a CornerIterator More... | |
| PointIterator (const CellIterator &cellend_) | |
| construct a CornerIterator More... | |
Static Public Attributes | |
| static const unsigned | mydim |
Detailed Description
template<typename CellIterator, typename IS>
class Dune::VTK::PointIterator< CellIterator, IS >
class Dune::VTK::PointIterator< CellIterator, IS >
iterate over the points of some corner range
This iterator essentially filters the output from CornerIterator to visit each point only once.
- Template Parameters
-
CellIterator Type of the iterators over cells. The usual codim0 EntityIterators should work here. IS Type of the indexset.
The IndexSet must provide methods and member types:
- size(unsigned codimension) should return the number of vertices in the indexset. The dimension of the cells will be passed as the codimension parameter value.
- subIndex(const Cell& cell, unsigned subIndex, unsigned codimension) should return the index of the point with local Dune index subIndex in cell cell. The codimension parameter will again be the dimension of the cell.
- IndexType should be the type of the indices returned by subIndex().
The requirements are crafted in such a way that the indexsets provided by the grid should fulfill them as long as the cells are codim=0 Entities.
Member Typedef Documentation
◆ Corner
template<typename CellIterator , typename IS >
| typedef VTK::Corner<typename std::remove_const<typename std::iterator_traits< CellIterator>::value_type>::type> Dune::VTK::PointIterator< CellIterator, IS >::Corner |
◆ DerivedType
template<typename CellIterator , typename IS >
| typedef PointIterator<CellIterator, IS> Dune::VTK::PointIterator< CellIterator, IS >::DerivedType |
◆ DifferenceType
template<typename CellIterator , typename IS >
| typedef std::iterator_traits<CellIterator>::difference_type Dune::VTK::PointIterator< CellIterator, IS >::DifferenceType |
◆ Reference
template<typename CellIterator , typename IS >
| typedef Value& Dune::VTK::PointIterator< CellIterator, IS >::Reference |
◆ Value
template<typename CellIterator , typename IS >
| typedef const Corner Dune::VTK::PointIterator< CellIterator, IS >::Value |
Constructor & Destructor Documentation
◆ PointIterator() [1/2]
template<typename CellIterator , typename IS >
|
inline |
construct a CornerIterator
- Parameters
-
cellit The begin iterator of the undelying range. cellend The end iterator of the underlying range. is_ A reference to the indexset to use.
◆ PointIterator() [2/2]
template<typename CellIterator , typename IS >
|
inline |
construct a CornerIterator
This constructs a passed-the-end iterator value.
Member Function Documentation
◆ dereference()
template<typename CellIterator , typename IS >
|
inline |
◆ equals()
template<typename CellIterator , typename IS >
|
inline |
◆ increment()
template<typename CellIterator , typename IS >
|
inline |
◆ isDereferencable()
template<typename CellIterator , typename IS >
|
inline |
Member Data Documentation
◆ mydim
template<typename CellIterator , typename IS >
|
static |
Initial value:
= std::iterator_traits<CellIterator>::
value_type::mydimension
The documentation for this class was generated from the following file:
