|
1899 | 1899 | the indicated semantics. |
1900 | 1900 | \end{itemize} |
1901 | 1901 |
|
1902 | | -\begin{libreqtab4b} |
| 1902 | +\begin{libreqtab4b}[floattable] |
1903 | 1903 | {\oldconcept{Iterator} requirements} |
1904 | 1904 | {iterator} |
1905 | | -\\ \topline |
1906 | | -\lhdr{Expression} & \chdr{Return type} & \chdr{Operational} & \rhdr{Assertion/note} \\ |
1907 | | - & & \chdr{semantics} & \rhdr{pre-/post-condition} \\ \capsep |
1908 | | -\endfirsthead |
1909 | | -\continuedcaption\\ |
1910 | | -\hline |
| 1905 | +\topline |
1911 | 1906 | \lhdr{Expression} & \chdr{Return type} & \chdr{Operational} & \rhdr{Assertion/note} \\ |
1912 | 1907 | & & \chdr{semantics} & \rhdr{pre-/post-condition} \\ \capsep |
1913 | | -\endhead |
1914 | 1908 |
|
1915 | 1909 | \tcode{*r} & |
1916 | 1910 | unspecified & |
|
2041 | 2035 | and the expressions in \tref{outputiterator} |
2042 | 2036 | are valid and have the indicated semantics. |
2043 | 2037 |
|
2044 | | -\begin{libreqtab4b} |
| 2038 | +\begin{libreqtab4b}[floattable] |
2045 | 2039 | {\oldconcept{OutputIterator} requirements (in addition to \oldconcept{Iterator})} |
2046 | 2040 | {outputiterator} |
2047 | | -\\ \topline |
2048 | | -\lhdr{Expression} & \chdr{Return type} & \chdr{Operational} & \rhdr{Assertion/note} \\ |
2049 | | - & & \chdr{semantics} & \rhdr{pre-/post-condition} \\ \capsep |
2050 | | -\endfirsthead |
2051 | | -\continuedcaption\\ |
2052 | | -\hline |
| 2041 | +\topline |
2053 | 2042 | \lhdr{Expression} & \chdr{Return type} & \chdr{Operational} & \rhdr{Assertion/note} \\ |
2054 | 2043 | & & \chdr{semantics} & \rhdr{pre-/post-condition} \\ \capsep |
2055 | | -\endhead |
| 2044 | + |
2056 | 2045 | \tcode{*r = o} & |
2057 | 2046 | result is not used & |
2058 | 2047 | & |
|
2143 | 2132 | allows the use of multi-pass one-directional algorithms with forward iterators. |
2144 | 2133 | \end{note} |
2145 | 2134 |
|
2146 | | -\begin{libreqtab4b} |
| 2135 | +\begin{libreqtab4b}[floattable] |
2147 | 2136 | {\oldconcept{ForwardIterator} requirements (in addition to \oldconcept{InputIterator})} |
2148 | 2137 | {forwarditerator} |
2149 | | -\\ \topline |
2150 | | -\lhdr{Expression} & \chdr{Return type} & \chdr{Operational} & \rhdr{Assertion/note} \\ |
2151 | | - & & \chdr{semantics} & \rhdr{pre-/post-condition} \\ \capsep |
2152 | | -\endfirsthead |
2153 | | -\continuedcaption\\ |
2154 | | -\hline |
| 2138 | +\topline |
2155 | 2139 | \lhdr{Expression} & \chdr{Return type} & \chdr{Operational} & \rhdr{Assertion/note} \\ |
2156 | 2140 | & & \chdr{semantics} & \rhdr{pre-/post-condition} \\ \capsep |
2157 | | -\endhead |
| 2141 | + |
2158 | 2142 | \tcode{r++} & |
2159 | 2143 | convertible to \tcode{const X\&} & |
2160 | 2144 | \tcode{\{ X tmp = r;}\br |
|
2184 | 2168 | in addition to meeting the \oldconcept{ForwardIterator} requirements, |
2185 | 2169 | the following expressions are valid as shown in \tref{bidirectionaliterator}. |
2186 | 2170 |
|
2187 | | -\begin{libreqtab4b} |
| 2171 | +\begin{libreqtab4b}[floattable] |
2188 | 2172 | {\oldconcept{BidirectionalIterator} requirements (in addition to \oldconcept{ForwardIterator})} |
2189 | 2173 | {bidirectionaliterator} |
2190 | | -\\ \topline |
2191 | | -\lhdr{Expression} & \chdr{Return type} & \chdr{Operational} & \rhdr{Assertion/note} \\ |
2192 | | - & & \chdr{semantics} & \rhdr{pre-/post-condition} \\ \capsep |
2193 | | -\endfirsthead |
2194 | | -\continuedcaption\\ |
2195 | | -\hline |
| 2174 | +\topline |
2196 | 2175 | \lhdr{Expression} & \chdr{Return type} & \chdr{Operational} & \rhdr{Assertion/note} \\ |
2197 | 2176 | & & \chdr{semantics} & \rhdr{pre-/post-condition} \\ \capsep |
2198 | | -\endhead |
| 2177 | + |
2199 | 2178 | \tcode{\dcr r} & |
2200 | 2179 | \tcode{X\&} & |
2201 | 2180 | & |
|
0 commit comments