






'''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.
__lowerCAmelCase									=   {'LayoutLMv2Config', 'LayoutLMv3Config'}





@is_pipeline_test
class 						SCREAMING_SNAKE_CASE       (       unittest.TestCase							):
			snake_case__	=					MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING
			snake_case__	=					TF_MODEL_FOR_SEQUENCE_CLASSIFICATION_MAPPING

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






			def       SCREAMING_SNAKE_CASE   (			self   :      int	,    __SCREAMING_SNAKE_CASE   :      int	,    __SCREAMING_SNAKE_CASE   :      Optional[int]	,    __SCREAMING_SNAKE_CASE   :      List[Any]       )      ->      str:
							a_		:	Any									=   ZeroShotClassificationPipeline(
							    model=__SCREAMING_SNAKE_CASE	,    tokenizer=__SCREAMING_SNAKE_CASE	,    candidate_labels=['''polics''', '''health''']       )
							return classifier, ["Who are you voting for in 2020?", "My stomach hurts."]






			def       SCREAMING_SNAKE_CASE   (			self   :      Optional[Any]	,    __SCREAMING_SNAKE_CASE   :      Tuple	,    __SCREAMING_SNAKE_CASE   :      Optional[int]       )      ->      int:
							a_		:	List[Any]									=   classifier('''Who are you voting for in 2020?'''	,    candidate_labels='''politics'''       )
							self.assertEqual(__SCREAMING_SNAKE_CASE	,    {'''sequence''': ANY(__SCREAMING_SNAKE_CASE       ), '''labels''': [ANY(__SCREAMING_SNAKE_CASE       )], '''scores''': [ANY(__SCREAMING_SNAKE_CASE       )]}       )

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

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

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

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

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

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

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

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

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

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

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

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

							self.run_entailment_id(__SCREAMING_SNAKE_CASE       )






			def       SCREAMING_SNAKE_CASE   (			self   :      Union[str, Any]	,    __SCREAMING_SNAKE_CASE   :      Pipeline       )      ->      List[Any]:
							a_		:	Optional[Any]									=   zero_shot_classifier.model.config
							a_		:	str									=   config.labelaid
							a_		:	int									=   zero_shot_classifier.entailment_id

							a_		:	List[Any]									=   {'''LABEL_0''': 0, '''LABEL_1''': 1, '''LABEL_2''': 2}
							self.assertEqual(zero_shot_classifier.entailment_id	,    -1       )

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

							a_		:	Optional[int]									=   {'''ENTAIL''': 0, '''NON-ENTAIL''': 1}
							self.assertEqual(zero_shot_classifier.entailment_id	,    0       )

							a_		:	List[Any]									=   {'''ENTAIL''': 2, '''NEUTRAL''': 1, '''CONTR''': 0}
							self.assertEqual(zero_shot_classifier.entailment_id	,    2       )

							a_		:	int									=   original_labelaid
							self.assertEqual(__SCREAMING_SNAKE_CASE	,    zero_shot_classifier.entailment_id       )






			@require_torch
			def       SCREAMING_SNAKE_CASE   (			self   :      Tuple       )      ->      Union[str, Any]:
							a_		:	Optional[int]									=   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       SCREAMING_SNAKE_CASE   (			self   :      Any       )      ->      Any:
							a_		:	int									=   pipeline(
							    '''zero-shot-classification'''	,    model='''sshleifer/tiny-distilbert-base-cased-distilled-squad'''	,    framework='''pt'''	,    )
							a_		:	List[str]									=   zero_shot_classifier(
							    '''Who are you voting for in 2020?'''	,    candidate_labels=['''politics''', '''public health''', '''science''']       )

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






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

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






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

							self.assertEqual(
							    nested_simplify(__SCREAMING_SNAKE_CASE       )	,    {
							        '''sequence''': '''Who are you voting for in 2020?''',
							        '''labels''': ['''politics''', '''public health''', '''science'''],
							        '''scores''': [0.976, 0.015, 0.009],
							    }	,    )
							a_		:	Any									=   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=__SCREAMING_SNAKE_CASE	,    )
							self.assertEqual(
							    nested_simplify(__SCREAMING_SNAKE_CASE       )	,    {
							        '''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       SCREAMING_SNAKE_CASE   (			self   :      List[Any]       )      ->      str:
							a_		:	int									=   pipeline('''zero-shot-classification'''	,    model='''roberta-large-mnli'''	,    framework='''tf'''       )
							a_		:	Any									=   zero_shot_classifier(
							    '''Who are you voting for in 2020?'''	,    candidate_labels=['''politics''', '''public health''', '''science''']       )

							self.assertEqual(
							    nested_simplify(__SCREAMING_SNAKE_CASE       )	,    {
							        '''sequence''': '''Who are you voting for in 2020?''',
							        '''labels''': ['''politics''', '''public health''', '''science'''],
							        '''scores''': [0.976, 0.015, 0.009],
							    }	,    )
							a_		:	List[str]									=   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=__SCREAMING_SNAKE_CASE	,    )
							self.assertEqual(
							    nested_simplify(__SCREAMING_SNAKE_CASE       )	,    {
							        '''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],
							    }	,    )












'''simple docstring'''







from __future__ import annotations





def 		_UpperCAmelCase (				__A				: str    ,		__A				: str   ):
				a_		:	int									=   get_failure_array(__A   )

				# 2) Step through text searching for pattern
				a_					,      a_		:	Any									=   0, 0  # index into text, pattern
				while i < len(__A   ):
								if pattern[j] == text[i]:
												if j == (len(__A   ) - 1):
																return True
												j += 1

								# if this is a prefix in our pattern
								# just go back far enough to continue
								elif j > 0:
												a_		:	Any									=   failure[j - 1]
												continue
								i += 1
				return False





def 		_UpperCAmelCase (				__A				: str   ):
				a_		:	Optional[Any]									=   [0]
				a_		:	Any									=   0
				a_		:	int									=   1
				while j < len(__A   ):
								if pattern[i] == pattern[j]:
												i += 1
								elif i > 0:
												a_		:	List[Any]									=   failure[i - 1]
												continue
								j += 1
								failure.append(__A   )
				return failure


if __name__ == "__main__":
		# Test 1)
		__lowerCAmelCase									=   'abc1abc12'
		__lowerCAmelCase									=   'alskfjaldsabc1abc1abc12k23adsfabcabc'
		__lowerCAmelCase									=   'alskfjaldsk23adsfabcabc'
		assert kmp(pattern, texta) and not kmp(pattern, texta)

		# Test 2)
		__lowerCAmelCase									=   'ABABX'
		__lowerCAmelCase									=   'ABABZABABYABABX'
		assert kmp(pattern, text)

		# Test 3)
		__lowerCAmelCase									=   'AAAB'
		__lowerCAmelCase									=   'ABAAAAAB'
		assert kmp(pattern, text)

		# Test 4)
		__lowerCAmelCase									=   'abcdabcy'
		__lowerCAmelCase									=   'abcxabcdabxabcdabcdabcy'
		assert kmp(pattern, text)

		# Test 5)
		__lowerCAmelCase									=   'aabaabaaa'
		assert get_failure_array(pattern) == [0, 1, 0, 1, 2, 3, 4, 5, 2]




