WTF: De-specialize PtrHash<T>.

third_party/WebKit/Source/wtf/HashSetTest.cpp

 /*
  * Copyright (C) 2012 Apple Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 212 matching lines @@
 
 struct CountCopyHashTraits : public GenericHashTraits<CountCopy> {
     static const bool emptyValueIsZero = false;
     static const bool hasIsEmptyValueFunction = true;
     static bool isEmptyValue(const CountCopy& value) { return !value.counter(); }
     static void constructDeletedValue(CountCopy& slot, bool) { slot = CountCopy(CountCopy::kDeletedValue); }
     static bool isDeletedValue(const CountCopy& value) { return value.counter() == CountCopy::kDeletedValue; }
 };
 
 struct CountCopyHash : public PtrHash<const int*> {
-    static unsigned hash(const CountCopy& value) { return PtrHash<const int*>::hash(value.counter()); }
+    static unsigned hash(const CountCopy& value) { return PtrHash<const int>::hash(value.counter()); }
     static bool equal(const CountCopy& left, const CountCopy& right)
     {
-        return PtrHash<const int*>::equal(left.counter(), right.counter());
+        return PtrHash<const int>::equal(left.counter(), right.counter());
     }
     static const bool safeToCompareToEmptyOrDeleted = true;
 };
 
 } // anonymous namespace
 
 template <>
 struct HashTraits<CountCopy> : public CountCopyHashTraits { };
 
 template <>
@@ skipping 138 matching lines @@
     EXPECT_EQ(13, thirteen.id());
     iter = set.find(MoveOnly(13));
     EXPECT_TRUE(iter == set.end());
 
     set.clear();
 }
 
 } // anonymous namespace
 
 } // namespace WTF