



'''simple docstring'''
import json
import os
from functools import lru_cache
from typing import List, Optional, Tuple

import regex as re

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


snake_case_			:     List[Any]  	=  logging.get_logger(__name__)


snake_case_			:     str  	=  {'vocab_file': 'vocab.json', 'merges_file': 'merges.txt'}

# See all BART models at https://huggingface.co/models?filter=bart
snake_case_			:     Union[str, Any]  	=  {
    'vocab_file': {
        'facebook/bart-base': 'https://huggingface.co/facebook/bart-base/resolve/main/vocab.json',
        'facebook/bart-large': 'https://huggingface.co/facebook/bart-large/resolve/main/vocab.json',
        'facebook/bart-large-mnli': 'https://huggingface.co/facebook/bart-large-mnli/resolve/main/vocab.json',
        'facebook/bart-large-cnn': 'https://huggingface.co/facebook/bart-large-cnn/resolve/main/vocab.json',
        'facebook/bart-large-xsum': 'https://huggingface.co/facebook/bart-large-xsum/resolve/main/vocab.json',
        'yjernite/bart_eli5': 'https://huggingface.co/yjernite/bart_eli5/resolve/main/vocab.json',
    },
    'merges_file': {
        'facebook/bart-base': 'https://huggingface.co/facebook/bart-base/resolve/main/merges.txt',
        'facebook/bart-large': 'https://huggingface.co/facebook/bart-large/resolve/main/merges.txt',
        'facebook/bart-large-mnli': 'https://huggingface.co/facebook/bart-large-mnli/resolve/main/merges.txt',
        'facebook/bart-large-cnn': 'https://huggingface.co/facebook/bart-large-cnn/resolve/main/merges.txt',
        'facebook/bart-large-xsum': 'https://huggingface.co/facebook/bart-large-xsum/resolve/main/merges.txt',
        'yjernite/bart_eli5': 'https://huggingface.co/yjernite/bart_eli5/resolve/main/merges.txt',
    },
}

snake_case_			:     Any  	=  {
    'facebook/bart-base': 1024,
    'facebook/bart-large': 1024,
    'facebook/bart-large-mnli': 1024,
    'facebook/bart-large-cnn': 1024,
    'facebook/bart-large-xsum': 1024,
    'yjernite/bart_eli5': 1024,
}






@lru_cache()
def A__   (					):
						_UpperCamelCase :		str			    =       (
						    list(range(ord('!'							)  ,  ord('~'							) + 1							)							) + list(range(ord('¡'							)  ,  ord('¬'							) + 1							)							) + list(range(ord('®'							)  ,  ord('ÿ'							) + 1							)							)
						)
						_UpperCamelCase :		Any			    =       bs[:]
						_UpperCamelCase :		Union[str, Any]			    =       0
						for b in range(2**8							):
												if b not in bs:
																		bs.append(UpperCAmelCase_							)
																		cs.append(2**8 + n							)
																		n += 1
						_UpperCamelCase :		Any			    =       [chr(UpperCAmelCase_							) for n in cs]
						return dict(zip(UpperCAmelCase_  ,  UpperCAmelCase_							)							)






def A__   (					UpperCAmelCase_							):
						_UpperCamelCase :		Tuple			    =       set()
						_UpperCamelCase :		Dict			    =       word[0]
						for char in word[1:]:
												pairs.add((prev_char, char)							)
												_UpperCamelCase :		Any			    =       char
						return pairs






