



'''simple docstring'''




import json
import os
import shutil
import tempfile
import unittest

from transformers import is_speech_available, is_torch_available
from transformers.models.speechta import SpeechTaTokenizer
from transformers.testing_utils import get_tests_dir, require_torch
from transformers.utils import FEATURE_EXTRACTOR_NAME


if is_speech_available() and is_torch_available():
							from transformers import SpeechTaFeatureExtractor, SpeechTaProcessor

							from .test_feature_extraction_speechta import floats_list


a  :     Optional[Any]       =       get_tests_dir("""fixtures/test_sentencepiece_bpe_char.model""")

@require_torch
class      UpperCamelCase_					(				unittest.TestCase     ):





	def 					_lowercase(    self       )     ->     Tuple:
								UpperCAmelCase	:						int					=						tempfile.mkdtemp()

								UpperCAmelCase	:						Optional[Any]					=						SpeechTaTokenizer(A       )
								tokenizer.save_pretrained(self.tmpdirname       )

								UpperCAmelCase	:						List[str]					=						{
								    """feature_size""": 1,
								    """padding_value""": 0.0,
								    """sampling_rate""": 16000,
								    """do_normalize""": False,
								    """num_mel_bins""": 80,
								    """hop_length""": 16,
								    """win_length""": 64,
								    """win_function""": """hann_window""",
								    """fmin""": 80,
								    """fmax""": 7600,
								    """mel_floor""": 1e-10,
								    """reduction_factor""": 2,
								    """return_attention_mask""": True,
								}

								UpperCAmelCase	:						List[str]					=						os.path.join(self.tmpdirname						,						A       )
								with open(self.feature_extraction_file						,						"""w"""						,						encoding="""utf-8"""       ) as fp:
															fp.write(json.dumps(A       ) + """\n"""       )





	def 					_lowercase(    self						,						**A       )     ->     List[str]:
								return SpeechTaTokenizer.from_pretrained(self.tmpdirname						,						**A       )





	def 					_lowercase(    self						,						**A       )     ->     Any:
								return SpeechTaFeatureExtractor.from_pretrained(self.tmpdirname						,						**A       )





	def 					_lowercase(    self       )     ->     Any:
								shutil.rmtree(self.tmpdirname       )





	def 					_lowercase(    self       )     ->     Tuple:
								UpperCAmelCase	:						str					=						self.get_tokenizer()
								UpperCAmelCase	:						Optional[int]					=						self.get_feature_extractor()

								UpperCAmelCase	:						List[Any]					=						SpeechTaProcessor(tokenizer=A						,						feature_extractor=A       )

								processor.save_pretrained(self.tmpdirname       )
								UpperCAmelCase	:						Any					=						SpeechTaProcessor.from_pretrained(self.tmpdirname       )

								self.assertEqual(processor.tokenizer.get_vocab()						,						tokenizer.get_vocab()       )
								self.assertIsInstance(processor.tokenizer						,						A       )

								self.assertEqual(processor.feature_extractor.to_json_string()						,						feature_extractor.to_json_string()       )
								self.assertIsInstance(processor.feature_extractor						,						A       )





	def 					_lowercase(    self       )     ->     List[Any]:
								UpperCAmelCase	:						str					=						SpeechTaProcessor(tokenizer=self.get_tokenizer()						,						feature_extractor=self.get_feature_extractor()       )
								processor.save_pretrained(self.tmpdirname       )

								UpperCAmelCase	:						int					=						self.get_tokenizer(bos_token="""(BOS)"""						,						eos_token="""(EOS)"""       )
								UpperCAmelCase	:						List[str]					=						self.get_feature_extractor(do_normalize=A						,						padding_value=1.0       )

								UpperCAmelCase	:						str					=						SpeechTaProcessor.from_pretrained(
								    self.tmpdirname						,						bos_token="""(BOS)"""						,						eos_token="""(EOS)"""						,						do_normalize=A						,						padding_value=1.0       )

								self.assertEqual(processor.tokenizer.get_vocab()						,						tokenizer_add_kwargs.get_vocab()       )
								self.assertIsInstance(processor.tokenizer						,						A       )

								self.assertEqual(processor.feature_extractor.to_json_string()						,						feature_extractor_add_kwargs.to_json_string()       )
								self.assertIsInstance(processor.feature_extractor						,						A       )





	def 					_lowercase(    self       )     ->     Union[str, Any]:
								UpperCAmelCase	:						List[str]					=						self.get_feature_extractor()
								UpperCAmelCase	:						List[str]					=						self.get_tokenizer()

								UpperCAmelCase	:						List[str]					=						SpeechTaProcessor(tokenizer=A						,						feature_extractor=A       )

								UpperCAmelCase	:						Optional[int]					=						floats_list((3, 1000)       )

								UpperCAmelCase	:						str					=						feature_extractor(audio=A						,						return_tensors="""np"""       )
								UpperCAmelCase	:						Any					=						processor(audio=A						,						return_tensors="""np"""       )

								for key in input_feat_extract.keys():
															self.assertAlmostEqual(input_feat_extract[key].sum()						,						input_processor[key].sum()						,						delta=1e-2       )





	def 					_lowercase(    self       )     ->     List[str]:
								UpperCAmelCase	:						Optional[int]					=						self.get_feature_extractor()
								UpperCAmelCase	:						Any					=						self.get_tokenizer()

								UpperCAmelCase	:						int					=						SpeechTaProcessor(tokenizer=A						,						feature_extractor=A       )

								UpperCAmelCase	:						Dict					=						floats_list((3, 1000)       )

								UpperCAmelCase	:						Optional[Any]					=						feature_extractor(audio_target=A						,						return_tensors="""np"""       )
								UpperCAmelCase	:						Union[str, Any]					=						processor(audio_target=A						,						return_tensors="""np"""       )

								for key in input_feat_extract.keys():
															self.assertAlmostEqual(input_feat_extract[key].sum()						,						input_processor[key].sum()						,						delta=1e-2       )





	def 					_lowercase(    self       )     ->     List[Any]:
								UpperCAmelCase	:						Tuple					=						self.get_feature_extractor()
								UpperCAmelCase	:						List[Any]					=						self.get_tokenizer()

								UpperCAmelCase	:						Union[str, Any]					=						SpeechTaProcessor(tokenizer=A						,						feature_extractor=A       )

								UpperCAmelCase	:						Dict					=						"""This is a test string"""

								UpperCAmelCase	:						Optional[Any]					=						processor(text=A       )
								UpperCAmelCase	:						Any					=						tokenizer(A       )

								for key in encoded_tok.keys():
															self.assertListEqual(encoded_tok[key]						,						encoded_processor[key]       )





	def 					_lowercase(    self       )     ->     List[Any]:
								UpperCAmelCase	:						int					=						self.get_feature_extractor()
								UpperCAmelCase	:						Optional[int]					=						self.get_tokenizer()

								UpperCAmelCase	:						int					=						SpeechTaProcessor(tokenizer=A						,						feature_extractor=A       )

								UpperCAmelCase	:						Any					=						"""This is a test string"""

								UpperCAmelCase	:						Optional[int]					=						processor(text_target=A       )
								UpperCAmelCase	:						Union[str, Any]					=						tokenizer(A       )

								for key in encoded_tok.keys():
															self.assertListEqual(encoded_tok[key]						,						encoded_processor[key]       )





	def 					_lowercase(    self       )     ->     int:
								UpperCAmelCase	:						List[Any]					=						self.get_feature_extractor()
								UpperCAmelCase	:						str					=						self.get_tokenizer()

								UpperCAmelCase	:						Optional[int]					=						SpeechTaProcessor(tokenizer=A						,						feature_extractor=A       )

								UpperCAmelCase	:						int					=						[[1, 4, 5, 8, 1, 0, 8], [3, 4, 3, 1, 1, 8, 9]]

								UpperCAmelCase	:						Optional[Any]					=						processor.batch_decode(A       )
								UpperCAmelCase	:						Any					=						tokenizer.batch_decode(A       )

								self.assertListEqual(A						,						A       )






	def 					_lowercase(    self       )     ->     Dict:
								UpperCAmelCase	:						List[Any]					=						self.get_feature_extractor()
								UpperCAmelCase	:						str					=						self.get_tokenizer()

								UpperCAmelCase	:						Dict					=						SpeechTaProcessor(tokenizer=A						,						feature_extractor=A       )

								self.assertListEqual(
								    processor.model_input_names						,						feature_extractor.model_input_names						,						msg="""`processor` and `feature_extractor` model input names do not match"""						,						)






