Boost logo

Boost-Commit :

From: dgregor_at_[hidden]
Date: 2008-08-18 21:51:28


Author: dgregor
Date: 2008-08-18 21:51:28 EDT (Mon, 18 Aug 2008)
New Revision: 48206
URL: http://svn.boost.org/trac/boost/changeset/48206

Log:
Some fixups from N2691
Text files modified:
   sandbox/committee/concepts/stdlib/Makefile | 2 ++
   sandbox/committee/concepts/stdlib/clib-containers.tex | 20 ++++++++++++--------
   2 files changed, 14 insertions(+), 8 deletions(-)

Modified: sandbox/committee/concepts/stdlib/Makefile
==============================================================================
--- sandbox/committee/concepts/stdlib/Makefile (original)
+++ sandbox/committee/concepts/stdlib/Makefile 2008-08-18 21:51:28 EDT (Mon, 18 Aug 2008)
@@ -12,6 +12,8 @@
 .tex.dvi:
         @ if test ! -f $*.ind; then echo "" > $*.ind; fi
         @ $(LATEX) $*
+
+.honk.wibble:
         @ if ( grep 'Writing index file' $*.log > /dev/null ); \
         then makeindex $* ; $(LATEX) $* ; fi
         @ if ( grep 'LaTeX Warning: Label(s) may' $*.log > /dev/null ); \

Modified: sandbox/committee/concepts/stdlib/clib-containers.tex
==============================================================================
--- sandbox/committee/concepts/stdlib/clib-containers.tex (original)
+++ sandbox/committee/concepts/stdlib/clib-containers.tex 2008-08-18 21:51:28 EDT (Mon, 18 Aug 2008)
@@ -1302,17 +1302,17 @@
     void swap(array<T,N>& x, array<T,N>& y);
 
   template <@\changedConcepts{class}{ObjectType}@ T> class tuple_size;
- template <int I, @\changedConcepts{class}{ObjectType}@ T>
+ template <size_t I, @\changedConcepts{class}{ObjectType}@ T>
     class tuple_element;
   template <@\changedConcepts{class}{ObjectType}@ T, size_t N>
     struct tuple_size<array<T, N> >;
- template <int I, class T, size_t N>
+ template <size_t I, class T, size_t N>
     @\addedConcepts{requires True<(I > 0 \&\& I < N)>}@
     struct tuple_element<I, array<T, N> >;
- template <int I, class T, size_t N>
+ template <size_t I, class T, size_t N>
     @\addedConcepts{requires True<(I > 0 \&\& I < N)>}@
     T& get(array<T, N>&);
- template <int I, class T, size_t N>
+ template <size_t I, class T, size_t N>
     @\addedConcepts{requires True<(I > 0 \&\& I < N)>}@
     const T& get(const array<T, N>&);
 }
@@ -1705,34 +1705,38 @@
 \index{array@\tcode{array}!get@\tcode{get}}%
 \index{get@\tcode{get}!array@\tcode{array}}%
 \begin{itemdecl}
-template <int I, class T, size_t N>
+template <size_t I, class T, size_t N>
   @\addedConcepts{requires True<(I > 0 \&\& I < N)>}@
   T& get(array<T, N>& a);
 \end{itemdecl}
 
 \begin{itemdescr}
 \pnum
-\removedConcepts{\mbox{\requires} \mbox{\tcode{0 <= I < N}}. The program is ill-formed if \mbox{\tcode{I}} is out of bounds.}
+\removedConcepts{\mbox{\requires} \mbox{\tcode{I < N}}. The program is ill-formed if \mbox{\tcode{I}} is out of bounds.}
 
 \returns\ A reference to the \tcode{I}th element of \tcode{a},
 where indexing is zero-based.
+
+\throws\ nothing.
 \end{itemdescr}
 
 \index{array@\tcode{array}!get@\tcode{get}}%
 \index{get@\tcode{get}!array@\tcode{array}}%
 \begin{itemdecl}
-template <int I, class T, size_t N>
+template <size_t I, class T, size_t N>
   @\addedConcepts{requires True<(I > 0 \&\& I < N)>}@
   const T& get(const array<T, N>& a);
 \end{itemdecl}
 
 \begin{itemdescr}
 \pnum
-\removedConcepts{\mbox{\requires} \mbox{\tcode{0 <= I < N}}. The program is ill-formed if \mbox{\tcode{I}} is out of bounds.}
+\removedConcepts{\mbox{\requires} \mbox{\tcode{I < N}}. The program is ill-formed if \mbox{\tcode{I}} is out of bounds.}
 
 \pnum
 \returns\ A const reference to the \tcode{I}th element of \tcode{a},
 where indexing is zero-based.
+
+\throws\ nothing.
 \end{itemdescr}
 
 \rSec2[deque]{Class template \tcode{deque}}%


Boost-Commit list run by bdawes at acm.org, david.abrahams at rcn.com, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk