Remove HasInlinedTraceMethod<T>.

Source/wtf/ListHashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2011, Benjamin Poulain <ikipou@gmail.com>
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
  *
  * This library is distributed in the hope that it will be useful,
@@ skipping 149 matching lines @@
         void remove(ValuePeekInType value) { return remove(find(value)); }
         void remove(iterator);
         void clear();
         template<typename Collection>
         void removeAll(const Collection& other) { WTF::removeAll(*this, other); }
 
         ValuePassOutType take(iterator);
         ValuePassOutType take(ValuePeekInType);
         ValuePassOutType takeFirst();
 
-        typedef int HasInlinedTraceMethodMarker;
         template<typename VisitorDispatcher>
         void trace(VisitorDispatcher);
 
     private:
         void unlink(Node*);
         void unlinkAndDelete(Node*);
         void appendNode(Node*);
         void prependNode(Node*);
         void insertNodeBefore(Node* beforeNode, Node* newNode);
         void deleteAllNodes();
@@ skipping 206 matching lines @@
             finalize(this);
         }
 
         void destroy(NodeAllocator* allocator)
         {
             this->~ListHashSetNode();
             setWasAlreadyDestructed();
             allocator->deallocate(this);
         }
 
-        typedef int HasInlinedTraceMethodMarker;
         // This is not called in normal tracing, but it is called if we find a
         // pointer to a node on the stack using conservative scanning. Since
         // the original ListHashSet may no longer exist we make sure to mark
         // the neighbours in the chain too.
         template<typename VisitorDispatcher>
         void trace(VisitorDispatcher visitor)
         {
             // The conservative stack scan can find nodes that have been
             // removed from the set and destructed. We don't need to trace
             // these, and it would be wrong to do so, because the class will
@@ skipping 602 matching lines @@
     struct NeedsTracing<ListHashSet<T, U, V>> {
         static const bool value = false;
     };
 #endif
 
 } // namespace WTF
 
 using WTF::ListHashSet;
 
 #endif /* WTF_ListHashSet_h */