'''simple docstring'''




from __future__ import annotations

from collections.abc import Iterable

class      UpperCamelCase_					:





	def __init__(    self						,						A						,						A       )     ->     int:
								UpperCAmelCase	,	UpperCAmelCase	:						Any					=						float(A       ), float(A       )





	def __eq__(    self						,						A       )     ->     str:
								return self.x == other.x and self.y == other.y





	def __ne__(    self						,						A       )     ->     Dict:
								return not self == other





	def __gt__(    self						,						A       )     ->     Dict:
								if self.x > other.x:
															return True
								elif self.x == other.x:
															return self.y > other.y
								return False





	def __lt__(    self						,						A       )     ->     str:
								return not self > other





	def __ge__(    self						,						A       )     ->     Union[str, Any]:
								if self.x > other.x:
															return True
								elif self.x == other.x:
															return self.y >= other.y
								return False





	def __le__(    self						,						A       )     ->     List[str]:
								if self.x < other.x:
															return True
								elif self.x == other.x:
															return self.y <= other.y
								return False





	def __repr__(    self       )     ->     Tuple:
								return f'''({self.x}, {self.y})'''






	def __hash__(    self       )     ->     List[str]:
								return hash(self.x       )




def  __lowerCamelCase    (   _lowercase      ,							) ->     list[Point]:
							UpperCAmelCase	:						list[Point]					=						[]
							if list_of_tuples:
														for p in list_of_tuples:
																					if isinstance(_lowercase      ,							_lowercase						):
																												points.append(_lowercase						)
																					else:
																												try:
																																			points.append(Point(p[0]      ,							p[1]						)						)
																												except (IndexError, TypeError):
																																			print(
																																			    F'''Ignoring deformed point {p}. All points'''
																																			    """ must have at least 2 coordinates."""						)
							return points



