From 05bd22ab4fce663f0abf5135825adc1b60682498 Mon Sep 17 00:00:00 2001
From: myyrakle <sssang97@naver.com>
Date: Wed, 4 Oct 2023 01:32:06 +0900
Subject: [PATCH] [#16] add: LinkedList::Append

---
 linked_list.go | 22 ++++++++++++++++++++++
 1 file changed, 22 insertions(+)

diff --git a/linked_list.go b/linked_list.go
index cba07d0..a6ac66f 100644
--- a/linked_list.go
+++ b/linked_list.go
@@ -149,6 +149,28 @@ func (list *LinkedList[T]) Front() Option[*T] {
 	return Some[*T](&list.head.value)
 }
 
+// Moves all elements from other to the end of the list.
+// This reuses all the nodes from other and moves them into self. After this operation, other becomes empty.
+// This operation should compute in O(1) time and O(1) memory.
+func (list *LinkedList[T]) Append(other *LinkedList[T]) {
+	if other.head == nil {
+		return
+	}
+
+	if list.head == nil {
+		list.head = other.head
+		list.tail = other.tail
+		list.len = other.len
+	} else {
+		list.tail.next = other.head
+		other.head.prev = list.tail
+		list.tail = other.tail
+		list.len += other.len
+	}
+
+	other.Clear()
+}
+
 // into_iter
 func (list *LinkedList[T]) IntoIter() Iterator[T] {
 	return &LinkedListIter[T]{