


from math import pi, sqrt, tan
def 							_UpperCAmelCase				(UpperCamelCase__     :  float						):
       if side_length < 0:
              raise ValueError("surface_area_cube() only accepts non-negative values"						)
       return 6 * side_length**2
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if length < 0 or breadth < 0 or height < 0:
              raise ValueError("surface_area_cuboid() only accepts non-negative values"						)
       return 2 * ((length * breadth) + (breadth * height) + (length * height))
def 							_UpperCAmelCase				(UpperCamelCase__     :  float						):
       if radius < 0:
              raise ValueError("surface_area_sphere() only accepts non-negative values"						)
       return 4 * pi * radius**2
def 							_UpperCAmelCase				(UpperCamelCase__     :  float						):
       if radius < 0:
              raise ValueError("surface_area_hemisphere() only accepts non-negative values"						)
       return 3 * pi * radius**2
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if radius < 0 or height < 0:
              raise ValueError("surface_area_cone() only accepts non-negative values"						)
       return pi * radius * (radius + (height**2 + radius**2) ** 0.5)
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if radius_a < 0 or radius_a < 0 or height < 0:
              raise ValueError(
                  "surface_area_conical_frustum() only accepts non-negative values"						)
       _A      :       Optional[int]				    = (height**2 + (radius_a - radius_a) ** 2) ** 0.5
       return pi * ((slant_height * (radius_a + radius_a)) + radius_a**2 + radius_a**2)
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if radius < 0 or height < 0:
              raise ValueError("surface_area_cylinder() only accepts non-negative values"						)
       return 2 * pi * radius * (height + radius)
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if torus_radius < 0 or tube_radius < 0:
              raise ValueError("surface_area_torus() only accepts non-negative values"						)
       if torus_radius < tube_radius:
              raise ValueError(
                  "surface_area_torus() does not support spindle or self intersecting tori"						)
       return 4 * pow(UpperCamelCase__				,							2						) * torus_radius * tube_radius
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if length < 0 or width < 0:
              raise ValueError("area_rectangle() only accepts non-negative values"						)
       return length * width
def 							_UpperCAmelCase				(UpperCamelCase__     :  float						):
       if side_length < 0:
              raise ValueError("area_square() only accepts non-negative values"						)
       return side_length**2
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if base < 0 or height < 0:
              raise ValueError("area_triangle() only accepts non-negative values"						)
       return (base * height) / 2
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if sidea < 0 or sidea < 0 or sidea < 0:
              raise ValueError("area_triangle_three_sides() only accepts non-negative values"						)
       elif sidea + sidea < sidea or sidea + sidea < sidea or sidea + sidea < sidea:
              raise ValueError("Given three sides do not form a triangle"						)
       _A      :       int				    = (sidea + sidea + sidea) / 2
       _A      :       Any				    = sqrt(
           semi_perimeter
           * (semi_perimeter - sidea)
           * (semi_perimeter - sidea)
           * (semi_perimeter - sidea)						)
       return area
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if base < 0 or height < 0:
              raise ValueError("area_parallelogram() only accepts non-negative values"						)
       return base * height
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if basea < 0 or basea < 0 or height < 0:
              raise ValueError("area_trapezium() only accepts non-negative values"						)
       return 1 / 2 * (basea + basea) * height
def 							_UpperCAmelCase				(UpperCamelCase__     :  float						):
       if radius < 0:
              raise ValueError("area_circle() only accepts non-negative values"						)
       return pi * radius**2
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if radius_x < 0 or radius_y < 0:
              raise ValueError("area_ellipse() only accepts non-negative values"						)
       return pi * radius_x * radius_y
def 							_UpperCAmelCase				(UpperCamelCase__     :  float				,							UpperCamelCase__     :  float						):
       if diagonal_a < 0 or diagonal_a < 0:
              raise ValueError("area_rhombus() only accepts non-negative values"						)
       return 1 / 2 * diagonal_a * diagonal_a
def 							_UpperCAmelCase				(UpperCamelCase__     :  int				,							UpperCamelCase__     :  float						):
       if not isinstance(UpperCamelCase__				,							UpperCamelCase__						) or sides < 3:
              raise ValueError(
                  "area_reg_polygon() only accepts integers greater than or \
equal to three as number of sides"						)
       elif length < 0:
              raise ValueError(
                  "area_reg_polygon() only accepts non-negative values as \
length of a side"						)
       return (sides * length**2) / (4 * tan(pi / sides						))
       return (sides * length**2) / (4 * tan(pi / sides						))


