|
2092 | 2092 | \complexity
|
2093 | 2093 | \begin{itemize}
|
2094 | 2094 | \item
|
2095 |
| -For the overloads with no \tcode{ExecutionPolicy}, no applications of the |
2096 |
| -corresponding predicate if |
| 2095 | +For the overloads with no \tcode{ExecutionPolicy}, |
| 2096 | +\begin{itemize} |
| 2097 | +\item |
| 2098 | +if |
2097 | 2099 | \tcode{InputIterator1}
|
2098 | 2100 | and
|
2099 | 2101 | \tcode{InputIterator2}
|
2100 |
| -meet the requirements of random access iterators and |
2101 |
| -\tcode{last1 - first1 != last2 - first2}; |
2102 |
| -otherwise, at most |
| 2102 | +meet the requirements of random access iterators~(\ref{random.access.iterators}) |
| 2103 | +and |
| 2104 | +\tcode{last1 - first1 != last2 - first2}, |
| 2105 | +then |
| 2106 | +no applications of the corresponding predicate; otherwise, |
| 2107 | + |
| 2108 | +\item |
| 2109 | +at most |
2103 | 2110 | $\min(\tcode{last1 - first1}, \tcode{last2 - first2})$
|
2104 | 2111 | applications of the corresponding predicate.
|
| 2112 | +\end{itemize} |
2105 | 2113 |
|
2106 | 2114 | \item
|
2107 |
| -For the overloads with no \tcode{ExecutionPolicy}, no applications of the |
2108 |
| -corresponding predicate if |
| 2115 | +For the overloads with no \tcode{ExecutionPolicy}, |
| 2116 | +\begin{itemize} |
| 2117 | +\item |
| 2118 | +if |
2109 | 2119 | \tcode{ForwardIterator1}
|
2110 | 2120 | and
|
2111 | 2121 | \tcode{ForwardIterator2}
|
2112 | 2122 | meet the requirements of random access iterators and
|
2113 |
| -\tcode{last1 - first1 != last2 - first2}; |
2114 |
| -otherwise, \bigoh{\min(\tcode{last1 - first1}, \tcode{last2 - first2})} applications |
| 2123 | +\tcode{last1 - first1 != last2 - first2}, then |
| 2124 | +no applications of the corresponding predicate; otherwise, |
| 2125 | + |
| 2126 | +\item |
| 2127 | +\bigoh{\min(\tcode{last1 - first1}, \tcode{last2 - first2})} applications |
2115 | 2128 | of the corresponding predicate.
|
2116 | 2129 | \end{itemize}
|
| 2130 | +\end{itemize} |
2117 | 2131 | \end{itemdescr}
|
2118 | 2132 |
|
2119 | 2133 | \rSec2[alg.is_permutation]{Is permutation}
|
|
2156 | 2170 |
|
2157 | 2171 | \pnum
|
2158 | 2172 | \complexity No applications of the corresponding predicate if \tcode{ForwardIterator1}
|
2159 |
| -and \tcode{ForwardIter\-ator2} meet the requirements of random access iterators and |
| 2173 | +and \tcode{Forward\-Iter\-ator2} meet the requirements of random access iterators and |
2160 | 2174 | \tcode{last1 - first1 != last2 - first2}.
|
2161 | 2175 | Otherwise, exactly \tcode{last1 - first1} applications of the
|
2162 | 2176 | corresponding predicate if \tcode{equal(\brk{}first1, last1, first2, last2)}
|
|
0 commit comments