




"""simple docstring"""






from abc import ABC, abstractmethod
from typing import List, Optional






class lowerCAmelCase__      (	lowercase		):






			'''simple docstring'''



			def __init__(    self    ):
							# test for the above condition
							self.test()
			def    A_       (    self    ):
							_lowerCamelCase	:     List[str]       =       0
							_lowerCamelCase	:     List[str]       =       False
							while not completed:
											if counter == 1:
															self.reset()
											_lowerCamelCase	:     Optional[Any]       =       self.advance()
											if not self.does_advance(lowercase    ):
															raise Exception(
															    'Custom Constraint is not defined correctly. self.does_advance(self.advance()) must be true.'    )

											_lowerCamelCase,					_lowerCamelCase,					_lowerCamelCase	:     Dict       =       self.update(lowercase    )
											counter += 1

											if counter > 10000:
															raise Exception('update() does not fulfill the constraint.'    )

							if self.remaining() != 0:
											raise Exception('Custom Constraint is not defined correctly.'    )
			@abstractmethod
			def    A_       (    self    ):
							raise NotImplementedError(
							    F'''{self.__class__} is an abstract class. Only classes inheriting this class can be called.'''    )
			@abstractmethod
			def    A_       (    self    , lowercase    ):
							raise NotImplementedError(
							    F'''{self.__class__} is an abstract class. Only classes inheriting this class can be called.'''    )
			@abstractmethod
			def    A_       (    self    , lowercase    ):
							raise NotImplementedError(
							    F'''{self.__class__} is an abstract class. Only classes inheriting this class can be called.'''    )
			@abstractmethod
			def    A_       (    self    ):
							raise NotImplementedError(
							    F'''{self.__class__} is an abstract class. Only classes inheriting this class can be called.'''    )
			@abstractmethod
			def    A_       (    self    ):
							raise NotImplementedError(
							    F'''{self.__class__} is an abstract class. Only classes inheriting this class can be called.'''    )






			@abstractmethod
			def    A_       (    self    , lowercase=False    ):
							raise NotImplementedError(
							    F'''{self.__class__} is an abstract class. Only classes inheriting this class can be called.'''    )






class lowerCAmelCase__      (	lowercase		):






			'''simple docstring'''



			def __init__(    self    , lowercase    ):
							super(lowercase    , self    ).__init__()

							if not isinstance(lowercase    , lowercase    ) or len(lowercase    ) == 0:
											raise ValueError(F'''`token_ids` has to be a non-empty list, but is {token_ids}.'''    )
							if any((not isinstance(lowercase    , lowercase    ) or token_id < 0) for token_id in token_ids    ):
											raise ValueError(F'''Each list in `token_ids` has to be a list of positive integers, but is {token_ids}.'''    )

							_lowerCamelCase	:     str       =       token_ids

							_lowerCamelCase	:     str       =       len(self.token_ids    )
							_lowerCamelCase	:     str       =       -1  # the index of the currently fulfilled step
							_lowerCamelCase	:     str       =       False
			def    A_       (    self    ):
							if self.completed:
											return None
							return self.token_ids[self.fulfilled_idx + 1]
			def    A_       (    self    , lowercase    ):
							if not isinstance(lowercase    , lowercase    ):
											raise ValueError(F'''`token_id` has to be an `int`, but is {token_id} of type {type(lowercase    )}'''    )

							if self.completed:
											return False

							return token_id == self.token_ids[self.fulfilled_idx + 1]
			def    A_       (    self    , lowercase    ):
							if not isinstance(lowercase    , lowercase    ):
											raise ValueError(F'''`token_id` has to be an `int`, but is {token_id} of type {type(lowercase    )}'''    )

							_lowerCamelCase	:     Tuple       =       False
							_lowerCamelCase	:     Union[str, Any]       =       False
							_lowerCamelCase	:     Dict       =       False

							if self.does_advance(lowercase    ):
											self.fulfilled_idx += 1
											_lowerCamelCase	:     int       =       True
											if self.fulfilled_idx == (self.seqlen - 1):
															_lowerCamelCase	:     str       =       True
											_lowerCamelCase	:     Optional[int]       =       completed
							else:
											# failed to make progress.
											_lowerCamelCase	:     Union[str, Any]       =       True
											self.reset()
							return stepped, completed, reset
			def    A_       (    self    ):
							_lowerCamelCase	:     Dict       =       False
							_lowerCamelCase	:     Tuple       =       0
			def    A_       (    self    ):
							return self.seqlen - (self.fulfilled_idx + 1)






			def    A_       (    self    , lowercase=False    ):
							_lowerCamelCase	:     Optional[int]       =       PhrasalConstraint(self.token_ids    )

							if stateful:
											_lowerCamelCase	:     Tuple       =       self.seqlen
											_lowerCamelCase	:     int       =       self.fulfilled_idx
											_lowerCamelCase	:     Any       =       self.completed

							return new_constraint






