import json
from typing import List, Optional, Tuple

from tokenizers import normalizers

from ...tokenization_utils_fast import PreTrainedTokenizerFast
from ...utils import logging
from .tokenization_mobilebert import MobileBertTokenizer


_snake_case								=    logging.get_logger(__name__)

_snake_case								=    {'''vocab_file''': '''vocab.txt''', '''tokenizer_file''': '''tokenizer.json'''}

_snake_case								=    {
    '''vocab_file''': {'''mobilebert-uncased''': '''https://huggingface.co/google/mobilebert-uncased/resolve/main/vocab.txt'''},
    '''tokenizer_file''': {
        '''mobilebert-uncased''': '''https://huggingface.co/google/mobilebert-uncased/resolve/main/tokenizer.json'''
    },
}

_snake_case								=    {'''mobilebert-uncased''': 512}


_snake_case								=    {}




class        _snake_case    (    _lowercase					):
					lowerCamelCase__:		Any	=  VOCAB_FILES_NAMES
					lowerCamelCase__:		Union[str, Any]	=  PRETRAINED_VOCAB_FILES_MAP
					lowerCamelCase__:		int	=  PRETRAINED_INIT_CONFIGURATION
					lowerCamelCase__:		Dict	=  PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
					lowerCamelCase__:		List[Any]	=  MobileBertTokenizer
					def __init__(	self:					Dict						,	__lowerCamelCase:					List[str]=None						,	__lowerCamelCase:					str=None						,	__lowerCamelCase:					Union[str, Any]=True						,	__lowerCamelCase:					List[Any]="[UNK]"						,	__lowerCamelCase:					int="[SEP]"						,	__lowerCamelCase:					Optional[Any]="[PAD]"						,	__lowerCamelCase:					Optional[Any]="[CLS]"						,	__lowerCamelCase:					Optional[Any]="[MASK]"						,	__lowerCamelCase:					List[str]=True						,	__lowerCamelCase:					Tuple=None						,	**__lowerCamelCase:					Optional[int]						,	)     ->					str:
												super().__init__(
												    __lowerCamelCase						,	tokenizer_file=__lowerCamelCase						,	do_lower_case=__lowerCamelCase						,	unk_token=__lowerCamelCase						,	sep_token=__lowerCamelCase						,	pad_token=__lowerCamelCase						,	cls_token=__lowerCamelCase						,	mask_token=__lowerCamelCase						,	tokenize_chinese_chars=__lowerCamelCase						,	strip_accents=__lowerCamelCase						,	**__lowerCamelCase						,	)

												__UpperCAmelCase    :      Optional[Any]       = json.loads(self.backend_tokenizer.normalizer.__getstate__()  )
												if (
												    normalizer_state.get("lowercase"						,	__lowerCamelCase  ) != do_lower_case
												    or normalizer_state.get("strip_accents"						,	__lowerCamelCase  ) != strip_accents
												    or normalizer_state.get("handle_chinese_chars"						,	__lowerCamelCase  ) != tokenize_chinese_chars
												):
																			__UpperCAmelCase    :      str       = getattr(__lowerCamelCase						,	normalizer_state.pop("type"  )  )
																			__UpperCAmelCase    :      Dict       = do_lower_case
																			__UpperCAmelCase    :      Union[str, Any]       = strip_accents
																			__UpperCAmelCase    :      Tuple       = tokenize_chinese_chars
																			__UpperCAmelCase    :      Union[str, Any]       = normalizer_class(**__lowerCamelCase  )

												__UpperCAmelCase    :      Optional[Any]       = do_lower_case
					def  _lowerCamelCase			(	self:					int						,	__lowerCamelCase:					Optional[int]						,	__lowerCamelCase:					Union[str, Any]=None  )     ->					Tuple:
												__UpperCAmelCase    :      str       = [self.cls_token_id] + token_ids_a + [self.sep_token_id]

												if token_ids_a:
																			output += token_ids_a + [self.sep_token_id]

												return output
					def  _lowerCamelCase			(	self:					str						,	__lowerCamelCase:					List[str]						,	__lowerCamelCase:					Any = None  )     ->					List[int]:
												__UpperCAmelCase    :      Optional[int]       = [self.sep_token_id]
												__UpperCAmelCase    :      int       = [self.cls_token_id]
												if token_ids_a is None:
																			return len(cls + token_ids_a + sep  ) * [0]
												return len(cls + token_ids_a + sep  ) * [0] + len(token_ids_a + sep  ) * [1]





					def  _lowerCamelCase			(	self:					Any						,	__lowerCamelCase:					List[str]						,	__lowerCamelCase:					Optional[Any] = None  )     ->					Tuple[str]:
												__UpperCAmelCase    :      List[Any]       = self._tokenizer.model.save(__lowerCamelCase						,	name=__lowerCamelCase  )
												return tuple(__lowerCamelCase  )










