#include <mia/2d/vector.hh>
Go to the source code of this file.
Data Structures | |
class | std::iterator_traits< mia::range2d_iterator< I > > |
class | std::iterator_traits< mia::range2d_iterator_with_boundary_flag< I > > |
class | range2d_iterator< I > |
class | range2d_iterator_with_boundary_flag< I > |
a 2D iterator that knows its position in the 2D grid ans supports iterating over sub-ranges More... | |
Namespaces | |
std | |
Functions | |
template<typename T > | |
bool | operator!= (const range2d_iterator_with_boundary_flag< T > &left, const range2d_iterator_with_boundary_flag< T > &right) |
template<typename I > | |
bool | operator!= (const range2d_iterator< I > &a, const range2d_iterator< I > &b) |
template<typename T > | |
bool | operator== (const range2d_iterator_with_boundary_flag< T > &left, const range2d_iterator_with_boundary_flag< T > &right) |
template<typename I > | |
bool | operator== (const range2d_iterator< I > &left, const range2d_iterator< I > &right) |
bool operator!= | ( | const range2d_iterator_with_boundary_flag< T > & | left, |
const range2d_iterator_with_boundary_flag< T > & | right | ||
) |
Definition at line 207 of file 2d/iterator.hh.
bool operator!= | ( | const range2d_iterator< I > & | a, |
const range2d_iterator< I > & | b | ||
) |
Compare two range iterators. There equivalence is only decided based on the grid position.
Definition at line 374 of file 2d/iterator.hh.
bool operator== | ( | const range2d_iterator_with_boundary_flag< T > & | left, |
const range2d_iterator_with_boundary_flag< T > & | right | ||
) |
Definition at line 201 of file 2d/iterator.hh.
bool operator== | ( | const range2d_iterator< I > & | left, |
const range2d_iterator< I > & | right | ||
) |
Compare two range iterators. There equivalence is only decided based on the grid position.
Definition at line 359 of file 2d/iterator.hh.