data_structures.linked_list.partition_linked_list
=================================================

.. py:module:: data_structures.linked_list.partition_linked_list


Classes
-------

.. autoapisummary::

   data_structures.linked_list.partition_linked_list.LinkedList
   data_structures.linked_list.partition_linked_list.Node


Module Contents
---------------

.. py:class:: LinkedList

   .. py:method:: __len__() -> int

      >>> linked_list = LinkedList()
      >>> len(linked_list)
      0
      >>> linked_list.add("a")
      >>> len(linked_list)
      1
      >>> linked_list.add("b")
      >>> len(linked_list)
      2



   .. py:method:: __str__() -> str

      >>> linked_list = LinkedList()
      >>> linked_list.add(23)
      >>> linked_list.add(14)
      >>> linked_list.add(9)
      >>> print(linked_list)
      9 --> 14 --> 23



   .. py:method:: add(item: Any, position: int = 0) -> None

      Add an item to the LinkedList at the specified position.
      Default position is 0 (the head).

      Args:
          item (Any): The item to add to the LinkedList.
          position (int, optional): The position at which to add the item.
              Defaults to 0.

      Raises:
          ValueError: If the position is negative or out of bounds.

      >>> linked_list = LinkedList()
      >>> linked_list.add(1)
      >>> linked_list.add(2)
      >>> linked_list.add(3)
      >>> linked_list.add(4, 2)
      >>> print(linked_list)
      3 --> 2 --> 4 --> 1

      # Test adding to a negative position
      >>> linked_list.add(5, -3)
      Traceback (most recent call last):
          ...
      ValueError: Position must be non-negative

      # Test adding to an out-of-bounds position
      >>> linked_list.add(5,7)
      Traceback (most recent call last):
          ...
      ValueError: Out of bounds
      >>> linked_list.add(5, 4)
      >>> print(linked_list)
      3 --> 2 --> 4 --> 1 --> 5



   .. py:method:: partition_liked_list(value: int) -> None

      Partition the linked list based on node elements in order.
      All nodes with elements less than value should occur on the left,
      while those greater than or equal to value should occur on the right.

      >>> linked_list = LinkedList()
      >>> linked_list.add(1)
      >>> linked_list.add(2)
      >>> linked_list.add(3)
      >>> linked_list.add(4, 2)
      >>> linked_list.add(5, 4)
      >>> print(linked_list)
      3 --> 2 --> 4 --> 1 --> 5
      >>> linked_list.partition_liked_list(3)
      >>> print(linked_list)
      2 --> 1 --> 3 --> 4 --> 5
      >>> linked_list = LinkedList()
      >>> linked_list.add(1)
      >>> linked_list.add(2)
      >>> linked_list.add(3)
      >>> print(linked_list)
      3 --> 2 --> 1
      >>> linked_list.partition_liked_list(3)
      >>> print(linked_list)
      2 --> 1 --> 3
      >>> linked_list = LinkedList()
      >>> linked_list.add(5)
      >>> linked_list.add(5)
      >>> linked_list.add(5)
      >>> print(linked_list)
      5 --> 5 --> 5
      >>> linked_list.partition_liked_list(5)
      >>> print(linked_list)
      5 --> 5 --> 5
      >>> linked_list = LinkedList()
      >>> linked_list.add(1, 0)
      >>> linked_list.add(2, 1)
      >>> linked_list.add(3, 2)
      >>> linked_list.add(4, 3)
      >>> linked_list.add(5, 4)
      >>> print(linked_list)
      1 --> 2 --> 3 --> 4 --> 5
      >>> linked_list.partition_liked_list(6)
      >>> print(linked_list)
      1 --> 2 --> 3 --> 4 --> 5
      >>> linked_list = LinkedList()
      >>> linked_list.add(1)
      >>> print(linked_list)
      1
      >>> linked_list.partition_liked_list(1)
      >>> print(linked_list)
      1



   .. py:attribute:: head
      :type:  Node | None
      :value: None



   .. py:attribute:: size
      :value: 0



.. py:class:: Node

   .. py:attribute:: item
      :type:  Any


   .. py:attribute:: next
      :type:  Node | Any
      :value: None