



'''simple docstring'''





import collections
from typing import List, Optional, Union

from ...tokenization_utils_base import BatchEncoding
from ...utils import TensorType, add_end_docstrings, add_start_docstrings, logging
from ..bert.tokenization_bert import BertTokenizer


__a          =		logging.get_logger(__name__)

__a          =		{"vocab_file": "vocab.txt", "tokenizer_file": "tokenizer.json"}

__a          =		{
    "vocab_file": {
        "facebook/dpr-ctx_encoder-single-nq-base": (
            "https://huggingface.co/facebook/dpr-ctx_encoder-single-nq-base/resolve/main/vocab.txt"
        ),
        "facebook/dpr-ctx_encoder-multiset-base": (
            "https://huggingface.co/facebook/dpr-ctx_encoder-multiset-base/resolve/main/vocab.txt"
        ),
    },
    "tokenizer_file": {
        "facebook/dpr-ctx_encoder-single-nq-base": (
            "https://huggingface.co/facebook/dpr-ctx_encoder-single-nq-base/resolve/main/tokenizer.json"
        ),
        "facebook/dpr-ctx_encoder-multiset-base": (
            "https://huggingface.co/facebook/dpr-ctx_encoder-multiset-base/resolve/main/tokenizer.json"
        ),
    },
}
__a          =		{
    "vocab_file": {
        "facebook/dpr-question_encoder-single-nq-base": (
            "https://huggingface.co/facebook/dpr-question_encoder-single-nq-base/resolve/main/vocab.txt"
        ),
        "facebook/dpr-question_encoder-multiset-base": (
            "https://huggingface.co/facebook/dpr-question_encoder-multiset-base/resolve/main/vocab.txt"
        ),
    },
    "tokenizer_file": {
        "facebook/dpr-question_encoder-single-nq-base": (
            "https://huggingface.co/facebook/dpr-question_encoder-single-nq-base/resolve/main/tokenizer.json"
        ),
        "facebook/dpr-question_encoder-multiset-base": (
            "https://huggingface.co/facebook/dpr-question_encoder-multiset-base/resolve/main/tokenizer.json"
        ),
    },
}
__a          =		{
    "vocab_file": {
        "facebook/dpr-reader-single-nq-base": (
            "https://huggingface.co/facebook/dpr-reader-single-nq-base/resolve/main/vocab.txt"
        ),
        "facebook/dpr-reader-multiset-base": (
            "https://huggingface.co/facebook/dpr-reader-multiset-base/resolve/main/vocab.txt"
        ),
    },
    "tokenizer_file": {
        "facebook/dpr-reader-single-nq-base": (
            "https://huggingface.co/facebook/dpr-reader-single-nq-base/resolve/main/tokenizer.json"
        ),
        "facebook/dpr-reader-multiset-base": (
            "https://huggingface.co/facebook/dpr-reader-multiset-base/resolve/main/tokenizer.json"
        ),
    },
}

__a          =		{
    "facebook/dpr-ctx_encoder-single-nq-base": 512,
    "facebook/dpr-ctx_encoder-multiset-base": 512,
}
__a          =		{
    "facebook/dpr-question_encoder-single-nq-base": 512,
    "facebook/dpr-question_encoder-multiset-base": 512,
}
__a          =		{
    "facebook/dpr-reader-single-nq-base": 512,
    "facebook/dpr-reader-multiset-base": 512,
}


__a          =		{
    "facebook/dpr-ctx_encoder-single-nq-base": {"do_lower_case": True},
    "facebook/dpr-ctx_encoder-multiset-base": {"do_lower_case": True},
}
__a          =		{
    "facebook/dpr-question_encoder-single-nq-base": {"do_lower_case": True},
    "facebook/dpr-question_encoder-multiset-base": {"do_lower_case": True},
}
__a          =		{
    "facebook/dpr-reader-single-nq-base": {"do_lower_case": True},
    "facebook/dpr-reader-multiset-base": {"do_lower_case": True},
}







class     UpperCAmelCase_       (       _a	):
    """simple docstring"""







    lowercase					=		VOCAB_FILES_NAMES
    lowercase					=		CONTEXT_ENCODER_PRETRAINED_VOCAB_FILES_MAP
    lowercase					=		CONTEXT_ENCODER_PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
    lowercase					=		CONTEXT_ENCODER_PRETRAINED_INIT_CONFIGURATION







