Create HeapLinkedHashSet and LinkedHashSet, ordered heap-friendly hash sets.

Source/heap/Visitor.h

 /*
  * Copyright (C) 2013 Google 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:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 21 matching lines @@
 #define Visitor_h
 
 #include "heap/HeapExport.h"
 #include "heap/ThreadState.h"
 #include "wtf/Assertions.h"
 #include "wtf/Deque.h"
 #include "wtf/Forward.h"
 #include "wtf/HashMap.h"
 #include "wtf/HashSet.h"
 #include "wtf/HashTraits.h"
+#include "wtf/LinkedHashSet.h"
 #include "wtf/ListHashSet.h"
 #include "wtf/OwnPtr.h"
 #include "wtf/RefPtr.h"
 #include "wtf/TypeTraits.h"
 
 #ifndef NDEBUG
 #define DEBUG_ONLY(x) x
 #else
 #define DEBUG_ONLY(x)
 #endif
@@ skipping 203 matching lines @@
     {
         OffHeapCollectionTraceTrait<HashSet<T, U, V, WTF::DefaultAllocator> >::trace(this, hashSet);
     }
 
     template<typename T, size_t inlineCapacity, typename U>
     void trace(const ListHashSet<T, inlineCapacity, U>& hashSet)
     {
         OffHeapCollectionTraceTrait<ListHashSet<T, inlineCapacity, U> >::trace(this, hashSet);
     }
 
+    template<typename T, typename U>
+    void trace(const LinkedHashSet<T, U>& hashSet)
+    {
+        OffHeapCollectionTraceTrait<LinkedHashSet<T, U> >::trace(this, hashSet);
+    }
+
     template<typename T, size_t N>
     void trace(const Deque<T, N>& deque)
     {
         OffHeapCollectionTraceTrait<Deque<T, N> >::trace(this, deque);
     }
 
     template<typename T, typename U, typename V, typename W, typename X>
     void trace(const HashMap<T, U, V, W, X, WTF::DefaultAllocator>& map)
     {
         OffHeapCollectionTraceTrait<HashMap<T, U, V, W, X, WTF::DefaultAllocator> >::trace(this, map);
@@ skipping 145 matching lines @@
     static void trace(Visitor* visitor, const ListHashSet& set)
     {
         if (set.isEmpty())
             return;
         ListHashSet& iterSet = const_cast<ListHashSet&>(set);
         for (typename ListHashSet::iterator it = iterSet.begin(), end = iterSet.end(); it != end; ++it)
             visitor->trace(*it);
     }
 };
 
+template<typename T, typename HashFunctions>
+struct OffHeapCollectionTraceTrait<WTF::LinkedHashSet<T, HashFunctions> > {
+    typedef WTF::LinkedHashSet<T, HashFunctions> LinkedHashSet;
+
+    static void trace(Visitor* visitor, const LinkedHashSet& set)
+    {
+        if (set.isEmpty())
+            return;
+        LinkedHashSet& iterSet = const_cast<LinkedHashSet&>(set);
+        for (typename LinkedHashSet::iterator it = iterSet.begin(), end = iterSet.end(); it != end; ++it)
+            visitor->trace(*it);
+    }
+};
+
 template<typename Key, typename Value, typename HashFunctions, typename KeyTraits, typename ValueTraits>
 struct OffHeapCollectionTraceTrait<WTF::HashMap<Key, Value, HashFunctions, KeyTraits, ValueTraits, WTF::DefaultAllocator> > {
     typedef WTF::HashMap<Key, Value, HashFunctions, KeyTraits, ValueTraits, WTF::DefaultAllocator> HashMap;
 
     static void trace(Visitor* visitor, const HashMap& map)
     {
         if (map.isEmpty())
             return;
         if (WTF::ShouldBeTraced<KeyTraits>::value || WTF::ShouldBeTraced<ValueTraits>::value) {
             HashMap& iterMap = const_cast<HashMap&>(map);
@@ skipping 179 matching lines @@
 struct GCInfoTrait {
     static const GCInfo* get()
     {
         return GCInfoAtBase<typename GetGarbageCollectedBase<T>::type>::get();
     }
 };
 
 }
 
 #endif