




"""simple docstring"""



def   _SCREAMING_SNAKE_CASE       (							lowercase_						)						->		bool:
 return number & 1 == 0


if __name__ == "__main__":
      import doctest

      doctest.testmod()











"""simple docstring"""



from typing import Any




class      UpperCAmelCase_  :




    def __init__(   self						:	Optional[Any]     ,			snake_case_						:	Any				)				->							List[str]:




     '''simple docstring'''

     A__	=    data
     A__	=    None




    def __repr__(   self						:	Optional[int]				)				->							str:




     '''simple docstring'''

     return F"""Node({self.data})"""






class      UpperCAmelCase_  :




    def __init__(   self						:	Dict				)				->							Any:




     '''simple docstring'''

     A__	=    None




    def __iter__(   self						:	List[Any]				)				->							Any:




     '''simple docstring'''

     A__	=    self.head
     while node:
      yield node.data
      A__	=    node.next




    def __len__(   self						:	Any				)				->							int:




     '''simple docstring'''

     return sum(1 for _ in self				)




    def __repr__(   self						:	List[str]				)				->							str:




     '''simple docstring'''

     return "->".join([str(snake_case_				) for item in self]				)




    def __getitem__(   self						:	str     ,			snake_case_						:	int				)				->							Any:




     '''simple docstring'''

     if not 0 <= index < len(self				):
      raise ValueError("list index out of range."				)
     for i, node in enumerate(self				):
      if i == index:
       return node
     return None




    def __setitem__(   self						:	Tuple     ,			snake_case_						:	int     ,			snake_case_						:	Any				)				->							None:




     '''simple docstring'''

     if not 0 <= index < len(self				):
      raise ValueError("list index out of range."				)
     A__	=    self.head
     for _ in range(snake_case_				):
      A__	=    current.next
     A__	=    data




    def 							__magic_name__							(   self						:	List[Any]     ,			snake_case_						:	Any				)				->							None:




     '''simple docstring'''

     self.insert_nth(len(self				)     ,			snake_case_				)




    def 							__magic_name__							(   self						:	Tuple     ,			snake_case_						:	Any				)				->							None:




     '''simple docstring'''

     self.insert_nth(0     ,			snake_case_				)




    def 							__magic_name__							(   self						:	Dict     ,			snake_case_						:	int     ,			snake_case_						:	Any				)				->							None:




     '''simple docstring'''

     if not 0 <= index <= len(self				):
      raise IndexError("list index out of range"				)
     A__	=    Node(snake_case_				)
     if self.head is None:
      A__	=    new_node
     elif index == 0:
      A__	=    self.head  # link new_node to head
      A__	=    new_node
     else:
      A__	=    self.head
      for _ in range(index - 1				):
       A__	=    temp.next
      A__	=    temp.next
      A__	=    new_node




    def 							__magic_name__							(   self						:	Dict				)				->							None:  # print every node data




     '''simple docstring'''

     print(self				)




    def 							__magic_name__							(   self						:	Dict				)				->							Any:




     '''simple docstring'''

     return self.delete_nth(0				)




    def 							__magic_name__							(   self						:	Optional[Any]				)				->							Any:  # delete from tail




     '''simple docstring'''

     return self.delete_nth(len(self				) - 1				)




    def 							__magic_name__							(   self						:	Any     ,			snake_case_						:	int = 0				)				->							Any:




     '''simple docstring'''

     if not 0 <= index <= len(self				) - 1:  # test if index is valid
      raise IndexError("List index out of range."				)
     A__	=    self.head  # default first node
     if index == 0:
      A__	=    self.head.next
     else:
      A__	=    self.head
      for _ in range(index - 1				):
       A__	=    temp.next
      A__	=    temp.next
      A__	=    temp.next.next
     return delete_node.data




    def 							__magic_name__							(   self						:	Dict				)				->							bool:




     '''simple docstring'''

     return self.head is None




    def 							__magic_name__							(   self						:	List[Any]				)				->							None:




     '''simple docstring'''

     A__	=    None
     A__	=    self.head

     while current:
      # Store the current node's next node.
      A__	=    current.next
      # Make the current node's next point backwards
      A__	=    prev
      # Make the previous node be the current node
      A__	=    current
      # Make the current node the next node (to progress iteration)
      A__	=    next_node
     # Return prev in order to put the head at the end
     A__	=    prev