class lowerCAmelCase__      :






			'''simple docstring'''



			def __init__(    self    , lowercase    , lowercase=True    ):
							_lowerCamelCase	:     Any       =       max([len(lowercase    ) for one in nested_token_ids]    )

							_lowerCamelCase	:     Any       =       {}
							for token_ids in nested_token_ids:
											_lowerCamelCase	:     str       =       root
											for tidx, token_id in enumerate(lowercase    ):
															if token_id not in level:
																			_lowerCamelCase	:     Tuple       =       {}

															_lowerCamelCase	:     Dict       =       level[token_id]

							if no_subsets and self.has_subsets(lowercase    , lowercase    ):
											raise ValueError(
											    'Each list in `nested_token_ids` can\'t be a complete subset of another list, but is'
											    F''' {nested_token_ids}.'''    )

							_lowerCamelCase	:     str       =       root
			def    A_       (    self    , lowercase    ):
							_lowerCamelCase	:     List[str]       =       self.trie

							for current_token in current_seq:
											_lowerCamelCase	:     Tuple       =       start[current_token]

							_lowerCamelCase	:     Tuple       =       list(start.keys()    )

							return next_tokens
			def    A_       (    self    , lowercase    ):
							_lowerCamelCase	:     str       =       self.next_tokens(lowercase    )

							return len(lowercase    ) == 0
			def    A_       (    self    , lowercase    ):
							_lowerCamelCase	:     Optional[int]       =       list(root.values()    )
							if len(lowercase    ) == 0:
											return 1
							else:
											return sum([self.count_leaves(lowercase    ) for nn in next_nodes]    )






			def    A_       (    self    , lowercase    , lowercase    ):
							_lowerCamelCase	:     Tuple       =       self.count_leaves(lowercase    )
							return len(lowercase    ) != leaf_count