def  __lowerCamelCase    (   _lowercase						) ->     list[Point]:

							if not hasattr(_lowercase      ,							"""__iter__"""						):
														UpperCAmelCase	:						List[str]					=						F'''Expecting an iterable object but got an non-iterable type {points}'''
														raise ValueError(_lowercase						)

							if not points:
														UpperCAmelCase	:						Optional[int]					=						F'''Expecting a list of points but got {points}'''
														raise ValueError(_lowercase						)

							return _construct_points(_lowercase						)



def  __lowerCamelCase    (   _lowercase      ,							_lowercase      ,							_lowercase						) ->     float:
							UpperCAmelCase	:						Dict					=						(a.x * b.y + b.x * c.y + c.x * a.y) - (a.y * b.x + b.y * c.x + c.y * a.x)
							return det



def  __lowerCamelCase    (   _lowercase						) ->     list[Point]:
							UpperCAmelCase	:						Optional[int]					=						sorted(_validate_input(_lowercase						)						)
							UpperCAmelCase	:						int					=						len(_lowercase						)
							UpperCAmelCase	:						Any					=						set()

							for i in range(n - 1						):
														for j in range(i + 1      ,							_lowercase						):
																					UpperCAmelCase	:						Optional[Any]					=						False
																					UpperCAmelCase	:						Optional[int]					=						True
																					for k in range(_lowercase						):
																												if k != i and k != j:
																																			UpperCAmelCase	:						Union[str, Any]					=						_det(points[i]      ,							points[j]      ,							points[k]						)

																																			if det_k > 0:
																																										UpperCAmelCase	:						Optional[int]					=						True
																																			elif det_k < 0:
																																										UpperCAmelCase	:						int					=						True
																																			else:
																																										# point[i], point[j], point[k] all lie on a straight line
																																										# if point[k] is to the left of point[i] or it's to the
																																										# right of point[j], then point[i], point[j] cannot be
																																										# part of the convex hull of A
																																										if points[k] < points[i] or points[k] > points[j]:
																																																	UpperCAmelCase	:						List[Any]					=						False
																																																	break

																												if points_left_of_ij and points_right_of_ij:
																																			UpperCAmelCase	:						Union[str, Any]					=						False
																																			break

																					if ij_part_of_convex_hull:
																												convex_set.update([points[i], points[j]]						)

							return sorted(_lowercase						)



