fix operator precedence in test.

chrome/browser/safe_browsing/protocol_parser_unittest.cc

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include <string>
 
 #include "base/strings/stringprintf.h"
 #include "base/time/time.h"
 #include "chrome/browser/safe_browsing/protocol_parser.h"
 #include "chrome/browser/safe_browsing/safe_browsing_util.h"
@@ skipping 60 matching lines @@
     '0', '1', '0', '1', '0', '1', '0', '1',
 
     '2', '3', '2', '3', '2', '3', '2', '3',
     '2', '3', '2', '3', '2', '3', '2', '3',
     '2', '3', '2', '3', '2', '3', '2', '3',
     '2', '3', '2', '3', '2', '3', '2', '3',
   };
 
   SBFullHash full_hash1, full_hash2;
   for (int i = 0; i < 32; ++i) {
-    full_hash1.full_hash[i] = i % 2 ? '1' : '0';
-    full_hash2.full_hash[i] = i % 2 ? '3' : '2';
+    full_hash1.full_hash[i] = (i % 2) ? '1' : '0';
+    full_hash2.full_hash[i] = (i % 2) ? '3' : '2';
   }
 
   ScopedVector<SBChunkData> chunks;
   EXPECT_TRUE(safe_browsing::ParseChunk(kRawAddChunk, sizeof(kRawAddChunk),
                                         &chunks));
   ASSERT_EQ(1U, chunks.size());
   EXPECT_EQ(1, chunks[0]->ChunkNumber());
   EXPECT_TRUE(chunks[0]->IsAdd());
   EXPECT_FALSE(chunks[0]->IsSub());
   EXPECT_FALSE(chunks[0]->IsPrefix());
@@ skipping 616 matching lines @@
   EXPECT_FALSE(chunks[0]->IsAdd());
   EXPECT_TRUE(chunks[0]->IsSub());
   EXPECT_TRUE(chunks[2]->IsPrefix());
   EXPECT_FALSE(chunks[2]->IsFullHash());
   ASSERT_EQ(1U, chunks[2]->PrefixCount());
   EXPECT_EQ(0x70707070U, chunks[2]->PrefixAt(0));  // pppp
   EXPECT_EQ(11, chunks[2]->AddChunkNumberAt(0));
 }
 
 }  // namespace