class lowerCAmelCase__      (	lowercase		):






			'''simple docstring'''



			def __init__(    self    , lowercase    ):
							super(lowercase    , self    ).__init__()

							if not isinstance(lowercase    , lowercase    ) or len(lowercase    ) == 0:
											raise ValueError(F'''`nested_token_ids` has to be a non-empty list, but is {nested_token_ids}.'''    )
							if any(not isinstance(lowercase    , lowercase    ) for token_ids in nested_token_ids    ):
											raise ValueError(F'''`nested_token_ids` has to be a list of lists, but is {nested_token_ids}.'''    )
							if any(
							    any((not isinstance(lowercase    , lowercase    ) or token_id < 0) for token_id in token_ids    )
							    for token_ids in nested_token_ids    ):
											raise ValueError(
											    F'''Each list in `nested_token_ids` has to be a list of positive integers, but is {nested_token_ids}.'''    )

							_lowerCamelCase	:     List[str]       =       DisjunctiveTrie(lowercase    )
							_lowerCamelCase	:     Optional[Any]       =       nested_token_ids

							_lowerCamelCase	:     str       =       self.trie.max_height
							_lowerCamelCase	:     List[str]       =       []
							_lowerCamelCase	:     Optional[int]       =       False
			def    A_       (    self    ):
							_lowerCamelCase	:     List[str]       =       self.trie.next_tokens(self.current_seq    )

							if len(lowercase    ) == 0:
											return None
							else:
											return token_list
			def    A_       (    self    , lowercase    ):
							if not isinstance(lowercase    , lowercase    ):
											raise ValueError(F'''`token_id` is supposed to be type `int`, but is {token_id} of type {type(lowercase    )}'''    )

							_lowerCamelCase	:     List[str]       =       self.trie.next_tokens(self.current_seq    )

							return token_id in next_tokens
			def    A_       (    self    , lowercase    ):
							if not isinstance(lowercase    , lowercase    ):
											raise ValueError(F'''`token_id` is supposed to be type `int`, but is {token_id} of type {type(lowercase    )}'''    )

							_lowerCamelCase	:     Tuple       =       False
							_lowerCamelCase	:     str       =       False
							_lowerCamelCase	:     Union[str, Any]       =       False

							if self.does_advance(lowercase    ):
											self.current_seq.append(lowercase    )
											_lowerCamelCase	:     Optional[Any]       =       True
							else:
											_lowerCamelCase	:     List[Any]       =       True
											self.reset()

							_lowerCamelCase	:     str       =       self.trie.reached_leaf(self.current_seq    )
							_lowerCamelCase	:     Optional[Any]       =       completed

							return stepped, completed, reset
			def    A_       (    self    ):
							_lowerCamelCase	:     Any       =       False
							_lowerCamelCase	:     Optional[Any]       =       []
			def    A_       (    self    ):
							if self.completed:
											# since this can be completed without reaching max height
											return 0
							else:
											return self.seqlen - len(self.current_seq    )






			def    A_       (    self    , lowercase=False    ):
							_lowerCamelCase	:     Any       =       DisjunctiveConstraint(self.token_ids    )

							if stateful:
											_lowerCamelCase	:     Tuple       =       self.seqlen
											_lowerCamelCase	:     str       =       self.current_seq
											_lowerCamelCase	:     Optional[Any]       =       self.completed

							return new_constraint






