Index: Source/wtf/ListHashSet.h |
diff --git a/Source/wtf/ListHashSet.h b/Source/wtf/ListHashSet.h |
index 557cad1a494c3d6489acef621276048efdf609ef..78639b4067c137d7df368d49fc128f59e89ad722 100644 |
--- a/Source/wtf/ListHashSet.h |
+++ b/Source/wtf/ListHashSet.h |
@@ -94,8 +94,6 @@ namespace WTF { |
int capacity() const; |
bool isEmpty() const; |
- size_t sizeInBytes() const; |
- |
iterator begin(); |
iterator end(); |
const_iterator begin() const; |
@@ -218,15 +216,14 @@ namespace WTF { |
fastFree(node); |
} |
+ private: |
+ Node* pool() { return reinterpret_cast_ptr<Node*>(m_pool.pool); } |
+ Node* pastPool() { return pool() + m_poolSize; } |
bool inPool(Node* node) |
{ |
return node >= pool() && node < pastPool(); |
} |
- private: |
- Node* pool() { return reinterpret_cast_ptr<Node*>(m_pool.pool); } |
- Node* pastPool() { return pool() + m_poolSize; } |
- |
Node* m_freeList; |
bool m_isDoneWithInitialFreeList; |
static const size_t m_poolSize = inlineCapacity; |
@@ -569,18 +566,6 @@ namespace WTF { |
} |
template<typename T, size_t inlineCapacity, typename U> |
- size_t ListHashSet<T, inlineCapacity, U>::sizeInBytes() const |
- { |
- size_t result = sizeof(*this) + sizeof(*m_allocator); |
- result += sizeof(typename ImplType::ValueType) * m_impl.capacity(); |
- for (Node* node = m_head; node; node = node->m_next) { |
- if (!m_allocator->inPool(node)) |
- result += sizeof(Node); |
- } |
- return result; |
- } |
- |
- template<typename T, size_t inlineCapacity, typename U> |
inline typename ListHashSet<T, inlineCapacity, U>::iterator ListHashSet<T, inlineCapacity, U>::begin() |
{ |
return makeIterator(m_head); |