WTF HashSet: Implement move semantics for values.

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 438 matching lines @@
         return m_tableSize;
     }
     bool isEmpty() const
     {
         ASSERT(!m_accessForbidden);
         return !m_keyCount;
     }
 
     void reserveCapacityForSize(unsigned size);
 
-    AddResult add(ValuePassInType value)
+    template <typename IncomingValueType>
+    AddResult add(IncomingValueType&& value)
     {
-        return add<IdentityTranslatorType>(Extractor::extract(value), value);
+        return add<IdentityTranslatorType>(Extractor::extract(value), std::forward<IncomingValueType>(value));
     }
 
     // A special version of add() that finds the object by hashing and comparing
     // with some other type, to avoid the cost of type conversion if the object
     // is already in the table.
     template <typename HashTranslator, typename T, typename Extra> AddResult add(T&& key, Extra&&);
-    template <typename HashTranslator, typename T, typename Extra> AddResult addPassingHashCode(const T& key, const Extra&);
+    template <typename HashTranslator, typename T, typename Extra> AddResult addPassingHashCode(T&& key, Extra&&);
 
     iterator find(KeyPeekInType key) { return find<IdentityTranslatorType>(key); }
     const_iterator find(KeyPeekInType key) const { return find<IdentityTranslatorType>(key); }
     bool contains(KeyPeekInType key) const { return contains<IdentityTranslatorType>(key); }
 
     template <typename HashTranslator, typename T> iterator find(const T&);
     template <typename HashTranslator, typename T> const_iterator find(const T&) const;
     template <typename HashTranslator, typename T> bool contains(const T&) const;
 
     void remove(KeyPeekInType);
@@ skipping 377 matching lines @@
     ++m_keyCount;
 
     if (shouldExpand())
         entry = expand(entry);
 
     return AddResult(this, entry, true);
 }
 
 template <typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits, typename Allocator>
 template <typename HashTranslator, typename T, typename Extra>
-typename HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator>::AddResult HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator>::addPassingHashCode(const T& key, const Extra& extra)
+typename HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator>::AddResult HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator>::addPassingHashCode(T&& key, Extra&& extra)
 {
     ASSERT(!m_accessForbidden);
     ASSERT(Allocator::isAllocationAllowed());
     if (!m_table)
         expand();
 
     FullLookupType lookupResult = fullLookupForWriting<HashTranslator>(key);
 
     ValueType* entry = lookupResult.first.first;
     bool found = lookupResult.first.second;
     unsigned h = lookupResult.second;
 
     if (found)
         return AddResult(this, entry, false);
 
     registerModification();
 
     if (isDeletedBucket(*entry)) {
         initializeBucket(*entry);
         --m_deletedCount;
     }
 
-    HashTranslator::translate(*entry, key, extra, h);
+    HashTranslator::translate(*entry, std::forward<T>(key), std::forward<Extra>(extra), h);
     ASSERT(!isEmptyOrDeletedBucket(*entry));
 
     ++m_keyCount;
     if (shouldExpand())
         entry = expand(entry);
 
     return AddResult(this, entry, true);
 }
 
 template <typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits, typename Allocator>
@@ skipping 622 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