



from __future__ import annotations

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



class 						_snake_case					(	a_ ):





 """simple docstring"""



 lowerCamelCase_								=	1
 lowerCamelCase_								=	2
 lowerCamelCase_								=	3
 def __repr__(  self    )		->							Optional[Any]:




   """simple docstring"""







   return f'''{self.__class__.__name__}.{self.name}'''







def 			UpperCAmelCase__       (							__snake_case  , __snake_case  , __snake_case							)      ->       List[Any]:
  _A							=			point
  return degrees(atana(y - miny  , x - minx							)							)




def 			UpperCAmelCase__       (							__snake_case  , __snake_case  , __snake_case							)      ->       Any:
  _A							=			starting
  _A							=			via
  _A							=			target
  _A							=			degrees(atana(ya - ya  , xa - xa							)							)
  via_angle %= 360
  _A							=			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 			UpperCAmelCase__       (							__snake_case							)      ->       Union[str, Any]:

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

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

  _A							=			sorted(lowercase_  , key=lambda __snake_case							: angle_comparer(lowercase_  , lowercase_  , lowercase_							)							)
  # 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)							)

  _A							=			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.
  _A							=			Direction.left

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

      if next_direction == Direction.left:
        _A							=			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(lowercase_							)
import json
import os
from functools import lru_cache
from typing import TYPE_CHECKING, List, Optional, Tuple, Union

import numpy as np
import regex as re

from ...utils import is_tf_available, is_torch_available, logging


if TYPE_CHECKING:
 if is_torch_available():
  import torch
 if is_tf_available():
  import tensorflow as tf

from ...tokenization_utils import AddedToken, PreTrainedTokenizer


UpperCAmelCase							= logging.get_logger(__name__)

UpperCAmelCase							= {
    '''vocab_file''': '''vocab.json''',
    '''merges_file''': '''merges.txt''',
}

UpperCAmelCase							= {
    '''vocab_file''': {
        '''Salesforce/codegen-350M-mono''': '''https://huggingface.co/Salesforce/codegen-350M-mono/resolve/main/vocab.json''',
    },
    '''merges_file''': {
        '''Salesforce/codegen-350M-mono''': '''https://huggingface.co/Salesforce/codegen-350M-mono/resolve/main/merges.txt''',
    },
}

UpperCAmelCase							= {
    '''Salesforce/codegen-350M-mono''': 20_48,
}


@lru_cache()
def SCREAMING_SNAKE_CASE (   ):
       _UpperCamelCase   :				Any       =     (
           list(range(ord('!' )						,  ord('~' ) + 1 ) ) + list(range(ord('¡' )						,  ord('¬' ) + 1 ) ) + list(range(ord('®' )						,  ord('ÿ' ) + 1 ) )
       )
       _UpperCamelCase   :				int       =     bs[:]
       _UpperCamelCase   :				Any       =     0
       for b in range(2**8 ):
              if b not in bs:
                     bs.append(lowercase_ )
                     cs.append(2**8 + n )
                     n += 1
       _UpperCamelCase   :				str       =     [chr(lowercase_ ) for n in cs]
       return dict(zip(lowercase_						,  lowercase_ ) )


def SCREAMING_SNAKE_CASE (   lowercase_:		int ):
       _UpperCamelCase   :				List[str]       =     set()
       _UpperCamelCase   :				Optional[int]       =     word[0]
       for char in word[1:]:
              pairs.add((prev_char, char) )
              _UpperCamelCase   :				Optional[Any]       =     char
       return pairs





