diff options
author | Bill Wendling <isanbard@gmail.com> | 2019-07-08 22:01:07 +0000 |
---|---|---|
committer | Bill Wendling <isanbard@gmail.com> | 2019-07-08 22:01:07 +0000 |
commit | b9816f674b347979636315ca41689325d6ff946b (patch) | |
tree | 844578a0e93db0ed480a0c3c0b598c6aec62ea29 /clang/lib/Tooling/Syntax/BuildTree.cpp | |
parent | c8933c40707aa8d4e9ce84c94bc4e32309016f8b (diff) | |
download | bcm5719-llvm-b9816f674b347979636315ca41689325d6ff946b.tar.gz bcm5719-llvm-b9816f674b347979636315ca41689325d6ff946b.zip |
Add parentheses to silence warnings.
llvm-svn: 365395
Diffstat (limited to 'clang/lib/Tooling/Syntax/BuildTree.cpp')
-rw-r--r-- | clang/lib/Tooling/Syntax/BuildTree.cpp | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/clang/lib/Tooling/Syntax/BuildTree.cpp b/clang/lib/Tooling/Syntax/BuildTree.cpp index 3c259a08bd7..dc682ff677f 100644 --- a/clang/lib/Tooling/Syntax/BuildTree.cpp +++ b/clang/lib/Tooling/Syntax/BuildTree.cpp @@ -110,9 +110,9 @@ private: auto It = Trees.lower_bound(Range.begin()); assert(It != Trees.end() && "no node found"); assert(It->first == Range.begin() && "no child with the specified range"); - assert(std::next(It) == Trees.end() || - std::next(It)->first == Range.end() && - "no child with the specified range"); + assert((std::next(It) == Trees.end() || + std::next(It)->first == Range.end()) && + "no child with the specified range"); It->second.Role = Role; } @@ -129,9 +129,9 @@ private: BeginChildren->first == FirstToken && "fold crosses boundaries of existing subtrees"); auto EndChildren = Trees.lower_bound(NodeTokens.end()); - assert(EndChildren == Trees.end() || - EndChildren->first == NodeTokens.end() && - "fold crosses boundaries of existing subtrees"); + assert((EndChildren == Trees.end() || + EndChildren->first == NodeTokens.end()) && + "fold crosses boundaries of existing subtrees"); // (!) we need to go in reverse order, because we can only prepend. for (auto It = EndChildren; It != BeginChildren; --It) |