class lowerCAmelCase__      :






			'''simple docstring'''



			def __init__(    self    , lowercase    ):
							_lowerCamelCase	:     List[Any]       =       constraints

							# max # of steps required to fulfill a given constraint
							_lowerCamelCase	:     str       =       max([c.seqlen for c in constraints]    )
							_lowerCamelCase	:     Optional[Any]       =       len(lowercase    )
							_lowerCamelCase	:     Optional[Any]       =       False

							self.init_state()
			def    A_       (    self    ):
							_lowerCamelCase	:     Optional[int]       =       []
							_lowerCamelCase	:     Dict       =       None
							_lowerCamelCase	:     Tuple       =       [constraint.copy(stateful=lowercase    ) for constraint in self.constraints]
			def    A_       (    self    ):
							_lowerCamelCase	:     Optional[Any]       =       0
							if self.inprogress_constraint:
											# extra points for having a constraint mid-fulfilled
											add += self.max_seqlen - self.inprogress_constraint.remaining()

							return (len(self.complete_constraints    ) * self.max_seqlen) + add
			def    A_       (    self    ):
							_lowerCamelCase	:     List[Any]       =       []
							if self.inprogress_constraint is None:
											for constraint in self.pending_constraints:  # "pending" == "unfulfilled yet"
															_lowerCamelCase	:     str       =       constraint.advance()
															if isinstance(lowercase    , lowercase    ):
																			token_list.append(lowercase    )
															elif isinstance(lowercase    , lowercase    ):
																			token_list.extend(lowercase    )
							else:
											_lowerCamelCase	:     Tuple       =       self.inprogress_constraint.advance()
											if isinstance(lowercase    , lowercase    ):
															token_list.append(lowercase    )
											elif isinstance(lowercase    , lowercase    ):
															token_list.extend(lowercase    )

							if len(lowercase    ) == 0:
											return None
							else:
											return token_list
			def    A_       (    self    , lowercase    ):
							self.init_state()

							if token_ids is not None:
											for token in token_ids:
															# completes or steps **one** constraint
															_lowerCamelCase,					_lowerCamelCase	:     Any       =       self.add(lowercase    )

															# the entire list of constraints are fulfilled
															if self.completed:
																			break
			def    A_       (    self    , lowercase    ):
							if not isinstance(lowercase    , lowercase    ):
											raise ValueError(F'''`token_id` should be an `int`, but is `{token_id}`.'''    )

							_lowerCamelCase,					_lowerCamelCase	:     List[Any]       =       False, False

							if self.completed:
											_lowerCamelCase	:     Dict       =       True
											_lowerCamelCase	:     Union[str, Any]       =       False
											return complete, stepped

							if self.inprogress_constraint is not None:
											# In the middle of fulfilling a constraint. If the `token_id` *does* makes an incremental progress to current
											# job, simply update the state

											_lowerCamelCase,					_lowerCamelCase,					_lowerCamelCase	:     Dict       =       self.inprogress_constraint.update(lowercase    )
											if reset:
															# 1. If the next token breaks the progress, then we must restart.
															#     e.g. constraint = "I love pies" and sequence so far is "I love" but `token_id` == "books".

															#     But that doesn't mean we self.init_state(), since we only reset the state for this particular
															#     constraint, not the full list of constraints.

															self.pending_constraints.append(self.inprogress_constraint.copy(stateful=lowercase    )    )
															_lowerCamelCase	:     Optional[int]       =       None

											if complete:
															# 2. If the next token completes the constraint, move it to completed list, set
															#     inprogress to None. If there are no pending constraints either, then this full list of constraints
															#     is complete.

															self.complete_constraints.append(self.inprogress_constraint    )
															_lowerCamelCase	:     Optional[int]       =       None

															if len(self.pending_constraints    ) == 0:
																			# we're done!
																			_lowerCamelCase	:     List[Any]       =       True

							else:
											# Not in the middle of fulfilling a constraint. So does this `token_id` helps us step towards any of our list
											# of constraints?

											for cidx, pending_constraint in enumerate(self.pending_constraints    ):
															if pending_constraint.does_advance(lowercase    ):
																			_lowerCamelCase,					_lowerCamelCase,					_lowerCamelCase	:     List[Any]       =       pending_constraint.update(lowercase    )

																			if not stepped:
																							raise Exception(
																							    '`constraint.update(token_id)` is not yielding incremental progress, '
																							    'even though `constraint.does_advance(token_id)` is true.'    )

																			if complete:
																							self.complete_constraints.append(lowercase    )
																							_lowerCamelCase	:     Dict       =       None

																			if not complete and stepped:
																							_lowerCamelCase	:     Tuple       =       pending_constraint

																			if complete or stepped:
																							# If we made any progress at all, then it's at least not a "pending constraint".

																							_lowerCamelCase	:     Dict       =       (
																							    self.pending_constraints[:cidx] + self.pending_constraints[cidx + 1 :]
																							)

																							if len(self.pending_constraints    ) == 0 and self.inprogress_constraint is None:
																											# If there's no longer any pending after this and no inprogress either, then we must be
																											# complete.

																											_lowerCamelCase	:     Tuple       =       True

																							break  # prevent accidentally stepping through multiple constraints with just one token.

							return complete, stepped






			def    A_       (    self    , lowercase=True    ):
							_lowerCamelCase	:     Dict       =       ConstraintListState(self.constraints    )  # we actually never though self.constraints objects
							# throughout this process. So it's at initialization state.

							if stateful:
											_lowerCamelCase	:     List[Any]       =       [
											    constraint.copy(stateful=lowercase    ) for constraint in self.complete_constraints
											]
											if self.inprogress_constraint is not None:
															_lowerCamelCase	:     List[str]       =       self.inprogress_constraint.copy(stateful=lowercase    )
											_lowerCamelCase	:     int       =       [constraint.copy() for constraint in self.pending_constraints]

							return new_state





"""simple docstring"""






import os
import unittest

from transformers import MobileBertTokenizer, MobileBertTokenizerFast
from transformers.models.bert.tokenization_bert import (
    VOCAB_FILES_NAMES,
    BasicTokenizer,
    WordpieceTokenizer,
    _is_control,
    _is_punctuation,
    _is_whitespace,
)
from transformers.testing_utils import require_tokenizers, slow

