




from __future__ import annotations

from collections.abc import Iterable





class        lowerCamelCase__:
      def __init__(							self:					Optional[Any]       ,			UpperCamelCase_:					Tuple       ,			UpperCamelCase_:					Tuple  ):
             __lowerCamelCase  =		float(_lowerCAmelCase  ), float(_lowerCAmelCase  )
      def __eq__(							self:					List[Any]       ,			UpperCamelCase_:					List[str]  ):
             return self.x == other.x and self.y == other.y
      def __ne__(							self:					Any       ,			UpperCamelCase_:					Optional[Any]  ):
             return not self == other
      def __gt__(							self:					Union[str, Any]       ,			UpperCamelCase_:					int  ):
             if self.x > other.x:
                    return True
             elif self.x == other.x:
                    return self.y > other.y
             return False
      def __lt__(							self:					List[str]       ,			UpperCamelCase_:					List[str]  ):
             return not self > other
      def __ge__(							self:					List[Any]       ,			UpperCamelCase_:					List[Any]  ):
             if self.x > other.x:
                    return True
             elif self.x == other.x:
                    return self.y >= other.y
             return False
      def __le__(							self:					List[Any]       ,			UpperCamelCase_:					List[Any]  ):
             if self.x < other.x:
                    return True
             elif self.x == other.x:
                    return self.y <= other.y
             return False
      def __repr__(							self:					str  ):
             return F'({self.x}, {self.y})'




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




def    lowerCamelCase__			(		A__			:   list[Point] | list[list[float]] | Iterable[list[float]]    ,     ):





       '''simple docstring'''



       __lowerCamelCase  =		[]
       if list_of_tuples:
              for p in list_of_tuples:
                     if isinstance(__SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE      ):
                            points.append(__SCREAMING_SNAKE_CASE      )
                     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__			(		A__			:   list[Point] | list[list[float]]      ):





       '''simple docstring'''



       if not hasattr(__SCREAMING_SNAKE_CASE    ,     """__iter__"""      ):
              __lowerCamelCase  =		f'Expecting an iterable object but got an non-iterable type {points}'
              raise ValueError(__SCREAMING_SNAKE_CASE      )

       if not points:
              __lowerCamelCase  =		f'Expecting a list of points but got {points}'
              raise ValueError(__SCREAMING_SNAKE_CASE      )

       return _construct_points(__SCREAMING_SNAKE_CASE      )




def    lowerCamelCase__			(		A__			:   Point    ,     A__			:   Point    ,     A__			:   Point      ):





       '''simple docstring'''



       __lowerCamelCase  =		(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__			(		A__			:   list[Point]      ):





       '''simple docstring'''



       __lowerCamelCase  =		sorted(_validate_input(__SCREAMING_SNAKE_CASE      )      )
       __lowerCamelCase  =		len(__SCREAMING_SNAKE_CASE      )
       __lowerCamelCase  =		set()

       for i in range(n - 1      ):
              for j in range(i + 1    ,     __SCREAMING_SNAKE_CASE      ):
                     __lowerCamelCase  =		False
                     __lowerCamelCase  =		True
                     for k in range(__SCREAMING_SNAKE_CASE      ):
                            if k != i and k != j:
                                   __lowerCamelCase  =		_det(points[i]    ,     points[j]    ,     points[k]      )

                                   if det_k > 0:
                                          __lowerCamelCase  =		True
                                   elif det_k < 0:
                                          __lowerCamelCase  =		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]:
                                                 __lowerCamelCase  =		False
                                                 break

                            if points_left_of_ij and points_right_of_ij:
                                   __lowerCamelCase  =		False
                                   break

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

       return sorted(__SCREAMING_SNAKE_CASE      )




def    lowerCamelCase__			(		A__			:   list[Point]      ):





       '''simple docstring'''



       __lowerCamelCase  =		sorted(_validate_input(__SCREAMING_SNAKE_CASE      )      )
       __lowerCamelCase  =		len(__SCREAMING_SNAKE_CASE      )

       # 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

       __lowerCamelCase  =		points[0]
       __lowerCamelCase  =		points[n - 1]

       __lowerCamelCase  =		{left_most_point, right_most_point}
       __lowerCamelCase  =		[]
       __lowerCamelCase  =		[]

       for i in range(1    ,     n - 1      ):
              __lowerCamelCase  =		_det(__SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE    ,     points[i]      )

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

       _construct_hull(__SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE      )
       _construct_hull(__SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE      )

       return sorted(__SCREAMING_SNAKE_CASE      )




