From c516e7187423a7db1f61178ff05fb6512f279c8d Mon Sep 17 00:00:00 2001 From: Jubilee Young Date: Fri, 21 May 2021 16:05:07 -0700 Subject: [PATCH] Remove surplus prepend LinkedList fn Originally committed to Rust in 2013, it is identical to append with a reversed order of arguments. --- library/alloc/src/collections/linked_list.rs | 21 -------------------- 1 file changed, 21 deletions(-) diff --git a/library/alloc/src/collections/linked_list.rs b/library/alloc/src/collections/linked_list.rs index a5481fd175e..5dda8c47688 100644 --- a/library/alloc/src/collections/linked_list.rs +++ b/library/alloc/src/collections/linked_list.rs @@ -442,27 +442,6 @@ pub fn append(&mut self, other: &mut Self) { } } - /// Moves all elements from `other` to the begin of the list. - #[unstable(feature = "linked_list_prepend", issue = "none")] - pub fn prepend(&mut self, other: &mut Self) { - match self.head { - None => mem::swap(self, other), - Some(mut head) => { - // `as_mut` is okay here because we have exclusive access to the entirety - // of both lists. - if let Some(mut other_tail) = other.tail.take() { - unsafe { - head.as_mut().prev = Some(other_tail); - other_tail.as_mut().next = Some(head); - } - - self.head = other.head.take(); - self.len += mem::replace(&mut other.len, 0); - } - } - } - } - /// Provides a forward iterator. /// /// # Examples