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

Source/core/dom/ChildListMutationScope.cpp

 /*
  * Copyright (C) 2011 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 47 matching lines @@
     if (!isEmpty())
         enqueueMutationRecord();
     accumulatorMap().remove(m_target.get());
 }
 
 PassRefPtr<ChildListMutationAccumulator> ChildListMutationAccumulator::getOrCreate(Node& target)
 {
     AccumulatorMap::AddResult result = accumulatorMap().add(&target, 0);
     RefPtr<ChildListMutationAccumulator> accumulator;
     if (!result.isNewEntry)
-        accumulator = result.iterator->value;
+        accumulator = result.storedValue->value;
     else {
         accumulator = adoptRef(new ChildListMutationAccumulator(PassRefPtr<Node>(target), MutationObserverInterestGroup::createForChildListMutation(target)));
-        result.iterator->value = accumulator.get();
+        result.storedValue->value = accumulator.get();
     }
     return accumulator.release();
 }
 
 inline bool ChildListMutationAccumulator::isAddedNodeInOrder(Node* child)
 {
     return isEmpty() || (m_lastAdded == child->previousSibling() && m_nextSibling == child->nextSibling());
 }
 
 void ChildListMutationAccumulator::childAdded(PassRefPtr<Node> prpChild)
@@ skipping 58 matching lines @@
     if (result) {
         ASSERT(!m_previousSibling);
         ASSERT(!m_nextSibling);
         ASSERT(!m_lastAdded);
     }
 #endif
     return result;
 }
 
 } // namespace WebCore