![]() |
Reference documentation for deal.II version 8.4.2
|
#include <deal.II/base/synchronous_iterator.h>
Public Member Functions | |
| SynchronousIterators (const Iterators &i) | |
| SynchronousIterators (const SynchronousIterators &i) | |
Public Attributes | |
| Iterators | iterators |
Related Functions | |
(Note that these are not member 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_cxx11::tuple< I1, I2 > &t, const unsigned int n) |
| template<typename I1 , typename I2 , typename I3 > | |
| void | advance (std_cxx11::tuple< I1, I2, I3 > &t, const unsigned int n) |
| template<typename I1 , typename I2 , typename I3 , typename I4 > | |
| void | advance (std_cxx11::tuple< I1, I2, I3, I4 > &t, const unsigned int n) |
| template<typename I1 , typename I2 > | |
| void | advance_by_one (std_cxx11::tuple< I1, I2 > &t) |
| template<typename I1 , typename I2 , typename I3 > | |
| void | advance_by_one (std_cxx11::tuple< I1, I2, I3 > &t) |
| template<typename I1 , typename I2 , typename I3 , typename I4 > | |
| void | advance_by_one (std_cxx11::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) |
A class that represents a set of iterators each of which are incremented by one at the same time. This is typically used in calls like std::transform(a.begin(), a.end(), b.begin(), functor); where we have synchronous iterators marching through the containers a,b. If an object of this type represents the end of a range, only the first element is considered (we only have a.end(), not b.end())
The template argument of the current class shall be of type std_cxx11::tuple with arguments equal to the iterator types.
The individual iterators can be accessed using std_cxx11::get<X>(synchronous_iterator.iterators) where X is the number corresponding to the desired iterator.
This type, and the helper functions associated with it, are used as the Value concept for the blocked_range type of the Threading Building Blocks.
Definition at line 51 of file synchronous_iterator.h.
|
inline |
Constructor.
Definition at line 74 of file synchronous_iterator.h.
|
inline |
Copy constructor.
Definition at line 83 of file synchronous_iterator.h.
|
related |
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 101 of file synchronous_iterator.h.
|
related |
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 119 of file synchronous_iterator.h.
|
related |
Advance a tuple of iterators by
.
Definition at line 137 of file synchronous_iterator.h.
|
related |
Advance a tuple of iterators by
.
Definition at line 151 of file synchronous_iterator.h.
|
related |
Advance a tuple of iterators by
.
Definition at line 167 of file synchronous_iterator.h.
|
related |
Advance a tuple of iterators by 1.
Definition at line 185 of file synchronous_iterator.h.
|
related |
Advance a tuple of iterators by 1.
Definition at line 198 of file synchronous_iterator.h.
|
related |
Advance a tuple of iterators by 1.
Definition at line 213 of file synchronous_iterator.h.
|
related |
Advance the elements of this iterator by
.
Definition at line 231 of file synchronous_iterator.h.
|
related |
Advance the elements of this iterator by 1.
Definition at line 247 of file synchronous_iterator.h.
|
related |
Compare synch iterators for inequality. Since they march in synch, comparing only the first element is sufficient.
Definition at line 263 of file synchronous_iterator.h.
| Iterators SynchronousIterators< Iterators >::iterators |
Storage for the iterators represented by the current class.
Definition at line 66 of file synchronous_iterator.h.
1.8.12