HashSet: reverse the order of the template arguments at alternate 'find', 'contains' and 'add' meth…

Source/wtf/text/AtomicString.cpp

 /*
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2013 Apple Inc. All rights reserved.
  * Copyright (C) 2010 Patrick Gansterer <paroga@paroga.com>
  * Copyright (C) 2012 Google 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.
  *
@@ skipping 58 matching lines @@
     WTFThreadData& data = wtfThreadData();
     AtomicStringTable* table = data.atomicStringTable();
     if (UNLIKELY(!table))
         table = AtomicStringTable::create(data);
     return table->table();
 }
 
 template<typename T, typename HashTranslator>
 static inline PassRefPtr<StringImpl> addToStringTable(const T& value)
 {
-    HashSet<StringImpl*>::AddResult addResult = stringTable().add<T, HashTranslator>(value);
+    HashSet<StringImpl*>::AddResult addResult = stringTable().add<HashTranslator>(value);
 
     // If the string is newly-translated, then we need to adopt it.
     // The boolean in the pair tells us if that is so.
     return addResult.isNewEntry ? adoptRef(*addResult.iterator) : *addResult.iterator;
 }
 
 struct CStringTranslator {
     static unsigned hash(const LChar* c)
     {
         return StringHasher::computeHashAndMaskTop8Bits(c);
@@ skipping 297 matching lines @@
     if (result == r)
         r->setIsAtomic(true);
     ASSERT(!r->isStatic() || result->isStatic());
     return result;
 }
 
 template<typename CharacterType>
 static inline HashSet<StringImpl*>::iterator findString(const StringImpl* stringImpl)
 {
     HashAndCharacters<CharacterType> buffer = { stringImpl->existingHash(), stringImpl->getCharacters<CharacterType>(), stringImpl->length() };
-    return stringTable().find<HashAndCharacters<CharacterType>, HashAndCharactersTranslator<CharacterType> >(buffer);
+    return stringTable().find<HashAndCharactersTranslator<CharacterType> >(buffer);
 }
 
 AtomicStringImpl* AtomicString::find(const StringImpl* stringImpl)
 {
     ASSERT(stringImpl);
     ASSERT(stringImpl->existingHash());
 
     if (!stringImpl->length())
         return static_cast<AtomicStringImpl*>(StringImpl::empty());
 
@@ skipping 45 matching lines @@
 }
 
 #ifndef NDEBUG
 void AtomicString::show() const
 {
     m_string.show();
 }
 #endif
 
 } // namespace WTF