Migrate WTF::LinkedHashSet/ListHashSet::last() to ::back()

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 37 matching lines @@
 TYPED_TEST(ListOrLinkedHashSetTest, RemoveFirst) {
   using Set = TypeParam;
   Set list;
   list.insert(-1);
   list.insert(0);
   list.insert(1);
   list.insert(2);
   list.insert(3);
 
   EXPECT_EQ(-1, list.front());
-  EXPECT_EQ(3, list.last());
+  EXPECT_EQ(3, list.back());
 
   list.removeFirst();
   EXPECT_EQ(0, list.front());
 
   list.removeLast();
-  EXPECT_EQ(2, list.last());
+  EXPECT_EQ(2, list.back());
 
   list.removeFirst();
   EXPECT_EQ(1, list.front());
 
   list.removeFirst();
   EXPECT_EQ(2, list.front());
 
   list.removeFirst();
   EXPECT_TRUE(list.isEmpty());
 }
@@ skipping 29 matching lines @@
   EXPECT_TRUE(result.isNewEntry);
   result = list.appendOrMoveToLast(1);
   EXPECT_FALSE(result.isNewEntry);
   EXPECT_EQ(1UL, list.size());
 
   list.insert(2);
   list.insert(3);
   EXPECT_EQ(3UL, list.size());
 
   // Appending 2 move it to the end.
-  EXPECT_EQ(3, list.last());
+  EXPECT_EQ(3, list.back());
   result = list.appendOrMoveToLast(2);
   EXPECT_FALSE(result.isNewEntry);
-  EXPECT_EQ(2, list.last());
+  EXPECT_EQ(2, list.back());
 
   // Inverse the list by moving each element to end end.
   result = list.appendOrMoveToLast(3);
   EXPECT_FALSE(result.isNewEntry);
   result = list.appendOrMoveToLast(2);
   EXPECT_FALSE(result.isNewEntry);
   result = list.appendOrMoveToLast(1);
   EXPECT_FALSE(result.isNewEntry);
   EXPECT_EQ(3UL, list.size());
 
@@ skipping 181 matching lines @@
     set.insertBefore(it, 0);
     set.insertBefore(it, 1);
     set.insertBefore(it, 2);
     set.insertBefore(it, 3);
   }
   EXPECT_EQ(6u, set.size());
   it = set.addReturnIterator(5);
   EXPECT_EQ(7u, set.size());
   set.remove(it);
   EXPECT_EQ(6u, set.size());
-  EXPECT_EQ(4, set.last());
+  EXPECT_EQ(4, set.back());
 }
 
 TYPED_TEST(ListOrLinkedHashSetTest, Swap) {
   using Set = TypeParam;
   int num = 10;
   Set set0;
   Set set1;
   Set set2;
   for (int i = 0; i < num; ++i) {
     set1.insert(i + 1);
@@ skipping 483 matching lines @@
 
   // ... but they don't have any pass-out (like take()) methods.
 
   set.remove(MoveOnly(3));
   set.clear();
 }
 
 }  // anonymous namespace
 
 }  // namespace WTF