![]() |
Reference documentation for deal.II version 9.6.0
|
#include <deal.II/base/config.h>
#include <deal.II/base/exceptions.h>
#include <iterator>
#include <tuple>
Go to the source code of this file.
Classes | |
struct | SynchronousIterators< Iterators > |
Functions | |
template<typename Iterators > | |
bool | operator< (const SynchronousIterators< Iterators > &a, const SynchronousIterators< Iterators > &b) |
template<typename Iterators > | |
std::size_t | operator- (const SynchronousIterators< Iterators > &a, const SynchronousIterators< Iterators > &b) |
template<typename I1 , typename I2 > | |
void | advance (std::tuple< I1, I2 > &t, const unsigned int n) |
template<typename I1 , typename I2 , typename I3 > | |
void | advance (std::tuple< I1, I2, I3 > &t, const unsigned int n) |
template<typename I1 , typename I2 , typename I3 , typename I4 > | |
void | advance (std::tuple< I1, I2, I3, I4 > &t, const unsigned int n) |
template<typename I1 , typename I2 > | |
void | advance_by_one (std::tuple< I1, I2 > &t) |
template<typename I1 , typename I2 , typename I3 > | |
void | advance_by_one (std::tuple< I1, I2, I3 > &t) |
template<typename I1 , typename I2 , typename I3 , typename I4 > | |
void | advance_by_one (std::tuple< I1, I2, I3, I4 > &t) |
template<typename Iterators > | |
SynchronousIterators< Iterators > | operator+ (const SynchronousIterators< Iterators > &a, const std::size_t n) |
template<typename Iterators > | |
SynchronousIterators< Iterators > | operator++ (SynchronousIterators< Iterators > &a) |
template<typename Iterators > | |
bool | operator!= (const SynchronousIterators< Iterators > &a, const SynchronousIterators< Iterators > &b) |
|
inline |
Return whether the first element of the first argument is less than the first element of the second argument. Since the objects compared march forward all elements at the same time, comparing the first element is sufficient.
Definition at line 113 of file synchronous_iterator.h.
|
inline |
Return the distance between the first and the second argument. Since the objects compared march forward all elements at the same time, differencing the first element is sufficient.
Definition at line 131 of file synchronous_iterator.h.
|
inline |
Advance a tuple of iterators by \(n\).
Definition at line 147 of file synchronous_iterator.h.
|
inline |
Advance a tuple of iterators by \(n\).
Definition at line 160 of file synchronous_iterator.h.
|
inline |
Advance a tuple of iterators by \(n\).
Definition at line 174 of file synchronous_iterator.h.
|
inline |
Advance a tuple of iterators by 1.
Definition at line 191 of file synchronous_iterator.h.
|
inline |
Advance a tuple of iterators by 1.
Definition at line 204 of file synchronous_iterator.h.
|
inline |
Advance a tuple of iterators by 1.
Definition at line 218 of file synchronous_iterator.h.
|
inline |
Advance the elements of this iterator by \(n\).
Definition at line 235 of file synchronous_iterator.h.
|
inline |
Advance the elements of this iterator by 1.
Definition at line 249 of file synchronous_iterator.h.
|
inline |
Compare synch iterators for inequality. Since they march in synch, comparing only the first element is sufficient.
Definition at line 264 of file synchronous_iterator.h.