






'''simple docstring'''







import math
import sys

class _lowercase      :




							def __init__(				self:							List[Any]	):
														lowerCamelCase__   :      Union[str, Any]			    =			0
														lowerCamelCase__   :      Optional[int]			    =			[]
														lowerCamelCase__   :      List[str]			    =			{}  # To store the pos of node in array




							def 						lowerCamelCase_							(				self:							Dict	):
														return self.cur_size == 0




							def 						lowerCamelCase_							(				self:							str     ,				UpperCamelCase__:							Optional[Any]	):
														lowerCamelCase__   :      str			    =			self.left(__UpperCAmelCase	)
														lowerCamelCase__   :      Optional[int]			    =			self.right(__UpperCAmelCase	)
														if lc < self.cur_size and self.array(__UpperCAmelCase	)[0] < self.array(__UpperCAmelCase	)[0]:
																					lowerCamelCase__   :      Dict			    =			lc
														else:
																					lowerCamelCase__   :      Dict			    =			idx
														if rc < self.cur_size and self.array(__UpperCAmelCase	)[0] < self.array(__UpperCAmelCase	)[0]:
																					lowerCamelCase__   :      str			    =			rc
														if smallest != idx:
																					self.swap(__UpperCAmelCase     ,				__UpperCAmelCase	)
																					self.min_heapify(__UpperCAmelCase	)




							def 						lowerCamelCase_							(				self:							str     ,				UpperCamelCase__:							List[str]	):
														# Inserts a node into the Priority Queue
														lowerCamelCase__   :      int			    =			self.cur_size
														self.cur_size += 1
														self.array.append((sys.maxsize, tup[1])	)
														self.decrease_key((sys.maxsize, tup[1])     ,				tup[0]	)




							def 						lowerCamelCase_							(				self:							Optional[Any]	):
														# Removes and returns the min element at top of priority queue
														lowerCamelCase__   :      Optional[int]			    =			self.array[0][1]
														lowerCamelCase__   :      List[str]			    =			self.array[self.cur_size - 1]
														self.cur_size -= 1
														self.min_heapify(1	)
														del self.pos[min_node]
														return min_node




							def 						lowerCamelCase_							(				self:							Any     ,				UpperCamelCase__:							Optional[Any]	):
														# returns the index of left child
														return 2 * i + 1




							def 						lowerCamelCase_							(				self:							Any     ,				UpperCamelCase__:							Dict	):
														# returns the index of right child
														return 2 * i + 2




							def 						lowerCamelCase_							(				self:							Tuple     ,				UpperCamelCase__:							Any	):
														# returns the index of parent
														return math.floor(i / 2	)




							def 						lowerCamelCase_							(				self:							Optional[Any]     ,				UpperCamelCase__:							int     ,				UpperCamelCase__:							Tuple	):
														# swaps array elements at indices i and j
														# update the pos{}
														lowerCamelCase__   :      Dict			    =			j
														lowerCamelCase__   :      int			    =			i
														lowerCamelCase__   :      List[str]			    =			self.array[i]
														lowerCamelCase__   :      int			    =			self.array[j]
														lowerCamelCase__   :      List[Any]			    =			temp




							def 						lowerCamelCase_							(				self:							Any     ,				UpperCamelCase__:							List[Any]     ,				UpperCamelCase__:							int	):
														lowerCamelCase__   :      Tuple			    =			self.pos[tup[1]]
														# assuming the new_d is atmost old_d
														lowerCamelCase__   :      List[Any]			    =			(new_d, tup[1])
														while idx > 0 and self.array[self.par(__UpperCAmelCase	)][0] > self.array[idx][0]:
																					self.swap(__UpperCAmelCase     ,				self.par(__UpperCAmelCase	)	)
																					lowerCamelCase__   :      Optional[Any]			    =			self.par(__UpperCAmelCase	)