class 							lowercase__     (							lowercase       ):
	lowercase__      =      VOCAB_FILES_NAMES
	lowercase__      =      PRETRAINED_VOCAB_FILES_MAP
	lowercase__      =      PRETRAINED_POSITIONAL_EMBEDDINGS_SIZES
	lowercase__      =      ["""input_ids""", """attention_mask"""]





	def __init__(			self :    Optional[int]			,lowerCamelCase__ :    Tuple			,lowerCamelCase__ :    List[str]			,lowerCamelCase__ :    Optional[Any]="replace"			,lowerCamelCase__ :    str="<s>"			,lowerCamelCase__ :    str="</s>"			,lowerCamelCase__ :    str="</s>"			,lowerCamelCase__ :    Any="<s>"			,lowerCamelCase__ :    Tuple="<unk>"			,lowerCamelCase__ :    List[str]="<pad>"			,lowerCamelCase__ :    Optional[Any]="<mask>"			,lowerCamelCase__ :    Tuple=False			,**lowerCamelCase__ :    List[str]			,):







							'''simple docstring'''
							_UpperCamelCase :		Dict			    =       AddedToken(lowerCamelCase__			,lstrip=lowerCamelCase__			,rstrip=lowerCamelCase__			) if isinstance(lowerCamelCase__			,lowerCamelCase__			) else bos_token
							_UpperCamelCase :		Tuple			    =       AddedToken(lowerCamelCase__			,lstrip=lowerCamelCase__			,rstrip=lowerCamelCase__			) if isinstance(lowerCamelCase__			,lowerCamelCase__			) else eos_token
							_UpperCamelCase :		Optional[int]			    =       AddedToken(lowerCamelCase__			,lstrip=lowerCamelCase__			,rstrip=lowerCamelCase__			) if isinstance(lowerCamelCase__			,lowerCamelCase__			) else sep_token
							_UpperCamelCase :		Tuple			    =       AddedToken(lowerCamelCase__			,lstrip=lowerCamelCase__			,rstrip=lowerCamelCase__			) if isinstance(lowerCamelCase__			,lowerCamelCase__			) else cls_token
							_UpperCamelCase :		Union[str, Any]			    =       AddedToken(lowerCamelCase__			,lstrip=lowerCamelCase__			,rstrip=lowerCamelCase__			) if isinstance(lowerCamelCase__			,lowerCamelCase__			) else unk_token
							_UpperCamelCase :		List[str]			    =       AddedToken(lowerCamelCase__			,lstrip=lowerCamelCase__			,rstrip=lowerCamelCase__			) if isinstance(lowerCamelCase__			,lowerCamelCase__			) else pad_token

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

							super().__init__(
							    errors=lowerCamelCase__			,bos_token=lowerCamelCase__			,eos_token=lowerCamelCase__			,unk_token=lowerCamelCase__			,sep_token=lowerCamelCase__			,cls_token=lowerCamelCase__			,pad_token=lowerCamelCase__			,mask_token=lowerCamelCase__			,add_prefix_space=lowerCamelCase__			,**lowerCamelCase__			,)

							with open(lowerCamelCase__			,encoding='utf-8'			) as vocab_handle:
													_UpperCamelCase :		List[str]			    =       json.load(lowerCamelCase__			)
							_UpperCamelCase :		Union[str, Any]			    =       {v: k for k, v in self.encoder.items()}
							_UpperCamelCase :		Optional[Any]			    =       errors  # how to handle errors in decoding
							_UpperCamelCase :		Tuple			    =       bytes_to_unicode()
							_UpperCamelCase :		List[str]			    =       {v: k for k, v in self.byte_encoder.items()}
							with open(lowerCamelCase__			,encoding='utf-8'			) as merges_handle:
													_UpperCamelCase :		Dict			    =       merges_handle.read().split('\n'			)[1:-1]
							_UpperCamelCase :		str			    =       [tuple(merge.split()			) for merge in bpe_merges]
							_UpperCamelCase :		Dict			    =       dict(zip(lowerCamelCase__			,range(len(lowerCamelCase__			)			)			)			)
							_UpperCamelCase :		Tuple			    =       {}
							_UpperCamelCase :		List[Any]			    =       add_prefix_space

							# Should have added re.IGNORECASE so BPE merges can happen for capitalized versions of contractions
							_UpperCamelCase :		Any			    =       re.compile(R'\'s|\'t|\'re|\'ve|\'m|\'ll|\'d| ?\p{L}+| ?\p{N}+| ?[^\s\p{L}\p{N}]+|\s+(?!\S)|\s+'			)





	@property
	def      UpperCamelCase_  (			self :    Union[str, Any]			):







							'''simple docstring'''
							return len(self.encoder			)





	def      UpperCamelCase_  (			self :    str			):







							'''simple docstring'''
							return dict(self.encoder			,**self.added_tokens_encoder			)





	def      UpperCamelCase_  (			self :    str			,lowerCamelCase__ :    Any			):







							'''simple docstring'''
							if token in self.cache:
													return self.cache[token]
							_UpperCamelCase :		Dict			    =       tuple(lowerCamelCase__			)
							_UpperCamelCase :		List[str]			    =       get_pairs(lowerCamelCase__			)

							if not pairs:
													return token

							while True:
													_UpperCamelCase :		List[str]			    =       min(lowerCamelCase__			,key=lambda lowerCamelCase__			: self.bpe_ranks.get(lowerCamelCase__			,float('inf'			)			)			)
													if bigram not in self.bpe_ranks:
																			break
													_UpperCamelCase    ,      _UpperCamelCase :		int			    =       bigram
													_UpperCamelCase :		Optional[int]			    =       []
													_UpperCamelCase :		Dict			    =       0
													while i < len(lowerCamelCase__			):
																			try:
																									_UpperCamelCase :		int			    =       word.index(lowerCamelCase__			,lowerCamelCase__			)
																			except ValueError:
																									new_word.extend(word[i:]			)
																									break
																			else:
																									new_word.extend(word[i:j]			)
																									_UpperCamelCase :		Dict			    =       j

																			if word[i] == first and i < len(lowerCamelCase__			) - 1 and word[i + 1] == second:
																									new_word.append(first + second			)
																									i += 2
																			else:
																									new_word.append(word[i]			)
																									i += 1
													_UpperCamelCase :		int			    =       tuple(lowerCamelCase__			)
													_UpperCamelCase :		Union[str, Any]			    =       new_word
													if len(lowerCamelCase__			) == 1:
																			break
													else:
																			_UpperCamelCase :		Any			    =       get_pairs(lowerCamelCase__			)
							_UpperCamelCase :		int			    =       ' '.join(lowerCamelCase__			)
							_UpperCamelCase :		List[Any]			    =       word
							return word





	def      UpperCamelCase_  (			self :    List[str]			,lowerCamelCase__ :    Optional[Any]			):







							'''simple docstring'''
							_UpperCamelCase :		int			    =       []
							for token in re.findall(self.pat			,lowerCamelCase__			):
													_UpperCamelCase :		int			    =       ''.join(
													    self.byte_encoder[b] for b in token.encode('utf-8'			)			)  # Maps all our bytes to unicode strings, avoiding control tokens of the BPE (spaces in our case)
													bpe_tokens.extend(bpe_token for bpe_token in self.bpe(lowerCamelCase__			).split(' '			)			)
							return bpe_tokens





	def      UpperCamelCase_  (			self :    List[Any]			,lowerCamelCase__ :    List[Any]			):







							'''simple docstring'''
							return self.encoder.get(lowerCamelCase__			,self.encoder.get(self.unk_token			)			)





	def      UpperCamelCase_  (			self :    Optional[Any]			,lowerCamelCase__ :    int			):







							'''simple docstring'''
							return self.decoder.get(lowerCamelCase__			)





	def      UpperCamelCase_  (			self :    List[Any]			,lowerCamelCase__ :    Any			):







							'''simple docstring'''
							_UpperCamelCase :		Dict			    =       ''.join(lowerCamelCase__			)
							_UpperCamelCase :		Dict			    =       bytearray([self.byte_decoder[c] for c in text]			).decode('utf-8'			,errors=self.errors			)
							return text





	def      UpperCamelCase_  (			self :    Optional[Any]			,lowerCamelCase__ :    str			,lowerCamelCase__ :    Optional[str] = None			):







							'''simple docstring'''
							if not os.path.isdir(lowerCamelCase__			):
													logger.error(F'Vocabulary path ({save_directory}) should be a directory'			)
													return
							_UpperCamelCase :		List[Any]			    =       os.path.join(
							    lowerCamelCase__			,(filename_prefix + '-' if filename_prefix else '') + VOCAB_FILES_NAMES['vocab_file']			)
							_UpperCamelCase :		Union[str, Any]			    =       os.path.join(
							    lowerCamelCase__			,(filename_prefix + '-' if filename_prefix else '') + VOCAB_FILES_NAMES['merges_file']			)

							with open(lowerCamelCase__			,'w'			,encoding='utf-8'			) as f:
													f.write(json.dumps(self.encoder			,indent=2			,sort_keys=lowerCamelCase__			,ensure_ascii=lowerCamelCase__			) + '\n'			)

							_UpperCamelCase :		Optional[Any]			    =       0
							with open(lowerCamelCase__			,'w'			,encoding='utf-8'			) as writer:
													writer.write('#version: 0.2\n'			)
													for bpe_tokens, token_index in sorted(self.bpe_ranks.items()			,key=lambda lowerCamelCase__			: kv[1]			):
																			if index != token_index:
																									logger.warning(
																									    F'Saving vocabulary to {merge_file}: BPE merge indices are not consecutive.'
																									    ' Please check that the tokenizer is not corrupted!'			)
																									_UpperCamelCase :		int			    =       token_index
																			writer.write(' '.join(lowerCamelCase__			) + '\n'			)
																			index += 1

							return vocab_file, merge_file





	def      UpperCamelCase_  (			self :    Any			,lowerCamelCase__ :    List[int]			,lowerCamelCase__ :    Optional[List[int]] = None			):







							'''simple docstring'''
							if token_ids_a is None:
													return [self.cls_token_id] + token_ids_a + [self.sep_token_id]
							_UpperCamelCase :		Optional[Any]			    =       [self.cls_token_id]
							_UpperCamelCase :		str			    =       [self.sep_token_id]
							return cls + token_ids_a + sep + sep + token_ids_a + sep





	def      UpperCamelCase_  (			self :    List[str]			,lowerCamelCase__ :    List[int]			,lowerCamelCase__ :    Optional[List[int]] = None			,lowerCamelCase__ :    bool = False			):







							'''simple docstring'''
							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, 1] + ([0] * len(lowerCamelCase__			)) + [1]





	def      UpperCamelCase_  (			self :    Tuple			,lowerCamelCase__ :    List[int]			,lowerCamelCase__ :    Optional[List[int]] = None			):







							'''simple docstring'''
							_UpperCamelCase :		Tuple			    =       [self.sep_token_id]
							_UpperCamelCase :		Dict			    =       [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 + sep + token_ids_a + sep			) * [0]





	def      UpperCamelCase_  (			self :    Any			,lowerCamelCase__ :    List[str]			,lowerCamelCase__ :    Tuple=False			,**lowerCamelCase__ :    Optional[int]			):







							'''simple docstring'''
							_UpperCamelCase :		Tuple			    =       kwargs.pop('add_prefix_space'			,self.add_prefix_space			)
							if (is_split_into_words or add_prefix_space) and (len(lowerCamelCase__			) > 0 and not text[0].isspace()):
													_UpperCamelCase :		List[str]			    =       ' ' + text
							return (text, kwargs)







