From 06b61f540776cfb83f0f54fb5d0a11c6b73131e3 Mon Sep 17 00:00:00 2001 From: Edward Diener Date: Tue, 4 Apr 2017 07:59:25 -0400 Subject: [PATCH] Some doc corrections. --- concept_check.htm | 2 +- using_concept_check.htm | 8 ++++---- 2 files changed, 5 insertions(+), 5 deletions(-) diff --git a/concept_check.htm b/concept_check.htm index 1dd72c2..4a47fa8 100644 --- a/concept_check.htm +++ b/concept_check.htm @@ -72,7 +72,7 @@
  • A mechanism for inserting compile-time checks on template parameters at their point of use.
    • -
  • A framework for specifying concept requirements though concept +
  • A framework for specifying concept requirements through concept checking classes.
  • A mechanism for verifying that concept requirements cover the diff --git a/using_concept_check.htm b/using_concept_check.htm index 2d08db2..2fd5218 100644 --- a/using_concept_check.htm +++ b/using_concept_check.htm @@ -51,8 +51,8 @@ struct EqualityComparable;

    The template argument is the type to be checked. That is, the purpose of - EqualityComparable<X> is to make sure that - X models the EqualityComparable concept.

    + EqualityComparable<T> is to make sure that + T models the EqualityComparable concept.

    BOOST_CONCEPT_ASSERT()

    @@ -112,9 +112,9 @@ int main() { a sequence of adjacent concept checking template specializations, in double parentheses, and the function's return type must also be parenthesized. For example, the standard stable_sort - algorithm might be declared as follows: class

    + algorithm might be declared as follows: 

    -template<typename RanIter>
+class template<typename RanIter>
 BOOST_CONCEPT_REQUIRES(
     ((Mutable_RandomAccessIterator<RanIter>))
     ((LessThanComparable<typename Mutable_RandomAccessIterator<RanIter>::value_type>)),