sgpp::combigrid::AbstractPermutationIterator Class Referenceabstract

Iterates over the elements of a permutation. More...

#include <AbstractPermutationIterator.hpp>

Inheritance diagram for sgpp::combigrid::AbstractPermutationIterator:
sgpp::combigrid::ExponentialChebyshevPermutationIterator sgpp::combigrid::ExponentialLevelorderPermutationIterator sgpp::combigrid::ExponentialNoBoundaryPermutationIterator sgpp::combigrid::SortedPermutationIterator

Public Member Functions

virtual std::shared_ptr< AbstractPermutationIteratorclone ()=0
virtual void moveToNext ()=0
 Go to next element of the permutation. More...
virtual void reset ()=0
 Sets the iterator back to the start. More...
virtual size_t value ()=0
 Current value of the permutation. More...
virtual ~AbstractPermutationIterator ()

Detailed Description

Iterates over the elements of a permutation.

It is assumed that the user already knows the number of elements of the permutation. This class is used internally to obtain grid points in a sorted order, i.e. from left to right, by providing the indices in the correct order.

Constructor & Destructor Documentation

◆ ~AbstractPermutationIterator()

sgpp::combigrid::AbstractPermutationIterator::~AbstractPermutationIterator ( )

Member Function Documentation

◆ clone()

◆ moveToNext()

virtual void sgpp::combigrid::AbstractPermutationIterator::moveToNext ( )
pure virtual

◆ reset()

virtual void sgpp::combigrid::AbstractPermutationIterator::reset ( )
pure virtual

◆ value()

virtual size_t sgpp::combigrid::AbstractPermutationIterator::value ( )
pure virtual

The documentation for this class was generated from the following files: