Fix some m_instVar instances in wtf/

third_party/WebKit/Source/platform/wtf/LinkedHashSet.h

Index: third_party/WebKit/Source/platform/wtf/LinkedHashSet.h
diff --git a/third_party/WebKit/Source/platform/wtf/LinkedHashSet.h b/third_party/WebKit/Source/platform/wtf/LinkedHashSet.h
index eedd9f2553d812f9964b195467975df1278fe21a..83826b490e674f51f9d8e6694c45938a07487677 100644
--- a/third_party/WebKit/Source/platform/wtf/LinkedHashSet.h
+++ b/third_party/WebKit/Source/platform/wtf/LinkedHashSet.h
@@ -412,7 +412,7 @@ struct LinkedHashSetTranslator {
     location.value_ = std::forward<IncomingValueType>(key);
   }
 
-  // Empty (or deleted) slots have the m_next pointer set to null, but we
+  // Empty (or deleted) slots have the next_ pointer set to null, but we
   // don't do anything to the other fields, which may contain junk.
   // Therefore you can't compare a newly constructed empty value with a
   // slot and get the right answer.
@@ -434,7 +434,7 @@ struct LinkedHashSetTraits
   typedef LinkedHashSetNode<Value, Allocator> Node;
   typedef ValueTraitsArg ValueTraits;
 
-  // The slot is empty when the m_next field is zero so it's safe to zero
+  // The slot is empty when the next_ field is zero so it's safe to zero
   // the backing.
   static const bool kEmptyValueIsZero = true;
 
@@ -693,7 +693,7 @@ inline void LinkedHashSet<T, U, V, W>::Swap(LinkedHashSet& other) {
 
 template <typename T, typename U, typename V, typename Allocator>
 inline LinkedHashSet<T, U, V, Allocator>::~LinkedHashSet() {
-  // The destructor of m_anchor will implicitly be called here, which will
+  // The destructor of anchor_ will implicitly be called here, which will
   // unlink the anchor from the collection.
 }
 
@@ -706,7 +706,7 @@ inline T& LinkedHashSet<T, U, V, W>::front() {
 template <typename T, typename U, typename V, typename W>
 inline const T& LinkedHashSet<T, U, V, W>::front() const {
   DCHECK(!IsEmpty());
-  return FirstNode()->m_value;
+  return FirstNode()->value_;

[Nico, 2017/05/03 18:47:06]

Apparently no code ever calls the const version.

 }
 
 template <typename T, typename U, typename V, typename W>
@@ -724,7 +724,7 @@ inline T& LinkedHashSet<T, U, V, W>::back() {
 template <typename T, typename U, typename V, typename W>
 inline const T& LinkedHashSet<T, U, V, W>::back() const {
   DCHECK(!IsEmpty());
-  return LastNode()->m_value;
+  return LastNode()->value_;
 }
 
 template <typename T, typename U, typename V, typename W>