Fix List.takeLast for lists without RandomAccess

js/js.libraries/src/core/generated/_CollectionsJs.kt

@@ -745,7 +745,7 @@ public fun <T> List<T>.takeLast(n: Int): List<T> {
         for (index in size - n .. size - 1)
             list.add(this[index])
     } else {
-        for (item in listIterator(n))
+        for (item in listIterator(size - n))
             list.add(item)
     }
     return list

libraries/stdlib/src/generated/_Collections.kt

@@ -745,7 +745,7 @@ public fun <T> List<T>.takeLast(n: Int): List<T> {
         for (index in size - n .. size - 1)
             list.add(this[index])
     } else {
-        for (item in listIterator(n))
+        for (item in listIterator(size - n))
             list.add(item)
     }
     return list

libraries/stdlib/test/collections/CollectionTest.kt

@@ -579,6 +579,10 @@ class CollectionTest {
         assertEquals(coll, coll.takeLast(coll.size + 1))
 
         assertFails { coll.takeLast(-1) }
+
+        val collWithoutRandomAccess = object : List<String> by coll {}
+        assertEquals(listOf("abc"), collWithoutRandomAccess.takeLast(1))
+        assertEquals(listOf("bar", "abc"), collWithoutRandomAccess.takeLast(2))
     }
 
     @Test fun takeLastWhile() {

libraries/tools/kotlin-stdlib-gen/src/templates/Filtering.kt

@@ -231,7 +231,7 @@ fun filtering(): List<GenericFunction> {
                 for (index in size - n .. size - 1)
                     list.add(this[index])
             } else {
-                for (item in listIterator(n))
+                for (item in listIterator(size - n))
                     list.add(item)
             }
             return list