[container.requirements.general] reversible container

Author: jensmaurer

source/containers.tex

@@ -566,53 +566,97 @@
 swap.
 
 \pnum
-\indextext{reversible container|see{container, reversible}}%
-If the iterator type of a container belongs to the bidirectional or
-random access iterator categories\iref{iterator.requirements},
-the container is called
-\defnx{reversible}{container!reversible}
-and meets the additional requirements
-in \tref{container.rev.req}.
+A type \tcode{X} meets the \defnadj{reversible}{container} requirements if
+\tcode{X} meets the container requirements,
+the iterator type of \tcode{X} belongs to the
+bidirectional or random access iterator categories\iref{iterator.requirements},
+and
+the following types and expressions are well-formed and have
+the specified semantics.
+\begin{itemize}
+\item
+The name \tcode{X::reverse_iterator} denotes
+the type \tcode{reverse_iterator<X::iterator>},
+an iterator type whose value type is \tcode{T}.
+\item
+The name \tcode{X::const_reverse_iterator} denotes
+the type \tcode{reverse_iterator<X::const_iterator>},
+a constant iterator type whose value type is \tcode{T}.
+\end{itemize}
 
-\begin{libreqtab4a}
-{Reversible container requirements}
-{container.rev.req}
-\\ \topline
-\lhdr{Expression}       &   \chdr{Return type}  &
-\chdr{Assertion/note}   &   \rhdr{Complexity}   \\
-    &   &   \chdr{pre-/post-condition}   &      \\ \capsep
-\endfirsthead
-\continuedcaption\\
-\hline
-\lhdr{Expression}       &   \chdr{Return type}  &
-\chdr{Assertion/note}   &   \rhdr{Complexity}   \\
-    &   &   \chdr{pre-/post-condition}   &      \\ \capsep
-\endhead
-\tcode{X::reverse_iterator}            &
-iterator type whose value type is \tcode{T}    &
- \tcode{reverse_iterator<iterator>}   &
- compile time                           \\ \rowsep
-\tcode{X::const_reverse_iterator}         &
- constant iterator type whose value type is \tcode{T}  &
- \tcode{reverse_iterator<const_iterator>}    &
- compile time                               \\ \rowsep
-\tcode{a.rbegin()}                  &
- \tcode{reverse_iterator; const_reverse_iterator} for constant \tcode{a} &
- \tcode{reverse_iterator(end())}   &
- constant                           \\ \rowsep
-\tcode{a.rend()}                     &
- \tcode{reverse_iterator; const_reverse_iterator} for constant \tcode{a} &
- \tcode{reverse_iterator(begin())}    &
- constant                           \\ \rowsep
-\tcode{a.crbegin()}         &
- \tcode{const_reverse_iterator}     &
- \tcode{const_cast<X const\&>(a).rbegin()} &
- constant                   \\ \rowsep
-\tcode{a.crend()}         &
- \tcode{const_reverse_iterator}     &
- \tcode{const_cast<X const\&>(a).rend()} &
- constant                   \\
-\end{libreqtab4a}
+\begin{itemexpr}
+a.rbegin()
+\end{itemexpr}
+
+\begin{itemdescr}
+\pnum
+\result
+\tcode{reverse_iterator};
+\tcode{const_reverse_iterator} for constant \tcode{a}
+
+\pnum
+\cvalue
+\tcode{reverse_iterator(end())}
+
+\pnum
+\complexity
+Constant.
+\end{itemdescr}
+
+\begin{itemexpr}
+a.rend()
+\end{itemexpr}
+
+\begin{itemdescr}
+\pnum
+\result
+\tcode{reverse_iterator};
+\tcode{const_reverse_iterator} for constant \tcode{a}
+
+\pnum
+\cvalue
+\tcode{reverse_iterator(begin())}
+
+\pnum
+\complexity
+Constant.
+\end{itemdescr}
+
+\begin{itemexpr}
+a.crbegin()
+\end{itemexpr}
+
+\begin{itemdescr}
+\pnum
+\result
+\tcode{const_reverse_iterator}
+
+\pnum
+\cvalue
+\tcode{\keyword{const_cast}<X \keyword{const}\&>(a).rbegin()}
+
+\pnum
+\complexity
+Constant.
+\end{itemdescr}
+
+\begin{itemexpr}
+a.crend()
+\end{itemexpr}
+
+\begin{itemdescr}
+\pnum
+\result
+\tcode{const_reverse_iterator}
+
+\pnum
+\cvalue
+\tcode{\keyword{const_cast}<X \keyword{const}\&>(a).rend()}
+
+\pnum
+\complexity
+Constant.
+\end{itemdescr}
 
 \pnum
 Unless otherwise specified (see~\ref{associative.reqmts.except}, \ref{unord.req.except}, \ref{deque.modifiers}, and