Replace removeFirst with removeHead in ArrayDeque documentation

JD557 · web-flow · commit de6985fce6b8 · 2023-02-05T22:27:26.000+01:00
diff --git a/library/src/scala/collection/mutable/ArrayDeque.scala b/library/src/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.
   *

Original file line number	Diff line number	Diff line change
`@@ -21,7 +21,7 @@ import scala.reflect.ClassTag`
`21`	`21`
`22`	`22`	`/** An implementation of a double-ended queue that internally uses a resizable circular buffer.`
`23`	`23`	`*`
`24`		`- * Append, prepend, removeFirst, removeLast and random-access (indexed-lookup and indexed-replacement)`
	`24`	`+ * Append, prepend, removeHead, removeLast and random-access (indexed-lookup and indexed-replacement)`
`25`	`25`	`* take amortized constant time. In general, removals and insertions at i-th index are O(min(i, n-i))`
`26`	`26`	`* and thus insertions and removals from end/beginning are fast.`
`27`	`27`	`*`