class     UpperCAmelCase_       (       _a	):
    """simple docstring"""







    lowercase					=		VOCAB_FILES_NAMES
    lowercase					=		QUESTION_ENCODER_PRETRAINED_VOCAB_FILES_MAP
    lowercase					=		QUESTION_ENCODER_PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
    lowercase					=		QUESTION_ENCODER_PRETRAINED_INIT_CONFIGURATION
__a          =		collections.namedtuple(
    "DPRSpanPrediction", ["span_score", "relevance_score", "doc_id", "start_index", "end_index", "text"]
)

__a          =		collections.namedtuple("DPRReaderOutput", ["start_logits", "end_logits", "relevance_logits"])


__a          =		R"\n    Return a dictionary with the token ids of the input strings and other information to give to `.decode_best_spans`.\n    It converts the strings of a question and different passages (title and text) in a sequence of IDs (integers),\n    using the tokenizer and vocabulary. The resulting `input_ids` is a matrix of size `(n_passages, sequence_length)`\n    with the format:\n\n    ```\n    [CLS] <question token ids> [SEP] <titles ids> [SEP] <texts ids>\n    ```\n\n    Args:\n        questions (`str` or `List[str]`):\n            The questions to be encoded. You can specify one question for many passages. In this case, the question\n            will be duplicated like `[questions] * n_passages`. Otherwise you have to specify as many questions as in\n            `titles` or `texts`.\n        titles (`str` or `List[str]`):\n            The passages titles to be encoded. This can be a string or a list of strings if there are several passages.\n        texts (`str` or `List[str]`):\n            The passages texts to be encoded. This can be a string or a list of strings if there are several passages.\n        padding (`bool`, `str` or [`~utils.PaddingStrategy`], *optional*, defaults to `False`):\n            Activates and controls padding. Accepts the following values:\n\n            - `True` or `'longest'`: Pad to the longest sequence in the batch (or no padding if only a single sequence\n              if provided).\n            - `'max_length'`: Pad to a maximum length specified with the argument `max_length` or to the maximum\n              acceptable input length for the model if that argument is not provided.\n            - `False` or `'do_not_pad'` (default): No padding (i.e., can output a batch with sequences of different\n              lengths).\n        truncation (`bool`, `str` or [`~tokenization_utils_base.TruncationStrategy`], *optional*, defaults to `False`):\n            Activates and controls truncation. Accepts the following values:\n\n            - `True` or `'longest_first'`: Truncate to a maximum length specified with the argument `max_length` or to\n              the maximum acceptable input length for the model if that argument is not provided. This will truncate\n              token by token, removing a token from the longest sequence in the pair if a pair of sequences (or a batch\n              of pairs) is provided.\n            - `'only_first'`: Truncate to a maximum length specified with the argument `max_length` or to the maximum\n              acceptable input length for the model if that argument is not provided. This will only truncate the first\n              sequence of a pair if a pair of sequences (or a batch of pairs) is provided.\n            - `'only_second'`: Truncate to a maximum length specified with the argument `max_length` or to the maximum\n              acceptable input length for the model if that argument is not provided. This will only truncate the\n              second sequence of a pair if a pair of sequences (or a batch of pairs) is provided.\n            - `False` or `'do_not_truncate'` (default): No truncation (i.e., can output batch with sequence lengths\n              greater than the model maximum admissible input size).\n        max_length (`int`, *optional*):\n                Controls the maximum length to use by one of the truncation/padding parameters.\n\n                If left unset or set to `None`, this will use the predefined model maximum length if a maximum length\n                is required by one of the truncation/padding parameters. If the model has no specific maximum input\n                length (like XLNet) truncation/padding to a maximum length will be deactivated.\n        return_tensors (`str` or [`~utils.TensorType`], *optional*):\n                If set, will return tensors instead of list of python integers. Acceptable values are:\n\n                - `'tf'`: Return TensorFlow `tf.constant` objects.\n                - `'pt'`: Return PyTorch `torch.Tensor` objects.\n                - `'np'`: Return Numpy `np.ndarray` objects.\n        return_attention_mask (`bool`, *optional*):\n            Whether or not to return the attention mask. If not set, will return the attention mask according to the\n            specific tokenizer's default, defined by the `return_outputs` attribute.\n\n            [What are attention masks?](../glossary#attention-mask)\n\n    Returns:\n        `Dict[str, List[List[int]]]`: A dictionary with the following keys:\n\n        - `input_ids`: List of token ids to be fed to a model.\n        - `attention_mask`: List of indices specifying which tokens should be attended to by the model.\n    "







