From Jason Turner

[iterator.operations]

C++20 → C++23 0.9 KB 7 lines
Current Draft | LaTeX Source
Archived: C++20 | C++23
Markdown: C++20 | C++23
Explore in Adventure Game

Diff to HTML by rtfpessoa

Files changed (1) hide show
  1. tmp/tmpy4kmtvay/{from.md → to.md} +2 -2
tmp/tmpy4kmtvay/{from.md → to.md} RENAMED
@@ -25,12 +25,12 @@ template<class InputIterator>
25
  *Preconditions:* `last` is reachable from `first`, or `InputIterator`
26
  meets the *Cpp17RandomAccessIterator* requirements and `first` is
27
  reachable from `last`.
28
 
29
  *Effects:* If `InputIterator` meets the *Cpp17RandomAccessIterator*
30
- requirements, returns `(last - first)`; otherwise, returns the number of
31
- increments needed to get from `first` to `last`.
32
 
33
  ``` cpp
34
  template<class InputIterator>
35
  constexpr InputIterator next(InputIterator x,
36
  typename iterator_traits<InputIterator>::difference_type n = 1);
 
25
  *Preconditions:* `last` is reachable from `first`, or `InputIterator`
26
  meets the *Cpp17RandomAccessIterator* requirements and `first` is
27
  reachable from `last`.
28
 
29
  *Effects:* If `InputIterator` meets the *Cpp17RandomAccessIterator*
30
+ requirements, returns `(last - first)`; otherwise, increments `first`
31
+ until `last` is reached and returns the number of increments.
32
 
33
  ``` cpp
34
  template<class InputIterator>
35
  constexpr InputIterator next(InputIterator x,
36
  typename iterator_traits<InputIterator>::difference_type n = 1);