if __name__ == "__main__":
    import doctest

    doctest.testmod(verbose=True)  # verbose so we can see methods missing tests

    print('[DEMO] Areas of various geometric shapes: \n')
    print(f"Rectangle: {area_rectangle(10, 20) = }")
    print(f"Square: {area_square(10) = }")
    print(f"Triangle: {area_triangle(10, 10) = }")
    print(f"Triangle: {area_triangle_three_sides(5, 12, 13) = }")
    print(f"Parallelogram: {area_parallelogram(10, 20) = }")
    print(f"Rhombus: {area_rhombus(10, 20) = }")
    print(f"Trapezium: {area_trapezium(10, 20, 30) = }")
    print(f"Circle: {area_circle(20) = }")
    print(f"Ellipse: {area_ellipse(10, 20) = }")
    print('\nSurface Areas of various geometric shapes: \n')
    print(f"Cube: {surface_area_cube(20) = }")
    print(f"Cuboid: {surface_area_cuboid(10, 20, 30) = }")
    print(f"Sphere: {surface_area_sphere(20) = }")
    print(f"Hemisphere: {surface_area_hemisphere(20) = }")
    print(f"Cone: {surface_area_cone(10, 20) = }")
    print(f"Conical Frustum: {surface_area_conical_frustum(10, 20, 30) = }")
    print(f"Cylinder: {surface_area_cylinder(10, 20) = }")
    print(f"Torus: {surface_area_torus(20, 10) = }")
    print(f"Equilateral Triangle: {area_reg_polygon(3, 10) = }")
    print(f"Square: {area_reg_polygon(4, 10) = }")
    print(f"Reqular Pentagon: {area_reg_polygon(5, 10) = }")




'''simple docstring'''






class    __snake_case       :







    """simple docstring"""



    def __init__(   self    :  int    ,						lowerCamelCase    :  int    ,						lowerCamelCase    :  int=None    ,						lowerCamelCase    :  int=None		)   ->  str:
      lowerCAmelCase_			:      str			=   data
      lowerCAmelCase_			:      Optional[Any]			=   previous
      lowerCAmelCase_			:      int			=   next_node

    def __str__(   self    :  Any		)   ->  str:
      return F'{self.data}'

    def __lowercase   (   self    :  Optional[Any]		)   ->  int:
      return self.data

    def __lowercase   (   self    :  str		)   ->  List[str]:
      return self.next





    def __lowercase   (   self    :  int		)   ->  Optional[int]:
      return self.previous







class    __snake_case       :







    """simple docstring"""



    def __init__(   self    :  Union[str, Any]    ,						lowerCamelCase    :  Optional[int]		)   ->  Optional[Any]:
      lowerCAmelCase_			:      Optional[Any]			=   head

    def __iter__(   self    :  str		)   ->  Optional[Any]:
      return self





    def __lowercase   (   self    :  Union[str, Any]		)   ->  Dict:
      if not self.current:
        raise StopIteration
      else:
        lowerCAmelCase_			:      Dict			=   self.current.get_data()
        lowerCAmelCase_			:      Tuple			=   self.current.get_next()
        return value