def    lowerCamelCase__			(		A__			:   list[Point]    ,     A__			:   Point    ,     A__			:   Point    ,     A__			:   set[Point]      ):





       '''simple docstring'''



       if points:
              __lowerCamelCase  =		None
              __lowerCamelCase  =		float("""-inf"""      )
              __lowerCamelCase  =		[]

              for p in points:
                     __lowerCamelCase  =		_det(__SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE      )

                     if det > 0:
                            candidate_points.append(__SCREAMING_SNAKE_CASE      )

                            if det > extreme_point_distance:
                                   __lowerCamelCase  =		det
                                   __lowerCamelCase  =		p

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




def    lowerCamelCase__			(		A__			:   list[Point]      ):





       '''simple docstring'''



       __lowerCamelCase  =		sorted(_validate_input(__SCREAMING_SNAKE_CASE      )      )
       __lowerCamelCase  =		len(__SCREAMING_SNAKE_CASE      )

       __lowerCamelCase  =		points[:2]
       for i in range(2    ,     __SCREAMING_SNAKE_CASE      ):
              __lowerCamelCase  =		_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:
                     __lowerCamelCase  =		points[i]
       i += 1

       for j in range(__SCREAMING_SNAKE_CASE    ,     __SCREAMING_SNAKE_CASE      ):
              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(__SCREAMING_SNAKE_CASE      ) > 3 else convex_hull      )




def    lowerCamelCase__			(		):





       '''simple docstring'''



       __lowerCamelCase  =		[
           (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)]
       __lowerCamelCase  =		convex_hull_bf(__SCREAMING_SNAKE_CASE      )

       __lowerCamelCase  =		convex_hull_recursive(__SCREAMING_SNAKE_CASE      )
       assert results_bf == results_recursive

       __lowerCamelCase  =		convex_hull_melkman(__SCREAMING_SNAKE_CASE      )
       assert results_bf == results_melkman

       print(__SCREAMING_SNAKE_CASE      )


if __name__ == "__main__":
       main()


import functools
import operator

from ...configuration_utils import PretrainedConfig
from ...utils import logging


lowercase_  							=			logging.get_logger(__name__)

lowercase_  							=			{
    "facebook/hubert-base-ls960": "https://huggingface.co/facebook/hubert-base-ls960/resolve/main/config.json",
    # See all Hubert models at https://huggingface.co/models?filter=hubert
}







