




import logging

from transformers import PretrainedConfig


__a          =			logging.getLogger(__name__)


__a          =			{
    'bertabs-finetuned-cnndm': 'https://huggingface.co/remi/bertabs-finetuned-cnndm-extractive-abstractive-summarization/resolve/main/config.json',
}

class   __a(					_a       ):






    """simple docstring"""





    lowerCAmelCase        =				'''bertabs'''





    def __init__(				self       ,_SCREAMING_SNAKE_CASE=30_522       ,_SCREAMING_SNAKE_CASE=512       ,_SCREAMING_SNAKE_CASE=6       ,_SCREAMING_SNAKE_CASE=512       ,_SCREAMING_SNAKE_CASE=8       ,_SCREAMING_SNAKE_CASE=512       ,_SCREAMING_SNAKE_CASE=0.2       ,_SCREAMING_SNAKE_CASE=6       ,_SCREAMING_SNAKE_CASE=768       ,_SCREAMING_SNAKE_CASE=8       ,_SCREAMING_SNAKE_CASE=2_048       ,_SCREAMING_SNAKE_CASE=0.2       ,**_SCREAMING_SNAKE_CASE       ,)			->		str:
         super().__init__(**_SCREAMING_SNAKE_CASE  )

         UpperCAmelCase_      :							Optional[int]       =      vocab_size
         UpperCAmelCase_      :							int       =      max_pos

         UpperCAmelCase_      :							Optional[int]       =      enc_layers
         UpperCAmelCase_      :							Union[str, Any]       =      enc_hidden_size
         UpperCAmelCase_      :							int       =      enc_heads
         UpperCAmelCase_      :							str       =      enc_ff_size
         UpperCAmelCase_      :							Optional[Any]       =      enc_dropout

         UpperCAmelCase_      :							str       =      dec_layers
         UpperCAmelCase_      :							List[str]       =      dec_hidden_size
         UpperCAmelCase_      :							List[str]       =      dec_heads
         UpperCAmelCase_      :							Union[str, Any]       =      dec_ff_size
         UpperCAmelCase_      :							Optional[int]       =      dec_dropout





def lowerCamelCase__       (      _lowercase			,						_lowercase				):

     '''simple docstring'''


     return (pointa[0] - pointa[0]) ** 2 + (pointa[1] - pointa[1]) ** 2







def lowerCamelCase__       (      _lowercase			,						_lowercase=0				):

     '''simple docstring'''


     return sorted(_lowercase			,						key=lambda _lowercase				: x[column]				)







def lowerCamelCase__       (      _lowercase			,						_lowercase			,						_lowercase=float('''inf'''				)				):

     '''simple docstring'''


     for i in range(points_counts - 1				):
          for j in range(i + 1			,						_lowercase				):
               UpperCAmelCase_      :							Optional[int]       =      euclidean_distance_sqr(points[i]			,						points[j]				)
               if current_dis < min_dis:
                    UpperCAmelCase_      :							Optional[Any]       =      current_dis
     return min_dis







def lowerCamelCase__       (      _lowercase			,						_lowercase			,						_lowercase=float('''inf'''				)				):

     '''simple docstring'''


     for i in range(min(6			,						points_counts - 1				)			,						_lowercase				):
          for j in range(max(0			,						i - 6				)			,						_lowercase				):
               UpperCAmelCase_      :							List[str]       =      euclidean_distance_sqr(points[i]			,						points[j]				)
               if current_dis < min_dis:
                    UpperCAmelCase_      :							Optional[int]       =      current_dis
     return min_dis







def lowerCamelCase__       (      _lowercase			,						_lowercase			,						_lowercase				):

     '''simple docstring'''


     if points_counts <= 3:
          return dis_between_closest_pair(_lowercase			,						_lowercase				)

     # recursion
     UpperCAmelCase_      :							Optional[int]       =      points_counts // 2
     UpperCAmelCase_      :							List[Any]       =      closest_pair_of_points_sqr(
         _lowercase			,						points_sorted_on_y[:mid]			,						_lowercase				)
     UpperCAmelCase_      :							Dict       =      closest_pair_of_points_sqr(
         _lowercase			,						points_sorted_on_y[mid:]			,						points_counts - mid				)
     UpperCAmelCase_      :							Union[str, Any]       =      min(_lowercase			,						_lowercase				)
     UpperCAmelCase_      :							str       =      []
     for point in points_sorted_on_x:
          if abs(point[0] - points_sorted_on_x[mid][0]				) < closest_pair_dis:
               cross_strip.append(_lowercase				)

     UpperCAmelCase_      :							Optional[Any]       =      dis_between_closest_in_strip(
         _lowercase			,						len(_lowercase				)			,						_lowercase				)
     return min(_lowercase			,						_lowercase				)







def lowerCamelCase__       (      _lowercase			,						_lowercase				):

     '''simple docstring'''


     UpperCAmelCase_      :							Tuple       =      column_based_sort(_lowercase			,						column=0				)
     UpperCAmelCase_      :							List[Any]       =      column_based_sort(_lowercase			,						column=1				)
     return (
         closest_pair_of_points_sqr(
             _lowercase			,						_lowercase			,						_lowercase				)
     ) ** 0.5


if __name__ == "__main__":
     __a          =			[(2, 3), (12, 30), (40, 50), (5, 1), (12, 10), (3, 4)]
     print('Distance:', closest_pair_of_points(points, len(points)))