[Boost-commit] svn:boost r48823 - sandbox/committee/concepts/stdlib

Subject: [Boost-commit] svn:boost r48823 - sandbox/committee/concepts/stdlib
From: dgregor_at_[hidden]
Date: 2008-09-17 16:24:08

Author: dgregor
Date: 2008-09-17 16:24:08 EDT (Wed, 17 Sep 2008)
New Revision: 48823
URL: http://svn.boost.org/trac/boost/changeset/48823

Log:
Fix iterator concepts
Text files modified: 
   sandbox/committee/concepts/stdlib/clib-iterconcepts.tex |    11 ++++++-----                             
   1 files changed, 6 insertions(+), 5 deletions(-)

Modified: sandbox/committee/concepts/stdlib/clib-iterconcepts.tex
==============================================================================
--- sandbox/committee/concepts/stdlib/clib-iterconcepts.tex	(original)
+++ sandbox/committee/concepts/stdlib/clib-iterconcepts.tex	2008-09-17 16:24:08 EDT (Wed, 17 Sep 2008)
@@ -276,6 +276,7 @@
   instantiation of \tcode{iterator_traits<int>} should produce an
   empty class, not an error.
 \item Made a \tcode{ShuffleIterator} a \tcode{ForwardIterator}, and its value type both \tcode{MoveAssignable} and \tcode{Swappable}. 
+\item Fixed the precondition for \tcode{RandomAccessIterator}'s \tcode{operator-}, from \tcode{a + n == b} to \tcode{a == b + n}.
 \end{itemize}
 \end{titlepage}
 
@@ -446,8 +447,8 @@
 \topline
 \textbf{Random Access}                  &       $\rightarrow$ \textbf{Bidirectional}    &
 $\rightarrow$ \textbf{Forward}  &       $\rightarrow$ \textbf{Input}  & \addedConcepts{\mbox{$\rightarrow$} \mbox{\textbf{Iterator}}}                   \\ 
- &  &  & \addedConcepts{\mbox{$\uparrow$}} & \addedConcepts{\mbox{$\uparrow$}} \\
-   &        &     & \addedConcepts{\mbox{\textbf{Shuffle}}} &   \addedConcepts{\mbox{$\rightarrow$}} \textbf{Output}                   \\
+ &  & \addedConcepts{\mbox{$\uparrow$}} &  & \addedConcepts{\mbox{$\uparrow$}} \\
+   &        &   \addedConcepts{\mbox{\textbf{Shuffle}}}  & \addedConcepts{\mbox{$\rightarrow$}} &  \textbf{Output}                   \\
 \end{floattable}
 
 \pnum
@@ -1084,7 +1085,7 @@
 \pnum
 \addedConcepts{\mbox{\precondition}
 there exists a value \mbox{\tcode{n}} of \mbox{\tcode{difference_type}}
-  such that \mbox{\tcode{a + n == b}}.}
+  such that \mbox{\tcode{a == b + n}}.}
 
 \pnum
 \addedConcepts{\mbox{\effects}
@@ -1176,7 +1177,7 @@
 \color{black}
 
 \pnum
-\addedConcepts{A shuffle iterator is a form of input and output iterator
+\addedConcepts{A shuffle iterator is a form of forward and output iterator
   that allows values to be moved into or out of a sequence, along with
   permitting efficient swapping of values within the sequence. Shuffle
   iterators are typically used in algorithms that need to rearrange
@@ -1266,7 +1267,7 @@
 
 \setcounter{Paras}{1}
 \pnum
-\changedConcepts{The}{If the type \mbox{\tcode{Iterator}} has nested types
+\changedConcepts{The}{If the type \mbox{\tcode{Iter}} has nested types
   \mbox{\tcode{difference_type}}, \mbox{\tcode{value_type}},
   \mbox{\tcode{pointer}}, \mbox{\tcode{reference}}, and
   \mbox{\tcode{iterator_category}}, then the}