Simpler return value of HashTable::add/HashMap:add and others

Source/wtf/HashMap.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 358 matching lines @@
         return m_impl.template add<HashMapTranslator<ValueTraits, HashFunctions> >(key, mapped);
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     typename HashMap<T, U, V, W, X, Y>::AddResult
     HashMap<T, U, V, W, X, Y>::set(KeyPeekInType key, MappedPassInType mapped)
     {
         AddResult result = inlineAdd(key, mapped);
         if (!result.isNewEntry) {
             // The inlineAdd call above found an existing hash table entry; we need to set the mapped value.
-            MappedTraits::store(mapped, result.iterator->value);
+            MappedTraits::store(mapped, result.storedValue->value);
         }
         return result;
     }
 
     template<typename T, typename U, typename V, typename W, typename X, typename Y>
     template<typename HashTranslator, typename TYPE>
     typename HashMap<T, U, V, W, X, Y>::AddResult
     HashMap<T, U, V, W, X, Y>::add(const TYPE& key, MappedPassInType value)
     {
         return m_impl.template addPassingHashCode<HashMapTranslatorAdapter<ValueTraits, HashTranslator> >(key, value);
@@ skipping 132 matching lines @@
             vector[i] = *it;
     }
 
 } // namespace WTF
 
 using WTF::HashMap;
 
 #include "wtf/RefPtrHashMap.h"
 
 #endif /* WTF_HashMap_h */