




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.
__SCREAMING_SNAKE_CASE 						={"""LayoutLMv2Config""", """LayoutLMv3Config"""}







@is_pipeline_test
class  __magic_name__						(  unittest.TestCase):
				'''simple docstring'''







				SCREAMING_SNAKE_CASE__					:							Union[str, Any]	      =					MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING
				SCREAMING_SNAKE_CASE__					:							List[str]	      =					TF_MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING

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


				def     _A							(							self:   Dict		,					_lowerCamelCase:   str		,					_lowerCamelCase:   Any		,					_lowerCamelCase:   Any		):
											SCREAMING_SNAKE_CASE_   	=    ZeroShotClassificationPipeline(
											    model=_lowerCamelCase		,					tokenizer=_lowerCamelCase		,					candidate_labels=['''polics''', '''health''']		)
											return classifier, ["Who are you voting for in 2020?", "My stomach hurts."]


				def     _A							(							self:   Tuple		,					_lowerCamelCase:   List[Any]		,					_lowerCamelCase:   Union[str, Any]		):
											SCREAMING_SNAKE_CASE_   	=    classifier('''Who are you voting for in 2020?'''		,					candidate_labels='''politics'''		)
											self.assertEqual(_lowerCamelCase		,					{'''sequence''': ANY(_lowerCamelCase		), '''labels''': [ANY(_lowerCamelCase		)], '''scores''': [ANY(_lowerCamelCase		)]}		)

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

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

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

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

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

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

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

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

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

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

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

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

											self.run_entailment_id(_lowerCamelCase		)


				def     _A							(							self:   List[Any]		,					_lowerCamelCase:   Pipeline		):
											SCREAMING_SNAKE_CASE_   	=    zero_shot_classifier.model.config
											SCREAMING_SNAKE_CASE_   	=    config.labelaid
											SCREAMING_SNAKE_CASE_   	=    zero_shot_classifier.entailment_id

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

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

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

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

											SCREAMING_SNAKE_CASE_   	=    original_labelaid
											self.assertEqual(_lowerCamelCase		,					zero_shot_classifier.entailment_id		)


				@require_torch
				def     _A							(							self:   Dict		):
											SCREAMING_SNAKE_CASE_   	=    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?''' * 1_00		,					candidate_labels=['''politics''', '''public health''', '''science''']		)


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

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


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

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


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

											self.assertEqual(
											    nested_simplify(_lowerCamelCase		)		,					{
											        '''sequence''': '''Who are you voting for in 2020?''',
											        '''labels''': ['''politics''', '''public health''', '''science'''],
											        '''scores''': [0.9_76, 0.0_15, 0.0_09],
											    }		,					)
											SCREAMING_SNAKE_CASE_   	=    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=_lowerCamelCase		,					)
											self.assertEqual(
											    nested_simplify(_lowerCamelCase		)		,					{
											        '''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.8_17, 0.7_13, 0.0_18, 0.0_18],
											    }		,					)





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

											self.assertEqual(
											    nested_simplify(_lowerCamelCase		)		,					{
											        '''sequence''': '''Who are you voting for in 2020?''',
											        '''labels''': ['''politics''', '''public health''', '''science'''],
											        '''scores''': [0.9_76, 0.0_15, 0.0_09],
											    }		,					)
											SCREAMING_SNAKE_CASE_   	=    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=_lowerCamelCase		,					)
											self.assertEqual(
											    nested_simplify(_lowerCamelCase		)		,					{
											        '''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.8_17, 0.7_13, 0.0_18, 0.0_18],
											    }		,					)








from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_torch_available


__SCREAMING_SNAKE_CASE 						={
    """configuration_xlm_roberta_xl""": [
        """XLM_ROBERTA_XL_PRETRAINED_CONFIG_ARCHIVE_MAP""",
        """XLMRobertaXLConfig""",
        """XLMRobertaXLOnnxConfig""",
    ],
}

try:
			if not is_torch_available():
						raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
			pass
else:
			__SCREAMING_SNAKE_CASE 						=[
			    """XLM_ROBERTA_XL_PRETRAINED_MODEL_ARCHIVE_LIST""",
			    """XLMRobertaXLForCausalLM""",
			    """XLMRobertaXLForMaskedLM""",
			    """XLMRobertaXLForMultipleChoice""",
			    """XLMRobertaXLForQuestionAnswering""",
			    """XLMRobertaXLForSequenceClassification""",
			    """XLMRobertaXLForTokenClassification""",
			    """XLMRobertaXLModel""",
			    """XLMRobertaXLPreTrainedModel""",
			]

if TYPE_CHECKING:
			from .configuration_xlm_roberta_xl import (
			    XLM_ROBERTA_XL_PRETRAINED_CONFIG_ARCHIVE_MAP,
			    XLMRobertaXLConfig,
			    XLMRobertaXLOnnxConfig,
			)

			try:
						if not is_torch_available():
									raise OptionalDependencyNotAvailable()
			except OptionalDependencyNotAvailable:
						pass
			else:
						from .modeling_xlm_roberta_xl import (
						    XLM_ROBERTA_XL_PRETRAINED_MODEL_ARCHIVE_LIST,
						    XLMRobertaXLForCausalLM,
						    XLMRobertaXLForMaskedLM,
						    XLMRobertaXLForMultipleChoice,
						    XLMRobertaXLForQuestionAnswering,
						    XLMRobertaXLForSequenceClassification,
						    XLMRobertaXLForTokenClassification,
						    XLMRobertaXLModel,
						    XLMRobertaXLPreTrainedModel,
						)

else:
			import sys

			__SCREAMING_SNAKE_CASE 						=_LazyModule(__name__, globals()["""__file__"""], _import_structure)