class       __lowerCAmelCase     (				a_  ):



 '''simple docstring'''
 _lowerCamelCase  :		Union[str, Any] 			=       VOCAB_FILES_NAMES
 _lowerCamelCase  :		Optional[int] 			=       PRETRAINED_VOCAB_FILES_MAP
 _lowerCamelCase  :		List[str] 			=       PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
 _lowerCamelCase  :		Optional[int] 			=       ['input_ids', 'attention_mask']

 def __init__(	self				:						Union[str, Any]				,	lowerCamelCase				:						Tuple				,	lowerCamelCase				:						str				,	lowerCamelCase				:						Optional[Any]="replace"				,	lowerCamelCase				:						int="<|endoftext|>"				,	lowerCamelCase				:						Dict="<|endoftext|>"				,	lowerCamelCase				:						Dict="<|endoftext|>"				,	lowerCamelCase				:						str=None				,	lowerCamelCase				:						List[Any]=False				,	lowerCamelCase				:						Optional[int]=False				,	**lowerCamelCase				:						Optional[Any]				,	)       ->							int:
        _UpperCamelCase   :				int       =     AddedToken(lowerCamelCase				,	lstrip=lowerCamelCase				,	rstrip=lowerCamelCase     ) if isinstance(lowerCamelCase				,	lowerCamelCase     ) else bos_token
        _UpperCamelCase   :				Any       =     AddedToken(lowerCamelCase				,	lstrip=lowerCamelCase				,	rstrip=lowerCamelCase     ) if isinstance(lowerCamelCase				,	lowerCamelCase     ) else eos_token
        _UpperCamelCase   :				Dict       =     AddedToken(lowerCamelCase				,	lstrip=lowerCamelCase				,	rstrip=lowerCamelCase     ) if isinstance(lowerCamelCase				,	lowerCamelCase     ) else unk_token
        _UpperCamelCase   :				Dict       =     AddedToken(lowerCamelCase				,	lstrip=lowerCamelCase				,	rstrip=lowerCamelCase     ) if isinstance(lowerCamelCase				,	lowerCamelCase     ) else pad_token
        super().__init__(
            errors=lowerCamelCase				,	unk_token=lowerCamelCase				,	bos_token=lowerCamelCase				,	eos_token=lowerCamelCase				,	pad_token=lowerCamelCase				,	add_prefix_space=lowerCamelCase				,	add_bos_token=lowerCamelCase				,	**lowerCamelCase				,	)
        _UpperCamelCase   :				List[str]       =     add_bos_token

        with open(lowerCamelCase				,	encoding='utf-8'     ) as vocab_handle:
               _UpperCamelCase   :				Union[str, Any]       =     json.load(lowerCamelCase     )
        _UpperCamelCase   :				int       =     {v: k for k, v in self.encoder.items()}
        _UpperCamelCase   :				Optional[int]       =     errors  # how to handle errors in decoding
        _UpperCamelCase   :				Dict       =     bytes_to_unicode()
        _UpperCamelCase   :				Optional[Any]       =     {v: k for k, v in self.byte_encoder.items()}
        with open(lowerCamelCase				,	encoding='utf-8'     ) as merges_handle:
               _UpperCamelCase   :				Dict       =     merges_handle.read().split('\n'     )[1:-1]
        _UpperCamelCase   :				int       =     [tuple(merge.split()     ) for merge in bpe_merges]
        _UpperCamelCase   :				Optional[Any]       =     dict(zip(lowerCamelCase				,	range(len(lowerCamelCase     )     )     )     )
        _UpperCamelCase   :				List[Any]       =     {}
        _UpperCamelCase   :				Any       =     add_prefix_space

        # Should have added re.IGNORECASE so BPE merges can happen for capitalized versions of contractions
        _UpperCamelCase   :				Union[str, Any]       =     re.compile(r'\'s|\'t|\'re|\'ve|\'m|\'ll|\'d| ?\p{L}+| ?\p{N}+| ?[^\s\p{L}\p{N}]+|\s+(?!\S)|\s+'     )

 @property
 def     __snake_case    (	self				:						Optional[Any]     )       ->							Union[str, Any]:
        return len(self.encoder     )

 def     __snake_case    (	self				:						Union[str, Any]     )       ->							Optional[Any]:
        return dict(self.encoder				,	**self.added_tokens_encoder     )

 def     __snake_case    (	self				:						int				,	lowerCamelCase				:						Dict     )       ->							Union[str, Any]:
        if token in self.cache:
               return self.cache[token]
        _UpperCamelCase   :				Dict       =     tuple(lowerCamelCase     )
        _UpperCamelCase   :				Union[str, Any]       =     get_pairs(lowerCamelCase     )

        if not pairs:
               return token

        while True:
               _UpperCamelCase   :				List[Any]       =     min(lowerCamelCase				,	key=lambda lowerCamelCase     : self.bpe_ranks.get(lowerCamelCase				,	float('inf'     )     )     )
               if bigram not in self.bpe_ranks:
                      break
               _UpperCamelCase  ,					_UpperCamelCase   :				Optional[int]       =     bigram
               _UpperCamelCase   :				Optional[Any]       =     []
               _UpperCamelCase   :				int       =     0
               while i < len(lowerCamelCase     ):
                      try:
                             _UpperCamelCase   :				str       =     word.index(lowerCamelCase				,	lowerCamelCase     )
                      except ValueError:
                             new_word.extend(word[i:]     )
                             break
                      else:
                             new_word.extend(word[i:j]     )
                             _UpperCamelCase   :				List[Any]       =     j

                      if word[i] == first and i < len(lowerCamelCase     ) - 1 and word[i + 1] == second:
                             new_word.append(first + second     )
                             i += 2
                      else:
                             new_word.append(word[i]     )
                             i += 1
               _UpperCamelCase   :				List[str]       =     tuple(lowerCamelCase     )
               _UpperCamelCase   :				Tuple       =     new_word
               if len(lowerCamelCase     ) == 1:
                      break
               else:
                      _UpperCamelCase   :				int       =     get_pairs(lowerCamelCase     )
        _UpperCamelCase   :				List[Any]       =     ' '.join(lowerCamelCase     )
        _UpperCamelCase   :				List[str]       =     word
        return word

 def     __snake_case    (	self				:						Optional[Any]				,	lowerCamelCase				:						str				,	lowerCamelCase				:						Any=None     )       ->							Any:
        if self.add_bos_token:
               _UpperCamelCase   :				List[str]       =     [self.bos_token_id]
        else:
               _UpperCamelCase   :				List[str]       =     []

        _UpperCamelCase   :				Union[str, Any]       =     bos_token_ids + token_ids_a

        if token_ids_a is None:
               return output

        return output + bos_token_ids + token_ids_a

 def     __snake_case    (	self				:						Union[str, Any]				,	lowerCamelCase				:						Union[str, Any]     )       ->							str:
        _UpperCamelCase   :				Tuple       =     []
        for token in re.findall(self.pat				,	lowerCamelCase     ):
               _UpperCamelCase   :				int       =     ''.join(
                   self.byte_encoder[b] for b in token.encode('utf-8'     )     )  # Maps all our bytes to unicode strings, avoiding control tokens of the BPE (spaces in our case)
               bpe_tokens.extend(bpe_token for bpe_token in self.bpe(lowerCamelCase     ).split(' '     )     )
        return bpe_tokens

 def     __snake_case    (	self				:						int				,	lowerCamelCase				:						Any     )       ->							List[str]:
        return self.encoder.get(lowerCamelCase				,	self.encoder.get(self.unk_token     )     )

 def     __snake_case    (	self				:						Optional[int]				,	lowerCamelCase				:						List[Any]     )       ->							List[str]:
        return self.decoder.get(lowerCamelCase     )

 def     __snake_case    (	self				:						Optional[int]				,	lowerCamelCase				:						Optional[Any]     )       ->							List[Any]:
        _UpperCamelCase   :				Union[str, Any]       =     ''.join(lowerCamelCase     )
        _UpperCamelCase   :				Tuple       =     bytearray([self.byte_decoder[c] for c in text]     ).decode('utf-8'				,	errors=self.errors     )
        return text

 def     __snake_case    (	self				:						Any				,	lowerCamelCase				:						str				,	lowerCamelCase				:						Optional[str] = None     )       ->							Tuple[str]:
        if not os.path.isdir(lowerCamelCase     ):
               logger.error(f"Vocabulary path ({save_directory}) should be a directory"     )
               return
        _UpperCamelCase   :				Any       =     os.path.join(
            lowerCamelCase				,	(filename_prefix + '-' if filename_prefix else '') + VOCAB_FILES_NAMES['vocab_file']     )
        _UpperCamelCase   :				Optional[int]       =     os.path.join(
            lowerCamelCase				,	(filename_prefix + '-' if filename_prefix else '') + VOCAB_FILES_NAMES['merges_file']     )

        with open(lowerCamelCase				,	'w'				,	encoding='utf-8'     ) as f:
               f.write(json.dumps(self.encoder				,	indent=2				,	sort_keys=lowerCamelCase				,	ensure_ascii=lowerCamelCase     ) + '\n'     )

        _UpperCamelCase   :				Any       =     0
        with open(lowerCamelCase				,	'w'				,	encoding='utf-8'     ) as writer:
               writer.write('#version: 0.2\n'     )
               for bpe_tokens, token_index in sorted(self.bpe_ranks.items()				,	key=lambda lowerCamelCase     : kv[1]     ):
                      if index != token_index:
                             logger.warning(
                                 f"Saving vocabulary to {merge_file}: BPE merge indices are not consecutive."
                                 ' Please check that the tokenizer is not corrupted!'     )
                             _UpperCamelCase   :				Dict       =     token_index
                      writer.write(' '.join(lowerCamelCase     ) + '\n'     )
                      index += 1

        return vocab_file, merge_file

 def     __snake_case    (	self				:						Any				,	lowerCamelCase				:						Optional[int]				,	lowerCamelCase				:						int=False				,	**lowerCamelCase				:						Any     )       ->							Tuple:
        _UpperCamelCase   :				Optional[int]       =     kwargs.pop('add_prefix_space'				,	self.add_prefix_space     )
        if is_split_into_words or add_prefix_space:
               _UpperCamelCase   :				Union[str, Any]       =     ' ' + text
        return (text, kwargs)

 def     __snake_case    (	self				:						str				,	lowerCamelCase				:						Union[int, List[int], "np.ndarray", "torch.Tensor", "tf.Tensor"]				,	lowerCamelCase				:						bool = False				,	lowerCamelCase				:						bool = None				,	lowerCamelCase				:						Optional[List[str]] = None				,	**lowerCamelCase				:						Union[str, Any]				,	)       ->							str:
        _UpperCamelCase   :				List[str]       =     super()._decode(
            token_ids=lowerCamelCase				,	skip_special_tokens=lowerCamelCase				,	clean_up_tokenization_spaces=lowerCamelCase				,	**lowerCamelCase				,	)

        if truncate_before_pattern is not None and len(lowerCamelCase     ) > 0:
               _UpperCamelCase   :				Union[str, Any]       =     self.truncate(lowerCamelCase				,	lowerCamelCase     )

        return decoded_text

 def     __snake_case    (	self				:						Any				,	lowerCamelCase				:						Dict				,	lowerCamelCase				:						Optional[int]     )       ->							Any:
        def find_re(lowerCamelCase				:						int				,	lowerCamelCase				:						int				,	lowerCamelCase				:						List[Any]     ):
               _UpperCamelCase   :				Dict       =     pattern.search(lowerCamelCase				,	lowerCamelCase     )
               return m.start() if m else -1

        _UpperCamelCase   :				int       =     [re.compile(lowerCamelCase				,	re.MULTILINE     ) for pattern in truncate_before_pattern]

        _UpperCamelCase   :				Union[str, Any]       =     list(re.finditer('^print'				,	lowerCamelCase				,	re.MULTILINE     )     )

        if len(lowerCamelCase     ) > 1:
               _UpperCamelCase   :				List[Any]       =     completion[: prints[1].start()]

        _UpperCamelCase   :				Dict       =     list(re.finditer('^def'				,	lowerCamelCase				,	re.MULTILINE     )     )

        if len(lowerCamelCase     ) > 1:
               _UpperCamelCase   :				Tuple       =     completion[: defs[1].start()]

        _UpperCamelCase   :				Optional[Any]       =     0

        _UpperCamelCase   :				int       =     [
            pos for pos in [find_re(lowerCamelCase				,	lowerCamelCase				,	lowerCamelCase     ) for terminal in terminals] if pos != -1
        ]

        if len(lowerCamelCase     ) > 0:
               return completion[: min(lowerCamelCase     )]
        else:
               return completion