@add_start_docstrings(_a	)
class     UpperCAmelCase_       :
    """simple docstring"""







    def __call__(    self					:     List[Any] ,     snake_case_					:     Optional[Any] ,     snake_case_					:     Optional[str] = None ,     snake_case_					:     Optional[str] = None ,     snake_case_					:     Union[bool, str] = False ,     snake_case_					:     Union[bool, str] = False ,     snake_case_					:     Optional[int] = None ,     snake_case_					:     Optional[Union[str, TensorType]] = None ,     snake_case_					:     Optional[bool] = None ,     **snake_case_					:     List[Any] ,     ):
          if titles is None and texts is None:
                return super().__call__(
                    snake_case_ ,     padding=snake_case_ ,     truncation=snake_case_ ,     max_length=snake_case_ ,     return_tensors=snake_case_ ,     return_attention_mask=snake_case_ ,     **snake_case_ ,     )
          elif titles is None or texts is None:
                snake_case__  :    List[str]    						=      titles if texts is None else texts
                return super().__call__(
                    snake_case_ ,     snake_case_ ,     padding=snake_case_ ,     truncation=snake_case_ ,     max_length=snake_case_ ,     return_tensors=snake_case_ ,     return_attention_mask=snake_case_ ,     **snake_case_ ,     )
          snake_case__  :    Optional[Any]    						=      titles if not isinstance(snake_case_ ,     snake_case_						) else [titles]
          snake_case__  :    Union[str, Any]    						=      texts if not isinstance(snake_case_ ,     snake_case_						) else [texts]
          snake_case__  :    Union[str, Any]    						=      len(snake_case_						)
          snake_case__  :    Any    						=      questions if not isinstance(snake_case_ ,     snake_case_						) else [questions] * n_passages
          if len(snake_case_						) != len(snake_case_						):
                raise ValueError(
                    f"There should be as many titles than texts but got {len(snake_case_						)} titles and {len(snake_case_						)} texts."						)
          snake_case__  :    Dict    						=      super().__call__(snake_case_ ,     snake_case_ ,     padding=snake_case_ ,     truncation=snake_case_						)["""input_ids"""]
          snake_case__  :    List[Any]    						=      super().__call__(snake_case_ ,     add_special_tokens=snake_case_ ,     padding=snake_case_ ,     truncation=snake_case_						)["""input_ids"""]
          snake_case__  :    Any    						=      {
              """input_ids""": [
                  (encoded_question_and_title + encoded_text)[:max_length]
                  if max_length is not None and truncation
                  else encoded_question_and_title + encoded_text
                  for encoded_question_and_title, encoded_text in zip(snake_case_ ,     snake_case_						)
              ]
          }
          if return_attention_mask is not False:
                snake_case__  :    str    						=      []
                for input_ids in encoded_inputs["input_ids"]:
                      attention_mask.append([int(input_id != self.pad_token_id						) for input_id in input_ids]						)
                snake_case__  :    Optional[Any]    						=      attention_mask
          return self.pad(snake_case_ ,     padding=snake_case_ ,     max_length=snake_case_ ,     return_tensors=snake_case_						)




    def lowerCamelCase       (    self					:     Tuple ,     snake_case_					:     BatchEncoding ,     snake_case_					:     DPRReaderOutput ,     snake_case_					:     int = 16 ,     snake_case_					:     int = 64 ,     snake_case_					:     int = 4 ,     ):
          snake_case__  :    Dict    						=      reader_input["""input_ids"""]
          snake_case__						,				snake_case__						,				snake_case__  :    int    						=      reader_output[:3]
          snake_case__  :    Optional[int]    						=      len(snake_case_						)
          snake_case__  :    List[Any]    						=      sorted(range(snake_case_						) ,     reverse=snake_case_ ,     key=relevance_logits.__getitem__						)
          snake_case__  :    List[DPRReaderOutput]    						=      []
          for doc_id in sorted_docs:
                snake_case__  :    int    						=      list(input_ids[doc_id]						)
                # assuming question & title information is at the beginning of the sequence
                snake_case__  :    List[str]    						=      sequence_ids.index(self.sep_token_id ,     2						) + 1  # second sep id
                if sequence_ids[-1] == self.pad_token_id:
                      snake_case__  :    Any    						=      sequence_ids.index(self.pad_token_id						)
                else:
                      snake_case__  :    List[str]    						=      len(snake_case_						)

                snake_case__  :    Any    						=      self._get_best_spans(
                    start_logits=start_logits[doc_id][passage_offset:sequence_len] ,     end_logits=end_logits[doc_id][passage_offset:sequence_len] ,     max_answer_length=snake_case_ ,     top_spans=snake_case_ ,     )
                for start_index, end_index in best_spans:
                      start_index += passage_offset
                      end_index += passage_offset
                      nbest_spans_predictions.append(
                          DPRSpanPrediction(
                              span_score=start_logits[doc_id][start_index] + end_logits[doc_id][end_index] ,     relevance_score=relevance_logits[doc_id] ,     doc_id=snake_case_ ,     start_index=snake_case_ ,     end_index=snake_case_ ,     text=self.decode(sequence_ids[start_index : end_index + 1]						) ,     )						)
                if len(snake_case_						) >= num_spans:
                      break
          return nbest_spans_predictions[:num_spans]




    def lowerCamelCase       (    self					:     Tuple ,     snake_case_					:     List[int] ,     snake_case_					:     List[int] ,     snake_case_					:     int ,     snake_case_					:     int ,     ):
          snake_case__  :    Union[str, Any]    						=      []
          for start_index, start_score in enumerate(snake_case_						):
                for answer_length, end_score in enumerate(end_logits[start_index : start_index + max_answer_length]						):
                      scores.append(((start_index, start_index + answer_length), start_score + end_score)						)
          snake_case__  :    Dict    						=      sorted(snake_case_ ,     key=lambda snake_case_						: x[1] ,     reverse=snake_case_						)
          snake_case__  :    Optional[int]    						=      []
          for (start_index, end_index), score in scores:
                if start_index > end_index:
                      raise ValueError(f"Wrong span indices: [{start_index}:{end_index}]"						)
                snake_case__  :    Union[str, Any]    						=      end_index - start_index + 1
                if length > max_answer_length:
                      raise ValueError(f"Span is too long: {length} > {max_answer_length}"						)
                if any(
                    start_index <= prev_start_index <= prev_end_index <= end_index
                    or prev_start_index <= start_index <= end_index <= prev_end_index
                    for (prev_start_index, prev_end_index) in chosen_span_intervals						):
                      continue
                chosen_span_intervals.append((start_index, end_index)						)

                if len(snake_case_						) == top_spans:
                      break
          return chosen_span_intervals







