


"""simple docstring"""
import unittest

from transformers import load_tool

from .test_tools_common import ToolTesterMixin


__SCREAMING_SNAKE_CASE				:     Optional[int]		=     '\nHugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf originally as a company that developed a chatbot app targeted at teenagers.[2] After open-sourcing the model behind the chatbot, the company pivoted to focus on being a platform for machine learning.\n\nIn March 2021, Hugging Face raised $40 million in a Series B funding round.[3]\n\nOn April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model.[4] In 2022, the workshop concluded with the announcement of BLOOM, a multilingual large language model with 176 billion parameters.[5]\n'





class   __A  (unittest.TestCase    ,		snake_case__):





							'''simple docstring'''

							def 		lowerCAmelCase							(					self				:   Optional[Any]							)       ->List[Any]:



														"""simple docstring"""



														snake_case_     							=		load_tool("""summarization"""							)
														self.tool.setup()
														snake_case_     							=		load_tool("""summarization"""		,							remote=UpperCAmelCase_							)



							def 		lowerCAmelCase							(					self				:   Tuple							)       ->Tuple:



														"""simple docstring"""



														snake_case_     							=		self.tool(UpperCAmelCase_							)
														self.assertEqual(
														    UpperCAmelCase_		,							"""Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM."""		,							)



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



														"""simple docstring"""



														snake_case_     							=		self.remote_tool(UpperCAmelCase_							)
														self.assertEqual(
														    UpperCAmelCase_		,							"""Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM."""		,							)



							def 		lowerCAmelCase							(					self				:   Tuple							)       ->List[str]:



														"""simple docstring"""



														snake_case_     							=		self.tool(text=UpperCAmelCase_							)
														self.assertEqual(
														    UpperCAmelCase_		,							"""Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM."""		,							)



							def 		lowerCAmelCase							(					self				:   List[Any]							)       ->Optional[Any]:



														"""simple docstring"""



														snake_case_     							=		self.remote_tool(text=UpperCAmelCase_							)
														self.assertEqual(
														    UpperCAmelCase_		,							"""Hugging Face was founded in 2016 by French entrepreneurs Clément Delangue, Julien Chaumond, and Thomas Wolf. In March 2021, Hugging Face raised $40 million in a Series B funding round. On April 28, 2021, the company launched the BigScience Research Workshop in collaboration with several other research groups to release an open large language model. In 2022, the workshop concluded with the announcement of BLOOM."""		,							)







"""simple docstring"""
from __future__ import annotations

from collections import deque
from enum import Enum
from math import atana, degrees
from sys import maxsize





class   __A  (snake_case__):





							'''simple docstring'''

							__lowercase:		Dict				   =     1
							__lowercase:		List[str]				   =     2
							__lowercase:		int				   =     3



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



														"""simple docstring"""



														return F"""{self.__class__.__name__}.{self.name}"""







def     _a					(   _SCREAMING_SNAKE_CASE					,			_SCREAMING_SNAKE_CASE					,			_SCREAMING_SNAKE_CASE					)     ->					float:
							snake_case_							,    snake_case_     							=		point
							return degrees(atana(y - miny					,			x - minx					)					)







def     _a					(   _SCREAMING_SNAKE_CASE					,			_SCREAMING_SNAKE_CASE					,			_SCREAMING_SNAKE_CASE					)     ->					Direction:
							snake_case_							,    snake_case_     							=		starting
							snake_case_							,    snake_case_     							=		via
							snake_case_							,    snake_case_     							=		target
							snake_case_     							=		degrees(atana(ya - ya					,			xa - xa					)					)
							via_angle %= 360
							snake_case_     							=		degrees(atana(ya - ya					,			xa - xa					)					)
							target_angle %= 360
							# t-
							#  \ \
							#   \ v
							#    \|
							#     s
							# via_angle is always lower than target_angle, if direction is left.
							# If they are same, it means they are on a same line of convex hull.
							if target_angle > via_angle:
														return Direction.left
							elif target_angle == via_angle:
														return Direction.straight
							else:
														return Direction.right







def     _a					(   _SCREAMING_SNAKE_CASE					)     ->					list[tuple[int, int]]:

							if len(_SCREAMING_SNAKE_CASE					) <= 2:
														# There is no convex hull
														raise ValueError("""graham_scan: argument must contain more than 3 points."""					)
							if len(_SCREAMING_SNAKE_CASE					) == 3:
														return points
							# find the lowest and the most left point
							snake_case_     							=		0
							snake_case_							,    snake_case_     							=		maxsize, maxsize
							for i, point in enumerate(_SCREAMING_SNAKE_CASE					):
														snake_case_     							=		point[0]
														snake_case_     							=		point[1]
														if y < miny:
																					snake_case_     							=		y
																					snake_case_     							=		x
																					snake_case_     							=		i
														if y == miny and x < minx:
																					snake_case_     							=		x
																					snake_case_     							=		i

    # remove the lowest and the most left point from points for preparing for sort
							points.pop(_SCREAMING_SNAKE_CASE					)

							snake_case_     							=		sorted(_SCREAMING_SNAKE_CASE					,			key=lambda _SCREAMING_SNAKE_CASE					: angle_comparer(_SCREAMING_SNAKE_CASE					,			_SCREAMING_SNAKE_CASE					,			_SCREAMING_SNAKE_CASE					)					)
							# This insert actually costs complexity,
							# and you should instead add (minx, miny) into stack later.
							# I'm using insert just for easy understanding.
							sorted_points.insert(0					,			(minx, miny)					)

							snake_case_     							=		deque()
							stack.append(sorted_points[0]					)
							stack.append(sorted_points[1]					)
							stack.append(sorted_points[2]					)
							# In any ways, the first 3 points line are towards left.
							# Because we sort them the angle from minx, miny.
							snake_case_     							=		Direction.left

							for i in range(3					,			len(_SCREAMING_SNAKE_CASE					)					):
														while True:
																					snake_case_     							=		stack[-2]
																					snake_case_     							=		stack[-1]
																					snake_case_     							=		sorted_points[i]
																					snake_case_     							=		check_direction(_SCREAMING_SNAKE_CASE					,			_SCREAMING_SNAKE_CASE					,			_SCREAMING_SNAKE_CASE					)

																					if next_direction == Direction.left:
																												snake_case_     							=		Direction.left
																												break
																					if next_direction == Direction.straight:
																												if current_direction == Direction.left:
																																			# We keep current_direction as left.
																																			# Because if the straight line keeps as straight,
																																			# we want to know if this straight line is towards left.
																																			break
																												elif current_direction == Direction.right:
																																			# If the straight line is towards right,
																																			# every previous points on those straigh line is not convex hull.
																																			stack.pop()
																					if next_direction == Direction.right:
																												stack.pop()
														stack.append(sorted_points[i]					)
							return list(_SCREAMING_SNAKE_CASE					)



