Move ArrayDeque.newCapacity to AbstractList

libraries/stdlib/test/collections/ArrayDequeTest.kt

@@ -608,45 +608,6 @@ class ArrayDequeTest {
         }
     }
 
-    @Suppress("INVISIBLE_MEMBER")
-    @Test
-    fun newCapacity() {
-        // oldCapacity < minCapacity < newCapacity
-        repeat(100) {
-            val oldCapacity = Random.nextInt(1 shl 30)
-            val newCapacity = oldCapacity + (oldCapacity shr 1)
-            val minCapacity = Random.nextInt(oldCapacity + 1 until newCapacity)
-
-            assertEquals(newCapacity, ArrayDeque.newCapacity(oldCapacity, minCapacity))
-        }
-
-        // oldCapacity < newCapacity < minCapacity
-        repeat(100) {
-            val oldCapacity = Random.nextInt(1 shl 30)
-            val newCapacity = oldCapacity + (oldCapacity shr 1)
-            val minCapacity = Random.nextInt(newCapacity..Int.MAX_VALUE)
-
-            assertEquals(minCapacity, ArrayDeque.newCapacity(oldCapacity, minCapacity))
-        }
-
-        // newCapacity overflow, oldCapacity < minCapacity <= maxArraySize
-        val maxArraySize = Int.MAX_VALUE - 8
-        repeat(100) {
-            val oldCapacity = Random.nextInt((1 shl 30) + (1 shl 29) until maxArraySize)
-            val minCapacity = Random.nextInt(oldCapacity..maxArraySize)
-
-            assertEquals(maxArraySize, ArrayDeque.newCapacity(oldCapacity, minCapacity))
-        }
-
-        // newCapacity overflow, minCapacity > maxArraySize
-        repeat(100) {
-            val oldCapacity = Random.nextInt((1 shl 30) + (1 shl 29)..maxArraySize)
-            val minCapacity = Random.nextInt(maxArraySize + 1..Int.MAX_VALUE)
-
-            assertEquals(Int.MAX_VALUE, ArrayDeque.newCapacity(oldCapacity, minCapacity))
-        }
-    }
-
     @Suppress("INVISIBLE_MEMBER")
     @Test
     fun toArray() {