feedc0de/boost_concept_check
1
0
Fork 0
forked from boostorg/concept_check
Code Pull Requests Activity

Minor fixes

Browse Source 
[SVN r26024]
This commit is contained in:
Douglas Gregor
2004-10-31 19:55:15 +00:00
parent 9ef32e2e8d
commit 87f5b1ab63
1 changed files with 17 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
include/boost/concept_check.hpp
View File

@@ -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;