'''simple docstring'''
import itertools
import os
from collections import Counter, defaultdict
from concurrent.futures import ThreadPoolExecutor, as_completed

import numpy as np

import datasets

from .execute import check_correctness


snake_case_			:     List[str]  	=  '\\n@misc{chen2021evaluating,\n      title={Evaluating Large Language Models Trained on Code},\n      author={Mark Chen and Jerry Tworek and Heewoo Jun and Qiming Yuan \\nand Henrique Ponde de Oliveira Pinto and Jared Kaplan and Harri Edwards \\nand Yuri Burda and Nicholas Joseph and Greg Brockman and Alex Ray \\nand Raul Puri and Gretchen Krueger and Michael Petrov and Heidy Khlaaf \\nand Girish Sastry and Pamela Mishkin and Brooke Chan and Scott Gray \\nand Nick Ryder and Mikhail Pavlov and Alethea Power and Lukasz Kaiser \\nand Mohammad Bavarian and Clemens Winter and Philippe Tillet \\nand Felipe Petroski Such and Dave Cummings and Matthias Plappert \\nand Fotios Chantzis and Elizabeth Barnes and Ariel Herbert-Voss \\nand William Hebgen Guss and Alex Nichol and Alex Paino and Nikolas Tezak \\nand Jie Tang and Igor Babuschkin and Suchir Balaji and Shantanu Jain \\nand William Saunders and Christopher Hesse and Andrew N. Carr \\nand Jan Leike and Josh Achiam and Vedant Misra and Evan Morikawa \\nand Alec Radford and Matthew Knight and Miles Brundage and Mira Murati \\nand Katie Mayer and Peter Welinder and Bob McGrew and Dario Amodei \\nand Sam McCandlish and Ilya Sutskever and Wojciech Zaremba},\n      year={2021},\n      eprint={2107.03374},\n      archivePrefix={arXiv},\n      primaryClass={cs.LG}\n}\n'