class _lowercase      :




							def __init__(				self:							Dict     ,				UpperCamelCase__:							List[Any]	):
														lowerCamelCase__   :      List[Any]			    =			{}  # To store graph: u -> (v,w)
														lowerCamelCase__   :      Union[str, Any]			    =			num  # Number of nodes in graph
														# To store the distance from source vertex
														lowerCamelCase__   :      List[str]			    =			[0] * self.num_nodes
														lowerCamelCase__   :      List[Any]			    =			[-1] * self.num_nodes  # To store the path




							def 						lowerCamelCase_							(				self:							List[Any]     ,				UpperCamelCase__:							Tuple     ,				UpperCamelCase__:							List[str]     ,				UpperCamelCase__:							str	):
														#  Edge going from node u to v and v to u with weight w
														# u (w)-> v, v (w) -> u
														# Check if u already in graph
														if u in self.adjList:
																					self.adjList[u].append((v, w)	)
														else:
																					lowerCamelCase__   :      Dict			    =			[(v, w)]

														# Assuming undirected graph
														if v in self.adjList:
																					self.adjList[v].append((u, w)	)
														else:
																					lowerCamelCase__   :      List[Any]			    =			[(u, w)]




							def 						lowerCamelCase_							(				self:							Optional[Any]	):
														# u -> v(w)
														for u in self.adjList:
																					print(__UpperCAmelCase     ,				"""->"""     ,				""" -> """.join(str(F'''{v}({w})'''	) for v, w in self.adjList[u]	)	)




							def 						lowerCamelCase_							(				self:							Tuple     ,				UpperCamelCase__:							Optional[Any]	):
														# Flush old junk values in par[]
														lowerCamelCase__   :      List[Any]			    =			[-1] * self.num_nodes
														# src is the source node
														lowerCamelCase__   :      List[Any]			    =			0
														lowerCamelCase__   :      List[str]			    =			PriorityQueue()
														q.insert((0, src)	)  # (dist from src, node)
														for u in self.adjList:
																					if u != src:
																												lowerCamelCase__   :      Dict			    =			sys.maxsize  # Infinity
																												lowerCamelCase__   :      Tuple			    =			-1

														while not q.is_empty():
																					lowerCamelCase__   :      List[Any]			    =			q.extract_min()  # Returns node with the min dist from source
																					# Update the distance of all the neighbours of u and
																					# if their prev dist was INFINITY then push them in Q
																					for v, w in self.adjList[u]:
																												lowerCamelCase__   :      List[Any]			    =			self.dist[u] + w
																												if self.dist[v] > new_dist:
																																			if self.dist[v] == sys.maxsize:
																																										q.insert((new_dist, v)	)
																																			else:
																																										q.decrease_key((self.dist[v], v)     ,				__UpperCAmelCase	)
																																			lowerCamelCase__   :      str			    =			new_dist
																																			lowerCamelCase__   :      Optional[int]			    =			u

																					# Show the shortest distances from src
														self.show_distances(__UpperCAmelCase	)




							def 						lowerCamelCase_							(				self:							Any     ,				UpperCamelCase__:							List[Any]	):
														print(F'''Distance from node: {src}'''	)
														for u in range(self.num_nodes	):
																					print(F'''Node {u} has distance: {self.dist[u]}'''	)




							def 						lowerCamelCase_							(				self:							List[str]     ,				UpperCamelCase__:							List[str]     ,				UpperCamelCase__:							int	):
														# To show the shortest path from src to dest
														# WARNING: Use it *after* calling dijkstra
														lowerCamelCase__   :      int			    =			[]
														lowerCamelCase__   :      int			    =			0
														lowerCamelCase__   :      str			    =			dest
														# Backtracking from dest to src
														while self.par[temp] != -1:
																					path.append(__UpperCAmelCase	)
																					if temp != src:
																												for v, w in self.adjList[temp]:
																																			if v == self.par[temp]:
																																										cost += w
																																										break
																					lowerCamelCase__   :      List[str]			    =			self.par[temp]
														path.append(__UpperCAmelCase	)
														path.reverse()

														print(F'''----Path to reach {dest} from {src}----'''	)
														for u in path:
																					print(F'''{u}'''     ,				end=""" """	)
																					if u != dest:
																												print("""-> """     ,				end=""""""	)

														print("""\nTotal cost of path: """     ,				__UpperCAmelCase	)


if __name__ == "__main__":
			_A      :     int       	=Graph(9)
			graph.add_edge(0, 1, 4)
			graph.add_edge(0, 7, 8)
			graph.add_edge(1, 2, 8)
			graph.add_edge(1, 7, 11)
			graph.add_edge(2, 3, 7)
			graph.add_edge(2, 8, 2)
			graph.add_edge(2, 5, 4)
			graph.add_edge(3, 4, 9)
			graph.add_edge(3, 5, 14)
			graph.add_edge(4, 5, 10)
			graph.add_edge(5, 6, 2)
			graph.add_edge(6, 7, 1)
			graph.add_edge(6, 8, 6)
			graph.add_edge(7, 8, 7)
			graph.show_graph()
			graph.dijkstra(0)
			graph.show_path(0, 4)

