Maps offsets into a non-contiguous range's copy back to the caller's iterators by moving one iterator from the last offset mapped; std::next(first, offset) per mark would rewalk a std::list.
More...
|
|
| offset_cursor ()=default |
| | Unbound; assigned before use.
|
| |
| | offset_cursor (BidirIt it, std::size_t offset) |
| | Binds the cursor to it, which sits at offset of the sequence.
|
| |
| BidirIt | to (std::size_t offset) |
| | Moves to offset, either way.
|
| |
|
|
BidirIt | it_ {} |
| | The caller's iterator at offset_.
|
| |
|
std::size_t | offset_ {} |
| | Where it_ sits.
|
| |
template<typename BidirIt>
class real::compat::detail::offset_cursor< BidirIt >
Maps offsets into a non-contiguous range's copy back to the caller's iterators by moving one iterator from the last offset mapped; std::next(first, offset) per mark would rewalk a std::list.
- Template Parameters
-
| BidirIt | The caller's iterator. |
◆ offset_cursor()
template<typename BidirIt >
Binds the cursor to it, which sits at offset of the sequence.
- Parameters
-
| [in] | it | An iterator into the caller's sequence. |
| [in] | offset | Its offset from the sequence start. |
◆ to()
template<typename BidirIt >
Moves to offset, either way.
- Parameters
-
| [in] | offset | An offset of the sequence, at most its length. |
- Returns
- The caller's iterator at
offset.
The documentation for this class was generated from the following file: