Refactor the Heap into ThreadHeap to prepare for per thread heaps

third_party/WebKit/Source/wtf/HashTable.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2008 David Levin <levin@chromium.org>
  *
  * 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 417 matching lines @@
     HashTable& operator=(const HashTable&);
 
     // When the hash table is empty, just return the same iterator for end as
     // for begin.  This is more efficient because we don't have to skip all the
     // empty and deleted buckets, and iterating an empty table is a common case
     // that's worth optimizing.
     iterator begin() { return isEmpty() ? end() : makeIterator(m_table); }
     iterator end() { return makeKnownGoodIterator(m_table + m_tableSize); }
     const_iterator begin() const { return isEmpty() ? end() : makeConstIterator(m_table); }
     const_iterator end() const { return makeKnownGoodConstIterator(m_table + m_tableSize); }
+    ValueType* table() const { return m_table; }

[haraken, 2016/01/07 08:06:22]

Ditto.

 
     unsigned size() const
     {
         ASSERT(!m_accessForbidden);
         return m_keyCount;
     }
     unsigned capacity() const
     {
         ASSERT(!m_accessForbidden);
         return m_tableSize;
@@ skipping 1041 matching lines @@
     CollectionIterator end(toBeRemoved.end());
     for (CollectionIterator it(toBeRemoved.begin()); it != end; ++it)
         collection.remove(*it);
 }
 
 } // namespace WTF
 
 #include "wtf/HashIterators.h"
 
 #endif // WTF_HashTable_h