from ...test_tokenization_common import TokenizerTesterMixin, filter_non_english






@require_tokenizers
class lowerCAmelCase__      (	lowercase,      unittest.TestCase		):






			'''simple docstring'''



			lowerCamelCase__ =     MobileBertTokenizer
			lowerCamelCase__ =     MobileBertTokenizerFast
			lowerCamelCase__ =     True
			lowerCamelCase__ =     True
			lowerCamelCase__ =     filter_non_english
			lowerCamelCase__ =     """google/mobilebert-uncased"""
			def    A_       (    self    ):
							super().setUp()

							_lowerCamelCase	:     Optional[int]       =       [
							    '[UNK]',
							    '[CLS]',
							    '[SEP]',
							    '[PAD]',
							    '[MASK]',
							    'want',
							    '##want',
							    '##ed',
							    'wa',
							    'un',
							    'runn',
							    '##ing',
							    ',',
							    'low',
							    'lowest',
							]
							_lowerCamelCase	:     Union[str, Any]       =       os.path.join(self.tmpdirname    , VOCAB_FILES_NAMES['vocab_file']    )
							with open(self.vocab_file    , 'w'    , encoding='utf-8'    ) as vocab_writer:
											vocab_writer.write(''.join([x + '\n' for x in vocab_tokens]    )    )

							_lowerCamelCase	:     Any       =       [
							    (tokenizer_def[0], self.pre_trained_model_path, tokenizer_def[2])  # else the 'google/' prefix is stripped
							    for tokenizer_def in self.tokenizers_list
							]
			def    A_       (    self    , lowercase    ):
							_lowerCamelCase	:     Union[str, Any]       =       'UNwant\u00E9d,running'
							_lowerCamelCase	:     List[Any]       =       'unwanted, running'
							return input_text, output_text
			def    A_       (    self    ):
							_lowerCamelCase	:     Dict       =       self.tokenizer_class(self.vocab_file    )

							_lowerCamelCase	:     Union[str, Any]       =       tokenizer.tokenize('UNwant\u00E9d,running'    )
							self.assertListEqual(lowercase    , ['un', '##want', '##ed', ',', 'runn', '##ing']    )
							self.assertListEqual(tokenizer.convert_tokens_to_ids(lowercase    )    , [9, 6, 7, 12, 10, 11]    )
			def    A_       (    self    ):
							if not self.test_rust_tokenizer:
											return

							_lowerCamelCase	:     Any       =       self.get_tokenizer()
							_lowerCamelCase	:     Any       =       self.get_rust_tokenizer()

							_lowerCamelCase	:     int       =       'UNwant\u00E9d,running'

							_lowerCamelCase	:     Union[str, Any]       =       tokenizer.tokenize(lowercase    )
							_lowerCamelCase	:     List[Any]       =       rust_tokenizer.tokenize(lowercase    )
							self.assertListEqual(lowercase    , lowercase    )

							_lowerCamelCase	:     Dict       =       tokenizer.encode(lowercase    , add_special_tokens=lowercase    )
							_lowerCamelCase	:     Dict       =       rust_tokenizer.encode(lowercase    , add_special_tokens=lowercase    )
							self.assertListEqual(lowercase    , lowercase    )

							_lowerCamelCase	:     Optional[Any]       =       self.get_rust_tokenizer()
							_lowerCamelCase	:     Optional[int]       =       tokenizer.encode(lowercase    )
							_lowerCamelCase	:     List[str]       =       rust_tokenizer.encode(lowercase    )
							self.assertListEqual(lowercase    , lowercase    )

							# With lower casing
							_lowerCamelCase	:     List[Any]       =       self.get_tokenizer(do_lower_case=lowercase    )
							_lowerCamelCase	:     int       =       self.get_rust_tokenizer(do_lower_case=lowercase    )

							_lowerCamelCase	:     Optional[Any]       =       'UNwant\u00E9d,running'

							_lowerCamelCase	:     Dict       =       tokenizer.tokenize(lowercase    )
							_lowerCamelCase	:     int       =       rust_tokenizer.tokenize(lowercase    )
							self.assertListEqual(lowercase    , lowercase    )

							_lowerCamelCase	:     Dict       =       tokenizer.encode(lowercase    , add_special_tokens=lowercase    )
							_lowerCamelCase	:     Dict       =       rust_tokenizer.encode(lowercase    , add_special_tokens=lowercase    )
							self.assertListEqual(lowercase    , lowercase    )

							_lowerCamelCase	:     Any       =       self.get_rust_tokenizer()
							_lowerCamelCase	:     Union[str, Any]       =       tokenizer.encode(lowercase    )
							_lowerCamelCase	:     Dict       =       rust_tokenizer.encode(lowercase    )
							self.assertListEqual(lowercase    , lowercase    )
			def    A_       (    self    ):
							_lowerCamelCase	:     Dict       =       BasicTokenizer()

							self.assertListEqual(tokenizer.tokenize('ah\u535A\u63A8zz'    )    , ['ah', '\u535A', '\u63A8', 'zz']    )
			def    A_       (    self    ):
							_lowerCamelCase	:     Optional[Any]       =       BasicTokenizer(do_lower_case=lowercase    )

							self.assertListEqual(
							    tokenizer.tokenize(' \tHeLLo!how  \n Are yoU?  '    )    , ['hello', '!', 'how', 'are', 'you', '?']    )
							self.assertListEqual(tokenizer.tokenize('H\u00E9llo'    )    , ['hello']    )
			def    A_       (    self    ):
							_lowerCamelCase	:     List[str]       =       BasicTokenizer(do_lower_case=lowercase    , strip_accents=lowercase    )

							self.assertListEqual(
							    tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '    )    , ['hällo', '!', 'how', 'are', 'you', '?']    )
							self.assertListEqual(tokenizer.tokenize('H\u00E9llo'    )    , ['h\u00E9llo']    )
			def    A_       (    self    ):
							_lowerCamelCase	:     List[Any]       =       BasicTokenizer(do_lower_case=lowercase    , strip_accents=lowercase    )

							self.assertListEqual(
							    tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '    )    , ['hallo', '!', 'how', 'are', 'you', '?']    )
							self.assertListEqual(tokenizer.tokenize('H\u00E9llo'    )    , ['hello']    )
			def    A_       (    self    ):
							_lowerCamelCase	:     int       =       BasicTokenizer(do_lower_case=lowercase    )

							self.assertListEqual(
							    tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '    )    , ['hallo', '!', 'how', 'are', 'you', '?']    )
							self.assertListEqual(tokenizer.tokenize('H\u00E9llo'    )    , ['hello']    )
			def    A_       (    self    ):
							_lowerCamelCase	:     List[str]       =       BasicTokenizer(do_lower_case=lowercase    )

							self.assertListEqual(
							    tokenizer.tokenize(' \tHeLLo!how  \n Are yoU?  '    )    , ['HeLLo', '!', 'how', 'Are', 'yoU', '?']    )
			def    A_       (    self    ):
							_lowerCamelCase	:     Union[str, Any]       =       BasicTokenizer(do_lower_case=lowercase    , strip_accents=lowercase    )

							self.assertListEqual(
							    tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '    )    , ['HäLLo', '!', 'how', 'Are', 'yoU', '?']    )
			def    A_       (    self    ):
							_lowerCamelCase	:     Union[str, Any]       =       BasicTokenizer(do_lower_case=lowercase    , strip_accents=lowercase    )

							self.assertListEqual(
							    tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '    )    , ['HaLLo', '!', 'how', 'Are', 'yoU', '?']    )
			def    A_       (    self    ):
							_lowerCamelCase	:     int       =       BasicTokenizer(do_lower_case=lowercase    , never_split=['[UNK]']    )

							self.assertListEqual(
							    tokenizer.tokenize(' \tHeLLo!how  \n Are yoU? [UNK]'    )    , ['HeLLo', '!', 'how', 'Are', 'yoU', '?', '[UNK]']    )
			def    A_       (    self    ):
							_lowerCamelCase	:     Union[str, Any]       =       ['[UNK]', '[CLS]', '[SEP]', 'want', '##want', '##ed', 'wa', 'un', 'runn', '##ing']

							_lowerCamelCase	:     Tuple       =       {}
							for i, token in enumerate(lowercase    ):
											_lowerCamelCase	:     Union[str, Any]       =       i
							_lowerCamelCase	:     str       =       WordpieceTokenizer(vocab=lowercase    , unk_token='[UNK]'    )

							self.assertListEqual(tokenizer.tokenize(''    )    , []    )

							self.assertListEqual(tokenizer.tokenize('unwanted running'    )    , ['un', '##want', '##ed', 'runn', '##ing']    )

							self.assertListEqual(tokenizer.tokenize('unwantedX running'    )    , ['[UNK]', 'runn', '##ing']    )
			def    A_       (    self    ):
							self.assertTrue(_is_whitespace(' '    )    )
							self.assertTrue(_is_whitespace('\t'    )    )
							self.assertTrue(_is_whitespace('\r'    )    )
							self.assertTrue(_is_whitespace('\n'    )    )
							self.assertTrue(_is_whitespace('\u00A0'    )    )

							self.assertFalse(_is_whitespace('A'    )    )
							self.assertFalse(_is_whitespace('-'    )    )
			def    A_       (    self    ):
							self.assertTrue(_is_control('\u0005'    )    )

							self.assertFalse(_is_control('A'    )    )
							self.assertFalse(_is_control(' '    )    )
							self.assertFalse(_is_control('\t'    )    )
							self.assertFalse(_is_control('\r'    )    )
			def    A_       (    self    ):
							self.assertTrue(_is_punctuation('-'    )    )
							self.assertTrue(_is_punctuation('$'    )    )
							self.assertTrue(_is_punctuation('`'    )    )
							self.assertTrue(_is_punctuation('.'    )    )

							self.assertFalse(_is_punctuation('A'    )    )
							self.assertFalse(_is_punctuation(' '    )    )
			def    A_       (    self    ):
							_lowerCamelCase	:     List[Any]       =       self.get_tokenizer()
							_lowerCamelCase	:     Union[str, Any]       =       self.get_rust_tokenizer()

							# Example taken from the issue https://github.com/huggingface/tokenizers/issues/340
							self.assertListEqual([tokenizer.tokenize(lowercase    ) for t in ['Test', '\xad', 'test']]    , [['[UNK]'], [], ['[UNK]']]    )

							self.assertListEqual(
							    [rust_tokenizer.tokenize(lowercase    ) for t in ['Test', '\xad', 'test']]    , [['[UNK]'], [], ['[UNK]']]    )
			@slow
			def    A_       (    self    ):
							_lowerCamelCase	:     Optional[Any]       =       self.tokenizer_class.from_pretrained('google/mobilebert-uncased'    )

							_lowerCamelCase	:     List[str]       =       tokenizer.encode('sequence builders'    , add_special_tokens=lowercase    )
							_lowerCamelCase	:     Dict       =       tokenizer.encode('multi-sequence build'    , add_special_tokens=lowercase    )

							_lowerCamelCase	:     Optional[int]       =       tokenizer.build_inputs_with_special_tokens(lowercase    )
							_lowerCamelCase	:     List[Any]       =       tokenizer.build_inputs_with_special_tokens(lowercase    , lowercase    )

							assert encoded_sentence == [101] + text + [102]
							assert encoded_pair == [101] + text + [102] + text_a + [102]
			def    A_       (    self    ):
							for tokenizer, pretrained_name, kwargs in self.tokenizers_list:
											with self.subTest(F'''{tokenizer.__class__.__name__} ({pretrained_name})'''    ):
															_lowerCamelCase	:     int       =       self.rust_tokenizer_class.from_pretrained(lowercase    , **lowercase    )

															_lowerCamelCase	:     int       =       F'''A, naïve {tokenizer_r.mask_token} AllenNLP sentence.'''
															_lowerCamelCase	:     int       =       tokenizer_r.encode_plus(
															    lowercase    , return_attention_mask=lowercase    , return_token_type_ids=lowercase    , return_offsets_mapping=lowercase    , add_special_tokens=lowercase    , )

															_lowerCamelCase	:     Tuple       =       tokenizer_r.do_lower_case if hasattr(lowercase    , 'do_lower_case'    ) else False
															_lowerCamelCase	:     Dict       =       (
															    [
															        ((0, 0), tokenizer_r.cls_token),
															        ((0, 1), 'A'),
															        ((1, 2), ','),
															        ((3, 5), 'na'),
															        ((5, 6), '##ï'),
															        ((6, 8), '##ve'),
															        ((9, 15), tokenizer_r.mask_token),
															        ((16, 21), 'Allen'),
															        ((21, 23), '##NL'),
															        ((23, 24), '##P'),
															        ((25, 33), 'sentence'),
															        ((33, 34), '.'),
															        ((0, 0), tokenizer_r.sep_token),
															    ]
															    if not do_lower_case
															    else [
															        ((0, 0), tokenizer_r.cls_token),
															        ((0, 1), 'a'),
															        ((1, 2), ','),
															        ((3, 8), 'naive'),
															        ((9, 15), tokenizer_r.mask_token),
															        ((16, 21), 'allen'),
															        ((21, 23), '##nl'),
															        ((23, 24), '##p'),
															        ((25, 33), 'sentence'),
															        ((33, 34), '.'),
															        ((0, 0), tokenizer_r.sep_token),
															    ]
															)

															self.assertEqual(
															    [e[1] for e in expected_results]    , tokenizer_r.convert_ids_to_tokens(tokens['input_ids']    )    )
															self.assertEqual([e[0] for e in expected_results]    , tokens['offset_mapping']    )






			def    A_       (    self    ):
							_lowerCamelCase	:     Tuple       =       ['的', '人', '有']
							_lowerCamelCase	:     Optional[Any]       =       ''.join(lowercase    )
							for tokenizer, pretrained_name, kwargs in self.tokenizers_list:
											with self.subTest(F'''{tokenizer.__class__.__name__} ({pretrained_name})'''    ):
															_lowerCamelCase	:     int       =       True
															_lowerCamelCase	:     Any       =       self.tokenizer_class.from_pretrained(lowercase    , **lowercase    )
															_lowerCamelCase	:     Dict       =       self.rust_tokenizer_class.from_pretrained(lowercase    , **lowercase    )

															_lowerCamelCase	:     List[str]       =       tokenizer_p.encode(lowercase    , add_special_tokens=lowercase    )
															_lowerCamelCase	:     List[Any]       =       tokenizer_r.encode(lowercase    , add_special_tokens=lowercase    )

															_lowerCamelCase	:     Any       =       tokenizer_r.convert_ids_to_tokens(lowercase    )
															_lowerCamelCase	:     Dict       =       tokenizer_p.convert_ids_to_tokens(lowercase    )

															# it is expected that each Chinese character is not preceded by "##"
															self.assertListEqual(lowercase    , lowercase    )
															self.assertListEqual(lowercase    , lowercase    )

															_lowerCamelCase	:     Optional[Any]       =       False
															_lowerCamelCase	:     Dict       =       self.rust_tokenizer_class.from_pretrained(lowercase    , **lowercase    )
															_lowerCamelCase	:     Optional[int]       =       self.tokenizer_class.from_pretrained(lowercase    , **lowercase    )

															_lowerCamelCase	:     Optional[Any]       =       tokenizer_r.encode(lowercase    , add_special_tokens=lowercase    )
															_lowerCamelCase	:     str       =       tokenizer_p.encode(lowercase    , add_special_tokens=lowercase    )

															_lowerCamelCase	:     List[Any]       =       tokenizer_r.convert_ids_to_tokens(lowercase    )
															_lowerCamelCase	:     Dict       =       tokenizer_p.convert_ids_to_tokens(lowercase    )

															# it is expected that only the first Chinese character is not preceded by "##".
															_lowerCamelCase	:     List[str]       =       [
															    F'''##{token}''' if idx != 0 else token for idx, token in enumerate(lowercase    )
															]
															self.assertListEqual(lowercase    , lowercase    )
															self.assertListEqual(lowercase    , lowercase    )