"NULL !=" = NULL

src/core/SkTDynamicHash.h

 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkTDynamicHash_DEFINED
 #define SkTDynamicHash_DEFINED
 
@@ skipping 96 matching lines @@
     // Add an entry with this key.  We require that no entry with newEntry's key is already present.
     void add(T* newEntry) {
         SkASSERT(NULL == this->find(GetKey(*newEntry)));
         this->maybeGrow();
         this->innerAdd(newEntry);
         SkASSERT(this->validate());
     }
 
     // Remove the entry with this key.  We require that an entry with this key is present.
     void remove(const Key& key) {
-        SkASSERT(NULL != this->find(key));
+        SkASSERT(this->find(key));
         this->innerRemove(key);
         SkASSERT(this->validate());
     }
 
     void rewind() {
-        if (NULL != fArray) {
+        if (fArray) {
             sk_bzero(fArray, sizeof(T*)* fCapacity);
         }
         fCount = 0;
         fDeleted = 0;
     }
 
     void reset() { 
         fCount = 0; 
         fDeleted = 0; 
         fCapacity = 0; 
@@ skipping 36 matching lines @@
 
         // O(N) checks, skipped when very large.
         if (fCount < kLarge * kLarge) {
             // Are fCount and fDeleted correct, and are all elements findable?
             int count = 0, deleted = 0;
             for (int i = 0; i < fCapacity; i++) {
                 if (Deleted() == fArray[i]) {
                     deleted++;
                 } else if (Empty() != fArray[i]) {
                     count++;
-                    SKTDYNAMICHASH_CHECK(NULL != this->find(GetKey(*fArray[i])));
+                    SKTDYNAMICHASH_CHECK(this->find(GetKey(*fArray[i])));
                 }
             }
             SKTDYNAMICHASH_CHECK(count == fCount);
             SKTDYNAMICHASH_CHECK(deleted == fDeleted);
         }
 
         // O(N^2) checks, skipped when large.
         if (fCount < kLarge) {
             // Are all entries unique?
             for (int i = 0; i < fCapacity; i++) {
@@ skipping 89 matching lines @@
     static const Key& GetKey(const T& t) { return Traits::GetKey(t); }
     static uint32_t Hash(const Key& key) { return Traits::Hash(key); }
 
     int fCount;     // Number of non Empty(), non Deleted() entries in fArray.
     int fDeleted;   // Number of Deleted() entries in fArray.
     int fCapacity;  // Number of entries in fArray.  Always a power of 2.
     T** fArray;
 };
 
 #endif