Style Change: SkNEW->new; SkDELETE->delete

src/core/SkTMultiMap.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 SkTMultiMap_DEFINED
 #define SkTMultiMap_DEFINED
@@ skipping 22 matching lines @@
     ~SkTMultiMap() {
         SkASSERT(fCount == 0);
         SkASSERT(fHash.count() == 0);
     }
 
     void insert(const Key& key, T* value) {
         ValueList* list = fHash.find(key);
         if (list) {
             // The new ValueList entry is inserted as the second element in the
             // linked list, and it will contain the value of the first element.
-            ValueList* newEntry = SkNEW_ARGS(ValueList, (list->fValue));
+            ValueList* newEntry = new ValueList(list->fValue);
             newEntry->fNext = list->fNext;
             // The existing first ValueList entry is updated to contain the
             // inserted value.
             list->fNext = newEntry;
             list->fValue = value;
         } else {
-            fHash.add(SkNEW_ARGS(ValueList, (value)));
+            fHash.add(new ValueList(value));
         }
 
         ++fCount;
     }
 
     void remove(const Key& key, const T* value) {
         ValueList* list = fHash.find(key);
         // Since we expect the caller to be fully aware of what is stored, just
         // assert that the caller removes an existing value.
         SkASSERT(list);
         ValueList* prev = NULL;
         while (list->fValue != value) {
             prev = list;
             list = list->fNext;
         }
 
         if (list->fNext) {
             ValueList* next = list->fNext;
             list->fValue = next->fValue;
             list->fNext = next->fNext;
-            SkDELETE(next);
+            delete next;
         } else if (prev) {
             prev->fNext = NULL;
-            SkDELETE(list);
+            delete list;
         } else {
             fHash.remove(key);
-            SkDELETE(list);
+            delete list;
         }
 
         --fCount;
     }
 
     T* find(const Key& key) const {
         ValueList* list = fHash.find(key);
         if (list) {
             return list->fValue;
         }
@@ skipping 26 matching lines @@
         return count;
     }
 #endif
 
 private:
     SkTDynamicHash<ValueList, Key> fHash;
     int fCount;
 };
 
 #endif