'''simple docstring'''


import unittest

from transformers import (
    MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING,
    TF_MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING,
    Pipeline,
    ZeroShotClassificationPipeline,
    pipeline,
)
from transformers.testing_utils import is_pipeline_test, nested_simplify, require_tf, require_torch, slow

from .test_pipelines_common import ANY


# These 2 model types require different inputs than those of the usual text models.
UpperCAmelCase_					=   {"LayoutLMv2Config", "LayoutLMv3Config"}





@is_pipeline_test
class  __lowercase    (	unittest.TestCase			):
   _a    						=   MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING
   _a    						=   TF_MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING

   if model_mapping is not None:
      _a    						=   {config: model for config, model in model_mapping.items() if config.__name__ not in _TO_SKIP}
   if tf_model_mapping is not None:
      _a    						=   {
          config: model for config, model in tf_model_mapping.items() if config.__name__ not in _TO_SKIP
      }







   def 		UpperCamelCase__      (						self   ,				UpperCamelCase   ,				UpperCamelCase   ,				UpperCamelCase   )					->     Optional[Any]:
     __a								=       ZeroShotClassificationPipeline(
         model=UpperCamelCase   ,				tokenizer=UpperCamelCase   ,				candidate_labels=['polics', 'health']   )
     return classifier, ["Who are you voting for in 2020?", "My stomach hurts."]







   def 		UpperCamelCase__      (						self   ,				UpperCamelCase   ,				UpperCamelCase   )					->     Tuple:
     __a								=       classifier('Who are you voting for in 2020?'   ,				candidate_labels='politics'   )
     self.assertEqual(UpperCamelCase   ,				{'sequence': ANY(UpperCamelCase   ), 'labels': [ANY(UpperCamelCase   )], 'scores': [ANY(UpperCamelCase   )]}   )

     # No kwarg
     __a								=       classifier('Who are you voting for in 2020?'   ,				['politics']   )
     self.assertEqual(UpperCamelCase   ,				{'sequence': ANY(UpperCamelCase   ), 'labels': [ANY(UpperCamelCase   )], 'scores': [ANY(UpperCamelCase   )]}   )

     __a								=       classifier('Who are you voting for in 2020?'   ,				candidate_labels=['politics']   )
     self.assertEqual(UpperCamelCase   ,				{'sequence': ANY(UpperCamelCase   ), 'labels': [ANY(UpperCamelCase   )], 'scores': [ANY(UpperCamelCase   )]}   )

     __a								=       classifier('Who are you voting for in 2020?'   ,				candidate_labels='politics, public health'   )
     self.assertEqual(
         UpperCamelCase   ,				{'sequence': ANY(UpperCamelCase   ), 'labels': [ANY(UpperCamelCase   ), ANY(UpperCamelCase   )], 'scores': [ANY(UpperCamelCase   ), ANY(UpperCamelCase   )]}   )
     self.assertAlmostEqual(sum(nested_simplify(outputs['scores']   )   )   ,				1.0   )

     __a								=       classifier('Who are you voting for in 2020?'   ,				candidate_labels=['politics', 'public health']   )
     self.assertEqual(
         UpperCamelCase   ,				{'sequence': ANY(UpperCamelCase   ), 'labels': [ANY(UpperCamelCase   ), ANY(UpperCamelCase   )], 'scores': [ANY(UpperCamelCase   ), ANY(UpperCamelCase   )]}   )
     self.assertAlmostEqual(sum(nested_simplify(outputs['scores']   )   )   ,				1.0   )

     __a								=       classifier(
         'Who are you voting for in 2020?'   ,				candidate_labels='politics'   ,				hypothesis_template='This text is about {}'   )
     self.assertEqual(UpperCamelCase   ,				{'sequence': ANY(UpperCamelCase   ), 'labels': [ANY(UpperCamelCase   )], 'scores': [ANY(UpperCamelCase   )]}   )

     # https://github.com/huggingface/transformers/issues/13846
     __a								=       classifier(['I am happy']   ,				['positive', 'negative']   )
     self.assertEqual(
         UpperCamelCase   ,				[
             {'sequence': ANY(UpperCamelCase   ), 'labels': [ANY(UpperCamelCase   ), ANY(UpperCamelCase   )], 'scores': [ANY(UpperCamelCase   ), ANY(UpperCamelCase   )]}
             for i in range(1   )
         ]   ,				)
     __a								=       classifier(['I am happy', 'I am sad']   ,				['positive', 'negative']   )
     self.assertEqual(
         UpperCamelCase   ,				[
             {'sequence': ANY(UpperCamelCase   ), 'labels': [ANY(UpperCamelCase   ), ANY(UpperCamelCase   )], 'scores': [ANY(UpperCamelCase   ), ANY(UpperCamelCase   )]}
             for i in range(2   )
         ]   ,				)

     with self.assertRaises(UpperCamelCase   ):
       classifier(''   ,				candidate_labels='politics'   )

     with self.assertRaises(UpperCamelCase   ):
       classifier(UpperCamelCase   ,				candidate_labels='politics'   )

     with self.assertRaises(UpperCamelCase   ):
       classifier('Who are you voting for in 2020?'   ,				candidate_labels=''   )

     with self.assertRaises(UpperCamelCase   ):
       classifier('Who are you voting for in 2020?'   ,				candidate_labels=UpperCamelCase   )

     with self.assertRaises(UpperCamelCase   ):
       classifier(
           'Who are you voting for in 2020?'   ,				candidate_labels='politics'   ,				hypothesis_template='Not formatting template'   ,				)

     with self.assertRaises(UpperCamelCase   ):
       classifier(
           'Who are you voting for in 2020?'   ,				candidate_labels='politics'   ,				hypothesis_template=UpperCamelCase   ,				)

     self.run_entailment_id(UpperCamelCase   )







   def 		UpperCamelCase__      (						self   ,				UpperCamelCase   )					->     Optional[int]:
     __a								=       zero_shot_classifier.model.config
     __a								=       config.labelaid
     __a								=       zero_shot_classifier.entailment_id

     __a								=       {'LABEL_0': 0, 'LABEL_1': 1, 'LABEL_2': 2}
     self.assertEqual(zero_shot_classifier.entailment_id   ,				-1   )

     __a								=       {'entailment': 0, 'neutral': 1, 'contradiction': 2}
     self.assertEqual(zero_shot_classifier.entailment_id   ,				0   )

     __a								=       {'ENTAIL': 0, 'NON-ENTAIL': 1}
     self.assertEqual(zero_shot_classifier.entailment_id   ,				0   )

     __a								=       {'ENTAIL': 2, 'NEUTRAL': 1, 'CONTR': 0}
     self.assertEqual(zero_shot_classifier.entailment_id   ,				2   )

     __a								=       original_labelaid
     self.assertEqual(UpperCamelCase   ,				zero_shot_classifier.entailment_id   )







   @require_torch
   def 		UpperCamelCase__      (						self   )					->     Tuple:
     __a								=       pipeline(
         'zero-shot-classification'   ,				model='sshleifer/tiny-distilbert-base-cased-distilled-squad'   ,				framework='pt'   ,				)
     # There was a regression in 4.10 for this
     # Adding a test so we don't make the mistake again.
     # https://github.com/huggingface/transformers/issues/13381#issuecomment-912343499
     zero_shot_classifier(
         'Who are you voting for in 2020?' * 100   ,				candidate_labels=['politics', 'public health', 'science']   )







   @require_torch
   def 		UpperCamelCase__      (						self   )					->     List[str]:
     __a								=       pipeline(
         'zero-shot-classification'   ,				model='sshleifer/tiny-distilbert-base-cased-distilled-squad'   ,				framework='pt'   ,				)
     __a								=       zero_shot_classifier(
         'Who are you voting for in 2020?'   ,				candidate_labels=['politics', 'public health', 'science']   )

     self.assertEqual(
         nested_simplify(UpperCamelCase   )   ,				{
             'sequence': 'Who are you voting for in 2020?',
             'labels': ['science', 'public health', 'politics'],
             'scores': [0.333, 0.333, 0.333],
         }   ,				)







   @require_tf
   def 		UpperCamelCase__      (						self   )					->     Dict:
     __a								=       pipeline(
         'zero-shot-classification'   ,				model='sshleifer/tiny-distilbert-base-cased-distilled-squad'   ,				framework='tf'   ,				)
     __a								=       zero_shot_classifier(
         'Who are you voting for in 2020?'   ,				candidate_labels=['politics', 'public health', 'science']   )

     self.assertEqual(
         nested_simplify(UpperCamelCase   )   ,				{
             'sequence': 'Who are you voting for in 2020?',
             'labels': ['science', 'public health', 'politics'],
             'scores': [0.333, 0.333, 0.333],
         }   ,				)







   @slow
   @require_torch
   def 		UpperCamelCase__      (						self   )					->     List[str]:
     __a								=       pipeline('zero-shot-classification'   ,				model='roberta-large-mnli'   ,				framework='pt'   )
     __a								=       zero_shot_classifier(
         'Who are you voting for in 2020?'   ,				candidate_labels=['politics', 'public health', 'science']   )

     self.assertEqual(
         nested_simplify(UpperCamelCase   )   ,				{
             'sequence': 'Who are you voting for in 2020?',
             'labels': ['politics', 'public health', 'science'],
             'scores': [0.976, 0.015, 0.009],
         }   ,				)
     __a								=       zero_shot_classifier(
         'The dominant sequence transduction models are based on complex recurrent or convolutional neural networks'
         ' in an encoder-decoder configuration. The best performing models also connect the encoder and decoder'
         ' through an attention mechanism. We propose a new simple network architecture, the Transformer, based'
         ' solely on attention mechanisms, dispensing with recurrence and convolutions entirely. Experiments on two'
         ' machine translation tasks show these models to be superior in quality while being more parallelizable'
         ' and requiring significantly less time to train. Our model achieves 28.4 BLEU on the WMT 2014'
         ' English-to-German translation task, improving over the existing best results, including ensembles by'
         ' over 2 BLEU. On the WMT 2014 English-to-French translation task, our model establishes a new'
         ' single-model state-of-the-art BLEU score of 41.8 after training for 3.5 days on eight GPUs, a small'
         ' fraction of the training costs of the best models from the literature. We show that the Transformer'
         ' generalizes well to other tasks by applying it successfully to English constituency parsing both with'
         ' large and limited training data.'   ,				candidate_labels=['machine learning', 'statistics', 'translation', 'vision']   ,				multi_label=UpperCamelCase   ,				)
     self.assertEqual(
         nested_simplify(UpperCamelCase   )   ,				{
             'sequence': (
                 'The dominant sequence transduction models are based on complex recurrent or convolutional neural'
                 ' networks in an encoder-decoder configuration. The best performing models also connect the'
                 ' encoder and decoder through an attention mechanism. We propose a new simple network'
                 ' architecture, the Transformer, based solely on attention mechanisms, dispensing with recurrence'
                 ' and convolutions entirely. Experiments on two machine translation tasks show these models to be'
                 ' superior in quality while being more parallelizable and requiring significantly less time to'
                 ' train. Our model achieves 28.4 BLEU on the WMT 2014 English-to-German translation task,'
                 ' improving over the existing best results, including ensembles by over 2 BLEU. On the WMT 2014'
                 ' English-to-French translation task, our model establishes a new single-model state-of-the-art'
                 ' BLEU score of 41.8 after training for 3.5 days on eight GPUs, a small fraction of the training'
                 ' costs of the best models from the literature. We show that the Transformer generalizes well to'
                 ' other tasks by applying it successfully to English constituency parsing both with large and'
                 ' limited training data.'
             ),
             'labels': ['translation', 'machine learning', 'vision', 'statistics'],
             'scores': [0.817, 0.713, 0.018, 0.018],
         }   ,				)







   @slow
   @require_tf
   def 		UpperCamelCase__      (						self   )					->     Union[str, Any]:
     __a								=       pipeline('zero-shot-classification'   ,				model='roberta-large-mnli'   ,				framework='tf'   )
     __a								=       zero_shot_classifier(
         'Who are you voting for in 2020?'   ,				candidate_labels=['politics', 'public health', 'science']   )

     self.assertEqual(
         nested_simplify(UpperCamelCase   )   ,				{
             'sequence': 'Who are you voting for in 2020?',
             'labels': ['politics', 'public health', 'science'],
             'scores': [0.976, 0.015, 0.009],
         }   ,				)
     __a								=       zero_shot_classifier(
         'The dominant sequence transduction models are based on complex recurrent or convolutional neural networks'
         ' in an encoder-decoder configuration. The best performing models also connect the encoder and decoder'
         ' through an attention mechanism. We propose a new simple network architecture, the Transformer, based'
         ' solely on attention mechanisms, dispensing with recurrence and convolutions entirely. Experiments on two'
         ' machine translation tasks show these models to be superior in quality while being more parallelizable'
         ' and requiring significantly less time to train. Our model achieves 28.4 BLEU on the WMT 2014'
         ' English-to-German translation task, improving over the existing best results, including ensembles by'
         ' over 2 BLEU. On the WMT 2014 English-to-French translation task, our model establishes a new'
         ' single-model state-of-the-art BLEU score of 41.8 after training for 3.5 days on eight GPUs, a small'
         ' fraction of the training costs of the best models from the literature. We show that the Transformer'
         ' generalizes well to other tasks by applying it successfully to English constituency parsing both with'
         ' large and limited training data.'   ,				candidate_labels=['machine learning', 'statistics', 'translation', 'vision']   ,				multi_label=UpperCamelCase   ,				)
     self.assertEqual(
         nested_simplify(UpperCamelCase   )   ,				{
             'sequence': (
                 'The dominant sequence transduction models are based on complex recurrent or convolutional neural'
                 ' networks in an encoder-decoder configuration. The best performing models also connect the'
                 ' encoder and decoder through an attention mechanism. We propose a new simple network'
                 ' architecture, the Transformer, based solely on attention mechanisms, dispensing with recurrence'
                 ' and convolutions entirely. Experiments on two machine translation tasks show these models to be'
                 ' superior in quality while being more parallelizable and requiring significantly less time to'
                 ' train. Our model achieves 28.4 BLEU on the WMT 2014 English-to-German translation task,'
                 ' improving over the existing best results, including ensembles by over 2 BLEU. On the WMT 2014'
                 ' English-to-French translation task, our model establishes a new single-model state-of-the-art'
                 ' BLEU score of 41.8 after training for 3.5 days on eight GPUs, a small fraction of the training'
                 ' costs of the best models from the literature. We show that the Transformer generalizes well to'
                 ' other tasks by applying it successfully to English constituency parsing both with large and'
                 ' limited training data.'
             ),
             'labels': ['translation', 'machine learning', 'vision', 'statistics'],
             'scores': [0.817, 0.713, 0.018, 0.018],
         }   ,				)



