|
3647 | 3647 |
|
3648 | 3648 | \pnum
|
3649 | 3649 | \complexity
|
3650 |
| -Applies \tcode{f} exactly \tcode{last - first} times. |
| 3650 | +Applies \tcode{f} at most \tcode{last - first} times. |
3651 | 3651 |
|
3652 | 3652 | \pnum
|
3653 | 3653 | \remarks
|
|
3678 | 3678 |
|
3679 | 3679 | \pnum
|
3680 | 3680 | \complexity
|
3681 |
| -Applies \tcode{f} exactly \tcode{last - first} times. |
| 3681 | +Applies \tcode{f} at most \tcode{last - first} times. |
3682 | 3682 |
|
3683 | 3683 | \pnum
|
3684 | 3684 | \remarks
|
|
3723 | 3723 |
|
3724 | 3724 | \pnum
|
3725 | 3725 | \complexity
|
3726 |
| -Applies \tcode{f} and \tcode{proj} exactly \tcode{last - first} times. |
| 3726 | +Applies \tcode{f} and \tcode{proj} at most \tcode{last - first} times. |
3727 | 3727 |
|
3728 | 3728 | \pnum
|
3729 | 3729 | \remarks
|
|
4188 | 4188 | \pnum
|
4189 | 4189 | \complexity
|
4190 | 4190 | For the overloads with no \tcode{ExecutionPolicy},
|
4191 |
| -exactly \[ \min(\tcode{(i - first) + 1}, \ \tcode{(last - first) - 1}) \] |
| 4191 | +at most \[ \min(\tcode{(i - first) + 1}, \ \tcode{(last - first) - 1}) \] |
4192 | 4192 | applications of the corresponding predicate,
|
4193 | 4193 | where \tcode{i} is \tcode{adjacent_find}'s return value.
|
4194 | 4194 | For the overloads with an \tcode{ExecutionPolicy},
|
|
4262 | 4262 |
|
4263 | 4263 | \pnum
|
4264 | 4264 | \complexity
|
4265 |
| -Exactly \tcode{last - first} applications |
| 4265 | +At most \tcode{last - first} applications |
4266 | 4266 | of the corresponding predicate and any projection.
|
4267 | 4267 | \end{itemdescr}
|
4268 | 4268 |
|
|
4536 | 4536 | if \tcode{ForwardIterator1} and \tcode{Forward\-Iter\-ator2}
|
4537 | 4537 | meet the requirements of random access iterators and
|
4538 | 4538 | \tcode{last1 - first1 != last2 - first2}.
|
4539 |
| -Otherwise, exactly \tcode{last1 - first1} applications |
| 4539 | +Otherwise, at most \tcode{last1 - first1} applications |
4540 | 4540 | of the corresponding predicate
|
4541 | 4541 | if \tcode{equal(first1, last1, first2, last2, pred)} would return \tcode{true};
|
4542 | 4542 | otherwise, at worst \bigoh{N^2}, where $N$ has the value \tcode{last1 - first1}.
|
|
4586 | 4586 | \tcode{R1} and \tcode{R2} each model \libconcept{sized_range}, and
|
4587 | 4587 | \tcode{ranges::distance(r1) != ranges::distance(r2)}.
|
4588 | 4588 | \end{itemize}
|
4589 |
| -Otherwise, exactly \tcode{last1 - first1} applications |
| 4589 | +Otherwise, at most \tcode{last1 - first1} applications |
4590 | 4590 | of the corresponding predicate and projections
|
4591 | 4591 | if \tcode{ranges::equal(\brk{}first1, last1, first2, last2, pred, proj1, proj2)}
|
4592 | 4592 | would return \tcode{true};
|
|
5072 | 5072 |
|
5073 | 5073 | \pnum
|
5074 | 5074 | \complexity
|
5075 |
| -Exactly $N$ assignments. |
| 5075 | +At most $N$ assignments. |
5076 | 5076 | \end{itemdescr}
|
5077 | 5077 |
|
5078 | 5078 | \indexlibraryglobal{copy}%
|
|
5102 | 5102 |
|
5103 | 5103 | \pnum
|
5104 | 5104 | \complexity
|
5105 |
| -Exactly \tcode{last - first} assignments. |
| 5105 | +At most \tcode{last - first} assignments. |
5106 | 5106 | \end{itemdescr}
|
5107 | 5107 |
|
5108 | 5108 | \indexlibraryglobal{copy_n}%
|
|
5148 | 5148 |
|
5149 | 5149 | \pnum
|
5150 | 5150 | \complexity
|
5151 |
| -Exactly $N$ assignments. |
| 5151 | +At most $N$ assignments. |
5152 | 5152 | \end{itemdescr}
|
5153 | 5153 |
|
5154 | 5154 | \indexlibraryglobal{copy_if}%
|
|
5218 | 5218 |
|
5219 | 5219 | \pnum
|
5220 | 5220 | \complexity
|
5221 |
| -Exactly \tcode{last - first} applications |
| 5221 | +At most \tcode{last - first} applications |
5222 | 5222 | of the corresponding predicate and any projection.
|
5223 | 5223 |
|
5224 | 5224 | \pnum
|
|
5277 | 5277 |
|
5278 | 5278 | \pnum
|
5279 | 5279 | \complexity
|
5280 |
| -Exactly $N$ assignments. |
| 5280 | +At most $N$ assignments. |
5281 | 5281 | \end{itemdescr}
|
5282 | 5282 |
|
5283 | 5283 | \rSec2[alg.move]{Move}
|
|
5335 | 5335 |
|
5336 | 5336 | \pnum
|
5337 | 5337 | \complexity
|
5338 |
| -Exactly $N$ assignments. |
| 5338 | +At most $N$ assignments. |
5339 | 5339 | \end{itemdescr}
|
5340 | 5340 |
|
5341 | 5341 | \indexlibrary{\idxcode{move}!algorithm}%
|
|
5368 | 5368 |
|
5369 | 5369 | \pnum
|
5370 | 5370 | \complexity
|
5371 |
| -Exactly $N$ assignments. |
| 5371 | +At most $N$ assignments. |
5372 | 5372 | \end{itemdescr}
|
5373 | 5373 |
|
5374 | 5374 | \indexlibraryglobal{move_backward}%
|
|
5430 | 5430 |
|
5431 | 5431 | \pnum
|
5432 | 5432 | \complexity
|
5433 |
| -Exactly $N$ assignments. |
| 5433 | +At most $N$ assignments. |
5434 | 5434 | \end{itemdescr}
|
5435 | 5435 |
|
5436 | 5436 | \rSec2[alg.swap]{Swap}
|
|
5500 | 5500 |
|
5501 | 5501 | \pnum
|
5502 | 5502 | \complexity
|
5503 |
| -Exactly $M$ swaps. |
| 5503 | +At most $M$ swaps. |
5504 | 5504 | \end{itemdescr}
|
5505 | 5505 |
|
5506 | 5506 | \indexlibraryglobal{iter_swap}%
|
|
5642 | 5642 |
|
5643 | 5643 | \pnum
|
5644 | 5644 | \complexity
|
5645 |
| -Exactly $N$ applications of \tcode{op} or \tcode{binary_op}, and |
| 5645 | +At most $N$ applications of \tcode{op} or \tcode{binary_op}, and |
5646 | 5646 | any projections.
|
5647 | 5647 | This requirement also applies to the overload with an \tcode{ExecutionPolicy}.
|
5648 | 5648 |
|
|
5726 | 5726 |
|
5727 | 5727 | \pnum
|
5728 | 5728 | \complexity
|
5729 |
| -Exactly \tcode{last - first} applications |
| 5729 | +At most \tcode{last - first} applications |
5730 | 5730 | of the corresponding predicate and any projection.
|
5731 | 5731 | \end{itemdescr}
|
5732 | 5732 |
|
|
5837 | 5837 |
|
5838 | 5838 | \pnum
|
5839 | 5839 | \complexity
|
5840 |
| -Exactly \tcode{last - first} applications |
| 5840 | +At most \tcode{last - first} applications |
5841 | 5841 | of the corresponding predicate and any projection.
|
5842 | 5842 | \end{itemdescr}
|
5843 | 5843 |
|
|
5894 | 5894 |
|
5895 | 5895 | \pnum
|
5896 | 5896 | \complexity
|
5897 |
| -Exactly $N$ assignments. |
| 5897 | +At most $N$ assignments. |
5898 | 5898 | \end{itemdescr}
|
5899 | 5899 |
|
5900 | 5900 | \rSec2[alg.generate]{Generate}
|
|
5948 | 5948 |
|
5949 | 5949 | \pnum
|
5950 | 5950 | \complexity
|
5951 |
| -Exactly $N$ evaluations of \tcode{gen()} and assignments. |
| 5951 | +At most $N$ evaluations of \tcode{gen()} and assignments. |
5952 | 5952 | \end{itemdescr}
|
5953 | 5953 |
|
5954 | 5954 | \rSec2[alg.remove]{Remove}
|
|
6024 | 6024 |
|
6025 | 6025 | \pnum
|
6026 | 6026 | \complexity
|
6027 |
| -Exactly \tcode{last - first} applications |
| 6027 | +At most \tcode{last - first} applications |
6028 | 6028 | of the corresponding predicate and any projection.
|
6029 | 6029 |
|
6030 | 6030 | \pnum
|
|
6134 | 6134 |
|
6135 | 6135 | \pnum
|
6136 | 6136 | \complexity
|
6137 |
| -Exactly \tcode{last - first} applications |
| 6137 | +At most \tcode{last - first} applications |
6138 | 6138 | of the corresponding predicate and any projection.
|
6139 | 6139 |
|
6140 | 6140 | \pnum
|
|
6209 | 6209 |
|
6210 | 6210 | \pnum
|
6211 | 6211 | \complexity
|
6212 |
| -For nonempty ranges, exactly \tcode{(last - first) - 1} applications |
| 6212 | +For nonempty ranges, at most \tcode{(last - first) - 1} applications |
6213 | 6213 | of the corresponding predicate and
|
6214 | 6214 | no more than twice as many applications of any projection.
|
6215 | 6215 | \end{itemdescr}
|
|
6324 | 6324 |
|
6325 | 6325 | \pnum
|
6326 | 6326 | \complexity
|
6327 |
| -Exactly \tcode{last - first - 1} applications |
| 6327 | +At most \tcode{last - first - 1} applications |
6328 | 6328 | of the corresponding predicate
|
6329 | 6329 | and no more than twice as many applications of any projection.
|
6330 | 6330 | \end{itemdescr}
|
|
6367 | 6367 |
|
6368 | 6368 | \pnum
|
6369 | 6369 | \complexity
|
6370 |
| -Exactly \tcode{(last - first)/2} swaps. |
| 6370 | +At most \tcode{(last - first)/2} swaps. |
6371 | 6371 | \end{itemdescr}
|
6372 | 6372 |
|
6373 | 6373 | \indexlibraryglobal{reverse_copy}%
|
|
6419 | 6419 |
|
6420 | 6420 | \pnum
|
6421 | 6421 | \complexity
|
6422 |
| -Exactly $N$ assignments. |
| 6422 | +At most $N$ assignments. |
6423 | 6423 | \end{itemdescr}
|
6424 | 6424 |
|
6425 | 6425 | \rSec2[alg.rotate]{Rotate}
|
|
6533 | 6533 |
|
6534 | 6534 | \pnum
|
6535 | 6535 | \complexity
|
6536 |
| -Exactly $N$ assignments. |
| 6536 | +At most $N$ assignments. |
6537 | 6537 | \end{itemdescr}
|
6538 | 6538 |
|
6539 | 6539 | \begin{itemdecl}
|
|
6680 | 6680 |
|
6681 | 6681 | \pnum
|
6682 | 6682 | \complexity
|
6683 |
| -Exactly \tcode{(last - first) - 1} swaps. |
| 6683 | +At most \tcode{(last - first) - 1} swaps. |
6684 | 6684 |
|
6685 | 6685 | \pnum
|
6686 | 6686 | \remarks
|
|
7759 | 7759 | \begin{itemize}
|
7760 | 7760 | \item
|
7761 | 7761 | For the overload with no \tcode{ExecutionPolicy},
|
7762 |
| - exactly $N$ applications of the predicate and projection. |
| 7762 | + at most $N$ applications of the predicate and projection. |
7763 | 7763 | At most $N / 2$ swaps if the type of \tcode{first} meets
|
7764 | 7764 | the \oldconcept{BidirectionalIterator} requirements
|
7765 | 7765 | for the overloads in namespace \tcode{std} or
|
|
7835 | 7835 | \item
|
7836 | 7836 | For the overloads with no \tcode{ExecutionPolicy}, at most $N \log_2 N$ swaps,
|
7837 | 7837 | but only \bigoh{N} swaps if there is enough extra memory.
|
7838 |
| - Exactly $N$ applications of the predicate and projection. |
| 7838 | + At most $N$ applications of the predicate and projection. |
7839 | 7839 | \item
|
7840 | 7840 | For the overload with an \tcode{ExecutionPolicy},
|
7841 | 7841 | \bigoh{N \log N} swaps and \bigoh{N} applications of the predicate.
|
|
7912 | 7912 |
|
7913 | 7913 | \pnum
|
7914 | 7914 | \complexity
|
7915 |
| -Exactly \tcode{last - first} applications of \tcode{pred} and \tcode{proj}. |
| 7915 | +At most \tcode{last - first} applications of \tcode{pred} and \tcode{proj}. |
7916 | 7916 | \end{itemdescr}
|
7917 | 7917 |
|
7918 | 7918 | \indexlibraryglobal{partition_point}%
|
|
8117 | 8117 | \begin{itemize}
|
8118 | 8118 | \item
|
8119 | 8119 | For the overloads with no \tcode{ExecutionPolicy}, and
|
8120 |
| - if enough additional memory is available, exactly $N - 1$ comparisons. |
| 8120 | + if enough additional memory is available, at most $N - 1$ comparisons. |
8121 | 8121 | \item
|
8122 | 8122 | Otherwise, \bigoh{N \log N} comparisons.
|
8123 | 8123 | \end{itemize}
|
|
8998 | 8998 |
|
8999 | 8999 | \pnum
|
9000 | 9000 | \complexity
|
9001 |
| -Exactly one comparison and two applications of the projection, if any. |
| 9001 | +At most one comparison and two applications of the projection, if any. |
9002 | 9002 |
|
9003 | 9003 | \pnum
|
9004 | 9004 | \remarks
|
|
9041 | 9041 |
|
9042 | 9042 | \pnum
|
9043 | 9043 | \complexity
|
9044 |
| -Exactly \tcode{ranges::distance(r) - 1} comparisons |
| 9044 | +At most \tcode{ranges::distance(r) - 1} comparisons |
9045 | 9045 | and twice as many applications of the projection, if any.
|
9046 | 9046 |
|
9047 | 9047 | \pnum
|
|
9076 | 9076 |
|
9077 | 9077 | \pnum
|
9078 | 9078 | \complexity
|
9079 |
| -Exactly one comparison and two applications of the projection, if any. |
| 9079 | +At most one comparison and two applications of the projection, if any. |
9080 | 9080 |
|
9081 | 9081 | \pnum
|
9082 | 9082 | \remarks
|
|
9119 | 9119 |
|
9120 | 9120 | \pnum
|
9121 | 9121 | \complexity
|
9122 |
| -Exactly \tcode{ranges::distance(r) - 1} comparisons |
| 9122 | +At most \tcode{ranges::distance(r) - 1} comparisons |
9123 | 9123 | and twice as many applications of the projection, if any.
|
9124 | 9124 |
|
9125 | 9125 | \pnum
|
|
9156 | 9156 |
|
9157 | 9157 | \pnum
|
9158 | 9158 | \complexity
|
9159 |
| -Exactly one comparison and two applications of the projection, if any. |
| 9159 | +At most one comparison and two applications of the projection, if any. |
9160 | 9160 |
|
9161 | 9161 | \pnum
|
9162 | 9162 | \remarks
|
|
9256 | 9256 |
|
9257 | 9257 | \pnum
|
9258 | 9258 | \complexity
|
9259 |
| -Exactly $\max(\tcode{last - first - 1}, 0)$ comparisons and |
| 9259 | +At most $\max(\tcode{last - first - 1}, 0)$ comparisons and |
9260 | 9260 | twice as many projections.
|
9261 | 9261 | \end{itemdescr}
|
9262 | 9262 |
|
|
9303 | 9303 |
|
9304 | 9304 | \pnum
|
9305 | 9305 | \complexity
|
9306 |
| -Exactly $\max(\tcode{last - first - 1}, 0)$ comparisons and |
| 9306 | +At most $\max(\tcode{last - first - 1}, 0)$ comparisons and |
9307 | 9307 | twice as many projections.
|
9308 | 9308 | \end{itemdescr}
|
9309 | 9309 |
|
|
10334 | 10334 |
|
10335 | 10335 | \pnum
|
10336 | 10336 | \complexity
|
10337 |
| -Exactly \tcode{(last - first) - 1} applications of the binary operation. |
| 10337 | +At most \tcode{(last - first) - 1} applications of the binary operation. |
10338 | 10338 |
|
10339 | 10339 | \pnum
|
10340 | 10340 | \remarks
|
|
10846 | 10846 |
|
10847 | 10847 | \pnum
|
10848 | 10848 | \complexity
|
10849 |
| -Exactly \tcode{(last - first) - 1} applications of the binary operation. |
| 10849 | +At most \tcode{(last - first) - 1} applications of the binary operation. |
10850 | 10850 |
|
10851 | 10851 | \pnum
|
10852 | 10852 | \remarks
|
|
10881 | 10881 |
|
10882 | 10882 | \pnum
|
10883 | 10883 | \complexity
|
10884 |
| -Exactly \tcode{last - first} increments and assignments. |
| 10884 | +At most \tcode{last - first} increments and assignments. |
10885 | 10885 | \end{itemdescr}
|
10886 | 10886 |
|
10887 | 10887 | \indexlibraryglobal{iota}%
|
|
0 commit comments