class      SCREAMING_SNAKE_CASE__					(  __UpperCamelCase    ):
       A							:	List[str]          =	"hubert"

       def __init__(							self					:     List[str]			,			_lowerCAmelCase					:     Union[str, Any]=32			,			_lowerCAmelCase					:     Any=7_68			,			_lowerCAmelCase					:     Optional[Any]=12			,			_lowerCAmelCase					:     Optional[int]=12			,			_lowerCAmelCase					:     int=30_72			,			_lowerCAmelCase					:     Optional[Any]="gelu"			,			_lowerCAmelCase					:     List[str]=0.1			,			_lowerCAmelCase					:     Any=0.1			,			_lowerCAmelCase					:     List[str]=0.1			,			_lowerCAmelCase					:     Dict=True			,			_lowerCAmelCase					:     Dict=0.0			,			_lowerCAmelCase					:     List[str]=0.1			,			_lowerCAmelCase					:     Optional[int]=0.1			,			_lowerCAmelCase					:     Dict=0.02			,			_lowerCAmelCase					:     Any=1e-5			,			_lowerCAmelCase					:     str="group"			,			_lowerCAmelCase					:     Any="gelu"			,			_lowerCAmelCase					:     List[str]=(5_12, 5_12, 5_12, 5_12, 5_12, 5_12, 5_12)			,			_lowerCAmelCase					:     Any=(5, 2, 2, 2, 2, 2, 2)			,			_lowerCAmelCase					:     Dict=(10, 3, 3, 3, 3, 2, 2)			,			_lowerCAmelCase					:     List[str]=False			,			_lowerCAmelCase					:     Optional[Any]=1_28			,			_lowerCAmelCase					:     int=16			,			_lowerCAmelCase					:     Tuple=False			,			_lowerCAmelCase					:     int=True			,			_lowerCAmelCase					:     int=0.05			,			_lowerCAmelCase					:     Any=10			,			_lowerCAmelCase					:     Dict=2			,			_lowerCAmelCase					:     Dict=0.0			,			_lowerCAmelCase					:     Optional[int]=10			,			_lowerCAmelCase					:     Union[str, Any]=0			,			_lowerCAmelCase					:     int="sum"			,			_lowerCAmelCase					:     Optional[int]=False			,			_lowerCAmelCase					:     str=False			,			_lowerCAmelCase					:     Optional[Any]=2_56			,			_lowerCAmelCase					:     Any=0			,			_lowerCAmelCase					:     List[Any]=1			,			_lowerCAmelCase					:     List[str]=2			,			**_lowerCAmelCase					:     Optional[int]			,			):
           super().__init__(**_lowerCAmelCase			,			pad_token_id=_lowerCAmelCase			,			bos_token_id=_lowerCAmelCase			,			eos_token_id=_lowerCAmelCase			)
           __snake_case       :				Optional[int] 			=    hidden_size
           __snake_case       :				Optional[Any] 			=    feat_extract_norm
           __snake_case       :				Optional[int] 			=    feat_extract_activation
           __snake_case       :				List[str] 			=    list(_lowerCAmelCase			)
           __snake_case       :				Any 			=    list(_lowerCAmelCase			)
           __snake_case       :				List[Any] 			=    list(_lowerCAmelCase			)
           __snake_case       :				Any 			=    conv_bias
           __snake_case       :				Tuple 			=    num_conv_pos_embeddings
           __snake_case       :				List[Any] 			=    num_conv_pos_embedding_groups
           __snake_case       :				Union[str, Any] 			=    len(self.conv_dim			)
           __snake_case       :				List[Any] 			=    num_hidden_layers
           __snake_case       :				Tuple 			=    intermediate_size
           __snake_case       :				Optional[int] 			=    hidden_act
           __snake_case       :				Union[str, Any] 			=    num_attention_heads
           __snake_case       :				str 			=    hidden_dropout
           __snake_case       :				Union[str, Any] 			=    attention_dropout
           __snake_case       :				Dict 			=    activation_dropout
           __snake_case       :				List[Any] 			=    feat_proj_layer_norm
           __snake_case       :				List[str] 			=    feat_proj_dropout
           __snake_case       :				List[Any] 			=    final_dropout
           __snake_case       :				str 			=    layerdrop
           __snake_case       :				List[str] 			=    layer_norm_eps
           __snake_case       :				Optional[Any] 			=    initializer_range
           __snake_case       :				Optional[int] 			=    vocab_size
           __snake_case       :				Dict 			=    do_stable_layer_norm
           __snake_case       :				Tuple 			=    use_weighted_layer_sum
           __snake_case       :				List[Any] 			=    classifier_proj_size

           if (
               (len(self.conv_stride			) != self.num_feat_extract_layers)
               or (len(self.conv_kernel			) != self.num_feat_extract_layers)
               or (len(self.conv_dim			) != self.num_feat_extract_layers)
           ):
               raise ValueError(
                   """Configuration for convolutional layers is incorrect. It is required that `len(config.conv_dim)` =="""
                   """ `len(config.conv_stride)` == `len(config.conv_kernel)`, but is `len(config.conv_dim) ="""
                   f''' {len(self.conv_dim			)}`, `len(config.conv_stride) = {len(self.conv_stride			)}`,'''
                   f''' `len(config.conv_kernel) = {len(self.conv_kernel			)}`.'''			)

           # fine-tuning config parameters for SpecAugment: https://arxiv.org/abs/1904.08779
           __snake_case       :				Union[str, Any] 			=    apply_spec_augment
           __snake_case       :				List[str] 			=    mask_time_prob
           __snake_case       :				Dict 			=    mask_time_length
           __snake_case       :				int 			=    mask_time_min_masks
           __snake_case       :				List[str] 			=    mask_feature_prob
           __snake_case       :				Tuple 			=    mask_feature_length
           __snake_case       :				int 			=    mask_feature_min_masks

           # ctc loss
           __snake_case       :				Dict 			=    ctc_loss_reduction
           __snake_case       :				List[str] 			=    ctc_zero_infinity





       @property
       def 			snake_case__    (							self					:     Any			):
           return functools.reduce(operator.mul			,			self.conv_stride			,			1			)



