Fix ListHashSet::AddResult storing a Node* instead of a ValueType*.

third_party/WebKit/Source/wtf/ListHashSetTest.cpp

 /*
  * Copyright (C) 2012 Apple 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:
  * 1. Redistributions of source code must retain the above copyright
  *    notice, this list of conditions and the following disclaimer.
  * 2. Redistributions in binary form must reproduce the above copyright
  *    notice, this list of conditions and the following disclaimer in the
@@ skipping 542 matching lines @@
     bool deleted1 = false, deleted2 = false;
 
     typedef ListHashSet<OwnPtr<Dummy>> OwnPtrSet;
     OwnPtrSet set;
 
     Dummy* ptr1 = new Dummy(deleted1);
     {
         // AddResult in a separate scope to avoid assertion hit,
         // since we modify the container further.
         OwnPtrSet::AddResult res1 = set.add(adoptPtr(ptr1));
-        EXPECT_EQ(res1.storedValue->m_value.get(), ptr1);
+        EXPECT_EQ(res1.storedValue->get(), ptr1);
     }
 
     EXPECT_FALSE(deleted1);
     EXPECT_EQ(1UL, set.size());
     OwnPtrSet::iterator it1 = set.find(ptr1);
     EXPECT_NE(set.end(), it1);
     EXPECT_EQ(ptr1, (*it1));
 
     Dummy* ptr2 = new Dummy(deleted2);
     {
         OwnPtrSet::AddResult res2 = set.add(adoptPtr(ptr2));
-        EXPECT_EQ(res2.storedValue->m_value.get(), ptr2);
+        EXPECT_EQ(res2.storedValue->get(), ptr2);
     }
 
     EXPECT_FALSE(deleted2);
     EXPECT_EQ(2UL, set.size());
     OwnPtrSet::iterator it2 = set.find(ptr2);
     EXPECT_NE(set.end(), it2);
     EXPECT_EQ(ptr2, (*it2));
 
     set.remove(ptr1);
     EXPECT_TRUE(deleted1);
@@ skipping 106 matching lines @@
 
     Set other(set);
     counter = 0;
     set = std::move(other);
     EXPECT_EQ(0, counter);
 }
 
 } // anonymous namespace
 
 } // namespace WTF