



'''simple docstring'''





import json
import os
import unittest

from transformers import DebertaTokenizer, DebertaTokenizerFast
from transformers.models.deberta.tokenization_deberta import VOCAB_FILES_NAMES
from transformers.testing_utils import slow

from ...test_tokenization_common import TokenizerTesterMixin



class  snake_case__						(    SCREAMING_SNAKE_CASE_  ,     unittest.TestCase				):
 A__				= DebertaTokenizer
 A__				= True
 A__				= DebertaTokenizerFast
 def A_   (   self						:							Optional[int]  )      ->   str:







       '''simple docstring'''
       super().setUp()

       # Adapted from Sennrich et al. 2015 and https://github.com/rsennrich/subword-nmt
       __snake_case :   Union[str, Any]													=    [
           'l',
           'o',
           'w',
           'e',
           'r',
           's',
           't',
           'i',
           'd',
           'n',
           '\u0120',
           '\u0120l',
           '\u0120n',
           '\u0120lo',
           '\u0120low',
           'er',
           '\u0120lowest',
           '\u0120newer',
           '\u0120wider',
           '[UNK]',
       ]
       __snake_case :   List[str]													=    dict(zip(__a      ,     range(len(__a  )  )  )  )
       __snake_case :   int													=    ['#version: 0.2', '\u0120 l', '\u0120l o', '\u0120lo w', 'e r', '']
       __snake_case :   Any													=    {'unk_token': '[UNK]'}

       __snake_case :   Union[str, Any]													=    os.path.join(self.tmpdirname      ,     VOCAB_FILES_NAMES['vocab_file']  )
       __snake_case :   Dict													=    os.path.join(self.tmpdirname      ,     VOCAB_FILES_NAMES['merges_file']  )
       with open(self.vocab_file      ,     'w'      ,     encoding='utf-8'  ) as fp:
             fp.write(json.dumps(__a  ) + '\n'  )
       with open(self.merges_file      ,     'w'      ,     encoding='utf-8'  ) as fp:
             fp.write('\n'.join(__a  )  )
 def A_   (   self						:							Optional[int]      ,     **__a						:							List[Any]  )      ->   Optional[Any]:







       '''simple docstring'''
       kwargs.update(self.special_tokens_map  )
       return self.tokenizer_class.from_pretrained(self.tmpdirname      ,     **__a  )
 def A_   (   self						:							Optional[int]      ,     __a						:							Dict  )      ->   List[str]:







       '''simple docstring'''
       __snake_case :   Union[str, Any]													=    'lower newer'
       __snake_case :   List[Any]													=    'lower newer'
       return input_text, output_text
 def A_   (   self						:							Dict  )      ->   Union[str, Any]:







       '''simple docstring'''
       __snake_case :   str													=    self.get_tokenizer()
       __snake_case :   List[str]													=    'lower newer'
       __snake_case :   Tuple													=    ['l', 'o', 'w', 'er', '\u0120', 'n', 'e', 'w', 'er']
       __snake_case :   Optional[int]													=    tokenizer.tokenize(__a  )
       self.assertListEqual(__a      ,     __a  )

       __snake_case :   str													=    tokens + [tokenizer.unk_token]
       __snake_case :   Tuple													=    [0, 1, 2, 15, 10, 9, 3, 2, 15, 19]
       self.assertListEqual(tokenizer.convert_tokens_to_ids(__a  )      ,     __a  )
 def A_   (   self						:							List[Any]  )      ->   Dict:







       '''simple docstring'''
       __snake_case :   List[str]													=    self.get_tokenizer()
       __snake_case :   List[str]													=    tokenizer('Hello'      ,     'World'  )
       __snake_case :   int													=    [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1]
       self.assertListEqual(tokd['token_type_ids']      ,     __a  )
 @slow
 def A_   (   self						:							Dict  )      ->   str:







       '''simple docstring'''
       __snake_case :   str													=    self.tokenizer_class.from_pretrained('microsoft/deberta-base'  )

       __snake_case :   str													=    tokenizer.encode('sequence builders'      ,     add_special_tokens=__a  )
       __snake_case :   Any													=    tokenizer.encode('multi-sequence build'      ,     add_special_tokens=__a  )

       __snake_case :   List[Any]													=    tokenizer.encode(
           'sequence builders'      ,     add_special_tokens=__a      ,     add_prefix_space=__a  )
       __snake_case :   Union[str, Any]													=    tokenizer.encode(
           'sequence builders'      ,     'multi-sequence build'      ,     add_special_tokens=__a      ,     add_prefix_space=__a  )

       __snake_case :   int													=    tokenizer.build_inputs_with_special_tokens(__a  )
       __snake_case :   Tuple													=    tokenizer.build_inputs_with_special_tokens(__a      ,     __a  )

       assert encoded_sentence == encoded_text_from_decode
       assert encoded_pair == encoded_pair_from_decode





 @slow
 def A_   (   self						:							Optional[Any]  )      ->   Optional[int]:







       '''simple docstring'''
       __snake_case :   int													=    [self.tokenizer_class]
       if self.test_rust_tokenizer:
             tokenizer_classes.append(self.rust_tokenizer_class  )

       for tokenizer_class in tokenizer_classes:
             __snake_case :   List[Any]													=    tokenizer_class.from_pretrained('microsoft/deberta-base'  )

             __snake_case :   int													=    [
                 'ALBERT: A Lite BERT for Self-supervised Learning of Language Representations',
                 'ALBERT incorporates two parameter reduction techniques',
                 'The first one is a factorized embedding parameterization. By decomposing the large vocabulary'
                 ' embedding matrix into two small matrices, we separate the size of the hidden layers from the size of'
                 ' vocabulary embedding.',
             ]

             __snake_case :   Union[str, Any]													=    tokenizer(__a      ,     padding=__a  )
             __snake_case :   List[str]													=    [tokenizer.decode(__a      ,     skip_special_tokens=__a  ) for seq in encoding['input_ids']]

             # fmt: off
             __snake_case :   Optional[Any]													=    {
                 'input_ids': [
                     [1, 2118, 11126, 565, 35, 83, 25191, 163, 18854, 13, 12156, 12, 16101, 25376, 13807, 9, 22205, 27893, 1635, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [1, 2118, 11126, 565, 24536, 80, 43797, 4878, 7373, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [1, 133, 78, 65, 16, 10, 3724, 1538, 33183, 11303, 43797, 1938, 4, 870, 24165, 29105, 5, 739, 32644, 33183, 11303, 36173, 88, 80, 650, 7821, 45940, 6, 52, 2559, 5, 1836, 9, 5, 7397, 13171, 31, 5, 1836, 9, 32644, 33183, 11303, 4, 2]
                 ],
                 'token_type_ids': [
                     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
                 ],
                 'attention_mask': [
                     [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
                 ]
             }
             # fmt: on

             __snake_case :   int													=    [
                 'ALBERT: A Lite BERT for Self-supervised Learning of Language Representations',
                 'ALBERT incorporates two parameter reduction techniques',
                 'The first one is a factorized embedding parameterization. By decomposing the large vocabulary'
                 ' embedding matrix into two small matrices, we separate the size of the hidden layers from the size of'
                 ' vocabulary embedding.',
             ]

             self.assertDictEqual(encoding.data      ,     __a  )

             for expected, decoded in zip(__a      ,     __a  ):
                   self.assertEqual(__a      ,     __a  )








'''simple docstring'''





import json
import os
import unittest

from transformers import DebertaTokenizer, DebertaTokenizerFast
from transformers.models.deberta.tokenization_deberta import VOCAB_FILES_NAMES
from transformers.testing_utils import slow

from ...test_tokenization_common import TokenizerTesterMixin



class  snake_case__						(    SCREAMING_SNAKE_CASE_  ,     unittest.TestCase				):
 A__				= DebertaTokenizer
 A__				= True
 A__				= DebertaTokenizerFast
 def A_   (   self						:							Optional[int]  )      ->   str:







       '''simple docstring'''
       super().setUp()

       # Adapted from Sennrich et al. 2015 and https://github.com/rsennrich/subword-nmt
       __snake_case :   Union[str, Any]													=    [
           'l',
           'o',
           'w',
           'e',
           'r',
           's',
           't',
           'i',
           'd',
           'n',
           '\u0120',
           '\u0120l',
           '\u0120n',
           '\u0120lo',
           '\u0120low',
           'er',
           '\u0120lowest',
           '\u0120newer',
           '\u0120wider',
           '[UNK]',
       ]
       __snake_case :   List[str]													=    dict(zip(__a      ,     range(len(__a  )  )  )  )
       __snake_case :   int													=    ['#version: 0.2', '\u0120 l', '\u0120l o', '\u0120lo w', 'e r', '']
       __snake_case :   Any													=    {'unk_token': '[UNK]'}

       __snake_case :   Union[str, Any]													=    os.path.join(self.tmpdirname      ,     VOCAB_FILES_NAMES['vocab_file']  )
       __snake_case :   Dict													=    os.path.join(self.tmpdirname      ,     VOCAB_FILES_NAMES['merges_file']  )
       with open(self.vocab_file      ,     'w'      ,     encoding='utf-8'  ) as fp:
             fp.write(json.dumps(__a  ) + '\n'  )
       with open(self.merges_file      ,     'w'      ,     encoding='utf-8'  ) as fp:
             fp.write('\n'.join(__a  )  )
 def A_   (   self						:							Optional[int]      ,     **__a						:							List[Any]  )      ->   Optional[Any]:







       '''simple docstring'''
       kwargs.update(self.special_tokens_map  )
       return self.tokenizer_class.from_pretrained(self.tmpdirname      ,     **__a  )
 def A_   (   self						:							Optional[int]      ,     __a						:							Dict  )      ->   List[str]:







       '''simple docstring'''
       __snake_case :   Union[str, Any]													=    'lower newer'
       __snake_case :   List[Any]													=    'lower newer'
       return input_text, output_text
 def A_   (   self						:							Dict  )      ->   Union[str, Any]:







       '''simple docstring'''
       __snake_case :   str													=    self.get_tokenizer()
       __snake_case :   List[str]													=    'lower newer'
       __snake_case :   Tuple													=    ['l', 'o', 'w', 'er', '\u0120', 'n', 'e', 'w', 'er']
       __snake_case :   Optional[int]													=    tokenizer.tokenize(__a  )
       self.assertListEqual(__a      ,     __a  )

       __snake_case :   str													=    tokens + [tokenizer.unk_token]
       __snake_case :   Tuple													=    [0, 1, 2, 15, 10, 9, 3, 2, 15, 19]
       self.assertListEqual(tokenizer.convert_tokens_to_ids(__a  )      ,     __a  )
 def A_   (   self						:							List[Any]  )      ->   Dict:







       '''simple docstring'''
       __snake_case :   List[str]													=    self.get_tokenizer()
       __snake_case :   List[str]													=    tokenizer('Hello'      ,     'World'  )
       __snake_case :   int													=    [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1]
       self.assertListEqual(tokd['token_type_ids']      ,     __a  )
 @slow
 def A_   (   self						:							Dict  )      ->   str:







       '''simple docstring'''
       __snake_case :   str													=    self.tokenizer_class.from_pretrained('microsoft/deberta-base'  )

       __snake_case :   str													=    tokenizer.encode('sequence builders'      ,     add_special_tokens=__a  )
       __snake_case :   Any													=    tokenizer.encode('multi-sequence build'      ,     add_special_tokens=__a  )

       __snake_case :   List[Any]													=    tokenizer.encode(
           'sequence builders'      ,     add_special_tokens=__a      ,     add_prefix_space=__a  )
       __snake_case :   Union[str, Any]													=    tokenizer.encode(
           'sequence builders'      ,     'multi-sequence build'      ,     add_special_tokens=__a      ,     add_prefix_space=__a  )

       __snake_case :   int													=    tokenizer.build_inputs_with_special_tokens(__a  )
       __snake_case :   Tuple													=    tokenizer.build_inputs_with_special_tokens(__a      ,     __a  )

       assert encoded_sentence == encoded_text_from_decode
       assert encoded_pair == encoded_pair_from_decode





 @slow
 def A_   (   self						:							Optional[Any]  )      ->   Optional[int]:







       '''simple docstring'''
       __snake_case :   int													=    [self.tokenizer_class]
       if self.test_rust_tokenizer:
             tokenizer_classes.append(self.rust_tokenizer_class  )

       for tokenizer_class in tokenizer_classes:
             __snake_case :   List[Any]													=    tokenizer_class.from_pretrained('microsoft/deberta-base'  )

             __snake_case :   int													=    [
                 'ALBERT: A Lite BERT for Self-supervised Learning of Language Representations',
                 'ALBERT incorporates two parameter reduction techniques',
                 'The first one is a factorized embedding parameterization. By decomposing the large vocabulary'
                 ' embedding matrix into two small matrices, we separate the size of the hidden layers from the size of'
                 ' vocabulary embedding.',
             ]

             __snake_case :   Union[str, Any]													=    tokenizer(__a      ,     padding=__a  )
             __snake_case :   List[str]													=    [tokenizer.decode(__a      ,     skip_special_tokens=__a  ) for seq in encoding['input_ids']]

             # fmt: off
             __snake_case :   Optional[Any]													=    {
                 'input_ids': [
                     [1, 2118, 11126, 565, 35, 83, 25191, 163, 18854, 13, 12156, 12, 16101, 25376, 13807, 9, 22205, 27893, 1635, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [1, 2118, 11126, 565, 24536, 80, 43797, 4878, 7373, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [1, 133, 78, 65, 16, 10, 3724, 1538, 33183, 11303, 43797, 1938, 4, 870, 24165, 29105, 5, 739, 32644, 33183, 11303, 36173, 88, 80, 650, 7821, 45940, 6, 52, 2559, 5, 1836, 9, 5, 7397, 13171, 31, 5, 1836, 9, 32644, 33183, 11303, 4, 2]
                 ],
                 'token_type_ids': [
                     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
                 ],
                 'attention_mask': [
                     [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
                     [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
                 ]
             }
             # fmt: on

             __snake_case :   int													=    [
                 'ALBERT: A Lite BERT for Self-supervised Learning of Language Representations',
                 'ALBERT incorporates two parameter reduction techniques',
                 'The first one is a factorized embedding parameterization. By decomposing the large vocabulary'
                 ' embedding matrix into two small matrices, we separate the size of the hidden layers from the size of'
                 ' vocabulary embedding.',
             ]

             self.assertDictEqual(encoding.data      ,     __a  )

             for expected, decoded in zip(__a      ,     __a  ):
                   self.assertEqual(__a      ,     __a  )