def  __lowerCamelCase    (   _lowercase						) ->     list[Point]:
							UpperCAmelCase	:						List[str]					=						sorted(_validate_input(_lowercase						)						)
							UpperCAmelCase	:						Optional[Any]					=						len(_lowercase						)

							# divide all the points into an upper hull and a lower hull
							# the left most point and the right most point are definitely
							# members of the convex hull by definition.
							# use these two anchors to divide all the points into two hulls,
							# an upper hull and a lower hull.

							# all points to the left (above) the line joining the extreme points belong to the
							# upper hull
							# all points to the right (below) the line joining the extreme points below to the
							# lower hull
							# ignore all points on the line joining the extreme points since they cannot be
							# part of the convex hull

							UpperCAmelCase	:						List[str]					=						points[0]
							UpperCAmelCase	:						Union[str, Any]					=						points[n - 1]

							UpperCAmelCase	:						int					=						{left_most_point, right_most_point}
							UpperCAmelCase	:						Dict					=						[]
							UpperCAmelCase	:						Any					=						[]

							for i in range(1      ,							n - 1						):
														UpperCAmelCase	:						Any					=						_det(_lowercase      ,							_lowercase      ,							points[i]						)

														if det > 0:
																					upper_hull.append(points[i]						)
														elif det < 0:
																					lower_hull.append(points[i]						)

							_construct_hull(_lowercase      ,							_lowercase      ,							_lowercase      ,							_lowercase						)
							_construct_hull(_lowercase      ,							_lowercase      ,							_lowercase      ,							_lowercase						)

							return sorted(_lowercase						)



def  __lowerCamelCase    (   _lowercase      ,							_lowercase      ,							_lowercase      ,							_lowercase						) ->     None:
							if points:
														UpperCAmelCase	:						Union[str, Any]					=						None
														UpperCAmelCase	:						int					=						float("""-inf"""						)
														UpperCAmelCase	:						Tuple					=						[]

														for p in points:
																					UpperCAmelCase	:						List[Any]					=						_det(_lowercase      ,							_lowercase      ,							_lowercase						)

																					if det > 0:
																												candidate_points.append(_lowercase						)

																												if det > extreme_point_distance:
																																			UpperCAmelCase	:						List[str]					=						det
																																			UpperCAmelCase	:						Optional[Any]					=						p

														if extreme_point:
																					_construct_hull(_lowercase      ,							_lowercase      ,							_lowercase      ,							_lowercase						)
																					convex_set.add(_lowercase						)
																					_construct_hull(_lowercase      ,							_lowercase      ,							_lowercase      ,							_lowercase						)



def  __lowerCamelCase    (   _lowercase						) ->     list[Point]:
							UpperCAmelCase	:						Any					=						sorted(_validate_input(_lowercase						)						)
							UpperCAmelCase	:						Union[str, Any]					=						len(_lowercase						)

							UpperCAmelCase	:						Dict					=						points[:2]
							for i in range(2      ,							_lowercase						):
														UpperCAmelCase	:						Dict					=						_det(convex_hull[1]      ,							convex_hull[0]      ,							points[i]						)
														if det > 0:
																					convex_hull.insert(0      ,							points[i]						)
																					break
														elif det < 0:
																					convex_hull.append(points[i]						)
																					break
														else:
																					UpperCAmelCase	:						Dict					=						points[i]
							i += 1

							for j in range(_lowercase      ,							_lowercase						):
														if (
														    _det(convex_hull[0]      ,							convex_hull[-1]      ,							points[j]						) > 0
														    and _det(convex_hull[-1]      ,							convex_hull[0]      ,							points[1]						) < 0
														):
																					# The point lies within the convex hull
																					continue

														convex_hull.insert(0      ,							points[j]						)
														convex_hull.append(points[j]						)
														while _det(convex_hull[0]      ,							convex_hull[1]      ,							convex_hull[2]						) >= 0:
																					del convex_hull[1]
														while _det(convex_hull[-1]      ,							convex_hull[-2]      ,							convex_hull[-3]						) <= 0:
																					del convex_hull[-2]

    # `convex_hull` is contains the convex hull in circular order
							return sorted(convex_hull[1:] if len(_lowercase						) > 3 else convex_hull						)



def  __lowerCamelCase    (   ) ->     Tuple:
							UpperCAmelCase	:						Tuple					=						[
							    (0, 3),
							    (2, 2),
							    (1, 1),
							    (2, 1),
							    (3, 0),
							    (0, 0),
							    (3, 3),
							    (2, -1),
							    (2, -4),
							    (1, -3),
							]
							# the convex set of points is
							# [(0, 0), (0, 3), (1, -3), (2, -4), (3, 0), (3, 3)]
							UpperCAmelCase	:						Tuple					=						convex_hull_bf(_lowercase						)

							UpperCAmelCase	:						List[Any]					=						convex_hull_recursive(_lowercase						)
							assert results_bf == results_recursive

							UpperCAmelCase	:						Union[str, Any]					=						convex_hull_melkman(_lowercase						)
							assert results_bf == results_melkman

							print(_lowercase						)


if __name__ == "__main__":
							main()