@add_end_docstrings(_a	)
class     UpperCAmelCase_       (       _a		,		_a	):
    """simple docstring"""







    lowercase					=		VOCAB_FILES_NAMES
    lowercase					=		READER_PRETRAINED_VOCAB_FILES_MAP
    lowercase					=		READER_PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
    lowercase					=		READER_PRETRAINED_INIT_CONFIGURATION
    lowercase					=		["input_ids", "attention_mask"]







import os
import re
from shutil import copyfile
from typing import Any, Dict, List, Optional, Tuple

import sentencepiece as spm

from ...tokenization_utils import AddedToken, PreTrainedTokenizer
from ...utils import logging


a__:      Union[str, Any]									=		logging.get_logger(__name__)

a__:      Union[str, Any]									=		{'vocab_file': 'spiece.model'}

a__:      Tuple									=		{
    'vocab_file': {
        'google/bigbird-roberta-base': 'https://huggingface.co/google/bigbird-roberta-base/resolve/main/spiece.model',
        'google/bigbird-roberta-large': (
            'https://huggingface.co/google/bigbird-roberta-large/resolve/main/spiece.model'
        ),
        'google/bigbird-base-trivia-itc': (
            'https://huggingface.co/google/bigbird-base-trivia-itc/resolve/main/spiece.model'
        ),
    }
}

a__:      Any									=		{
    'google/bigbird-roberta-base': 4_096,
    'google/bigbird-roberta-large': 4_096,
    'google/bigbird-base-trivia-itc': 4_096,
}