# OUTPUT
# 0 -> 1(4) -> 7(8)
# 1 -> 0(4) -> 2(8) -> 7(11)
# 7 -> 0(8) -> 1(11) -> 6(1) -> 8(7)
# 2 -> 1(8) -> 3(7) -> 8(2) -> 5(4)
# 3 -> 2(7) -> 4(9) -> 5(14)
# 8 -> 2(2) -> 6(6) -> 7(7)
# 5 -> 2(4) -> 3(14) -> 4(10) -> 6(2)
# 4 -> 3(9) -> 5(10)
# 6 -> 5(2) -> 7(1) -> 8(6)
# Distance from node: 0
# Node 0 has distance: 0
# Node 1 has distance: 4
# Node 2 has distance: 12
# Node 3 has distance: 19
# Node 4 has distance: 21
# Node 5 has distance: 11
# Node 6 has distance: 9
# Node 7 has distance: 8
# Node 8 has distance: 14
# ----Path to reach 4 from 0----
# 0 -> 7 -> 6 -> 5 -> 4
# Total cost of path:  21





"""simple docstring"""






import os
import unittest

from transformers import RealmTokenizerFast
from transformers.models.bert.tokenization_bert import (
    VOCAB_FILES_NAMES,
    BasicTokenizer,
    WordpieceTokenizer,
    _is_control,
    _is_punctuation,
    _is_whitespace,
)
from transformers.models.realm.tokenization_realm import RealmTokenizer
from transformers.testing_utils import require_tokenizers, slow

from ...test_tokenization_common import TokenizerTesterMixin, filter_non_english


