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

Source/wtf/HashCountedSet.h

 /*
  * Copyright (C) 2005, 2006, 2008 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 136 matching lines @@
     template<typename Value, typename HashFunctions, typename Traits>
     inline unsigned HashCountedSet<Value, HashFunctions, Traits>::count(const ValueType& value) const
     {
         return m_impl.get(value);
     }
 
     template<typename Value, typename HashFunctions, typename Traits>
     inline typename HashCountedSet<Value, HashFunctions, Traits>::AddResult HashCountedSet<Value, HashFunctions, Traits>::add(const ValueType &value)
     {
         AddResult result = m_impl.add(value, 0);
-        ++result.iterator->value;
+        ++result.storedValue->value;
         return result;
     }
 
     template<typename Value, typename HashFunctions, typename Traits>
     inline bool HashCountedSet<Value, HashFunctions, Traits>::remove(const ValueType& value)
     {
         return remove(find(value));
     }
 
     template<typename Value, typename HashFunctions, typename Traits>
@@ skipping 60 matching lines @@
         for (unsigned i = 0; it != end; ++it, ++i)
             vector[i] = (*it).key;
     }
 
 
 } // namespace WTF
 
 using WTF::HashCountedSet;
 
 #endif /* WTF_HashCountedSet_h */