class    __snake_case       :







    """simple docstring"""



    def __init__(   self    :  Union[str, Any]		)   ->  Any:
      lowerCAmelCase_			:      Optional[Any]			=   None  # First node in list
      lowerCAmelCase_			:      Optional[Any]			=   None  # Last node in list

    def __str__(   self    :  Optional[int]		)   ->  Dict:
      lowerCAmelCase_			:      str			=   self.head
      lowerCAmelCase_			:      Tuple			=   []
      while current is not None:
        nodes.append(current.get_data()		)
        lowerCAmelCase_			:      str			=   current.get_next()
      return " ".join(str(lowerCamelCase		) for node in nodes		)

    def __contains__(   self    :  List[Any]    ,						lowerCamelCase    :  int		)   ->  List[str]:
      lowerCAmelCase_			:      List[str]			=   self.head
      while current:
        if current.get_data() == value:
          return True
        lowerCAmelCase_			:      List[Any]			=   current.get_next()
      return False

    def __iter__(   self    :  str		)   ->  Optional[Any]:
      return LinkedListIterator(self.head		)

    def __lowercase   (   self    :  Dict		)   ->  Optional[int]:
      if self.head:
        return self.head.get_data()
      return None

    def __lowercase   (   self    :  List[str]		)   ->  Optional[Any]:
      if self.tail:
        return self.tail.get_data()
      return None

    def __lowercase   (   self    :  Optional[Any]    ,						lowerCamelCase    :  Node		)   ->  None:
      if self.head is None:
        lowerCAmelCase_			:      Union[str, Any]			=   node
        lowerCAmelCase_			:      List[str]			=   node
      else:
        self.insert_before_node(self.head    ,						lowerCamelCase		)

    def __lowercase   (   self    :  Tuple    ,						lowerCamelCase    :  Node		)   ->  None:
      if self.head is None:
        self.set_head(lowerCamelCase		)
      else:
        self.insert_after_node(self.tail    ,						lowerCamelCase		)

    def __lowercase   (   self    :  Union[str, Any]    ,						lowerCamelCase    :  int		)   ->  None:
      lowerCAmelCase_			:      int			=   Node(lowerCamelCase		)
      if self.head is None:
        self.set_head(lowerCamelCase		)
      else:
        self.set_tail(lowerCamelCase		)

    def __lowercase   (   self    :  Optional[Any]    ,						lowerCamelCase    :  Node    ,						lowerCamelCase    :  Node		)   ->  None:
      lowerCAmelCase_			:      Optional[int]			=   node
      lowerCAmelCase_			:      List[Any]			=   node.previous

      if node.get_previous() is None:
        lowerCAmelCase_			:      Tuple			=   node_to_insert
      else:
        lowerCAmelCase_			:      Dict			=   node_to_insert

      lowerCAmelCase_			:      Optional[int]			=   node_to_insert

    def __lowercase   (   self    :  Union[str, Any]    ,						lowerCamelCase    :  Node    ,						lowerCamelCase    :  Node		)   ->  None:
      lowerCAmelCase_			:      Optional[int]			=   node
      lowerCAmelCase_			:      Tuple			=   node.next

      if node.get_next() is None:
        lowerCAmelCase_			:      Tuple			=   node_to_insert
      else:
        lowerCAmelCase_			:      Tuple			=   node_to_insert

      lowerCAmelCase_			:      Optional[Any]			=   node_to_insert

    def __lowercase   (   self    :  Dict    ,						lowerCamelCase    :  int    ,						lowerCamelCase    :  int		)   ->  None:
      lowerCAmelCase_			:      List[str]			=   1
      lowerCAmelCase_			:      Tuple			=   Node(lowerCamelCase		)
      lowerCAmelCase_			:      List[Any]			=   self.head
      while node:
        if current_position == position:
          self.insert_before_node(lowerCamelCase    ,						lowerCamelCase		)
          return
        current_position += 1
        lowerCAmelCase_			:      str			=   node.next
      self.insert_after_node(self.tail    ,						lowerCamelCase		)

    def __lowercase   (   self    :  int    ,						lowerCamelCase    :  int		)   ->  Node:
      lowerCAmelCase_			:      List[Any]			=   self.head
      while node:
        if node.get_data() == item:
          return node
        lowerCAmelCase_			:      List[Any]			=   node.get_next()
      raise Exception("""Node not found"""		)

    def __lowercase   (   self    :  str    ,						lowerCamelCase    :  str		)   ->  int:
      if (node := self.get_node(lowerCamelCase		)) is not None:
        if node == self.head:
          lowerCAmelCase_			:      Any			=   self.head.get_next()

        if node == self.tail:
          lowerCAmelCase_			:      Optional[int]			=   self.tail.get_previous()

        self.remove_node_pointers(lowerCamelCase		)

    @staticmethod
    def __lowercase   (   lowerCamelCase    :  Node		)   ->  None:
      if node.get_next():
        lowerCAmelCase_			:      Tuple			=   node.previous

      if node.get_previous():
        lowerCAmelCase_			:      Any			=   node.next

      lowerCAmelCase_			:      List[Any]			=   None
      lowerCAmelCase_			:      Any			=   None





    def __lowercase   (   self    :  str		)   ->  Optional[Any]:
      return self.head is None







def 				UpperCamelCase_			(    ):
  '''simple docstring'''







if __name__ == "__main__":
  import doctest

  doctest.testmod()