@require_tokenizers
class 	A_       (     _UpperCAmelCase      ,  unittest.TestCase   ):





  """simple docstring"""

  lowercase		:	Any   =						RealmTokenizer
  lowercase		:	Any   =						RealmTokenizerFast
  lowercase		:	int   =						True
  lowercase		:	Union[str, Any]   =						True
  lowercase		:	int   =						filter_non_english
  def 							lowercase_     (						self						)				->					int:
     super().setUp()

     a   :	str						=    [
         '[UNK]',
         '[CLS]',
         '[SEP]',
         '[PAD]',
         '[MASK]',
         'want',
         '##want',
         '##ed',
         'wa',
         'un',
         'runn',
         '##ing',
         ',',
         'low',
         'lowest',
     ]
     a   :	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]						)						)
  def 							lowercase_     (						self  ,					__UpperCAmelCase						)				->					Optional[int]:
     a   :	List[str]						=    'UNwant\u00E9d,running'
     a   :	Dict						=    'unwanted, running'
     return input_text, output_text
  def 							lowercase_     (						self						)				->					Union[str, Any]:
     a   :	int						=    self.tokenizer_class(self.vocab_file						)

     a   :	List[Any]						=    tokenizer.tokenize('UNwant\u00E9d,running'						)
     self.assertListEqual(__UpperCAmelCase  ,					['un', '##want', '##ed', ',', 'runn', '##ing']						)
     self.assertListEqual(tokenizer.convert_tokens_to_ids(__UpperCAmelCase						)  ,					[9, 6, 7, 12, 10, 11]						)
  def 							lowercase_     (						self						)				->					Dict:
     if not self.test_rust_tokenizer:
        return

     a   :	int						=    self.get_tokenizer()
     a   :	List[str]						=    self.get_rust_tokenizer()

     a   :	str						=    'UNwant\u00E9d,running'

     a   :	Optional[int]						=    tokenizer.tokenize(__UpperCAmelCase						)
     a   :	Tuple						=    rust_tokenizer.tokenize(__UpperCAmelCase						)
     self.assertListEqual(__UpperCAmelCase  ,					__UpperCAmelCase						)

     a   :	Optional[int]						=    tokenizer.encode(__UpperCAmelCase  ,					add_special_tokens=__UpperCAmelCase						)
     a   :	Tuple						=    rust_tokenizer.encode(__UpperCAmelCase  ,					add_special_tokens=__UpperCAmelCase						)
     self.assertListEqual(__UpperCAmelCase  ,					__UpperCAmelCase						)

     a   :	Tuple						=    self.get_rust_tokenizer()
     a   :	Optional[int]						=    tokenizer.encode(__UpperCAmelCase						)
     a   :	Union[str, Any]						=    rust_tokenizer.encode(__UpperCAmelCase						)
     self.assertListEqual(__UpperCAmelCase  ,					__UpperCAmelCase						)

     # With lower casing
     a   :	List[str]						=    self.get_tokenizer(do_lower_case=__UpperCAmelCase						)
     a   :	Any						=    self.get_rust_tokenizer(do_lower_case=__UpperCAmelCase						)

     a   :	Any						=    'UNwant\u00E9d,running'

     a   :	Tuple						=    tokenizer.tokenize(__UpperCAmelCase						)
     a   :	List[Any]						=    rust_tokenizer.tokenize(__UpperCAmelCase						)
     self.assertListEqual(__UpperCAmelCase  ,					__UpperCAmelCase						)

     a   :	Any						=    tokenizer.encode(__UpperCAmelCase  ,					add_special_tokens=__UpperCAmelCase						)
     a   :	Any						=    rust_tokenizer.encode(__UpperCAmelCase  ,					add_special_tokens=__UpperCAmelCase						)
     self.assertListEqual(__UpperCAmelCase  ,					__UpperCAmelCase						)

     a   :	Optional[int]						=    self.get_rust_tokenizer()
     a   :	int						=    tokenizer.encode(__UpperCAmelCase						)
     a   :	Union[str, Any]						=    rust_tokenizer.encode(__UpperCAmelCase						)
     self.assertListEqual(__UpperCAmelCase  ,					__UpperCAmelCase						)
  def 							lowercase_     (						self						)				->					Union[str, Any]:
     a   :	Any						=    BasicTokenizer()

     self.assertListEqual(tokenizer.tokenize('ah\u535A\u63A8zz'						)  ,					['ah', '\u535A', '\u63A8', 'zz']						)
  def 							lowercase_     (						self						)				->					Tuple:
     a   :	Tuple						=    BasicTokenizer(do_lower_case=__UpperCAmelCase						)

     self.assertListEqual(
         tokenizer.tokenize(' \tHeLLo!how  \n Are yoU?  '						)  ,					['hello', '!', 'how', 'are', 'you', '?']						)
     self.assertListEqual(tokenizer.tokenize('H\u00E9llo'						)  ,					['hello']						)
  def 							lowercase_     (						self						)				->					Dict:
     a   :	Optional[int]						=    BasicTokenizer(do_lower_case=__UpperCAmelCase  ,					strip_accents=__UpperCAmelCase						)

     self.assertListEqual(
         tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '						)  ,					['hällo', '!', 'how', 'are', 'you', '?']						)
     self.assertListEqual(tokenizer.tokenize('H\u00E9llo'						)  ,					['h\u00E9llo']						)
  def 							lowercase_     (						self						)				->					Optional[Any]:
     a   :	List[Any]						=    BasicTokenizer(do_lower_case=__UpperCAmelCase  ,					strip_accents=__UpperCAmelCase						)

     self.assertListEqual(
         tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '						)  ,					['hallo', '!', 'how', 'are', 'you', '?']						)
     self.assertListEqual(tokenizer.tokenize('H\u00E9llo'						)  ,					['hello']						)
  def 							lowercase_     (						self						)				->					Dict:
     a   :	Optional[Any]						=    BasicTokenizer(do_lower_case=__UpperCAmelCase						)

     self.assertListEqual(
         tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '						)  ,					['hallo', '!', 'how', 'are', 'you', '?']						)
     self.assertListEqual(tokenizer.tokenize('H\u00E9llo'						)  ,					['hello']						)
  def 							lowercase_     (						self						)				->					int:
     a   :	Any						=    BasicTokenizer(do_lower_case=__UpperCAmelCase						)

     self.assertListEqual(
         tokenizer.tokenize(' \tHeLLo!how  \n Are yoU?  '						)  ,					['HeLLo', '!', 'how', 'Are', 'yoU', '?']						)
  def 							lowercase_     (						self						)				->					Any:
     a   :	List[str]						=    BasicTokenizer(do_lower_case=__UpperCAmelCase  ,					strip_accents=__UpperCAmelCase						)

     self.assertListEqual(
         tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '						)  ,					['HäLLo', '!', 'how', 'Are', 'yoU', '?']						)
  def 							lowercase_     (						self						)				->					List[Any]:
     a   :	Optional[int]						=    BasicTokenizer(do_lower_case=__UpperCAmelCase  ,					strip_accents=__UpperCAmelCase						)

     self.assertListEqual(
         tokenizer.tokenize(' \tHäLLo!how  \n Are yoU?  '						)  ,					['HaLLo', '!', 'how', 'Are', 'yoU', '?']						)
  def 							lowercase_     (						self						)				->					Optional[Any]:
     a   :	List[Any]						=    BasicTokenizer(do_lower_case=__UpperCAmelCase  ,					never_split=['[UNK]']						)

     self.assertListEqual(
         tokenizer.tokenize(' \tHeLLo!how  \n Are yoU? [UNK]'						)  ,					['HeLLo', '!', 'how', 'Are', 'yoU', '?', '[UNK]']						)
  def 							lowercase_     (						self						)				->					int:
     a   :	Optional[int]						=    ['[UNK]', '[CLS]', '[SEP]', 'want', '##want', '##ed', 'wa', 'un', 'runn', '##ing']

     a   :	str						=    {}
     for i, token in enumerate(__UpperCAmelCase						):
        a   :	str						=    i
     a   :	List[Any]						=    WordpieceTokenizer(vocab=__UpperCAmelCase  ,					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 							lowercase_     (						self						)				->					Any:
     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 							lowercase_     (						self						)				->					Optional[int]:
     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 							lowercase_     (						self						)				->					Union[str, Any]:
     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 							lowercase_     (						self						)				->					Union[str, Any]:
     a   :	List[str]						=    self.get_tokenizer()

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

     if self.test_rust_tokenizer:
        a   :	Tuple						=    self.get_rust_tokenizer()
        self.assertListEqual(
            [rust_tokenizer.tokenize(__UpperCAmelCase						) for t in ['Test', '\xad', 'test']]  ,					[['[UNK]'], [], ['[UNK]']]						)
  @slow
  def 							lowercase_     (						self						)				->					Dict:
     a   :	Optional[int]						=    self.tokenizer_class.from_pretrained('bert-base-uncased'						)

     a   :	Optional[Any]						=    tokenizer.encode('sequence builders'  ,					add_special_tokens=__UpperCAmelCase						)
     a   :	Optional[int]						=    tokenizer.encode('multi-sequence build'  ,					add_special_tokens=__UpperCAmelCase						)

     a   :	str						=    tokenizer.build_inputs_with_special_tokens(__UpperCAmelCase						)
     a   :	Union[str, Any]						=    tokenizer.build_inputs_with_special_tokens(__UpperCAmelCase  ,					__UpperCAmelCase						)

     assert encoded_sentence == [1_01] + text + [1_02]
     assert encoded_pair == [1_01] + text + [1_02] + text_a + [1_02]
  def 							lowercase_     (						self						)				->					List[str]:
     for tokenizer, pretrained_name, kwargs in self.tokenizers_list:
        with self.subTest(f'{tokenizer.__class__.__name__} ({pretrained_name})'						):
           a   :	str						=    self.rust_tokenizer_class.from_pretrained(__UpperCAmelCase  ,					**__UpperCAmelCase						)

           a   :	Tuple						=    f'A, naïve {tokenizer_r.mask_token} AllenNLP sentence.'
           a   :	Union[str, Any]						=    tokenizer_r.encode_plus(
               __UpperCAmelCase  ,					return_attention_mask=__UpperCAmelCase  ,					return_token_type_ids=__UpperCAmelCase  ,					return_offsets_mapping=__UpperCAmelCase  ,					add_special_tokens=__UpperCAmelCase  ,					)

           a   :	List[Any]						=    tokenizer_r.do_lower_case if hasattr(__UpperCAmelCase  ,					'do_lower_case'						) else False
           a   :	str						=    (
               [
                   ((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']						)






  @slow
  def 							lowercase_     (						self						)				->					Dict:
     for tokenizer, pretrained_name, kwargs in self.tokenizers_list:
        with self.subTest(f'{tokenizer.__class__.__name__} ({pretrained_name})'						):
           a   :	str						=    self.rust_tokenizer_class.from_pretrained(__UpperCAmelCase  ,					**__UpperCAmelCase						)
           a   :	str						=    self.tokenizer_class.from_pretrained(__UpperCAmelCase  ,					**__UpperCAmelCase						)
           a   :	Dict						=    [['Hello world!', 'Nice to meet you!'], ['The cute cat.', 'The adorable dog.']]

           a   :	Optional[int]						=    tokenizer_r.batch_encode_candidates(__UpperCAmelCase  ,					max_length=10  ,					return_tensors='np'						)
           a   :	str						=    tokenizer_p.batch_encode_candidates(__UpperCAmelCase  ,					max_length=10  ,					return_tensors='np'						)

           a   :	Dict						=    (2, 2, 10)

           self.assertEqual(encoded_sentence_r['input_ids'].shape  ,					__UpperCAmelCase						)
           self.assertEqual(encoded_sentence_r['attention_mask'].shape  ,					__UpperCAmelCase						)
           self.assertEqual(encoded_sentence_r['token_type_ids'].shape  ,					__UpperCAmelCase						)

           self.assertEqual(encoded_sentence_p['input_ids'].shape  ,					__UpperCAmelCase						)
           self.assertEqual(encoded_sentence_p['attention_mask'].shape  ,					__UpperCAmelCase						)
           self.assertEqual(encoded_sentence_p['token_type_ids'].shape  ,					__UpperCAmelCase						)





