From c7a16c918f10fe52ce5ee5d08b8ef469b16c7f08 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Jo=C3=A3o=20Costa?= Date: Sun, 5 Feb 2023 22:27:26 +0100 Subject: [PATCH] Replace removeFirst with removeHead in ArrayDeque documentation --- src/library/scala/collection/mutable/ArrayDeque.scala | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/library/scala/collection/mutable/ArrayDeque.scala b/src/library/scala/collection/mutable/ArrayDeque.scala index 5dc4cbbaf83f..a61b6c94d973 100644 --- a/src/library/scala/collection/mutable/ArrayDeque.scala +++ b/src/library/scala/collection/mutable/ArrayDeque.scala @@ -21,7 +21,7 @@ import scala.reflect.ClassTag /** An implementation of a double-ended queue that internally uses a resizable circular buffer. * - * Append, prepend, removeFirst, removeLast and random-access (indexed-lookup and indexed-replacement) + * Append, prepend, removeHead, removeLast and random-access (indexed-lookup and indexed-replacement) * take amortized constant time. In general, removals and insertions at i-th index are O(min(i, n-i)) * and thus insertions and removals from end/beginning are fast. *