|
|
Boost-Commit : |
From: dgregor_at_[hidden]
Date: 2008-03-03 17:21:00
Author: dgregor
Date: 2008-03-03 17:21:00 EST (Mon, 03 Mar 2008)
New Revision: 43483
URL: http://svn.boost.org/trac/boost/changeset/43483
Log:
Fix issues 12 and 15; change from using DR to WP
Text files modified:
sandbox/committee/concepts/issues/Makefile | 3 +
sandbox/committee/concepts/issues/issues/concepts-issues.xml | 14 +++---
sandbox/committee/concepts/issues/issues/issue12.xml | 2
sandbox/committee/concepts/issues/issues/issue14.xml | 2
sandbox/committee/concepts/issues/issues/issue6.xml | 2
sandbox/committee/concepts/stdlib/clib-concepts.tex | 93 ++++++++++++++++++++-------------------
6 files changed, 60 insertions(+), 56 deletions(-)
Modified: sandbox/committee/concepts/issues/Makefile
==============================================================================
--- sandbox/committee/concepts/issues/Makefile (original)
+++ sandbox/committee/concepts/issues/Makefile 2008-03-03 17:21:00 EST (Mon, 03 Mar 2008)
@@ -4,6 +4,9 @@
make concepts_issues
./concepts_issues
+install: html
+ mv *.html /l/osl/www/www.generic-programming.org/languages/conceptcpp/issues
+
concepts_issues: main.cpp date.cpp date.h
$(CXX) -o concepts_issues main.cpp date.cpp date.h
Modified: sandbox/committee/concepts/issues/issues/concepts-issues.xml
==============================================================================
--- sandbox/committee/concepts/issues/issues/concepts-issues.xml (original)
+++ sandbox/committee/concepts/issues/issues/concepts-issues.xml 2008-03-03 17:21:00 EST (Mon, 03 Mar 2008)
@@ -13,7 +13,7 @@
<li>Table of Contents for all concepts issues.</li>
<li>Index by Section for all concepts issues.</li>
<li>Index by Status for all concepts issues.</li>
- <li>Concepts Defect Reports List</li>
+ <li>Concepts Defect Report List</li>
<li>Concepts Closed Issues List</li>
</ul>
<p>The purpose of this document is to record the status of issues
@@ -25,7 +25,7 @@
considered for concepts. That is, issues which have a
status of New, Open,
<a href="concepts-active.html#Ready">Ready</a>, and <a href="concepts-active.html#Review">Review</a>. See
- Concepts Defect Reports List for issues considered defects and
+ Concepts Defect Report List for issues considered defects and
<a href="concepts-closed.html">Concepts Closed Issues List</a> for issues considered closed.</p>
</intro>
@@ -41,7 +41,7 @@
</ul>
<p>This document contains only concepts issues which have been closed
after being found to be defects
- in the proposal. That is, issues which have a status of DR. See the
+ in the proposal. That is, issues which have a status of WP. See the
<a href="concepts-closed.html">Concepts Closed Issues List</a> for issues closed as non-defects. See the
<a href="concepts-active.html">Concepts Active Issues List</a> for active issues and more information. The
introductory material in that document also applies to this
@@ -141,7 +141,7 @@
issue number. </p>
<p><b><a name="NAD">NAD</a></b> - The committee has reached consensus that
- the issue is not a defect in the Standard.</p>
+ the issue is not a defect in the concepts proposal.</p>
<p><b><a name="NAD Editorial">NAD Editorial</a></b> - The committee has reached consensus that
the issue can either be handled editorially, or is handled by a paper (usually
@@ -160,7 +160,7 @@
the <b>Proposed Resolution</b> is correct, and the issue is ready to
be integrated into the next concepts proposal.</p>
- <p><b><a name="DR">DR</a></b> - (Defect Report) - The committee has
+ <p><b><a name="WP">WP</a></b> - (Concepts Defect) - The committee has
decided to accept the proposed resolution and the resolution is part
of a concepts proposal draft.</p>
@@ -178,8 +178,8 @@
<a href="concepts-active.html#Dup">Dup</a>, <a href="concepts-active.html#NAD">NAD</a>, or
<a href="concepts-active.html#Ready">Ready</a> as appropriate. Once
a Ready issue has made it into a draft of the concepts proposal, it
- is given the status of Defect Report
- ( DR). To streamline the
+ is given the status of Working Paper
+ ( WP). To streamline the
process for concepts (since it is still a proposal, not part of the
committee working paper), we will often skip the Review or Ready
status.
Modified: sandbox/committee/concepts/issues/issues/issue12.xml
==============================================================================
--- sandbox/committee/concepts/issues/issues/issue12.xml (original)
+++ sandbox/committee/concepts/issues/issues/issue12.xml 2008-03-03 17:21:00 EST (Mon, 03 Mar 2008)
@@ -3,7 +3,7 @@
<!ENTITY nbsp " ">
] >
-<issue num="12" status="Ready">
+<issue num="12" status="WP">
<title>Update operator concepts based on "Option #2" change in language specification</title>
<section><sref ref="[concept.operator]"/></section>
<submitter>LWG</submitter>
Modified: sandbox/committee/concepts/issues/issues/issue14.xml
==============================================================================
--- sandbox/committee/concepts/issues/issues/issue14.xml (original)
+++ sandbox/committee/concepts/issues/issues/issue14.xml 2008-03-03 17:21:00 EST (Mon, 03 Mar 2008)
@@ -3,7 +3,7 @@
<!ENTITY nbsp " ">
] >
-<issue num="14" status="Ready">
+<issue num="14" status="WP">
<title><tt>Addressable</tt> and <tt>const</tt> types</title>
<section><sref ref="[concept.operator]"/></section>
<submitter>LWG</submitter>
Modified: sandbox/committee/concepts/issues/issues/issue6.xml
==============================================================================
--- sandbox/committee/concepts/issues/issues/issue6.xml (original)
+++ sandbox/committee/concepts/issues/issues/issue6.xml 2008-03-03 17:21:00 EST (Mon, 03 Mar 2008)
@@ -3,7 +3,7 @@
<!ENTITY nbsp " ">
] >
-<issue num="6" status="DR">
+<issue num="6" status="WP">
<title>MoveAssignable assignment operator is incorrect</title>
<section><sref ref="[concept.copymove]"/></section>
<submitter>LWG</submitter>
Modified: sandbox/committee/concepts/stdlib/clib-concepts.tex
==============================================================================
--- sandbox/committee/concepts/stdlib/clib-concepts.tex (original)
+++ sandbox/committee/concepts/stdlib/clib-concepts.tex 2008-03-03 17:21:00 EST (Mon, 03 Mar 2008)
@@ -33,7 +33,7 @@
\begin{center}
\huge
Core Concepts for the C++0x Standard Library
-\vspace{0.5in}
+\vspace{0.25in}
\normalsize
Douglas Gregor and Andrew Lumsdaine \\
@@ -43,8 +43,8 @@
\{\href{mailto:dgregor_at_[hidden]}{dgregor}, \href{mailto:lums_at_[hidden]}{lums}\}@osl.iu.edu
\end{center}
-\vspace{1in}
-\par\noindent Document number: \vspace{-6pt}
+\vspace{0.25in}
+\par\noindent Document number: DRAFT\vspace{-6pt}
\par\noindent Revises document number: N2502=08-0012\vspace{-6pt}
\par\noindent Date: \today\vspace{-6pt}
\par\noindent Project: Programming Language \Cpp{}, Library Working Group\vspace{-6pt}
@@ -94,6 +94,8 @@
\editorial{Purely editorial comments will be written in a separate,
shaded box.}
+\paragraph*{Changes from N2502}
+Closed concept issues 6, 12, and 14.
\end{titlepage}
@@ -949,9 +951,9 @@
auto concept HasPlus<typename T, typename U = T> {
typename result_type;
result_type operator+(T const&, U const&);
- result_type operator+(T const&, U &&);
- result_type operator+(T &&, U const&);
- result_type operator+(T &&, U &&);
+ @\removedCC{result_type operator+(T const\&, U \&\&);}@
+ @\removedCC{result_type operator+(T \&\&, U const\&);}@
+ @\removedCC{result_type operator+(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -964,9 +966,9 @@
auto concept HasMinus<typename T, typename U = T> {
typename result_type;
result_type operator-(T const&, U const&);
- result_type operator-(T const&, U &&);
- result_type operator-(T &&, U const&);
- result_type operator-(T &&, U &&);
+ @\removedCC{result_type operator-(T const\&, U \&\&);}@
+ @\removedCC{result_type operator-(T \&\&, U const\&);}@
+ @\removedCC{result_type operator-(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -979,9 +981,9 @@
auto concept HasMultiply<typename T, typename U = T> {
typename result_type;
result_type operator*(T const&, U const&);
- result_type operator*(T const&, U &&);
- result_type operator*(T &&, U const&);
- result_type operator*(T &&, U &&);
+ @\removedCC{result_type operator*(T const\&, U \&\&);}@
+ @\removedCC{result_type operator*(T \&\&, U const\&);}@
+ @\removedCC{result_type operator*(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -994,9 +996,9 @@
auto concept HasDivide<typename T, typename U = T> {
typename result_type;
result_type operator/(T const&, U const&);
- result_type operator/(T const&, U &&);
- result_type operator/(T &&, U const&);
- result_type operator/(T &&, U &&);
+ @\removedCC{result_type operator/(T const\&, U \&\&);}@
+ @\removedCC{result_type operator/(T \&\&, U const\&);}@
+ @\removedCC{result_type operator/(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -1009,9 +1011,9 @@
auto concept HasModulus<typename T, typename U = T> {
typename result_type;
result_type operator%(T const&, U const&);
- result_type operator%(T const&, U &&);
- result_type operator%(T &&, U const&);
- result_type operator%(T &&, U &&);
+ @\removedCC{result_type operator\%(T const\&, U \&\&);}@
+ @\removedCC{result_type operator\%(T \&\&, U const\&);}@
+ @\removedCC{result_type operator\%(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -1024,7 +1026,7 @@
auto concept HasUnaryPlus<typename T> {
typename result_type;
result_type operator+(T const&);
- result_type operator+(T &&);
+ @\removedCC{result_type operator+(T \&\&);}@
}
\end{itemdecl}
@@ -1037,7 +1039,7 @@
auto concept HasNegate<typename T> {
typename result_type;
result_type operator-(T const&);
- result_type operator-(T &&);
+ @\removedCC{result_type operator-(T \&\&);}@
}
\end{itemdecl}
@@ -1049,9 +1051,9 @@
\begin{itemdecl}
auto concept HasLogicalAnd<typename T, typename U = T> {
bool operator&&(T const&, U const&);
- bool operator&&(T const&, U &&);
- bool operator&&(T &&, U const&);
- bool operator&&(T &&, U &&);
+ @\removedCC{bool operator\&\&(T const\&, U \&\&);}@
+ @\removedCC{bool operator\&\&(T \&\&, U const\&);}@
+ @\removedCC{bool operator\&\&(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -1063,9 +1065,9 @@
\begin{itemdecl}
auto concept HasLogicalOr<typename T, typename U = T> {
bool operator||(T const&, U const&);
- bool operator||(T const&, U &&);
- bool operator||(T &&, U const&);
- bool operator||(T &&, U &&);
+ @\removedCC{bool operator||(T const\&, U \&\&);}@
+ @\removedCC{bool operator||(T \&\&, U const\&);}@
+ @\removedCC{bool operator||(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -1077,7 +1079,7 @@
\begin{itemdecl}
auto concept HasLogicalNot<typename T> {
bool operator!(T const&);
- bool operator!(T &&);
+ @\removedCC{bool operator!(T \&\&);}@
}
\end{itemdecl}
@@ -1090,9 +1092,9 @@
auto concept HasBitAnd<typename T, typename U = T> {
typename result_type;
result_type operator&(T const&, U const&);
- result_type operator&(T const&, U &&);
- result_type operator&(T &&, U const&);
- result_type operator&(T &&, U &&);
+ @\removedCC{result_type operator\&(T const\&, U \&\&);}@
+ @\removedCC{result_type operator\&(T \&\&, U const\&);}@
+ @\removedCC{result_type operator\&(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -1105,9 +1107,9 @@
auto concept HasBitOr<typename T, typename U = T> {
typename result_type;
result_type operator|(T const&, U const&);
- result_type operator|(T const&, U &&);
- result_type operator|(T &&, U const&);
- result_type operator|(T &&, U &&);
+ @\removedCC{result_type operator|(T const\&, U \&\&);}@
+ @\removedCC{result_type operator|(T \&\&, U const\&);}@
+ @\removedCC{result_type operator|(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -1120,9 +1122,9 @@
auto concept HasBitXor<typename T, typename U = T> {
typename result_type;
result_type operator^(T const&, U const&);
- result_type operator^(T const&, U &&);
- result_type operator^(T &&, U const&);
- result_type operator^(T &&, U &&);
+ @\removedCC{result_type operator\^(T const\&, U \&\&);}@
+ @\removedCC{result_type operator\^(T \&\&, U const\&);}@
+ @\removedCC{result_type operator\^(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -1135,7 +1137,7 @@
auto concept HasComplement<typename T> {
typename result_type;
result_type operator~(T const&);
- result_type operator~(T &&);
+ @\removedCC{result_type operator$\sim{}$(T \&\&);}@
}
\end{itemdecl}
@@ -1149,9 +1151,9 @@
auto concept HasLeftShift<typename T, typename U = T> {
typename result_type;
result_type operator<<(T const&, U const&);
- result_type operator<<(T const&, U &&);
- result_type operator<<(T &&, U const&);
- result_type operator<<(T &&, U &&);
+ @\removedCC{result_type operator$\langle\langle$(T const\&, U \&\&);}@
+ @\removedCC{result_type operator$\langle\langle$(T \&\&, U const\&);}@
+ @\removedCC{result_type operator$\langle\langle$(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -1164,9 +1166,9 @@
auto concept HasRightShift<typename T, typename U = T> {
typename result_type;
result_type operator>>(T const&, U const&);
- result_type operator>>(T const&, U &&);
- result_type operator>>(T &&, U const&);
- result_type operator>>(T &&, U &&);
+ @\removedCC{result_type operator$\rangle\rangle$(T const\&, U \&\&);}@
+ @\removedCC{result_type operator$\rangle\rangle$(T \&\&, U const\&);}@
+ @\removedCC{result_type operator$\rangle\rangle$(T \&\&, U \&\&);}@
}
\end{itemdecl}
@@ -1190,10 +1192,9 @@
\begin{itemdecl}
auto concept Addressable<typename T> {
typename pointer;
- typename const_pointer;
-
+ @\removedCC{typename const_pointer;}@
pointer operator&(T&);
- const_pointer operator&(const T&);
+ @\removedCC{const_pointer operator\&(const T\&);}@
}
\end{itemdecl}
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