"NULL !=" = NULL

tests/BBoxHierarchyTest.cpp

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #include "Test.h"
 #include "SkRandom.h"
 #include "SkRTree.h"
@@ skipping 68 matching lines @@
         SkRect query = random_rect(rand);
         tree.search(query, &hits);
         REPORTER_ASSERT(reporter, verify_query(query, rects, hits));
     }
 }
 
 static void tree_test_main(SkBBoxHierarchy* tree, int minChildren, int maxChildren,
                            skiatest::Reporter* reporter) {
     DataRect rects[NUM_RECTS];
     SkRandom rand;
-    REPORTER_ASSERT(reporter, NULL != tree);
+    REPORTER_ASSERT(reporter, tree);
 
     int expectedDepthMin = -1;
     int expectedDepthMax = -1;
 
     int tmp = NUM_RECTS;
     if (maxChildren > 0) {
         while (tmp > 0) {
             tmp -= static_cast<int>(pow(static_cast<double>(maxChildren),
                                     static_cast<double>(expectedDepthMin + 1)));
             ++expectedDepthMin;
@@ skipping 61 matching lines @@
         SkRTree* rtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN);
         SkAutoUnref au(rtree);
         tree_test_main(rtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter);
 
         // Rtree that orders input rectangles on deferred insert.
         SkRTree* unsortedRtree = SkRTree::Create(RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, 1, false);
         SkAutoUnref auo(unsortedRtree);
         tree_test_main(unsortedRtree, RTREE_MIN_CHILDREN, RTREE_MAX_CHILDREN, reporter);
     }
 }