Enable WTF::HashSet<OwnPtr<> >

Source/wtf/HashSet.h

 /*
  * Copyright (C) 2005, 2006, 2007, 2008, 2011 Apple Inc. All rights reserved.
  *
  * 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,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ skipping 23 matching lines @@
 
     template<
         typename ValueArg,
         typename HashArg = typename DefaultHash<ValueArg>::Hash,
         typename TraitsArg = HashTraits<ValueArg>,
         typename Allocator = DefaultAllocator> class HashSet {
         WTF_USE_ALLOCATOR(HashSet);
     private:
         typedef HashArg HashFunctions;
         typedef TraitsArg ValueTraits;
-        typedef const typename ValueTraits::PeekInType& ValuePeekInType;
+        typedef typename ValueTraits::PeekInType ValuePeekInType;
+        typedef typename ValueTraits::PassInType ValuePassInType;
 
     public:
         typedef typename ValueTraits::TraitType ValueType;
 
     private:
         typedef HashTable<ValueType, ValueType, IdentityExtractor,
             HashFunctions, ValueTraits, ValueTraits, Allocator> HashTableType;
 
     public:
         typedef HashTableConstIteratorAdapter<HashTableType, ValueTraits> iterator;
@@ skipping 24 matching lines @@
         // An alternate version of find() that finds the object by hashing and comparing
         // with some other type, to avoid the cost of type conversion. HashTranslator
         // must have the following function members:
         //   static unsigned hash(const T&);
         //   static bool equal(const ValueType&, const T&);
         template<typename HashTranslator, typename T> iterator find(const T&) const;
         template<typename HashTranslator, typename T> bool contains(const T&) const;
 
         // The return value is a pair of an iterator to the new value's location,
         // and a bool that is true if an new entry was added.
-        AddResult add(ValuePeekInType);
+        AddResult add(ValuePassInType);
 
         // An alternate 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. HashTranslator must have the following function members:
         //   static unsigned hash(const T&);
         //   static bool equal(const ValueType&, const T&);
         //   static translate(ValueType&, const T&, unsigned hashCode);
         template<typename HashTranslator, typename T> AddResult add(const T&);
 
         void remove(ValuePeekInType);
@@ skipping 81 matching lines @@
     }
 
     template<typename Value, typename HashFunctions, typename Traits, typename Allocator>
     template<typename HashTranslator, typename T>
     inline bool HashSet<Value, HashFunctions, Traits, Allocator>::contains(const T& value) const
     {
         return m_impl.template contains<HashSetTranslatorAdapter<HashTranslator> >(value);
     }
 
     template<typename T, typename U, typename V, typename W>
-    inline typename HashSet<T, U, V, W>::AddResult HashSet<T, U, V, W>::add(ValuePeekInType value)
+    inline typename HashSet<T, U, V, W>::AddResult HashSet<T, U, V, W>::add(ValuePassInType value)
     {
         return m_impl.add(value);
     }
 
     template<typename Value, typename HashFunctions, typename Traits, typename Allocator>
     template<typename HashTranslator, typename T>
     inline typename HashSet<Value, HashFunctions, Traits, Allocator>::AddResult
     HashSet<Value, HashFunctions, Traits, Allocator>::add(const T& value)
     {
         return m_impl.template addPassingHashCode<HashSetTranslatorAdapter<HashTranslator> >(value, value);
@@ skipping 35 matching lines @@
     }
 
     template<typename ValueType, typename HashTableType>
     void deleteAllValues(HashTableType& collection)
     {
         typedef typename HashTableType::const_iterator iterator;
         iterator end = collection.end();
         for (iterator it = collection.begin(); it != end; ++it)
             delete *it;
     }
-
+    // Deprecated, HashSet<OwnPtr<>> to be used instead.
     template<typename T, typename U, typename V, typename W>
     inline void deleteAllValues(const HashSet<T, U, V, W>& collection)
     {
         deleteAllValues<typename HashSet<T, U, V, W>::ValueType>(collection.m_impl);
     }
 
     template<typename C, typename W>
     inline void copyToVector(const C& collection, W& vector)
     {
         typedef typename C::const_iterator iterator;
 
         vector.resize(collection.size());
 
         iterator it = collection.begin();
         iterator end = collection.end();
         for (unsigned i = 0; it != end; ++it, ++i)
             vector[i] = *it;
     }
 
 } // namespace WTF
 
 using WTF::HashSet;
 
 #endif /* WTF_HashSet_h */