snake_case_			:     Tuple  	=  '\\nThis metric implements the evaluation harness for the HumanEval problem solving dataset\ndescribed in the paper "Evaluating Large Language Models Trained on Code"\n(https://arxiv.org/abs/2107.03374).\n'


snake_case_			:     str  	=  '\nCalculates how good are predictions given some references, using certain scores\nArgs:\n    predictions: list of candidates to evaluate. Each candidates should be a list\n        of strings with several code candidates to solve the problem.\n    references: a list with a test for each prediction. Each test should evaluate the\n        correctness of a code candidate.\n    k: number of code candidates to consider in the evaluation (Default: [1, 10, 100])\n    num_workers: number of workers used to evaluate the canidate programs (Default: 4).\n    timeout:\nReturns:\n    pass_at_k: dict with pass rates for each k\n    results: dict with granular results of each unittest\nExamples:\n    >>> code_eval = datasets.load_metric("code_eval")\n    >>> test_cases = ["assert add(2,3)==5"]\n    >>> candidates = [["def add(a,b): return a*b", "def add(a, b): return a+b"]]\n    >>> pass_at_k, results = code_eval.compute(references=test_cases, predictions=candidates, k=[1, 2])\n    >>> print(pass_at_k)\n    {\'pass@1\': 0.5, \'pass@2\': 1.0}\n'