def   _SCREAMING_SNAKE_CASE       (							)						->		None:
 A__	=    LinkedList()
 assert linked_list.is_empty() is True
 assert str(lowercase_						) == ""

 try:
  linked_list.delete_head()
  raise AssertionError  # This should not happen.
 except IndexError:
  assert True  # This should happen.

 try:
  linked_list.delete_tail()
  raise AssertionError  # This should not happen.
 except IndexError:
  assert True  # This should happen.

 for i in range(10						):
  assert len(lowercase_						) == i
  linked_list.insert_nth(lowercase_      ,			i + 1						)
 assert str(lowercase_						) == "->".join(str(lowercase_						) for i in range(1      ,			11						)						)

 linked_list.insert_head(0						)
 linked_list.insert_tail(11						)
 assert str(lowercase_						) == "->".join(str(lowercase_						) for i in range(0      ,			12						)						)

 assert linked_list.delete_head() == 0
 assert linked_list.delete_nth(9						) == 10
 assert linked_list.delete_tail() == 11
 assert len(lowercase_						) == 9
 assert str(lowercase_						) == "->".join(str(lowercase_						) for i in range(1      ,			10						)						)

 assert all(linked_list[i] == i + 1 for i in range(0      ,			9						)						) is True

 for i in range(0      ,			9						):
  A__	=    -i
 assert all(linked_list[i] == -i for i in range(0      ,			9						)						) is True

 linked_list.reverse()
 assert str(lowercase_						) == "->".join(str(lowercase_						) for i in range(-8      ,			1						)						)







def   _SCREAMING_SNAKE_CASE       (							)						->		None:
 A__	=    [
     -9,
     1_00,
     Node(77_34_51_12						),
     "dlrow olleH",
     7,
     55_55,
     0,
     -1_9_2.5_5_5_5_5,
     "Hello, world!",
     7_7.9,
     Node(10						),
     None,
     None,
     1_2.2_0,
 ]
 A__	=    LinkedList()

 for i in test_input:
  linked_list.insert_tail(lowercase_						)

 # Check if it's empty or not
 assert linked_list.is_empty() is False
 assert (
     str(lowercase_						) == "-9->100->Node(77345112)->dlrow olleH->7->5555->0->"
     "-192.55555->Hello, world!->77.9->Node(10)->None->None->12.2"
 )

 # Delete the head
 A__	=    linked_list.delete_head()
 assert result == -9
 assert (
     str(lowercase_						) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
     "Hello, world!->77.9->Node(10)->None->None->12.2"
 )

 # Delete the tail
 A__	=    linked_list.delete_tail()
 assert result == 1_2.2
 assert (
     str(lowercase_						) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
     "Hello, world!->77.9->Node(10)->None->None"
 )

 # Delete a node in specific location in linked list
 A__	=    linked_list.delete_nth(10						)
 assert result is None
 assert (
     str(lowercase_						) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
     "Hello, world!->77.9->Node(10)->None"
 )

 # Add a Node instance to its head
 linked_list.insert_head(Node("Hello again, world!"						)						)
 assert (
     str(lowercase_						)
     == "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
     "7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None"
 )

 # Add None to its tail
 linked_list.insert_tail(lowercase_						)
 assert (
     str(lowercase_						)
     == "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
     "7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None->None"
 )

 # Reverse the linked list
 linked_list.reverse()
 assert (
     str(lowercase_						)
     == "None->None->Node(10)->77.9->Hello, world!->-192.55555->0->5555->"
     "7->dlrow olleH->Node(77345112)->100->Node(Hello again, world!)"
 )







def   _SCREAMING_SNAKE_CASE       (							)						->		Optional[int]:
 from doctest import testmod

 testmod()

 A__	=    LinkedList()
 linked_list.insert_head(input("Inserting 1st at head "						).strip()						)
 linked_list.insert_head(input("Inserting 2nd at head "						).strip()						)
 print("\nPrint list:"						)
 linked_list.print_list()
 linked_list.insert_tail(input("\nInserting 1st at tail "						).strip()						)
 linked_list.insert_tail(input("Inserting 2nd at tail "						).strip()						)
 print("\nPrint list:"						)
 linked_list.print_list()
 print("\nDelete head"						)
 linked_list.delete_head()
 print("Delete tail"						)
 linked_list.delete_tail()
 print("\nPrint list:"						)
 linked_list.print_list()
 print("\nReverse linked list"						)
 linked_list.reverse()
 print("\nPrint list:"						)
 linked_list.print_list()
 print("\nString representation of linked list:"						)
 print(lowercase_						)
 print("\nReading/changing Node data using indexing:"						)
 print(f"""Element at Position 1: {linked_list[1]}"""						)
 A__	=    input("Enter New Value: "						).strip()
 print("New list:"						)
 print(lowercase_						)
 print(f"""length of linked_list is : {len(lowercase_						)}"""						)


if __name__ == "__main__":
      main()





