





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 			__UpperCamelCase    (							unittest.TestCase    ):
     __A	:  List[Any]							  =   MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING
     __A	:  List[str]							  =   TF_MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING

     if model_mapping is not None:
          __A	:  Any							  =   {config: model for config, model in model_mapping.items() if config.__name__ not in _TO_SKIP}
     if tf_model_mapping is not None:
          __A	:  Optional[int]							  =   {
              config: model for config, model in tf_model_mapping.items() if config.__name__ not in _TO_SKIP
          }





     def 		UpperCamelCase(     self				,							_UpperCamelCase				,							_UpperCamelCase				,							_UpperCamelCase					):
        _UpperCAmelCase           =   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					):
        _UpperCAmelCase           =   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
        _UpperCAmelCase           =   classifier('''Who are you voting for in 2020?'''				,							['''politics''']					)
        self.assertEqual(_UpperCamelCase				,							{'''sequence''': ANY(_UpperCamelCase					), '''labels''': [ANY(_UpperCamelCase					)], '''scores''': [ANY(_UpperCamelCase					)]}					)

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

        _UpperCAmelCase           =   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					)

        _UpperCAmelCase           =   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					)

        _UpperCAmelCase           =   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
        _UpperCAmelCase           =   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					)
            ]				,							)
        _UpperCAmelCase           =   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					):
        _UpperCAmelCase           =   zero_shot_classifier.model.config
        _UpperCAmelCase           =   config.labelaid
        _UpperCAmelCase           =   zero_shot_classifier.entailment_id

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

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

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

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

        _UpperCAmelCase           =   original_labelaid
        self.assertEqual(_UpperCamelCase				,							zero_shot_classifier.entailment_id					)





     @require_torch
     def 		UpperCamelCase(     self					):
        _UpperCAmelCase           =   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					):
        _UpperCAmelCase           =   pipeline(
            '''zero-shot-classification'''				,							model='''sshleifer/tiny-distilbert-base-cased-distilled-squad'''				,							framework='''pt'''				,							)
        _UpperCAmelCase           =   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					):
        _UpperCAmelCase           =   pipeline(
            '''zero-shot-classification'''				,							model='''sshleifer/tiny-distilbert-base-cased-distilled-squad'''				,							framework='''tf'''				,							)
        _UpperCAmelCase           =   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					):
        _UpperCAmelCase           =   pipeline('''zero-shot-classification'''				,							model='''roberta-large-mnli'''				,							framework='''pt'''					)
        _UpperCAmelCase           =   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],
            }				,							)
        _UpperCAmelCase           =   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					):
        _UpperCAmelCase           =   pipeline('''zero-shot-classification'''				,							model='''roberta-large-mnli'''				,							framework='''tf'''					)
        _UpperCAmelCase           =   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],
            }				,							)
        _UpperCAmelCase           =   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],
            }				,							)






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


UpperCAmelCase_           =	logging.get_logger(__name__)

UpperCAmelCase_           =	{
    "microsoft/biogpt": "https://huggingface.co/microsoft/biogpt/resolve/main/config.json",
    # See all BioGPT models at https://huggingface.co/models?filter=biogpt
}




class 			__UpperCamelCase    (							A__    ):
     __A	:  Any							  =   """biogpt"""





     def __init__(     self				,							_UpperCamelCase=42384				,							_UpperCamelCase=1024				,							_UpperCamelCase=24				,							_UpperCamelCase=16				,							_UpperCamelCase=4096				,							_UpperCamelCase="gelu"				,							_UpperCamelCase=0.1				,							_UpperCamelCase=0.1				,							_UpperCamelCase=1024				,							_UpperCamelCase=0.02				,							_UpperCamelCase=1e-12				,							_UpperCamelCase=True				,							_UpperCamelCase=True				,							_UpperCamelCase=0.0				,							_UpperCamelCase=0.0				,							_UpperCamelCase=1				,							_UpperCamelCase=0				,							_UpperCamelCase=2				,							**_UpperCamelCase				,							):
        _UpperCAmelCase           =   vocab_size
        _UpperCAmelCase           =   max_position_embeddings
        _UpperCAmelCase           =   hidden_size
        _UpperCAmelCase           =   num_hidden_layers
        _UpperCAmelCase           =   num_attention_heads
        _UpperCAmelCase           =   intermediate_size
        _UpperCAmelCase           =   hidden_act
        _UpperCAmelCase           =   hidden_dropout_prob
        _UpperCAmelCase           =   attention_probs_dropout_prob
        _UpperCAmelCase           =   initializer_range
        _UpperCAmelCase           =   layer_norm_eps
        _UpperCAmelCase           =   scale_embedding
        _UpperCAmelCase           =   use_cache
        _UpperCAmelCase           =   layerdrop
        _UpperCAmelCase           =   activation_dropout
        super().__init__(pad_token_id=_UpperCamelCase				,							bos_token_id=_UpperCamelCase				,							eos_token_id=_UpperCamelCase				,							**_UpperCamelCase					)