Rename and improve "traceable" templates.

third_party/WebKit/Source/wtf/LinkedHashSet.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 332 matching lines @@
     static bool isEmptyValue(const Node& node) { return !node.m_next; }
 
     static const int deletedValue = -1;
 
     static void constructDeletedValue(Node& slot, bool) { slot.m_next = reinterpret_cast<Node*>(deletedValue); }
     static bool isDeletedValue(const Node& slot) { return slot.m_next == reinterpret_cast<Node*>(deletedValue); }
 
     // Whether we need to trace and do weak processing depends on the traits of
     // the type inside the node.
     template<typename U = void>
-    struct NeedsTracingLazily {
-        STATIC_ONLY(NeedsTracingLazily);
-        static const bool value = ValueTraits::template NeedsTracingLazily<>::value;
+    struct IsTraceableInCollection {
+        STATIC_ONLY(IsTraceableInCollection);
+        static const bool value = ValueTraits::template IsTraceableInCollection<>::value;
     };
     static const WeakHandlingFlag weakHandlingFlag = ValueTraits::weakHandlingFlag;
 };
 
 template<typename LinkedHashSetType>
 class LinkedHashSetIterator {
     DISALLOW_NEW();
 private:
     typedef typename LinkedHashSetType::Node Node;
     typedef typename LinkedHashSetType::Traits Traits;
@@ skipping 407 matching lines @@
     swap(static_cast<Base&>(a), static_cast<Base&>(b));
     swap(a.m_value, b.m_value);
     Allocator::leaveGCForbiddenScope();
 }
 
 } // namespace WTF
 
 using WTF::LinkedHashSet;
 
 #endif /* WTF_LinkedHashSet_h */