SparseMultiSet.h: Add suggested parentheses.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@173128 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
NAKAMURA Takumi 2013-01-22 05:41:57 +00:00
parent 19f24454b5
commit dc89ed7da3

View File

@ -267,7 +267,7 @@ public:
bool operator==(const iterator_base &RHS) const { bool operator==(const iterator_base &RHS) const {
// end compares equal // end compares equal
if (SMS == RHS.SMS && Idx == RHS.Idx) { if (SMS == RHS.SMS && Idx == RHS.Idx) {
assert(isEnd() || SparseIdx == RHS.SparseIdx && assert((isEnd() || SparseIdx == RHS.SparseIdx) &&
"Same dense entry, but different keys?"); "Same dense entry, but different keys?");
return true; return true;
} }
@ -282,7 +282,7 @@ public:
/// Increment and decrement operators /// Increment and decrement operators
iterator_base &operator--() { // predecrement - Back up iterator_base &operator--() { // predecrement - Back up
assert(isKeyed() && "Decrementing an invalid iterator"); assert(isKeyed() && "Decrementing an invalid iterator");
assert(isEnd() || !SMS->isHead(SMS->Dense[Idx]) && assert((isEnd() || !SMS->isHead(SMS->Dense[Idx])) &&
"Decrementing head of list"); "Decrementing head of list");
// If we're at the end, then issue a new find() // If we're at the end, then issue a new find()