snake_case_			:     str  	=  '\n################################################################################\n                                  !!!WARNING!!!\n################################################################################\nThe "code_eval" metric executes untrusted model-generated code in Python.\nAlthough it is highly unlikely that model-generated code will do something\novertly malicious in response to this test suite, model-generated code may act\ndestructively due to a lack of model capability or alignment.\nUsers are strongly encouraged to sandbox this evaluation suite so that it\ndoes not perform destructive actions on their host or network. For more\ninformation on how OpenAI sandboxes its code, see the paper "Evaluating Large\nLanguage Models Trained on Code" (https://arxiv.org/abs/2107.03374).\n\nOnce you have read this disclaimer and taken appropriate precautions,\nset the environment variable HF_ALLOW_CODE_EVAL="1". Within Python you can to this\nwith:\n\n>>> import os\n>>> os.environ["HF_ALLOW_CODE_EVAL"] = "1"\n\n################################################################################\\n'

snake_case_			:     List[Any]  	=  'The MIT License\n\nCopyright (c) OpenAI (https://openai.com)\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the "Software"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.'






@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION						, _KWARGS_DESCRIPTION       )
class 							lowercase__     (							datasets.Metric       ):





	def      UpperCamelCase_  (			self :    List[str]			):







							'''simple docstring'''
							return datasets.MetricInfo(
							    # This is the description that will appear on the metrics page.
							    description=_DESCRIPTION			,citation=_CITATION			,inputs_description=_KWARGS_DESCRIPTION			,features=datasets.Features(
							        {
							            'predictions': datasets.Sequence(datasets.Value('string'			)			),
							            'references': datasets.Value('string'			),
							        }			)			,homepage='https://github.com/openai/human-eval'			,codebase_urls=['https://github.com/openai/human-eval']			,reference_urls=['https://github.com/openai/human-eval']			,license=_LICENSE			,)





	def      UpperCamelCase_  (			self :    str			,lowerCamelCase__ :    Dict			,lowerCamelCase__ :    Dict			,lowerCamelCase__ :    List[Any]=[1, 10, 100]			,lowerCamelCase__ :    int=4			,lowerCamelCase__ :    List[Any]=3.0			):







							'''simple docstring'''

							if os.getenv('HF_ALLOW_CODE_EVAL'			,0			) != "1":
													raise ValueError(_WARNING			)

							if os.name == "nt":
													raise NotImplementedError('This metric is currently not supported on Windows.'			)

							with ThreadPoolExecutor(max_workers=lowerCamelCase__			) as executor:
													_UpperCamelCase :		Optional[int]			    =       []
													_UpperCamelCase :		Optional[int]			    =       Counter()
													_UpperCamelCase :		int			    =       0
													_UpperCamelCase :		Dict			    =       defaultdict(lowerCamelCase__			)

													for task_id, (candidates, test_case) in enumerate(zip(lowerCamelCase__			,lowerCamelCase__			)			):
																			for candidate in candidates:
																									_UpperCamelCase :		int			    =       candidate + '\n' + test_case
																									_UpperCamelCase :		Optional[Any]			    =       (test_program, timeout, task_id, completion_id[task_id])
																									_UpperCamelCase :		Dict			    =       executor.submit(lowerCamelCase__			,*lowerCamelCase__			)
																									futures.append(lowerCamelCase__			)
																									completion_id[task_id] += 1
																									n_samples += 1

													for future in as_completed(lowerCamelCase__			):
																			_UpperCamelCase :		Dict			    =       future.result()
																			results[result["task_id"]].append((result['completion_id'], result)			)

							_UpperCamelCase    ,      _UpperCamelCase :		List[str]			    =       [], []
							for result in results.values():
													result.sort()
													_UpperCamelCase :		Optional[Any]			    =       [r[1]['passed'] for r in result]
													total.append(len(lowerCamelCase__			)			)
													correct.append(sum(lowerCamelCase__			)			)
							_UpperCamelCase :		List[str]			    =       np.array(lowerCamelCase__			)
							_UpperCamelCase :		List[Any]			    =       np.array(lowerCamelCase__			)

							_UpperCamelCase :		Tuple			    =       k
							_UpperCamelCase :		Tuple			    =       {F'pass@{k}': estimate_pass_at_k(lowerCamelCase__			,lowerCamelCase__			,lowerCamelCase__			).mean() for k in ks if (total >= k).all()}

							return pass_at_k, results






def A__   (					UpperCAmelCase_  ,  UpperCAmelCase_  ,  UpperCAmelCase_							):

						def estimator(UpperCAmelCase_  ,  UpperCAmelCase_  ,  UpperCAmelCase_							) -> float:
												if n - c < k:
																		return 1.0
												return 1.0 - np.prod(1.0 - k / np.arange(n - c + 1  ,  n + 1							)							)

						if isinstance(UpperCAmelCase_  ,  UpperCAmelCase_							):
												_UpperCamelCase :		int			    =       itertools.repeat(UpperCAmelCase_  ,  len(UpperCAmelCase_							)							)
						else:
												assert len(UpperCAmelCase_							) == len(UpperCAmelCase_							)
												_UpperCamelCase :		Optional[Any]			    =       iter(UpperCAmelCase_							)

						return np.array([estimator(int(UpperCAmelCase_							)  ,  int(UpperCAmelCase_							)  ,  UpperCAmelCase_							) for n, c in zip(UpperCAmelCase_  ,  UpperCAmelCase_							)]							)