class     SCREAMING_SNAKE_CASE__ (						UpperCamelCase__      ):
 __SCREAMING_SNAKE_CASE							       =	VOCAB_FILES_NAMES
 __SCREAMING_SNAKE_CASE							       =	PRETRAINED_VOCAB_FILES_MAP
 __SCREAMING_SNAKE_CASE							       =	PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
 __SCREAMING_SNAKE_CASE							       =	['''input_ids''', '''attention_mask''']
 __SCREAMING_SNAKE_CASE							       =	[]



 def __init__(							self,__lowerCamelCase,__lowerCamelCase="<unk>",__lowerCamelCase="<s>",__lowerCamelCase="</s>",__lowerCamelCase="<pad>",__lowerCamelCase="[SEP]",__lowerCamelCase="[MASK]",__lowerCamelCase="[CLS]",__lowerCamelCase = None,**__lowerCamelCase,):
        A__											=						AddedToken(__lowerCamelCase,lstrip=__lowerCamelCase,rstrip=__lowerCamelCase ) if isinstance(__lowerCamelCase,__lowerCamelCase ) else bos_token
        A__											=						AddedToken(__lowerCamelCase,lstrip=__lowerCamelCase,rstrip=__lowerCamelCase ) if isinstance(__lowerCamelCase,__lowerCamelCase ) else eos_token
        A__											=						AddedToken(__lowerCamelCase,lstrip=__lowerCamelCase,rstrip=__lowerCamelCase ) if isinstance(__lowerCamelCase,__lowerCamelCase ) else unk_token
        A__											=						AddedToken(__lowerCamelCase,lstrip=__lowerCamelCase,rstrip=__lowerCamelCase ) if isinstance(__lowerCamelCase,__lowerCamelCase ) else pad_token
        A__											=						AddedToken(__lowerCamelCase,lstrip=__lowerCamelCase,rstrip=__lowerCamelCase ) if isinstance(__lowerCamelCase,__lowerCamelCase ) else cls_token
        A__											=						AddedToken(__lowerCamelCase,lstrip=__lowerCamelCase,rstrip=__lowerCamelCase ) if isinstance(__lowerCamelCase,__lowerCamelCase ) else sep_token

        # Mask token behave like a normal word, i.e. include the space before it
        A__											=						AddedToken(__lowerCamelCase,lstrip=__lowerCamelCase,rstrip=__lowerCamelCase ) if isinstance(__lowerCamelCase,__lowerCamelCase ) else mask_token

        A__											=						{} if sp_model_kwargs is None else sp_model_kwargs

        super().__init__(
            bos_token=__lowerCamelCase,eos_token=__lowerCamelCase,unk_token=__lowerCamelCase,pad_token=__lowerCamelCase,sep_token=__lowerCamelCase,mask_token=__lowerCamelCase,cls_token=__lowerCamelCase,sp_model_kwargs=self.sp_model_kwargs,**__lowerCamelCase,)

        A__											=						vocab_file

        A__											=						spm.SentencePieceProcessor(**self.sp_model_kwargs )
        self.sp_model.Load(__lowerCamelCase )



 @property
 def 				UpperCamelCase			(							self ):
        return self.sp_model.get_piece_size()



 def 				UpperCamelCase			(							self ):
        A__											=						{self.convert_ids_to_tokens(__lowerCamelCase ): i for i in range(self.vocab_size )}
        vocab.update(self.added_tokens_encoder )
        return vocab



 def __getstate__(							self ):
        A__											=						self.__dict__.copy()
        A__											=						None
        return state



 def __setstate__(							self,__lowerCamelCase ):
        A__											=						d

        # for backward compatibility
        if not hasattr(self,'''sp_model_kwargs''' ):
               A__											=						{}

        A__											=						spm.SentencePieceProcessor(**self.sp_model_kwargs )
        self.sp_model.Load(self.vocab_file )



 def 				UpperCamelCase			(							self,__lowerCamelCase ):
        return self.sp_model.encode(__lowerCamelCase,out_type=__lowerCamelCase )



 def 				UpperCamelCase			(							self,__lowerCamelCase ):
        return self.sp_model.piece_to_id(__lowerCamelCase )



 def 				UpperCamelCase			(							self,__lowerCamelCase ):
        A__											=						self.sp_model.IdToPiece(__lowerCamelCase )
        return token



 def 				UpperCamelCase			(							self,__lowerCamelCase ):
        A__											=						[]
        A__											=						''''''
        A__											=						False
        for token in tokens:
               # make sure that special tokens are not decoded using sentencepiece model
               if token in self.all_special_tokens:
                      if not prev_is_special:
                             out_string += " "
                      out_string += self.sp_model.decode(__lowerCamelCase ) + token
                      A__											=						True
                      A__											=						[]
               else:
                      current_sub_tokens.append(__lowerCamelCase )
                      A__											=						False
        out_string += self.sp_model.decode(__lowerCamelCase )
        return out_string.strip()



 def 				UpperCamelCase			(							self,__lowerCamelCase,__lowerCamelCase = False,__lowerCamelCase = None,__lowerCamelCase = True,**__lowerCamelCase,):
        A__											=						kwargs.pop('''use_source_tokenizer''',__lowerCamelCase )

        A__											=						self.convert_ids_to_tokens(__lowerCamelCase,skip_special_tokens=__lowerCamelCase )

        # To avoid mixing byte-level and unicode for byte-level BPT
        # we need to build string separately for added tokens and byte-level tokens
        # cf. https://github.com/huggingface/transformers/issues/1133
        A__											=						[]
        A__											=						[]
        for token in filtered_tokens:
               if skip_special_tokens and token in self.all_special_ids:
                      continue
               if token in self.added_tokens_encoder:
                      if current_sub_text:
                             sub_texts.append(self.convert_tokens_to_string(__lowerCamelCase ) )
                             A__											=						[]
                      sub_texts.append(__lowerCamelCase )
               else:
                      current_sub_text.append(__lowerCamelCase )
        if current_sub_text:
               sub_texts.append(self.convert_tokens_to_string(__lowerCamelCase ) )

        # Mimic the behavior of the Rust tokenizer:
        # No space before [MASK] and [SEP]
        if spaces_between_special_tokens:
               A__											=						re.sub(r''' (\[(MASK|SEP)\])''',r'''\1''',''' '''.join(__lowerCamelCase ) )
        else:
               A__											=						''''''.join(__lowerCamelCase )

        A__											=						(
            clean_up_tokenization_spaces
            if clean_up_tokenization_spaces is not None
            else self.clean_up_tokenization_spaces
        )
        if clean_up_tokenization_spaces:
               A__											=						self.clean_up_tokenization(__lowerCamelCase )
               return clean_text
        else:
               return text



 def 				UpperCamelCase			(							self,__lowerCamelCase,__lowerCamelCase = None ):
        if not os.path.isdir(__lowerCamelCase ):
               logger.error(f"Vocabulary path ({save_directory}) should be a directory" )
               return
        A__											=						os.path.join(
            __lowerCamelCase,(filename_prefix + '''-''' if filename_prefix else '''''') + VOCAB_FILES_NAMES['''vocab_file'''] )

        if os.path.abspath(self.vocab_file ) != os.path.abspath(__lowerCamelCase ) and os.path.isfile(self.vocab_file ):
               copyfile(self.vocab_file,__lowerCamelCase )
        elif not os.path.isfile(self.vocab_file ):
               with open(__lowerCamelCase,'''wb''' ) as fi:
                      A__											=						self.sp_model.serialized_model_proto()
                      fi.write(__lowerCamelCase )

        return (out_vocab_file,)



 def 				UpperCamelCase			(							self,__lowerCamelCase,__lowerCamelCase = None ):
        if token_ids_a is None:
               return [self.cls_token_id] + token_ids_a + [self.sep_token_id]
        A__											=						[self.cls_token_id]
        A__											=						[self.sep_token_id]
        return cls + token_ids_a + sep + token_ids_a + sep



 def 				UpperCamelCase			(							self,__lowerCamelCase,__lowerCamelCase = None,__lowerCamelCase = False ):
        if already_has_special_tokens:
               return super().get_special_tokens_mask(
                   token_ids_a=__lowerCamelCase,token_ids_a=__lowerCamelCase,already_has_special_tokens=__lowerCamelCase )

        if token_ids_a is None:
               return [1] + ([0] * len(__lowerCamelCase )) + [1]
        return [1] + ([0] * len(__lowerCamelCase )) + [1] + ([0] * len(__lowerCamelCase )) + [1]




 def 				UpperCamelCase			(							self,__lowerCamelCase,__lowerCamelCase = None ):
        A__											=						[self.sep_token_id]
        A__											=						[self.cls_token_id]
        if token_ids_a is None:
               return len(cls + token_ids_a + sep ) * [0]
        return len(cls + token_ids_a + sep ) * [0] + len(token_ids_a + sep ) * [1]





