update sources to v12.2.3

[ceph.git] / ceph / src / boost / libs / concept_check / using_concept_check.htm

diff --git a/ceph/src/boost/libs/concept_check/using_concept_check.htm b/ceph/src/boost/libs/concept_check/using_concept_check.htm
index 2d08db2da98270f56b016fbcaa3e2c68262c783d..80c95cbd54f36e80a28e60ad6b842f441ad6b644 100644 (file)
--- a/ceph/src/boost/libs/concept_check/using_concept_check.htm
+++ b/ceph/src/boost/libs/concept_check/using_concept_check.htm
@@ -51,8 +51,8 @@ struct EqualityComparable;
 </pre>
 
   <p>The template argument is the type to be checked. That is, the purpose of
-  <tt>EqualityComparable&lt;<em>X</em>&gt;</tt> is to make sure that
-  <tt><em>X</em></tt> models the EqualityComparable concept.</p>
+  <tt>EqualityComparable&lt;<em>T</em>&gt;</tt> is to make sure that
+  <tt><em>T</em></tt> models the EqualityComparable concept.</p>
 
   <h4><tt>BOOST_CONCEPT_ASSERT()</tt></h4>
 
@@ -112,9 +112,9 @@ int main() {
   a sequence of adjacent concept checking template specializations,
   <strong>in double parentheses</strong>, and the function's return type must
   also be parenthesized. For example, the standard <code>stable_sort</code>
-  algorithm might be declared as follows: class</p>
+  algorithm might be declared as follows: </p>
   <pre>
-template&lt;typename RanIter&gt;
+template &lt;class RanIter&gt;
 BOOST_CONCEPT_REQUIRES(
     ((Mutable_RandomAccessIterator&lt;RanIter&gt;))
     ((LessThanComparable&lt;typename Mutable_RandomAccessIterator&lt;RanIter&gt;::value_type&gt;)),