From 87f5b1ab63b84bcfabd6f75f22f1a94cf444674b Mon Sep 17 00:00:00 2001
From: Douglas Gregor <doug.gregor@gmail.com>
Date: Sun, 31 Oct 2004 19:55:15 +0000
Subject: [PATCH] Minor fixes

[SVN r26024]
---
 include/boost/concept_check.hpp | 34 ++++++++++++++++-----------------
 1 file changed, 17 insertions(+), 17 deletions(-)

diff --git a/include/boost/concept_check.hpp b/include/boost/concept_check.hpp
index 4ac5ee6..8b090d0 100644
--- a/include/boost/concept_check.hpp
+++ b/include/boost/concept_check.hpp
@@ -688,12 +688,12 @@ struct require_same { typedef T type; };
       function_requires< AssignableConcept<Container> >();
       const_constraints(c);
     }
-    void const_constraints(const Container& c) {
-      i = c.begin();
-      i = c.end();
-      n = c.size();
-      n = c.max_size();
-      b = c.empty();
+    void const_constraints(const Container& cc) {
+      i = cc.begin();
+      i = cc.end();
+      n = cc.size();
+      n = cc.max_size();
+      b = cc.empty();
     }
     Container c;
     bool b;
@@ -757,9 +757,9 @@ struct require_same { typedef T type; };
         BidirectionalIteratorConcept<const_reverse_iterator> >();
       const_constraints(c);
     }
-    void const_constraints(const ReversibleContainer& c) {
-      const_reverse_iterator i = c.rbegin();
-      i = c.rend();
+    void const_constraints(const ReversibleContainer& cc) {
+      const_reverse_iterator i = cc.rbegin();
+      i = cc.rend();
     }
     ReversibleContainer c;
   };
@@ -801,8 +801,8 @@ struct require_same { typedef T type; };
 
       const_constraints(c);
     }
-    void const_constraints(const RandomAccessContainer& c) {
-      const_reference r = c[n];
+    void const_constraints(const RandomAccessContainer& cc) {
+      const_reference r = cc[n];
       ignore_unused_variable_warning(r);
     }
     RandomAccessContainer c;
@@ -905,8 +905,8 @@ struct require_same { typedef T type; };
       reference r = c.back();
       ignore_unused_variable_warning(r);
     }
-    void const_constraints(const BackInsertionSequence& c) {
-      const_reference r = c.back();
+    void const_constraints(const BackInsertionSequence& cc) {
+      const_reference r = cc.back();
       ignore_unused_variable_warning(r);
     };
     BackInsertionSequence c;
@@ -927,10 +927,10 @@ struct require_same { typedef T type; };
       c.erase(r.first, r.second);
       const_constraints(c);
     }
-    void const_constraints(const AssociativeContainer& c) {
-      ci = c.find(k);
-      n = c.count(k);
-      cr = c.equal_range(k);
+    void const_constraints(const AssociativeContainer& cc) {
+      ci = cc.find(k);
+      n = cc.count(k);
+      cr = cc.equal_range(k);
     }
     typedef typename AssociativeContainer::iterator iterator;
     typedef typename AssociativeContainer::const_iterator const_iterator;