chore: Remove insert_after code in dll

Author: twumm

ring_buffer/doubly_linked_list.py

@@ -11,6 +11,7 @@ def __init__(self, value, prev=None, next=None):
     """Wrap the given value in a ListNode and insert it
     after this node. Note that this node could already
     have a next node it is point to."""
+
     def insert_after(self, value):
         current_next = self.next
         self.next = ListNode(value, self, current_next)
@@ -20,6 +21,7 @@ def insert_after(self, value):
     """Wrap the given value in a ListNode and insert it
     before this node. Note that this node could already
     have a previous node it is point to."""
+
     def insert_before(self, value):
         current_prev = self.prev
         self.prev = ListNode(value, current_prev, self)
@@ -28,6 +30,7 @@ def insert_before(self, value):
 
     """Rearranges this ListNode's previous and next pointers
     accordingly, effectively deleting this ListNode."""
+
     def delete(self):
         if self.prev:
             self.prev.next = self.next
@@ -51,6 +54,7 @@ def __len__(self):
     """Wraps the given value in a ListNode and inserts it 
     as the new head of the list. Don't forget to handle 
     the old head node's previous pointer accordingly."""
+
     def add_to_head(self, value):
         new_node = ListNode(value, None, None)
         self.length += 1
@@ -65,6 +69,7 @@ def add_to_head(self, value):
     """Removes the List's current head node, making the
     current head's next node the new head of the List.
     Returns the value of the removed Node."""
+
     def remove_from_head(self):
         value = self.head.value
         self.delete(self.head)
@@ -73,6 +78,7 @@ def remove_from_head(self):
     """Wraps the given value in a ListNode and inserts it 
     as the new tail of the list. Don't forget to handle 
     the old tail node's next pointer accordingly."""
+
     def add_to_tail(self, value):
         new_node = ListNode(value, None, None)
         self.length += 1
@@ -87,13 +93,15 @@ def add_to_tail(self, value):
     """Removes the List's current tail node, making the 
     current tail's previous node the new tail of the List.
     Returns the value of the removed Node."""
+
     def remove_from_tail(self):
         value = self.tail.value
         self.delete(self.tail)
         return value
 
     """Removes the input node from its current spot in the 
     List and inserts it as the new head node of the List."""
+
     def move_to_front(self, node):
         if node is self.head:
             return
@@ -103,6 +111,7 @@ def move_to_front(self, node):
 
     """Removes the input node from its current spot in the 
     List and inserts it as the new tail node of the List."""
+
     def move_to_end(self, node):
         if node is self.tail:
             return
@@ -112,6 +121,7 @@ def move_to_end(self, node):
 
     """Removes a node from the list and handles cases where
     the node was the head or the tail"""
+
     def delete(self, node):
         self.length -= 1
         if self.head is self.tail:
@@ -127,6 +137,7 @@ def delete(self, node):
             node.delete()
 
     """Returns the highest value currently in the list"""
+
     def get_max(self):
         max_value = self.head.value
         current = self.head
@@ -135,4 +146,4 @@ def get_max(self):
                 max_value = current.value
             current = current.next
 
-        return max_value
+        return max_value