




import faiss  # noqa: F401 # Here to have a nice missing dependency error message early on
import numpy  # noqa: F401 # Here to have a nice missing dependency error message early on
import requests  # noqa: F401 # Here to have a nice missing dependency error message early on
import sklearn  # noqa: F401 # Here to have a nice missing dependency error message early on
import tqdm  # noqa: F401 # Here to have a nice missing dependency error message early on
from mauve import compute_mauve  # From: mauve-text

import datasets


a__		     =     '''\
@inproceedings{pillutla-etal:mauve:neurips2021,
  title={MAUVE: Measuring the Gap Between Neural Text and Human Text using Divergence Frontiers},
  author={Pillutla, Krishna and Swayamdipta, Swabha and Zellers, Rowan and Thickstun, John and Welleck, Sean and Choi, Yejin and Harchaoui, Zaid},
  booktitle = {NeurIPS},
  year      = {2021}
}

'''

a__		     =     '''\
MAUVE is a library built on PyTorch and HuggingFace Transformers to measure the gap between neural text and human text with the eponymous MAUVE measure.

MAUVE summarizes both Type I and Type II errors measured softly using Kullback–Leibler (KL) divergences.

For details, see the MAUVE paper: https://arxiv.org/abs/2102.01454 (Neurips, 2021).

This metrics is a wrapper around the official implementation of MAUVE:
https://github.com/krishnap25/mauve
'''

a__		     =     '''
Calculates MAUVE scores between two lists of generated text and reference text.
Args:
    predictions: list of generated text to score. Each predictions
        should be a string with tokens separated by spaces.
    references: list of reference for each prediction. Each
        reference should be a string with tokens separated by spaces.
Optional Args:
    num_buckets: the size of the histogram to quantize P and Q. Options: \'auto\' (default) or an integer
    pca_max_data: the number data points to use for PCA dimensionality reduction prior to clustering. If -1, use all the data. Default -1
    kmeans_explained_var: amount of variance of the data to keep in dimensionality reduction by PCA. Default 0.9
    kmeans_num_redo: number of times to redo k-means clustering (the best objective is kept). Default 5
    kmeans_max_iter: maximum number of k-means iterations. Default 500
    featurize_model_name: name of the model from which features are obtained. Default \'gpt2-large\' Use one of [\'gpt2\', \'gpt2-medium\', \'gpt2-large\', \'gpt2-xl\'].
    device_id: Device for featurization. Supply a GPU id (e.g. 0 or 3) to use GPU. If no GPU with this id is found, use CPU
    max_text_length: maximum number of tokens to consider. Default 1024
    divergence_curve_discretization_size: Number of points to consider on the divergence curve. Default 25
    mauve_scaling_factor: "c" from the paper. Default 5.
    verbose: If True (default), print running time updates
    seed: random seed to initialize k-means cluster assignments.
Returns:
    mauve: MAUVE score, a number between 0 and 1. Larger values indicate that P and Q are closer,
    frontier_integral: Frontier Integral, a number between 0 and 1. Smaller values indicate that P and Q are closer,
    divergence_curve: a numpy.ndarray of shape (m, 2); plot it with matplotlib to view the divergence curve,
    p_hist: a discrete distribution, which is a quantized version of the text distribution p_text,
    q_hist: same as above, but with q_text.
Examples:

    >>> # faiss segfaults in doctest for some reason, so the .compute call is not tested with doctest
    >>> import datasets
    >>> mauve = datasets.load_metric(\'mauve\')
    >>> predictions = ["hello there", "general kenobi"]
    >>> references = ["hello there", "general kenobi"]
    >>> out = mauve.compute(predictions=predictions, references=references) # doctest: +SKIP
    >>> print(out.mauve) # doctest: +SKIP
    1.0
'''


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



	"""simple docstring"""


	def 					lowerCamelCase__     (					self		:						Optional[Any]	)	->       Tuple:







						"""simple docstring"""







						return datasets.MetricInfo(
						    description=_DESCRIPTION					,     citation=_CITATION					,     homepage="""https://github.com/krishnap25/mauve"""					,     inputs_description=_KWARGS_DESCRIPTION					,     features=datasets.Features(
						        {
						            """predictions""": datasets.Value("""string"""					,     id="""sequence"""	),
						            """references""": datasets.Value("""string"""					,     id="""sequence"""	),
						        }	)					,     codebase_urls=["""https://github.com/krishnap25/mauve"""]					,     reference_urls=[
						        """https://arxiv.org/abs/2102.01454""",
						        """https://github.com/krishnap25/mauve""",
						    ]					,     )






	def 					lowerCamelCase__     (					self		:						List[Any]					,     lowerCAmelCase		:						Union[str, Any]					,     lowerCAmelCase		:						Any					,     lowerCAmelCase		:						List[Any]=None					,     lowerCAmelCase		:						Optional[Any]=None					,     lowerCAmelCase		:						List[str]=None					,     lowerCAmelCase		:						Any=None					,     lowerCAmelCase		:						Any="auto"					,     lowerCAmelCase		:						List[Any]=-1					,     lowerCAmelCase		:						str=0.9					,     lowerCAmelCase		:						Tuple=5					,     lowerCAmelCase		:						Optional[Any]=500					,     lowerCAmelCase		:						Optional[Any]="gpt2-large"					,     lowerCAmelCase		:						List[Any]=-1					,     lowerCAmelCase		:						Optional[int]=1024					,     lowerCAmelCase		:						Optional[int]=25					,     lowerCAmelCase		:						int=5					,     lowerCAmelCase		:						Optional[int]=True					,     lowerCAmelCase		:						Dict=25					,     )	->       Optional[int]:







						"""simple docstring"""







						__UpperCamelCase					:	Optional[int]             =      compute_mauve(
						    p_text=lowerCAmelCase					,     q_text=lowerCAmelCase					,     p_features=lowerCAmelCase					,     q_features=lowerCAmelCase					,     p_tokens=lowerCAmelCase					,     q_tokens=lowerCAmelCase					,     num_buckets=lowerCAmelCase					,     pca_max_data=lowerCAmelCase					,     kmeans_explained_var=lowerCAmelCase					,     kmeans_num_redo=lowerCAmelCase					,     kmeans_max_iter=lowerCAmelCase					,     featurize_model_name=lowerCAmelCase					,     device_id=lowerCAmelCase					,     max_text_length=lowerCAmelCase					,     divergence_curve_discretization_size=lowerCAmelCase					,     mauve_scaling_factor=lowerCAmelCase					,     verbose=lowerCAmelCase					,     seed=lowerCAmelCase					,     )
						return out












# Copyright 2023 The HuggingFace Team. All rights reserved.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
#     http://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.

import torch

from accelerate import PartialState
from accelerate.utils.operations import broadcast, gather, gather_object, pad_across_processes, reduce





def 				A__ (snake_case   :		List[Any]				)     ->						Optional[Any]:
					return (torch.arange(state.num_processes				) + 1.0 + (state.num_processes * state.process_index)).to(state.device				)





def 				A__ (snake_case   :		int				)     ->						Any:
					__UpperCamelCase					:	List[str]             =      create_tensor(snake_case				)
					__UpperCamelCase					:	List[Any]             =      gather(snake_case				)
					assert gathered_tensor.tolist() == list(range(1		,	state.num_processes**2 + 1				)				)





def 				A__ (snake_case   :		Optional[Any]				)     ->						Dict:
					__UpperCamelCase					:	Any             =      [state.process_index]
					__UpperCamelCase					:	int             =      gather_object(snake_case				)
					assert len(snake_case				) == state.num_processes, F'''{gathered_obj}, {len(snake_case				)} != {state.num_processes}'''
					assert gathered_obj == list(range(state.num_processes				)				), F'''{gathered_obj} != {list(range(state.num_processes				)				)}'''





def 				A__ (snake_case   :		Any				)     ->						Optional[Any]:
					__UpperCamelCase					:	Optional[Any]             =      create_tensor(snake_case				)
					__UpperCamelCase					:	Any             =      broadcast(snake_case				)
					assert broadcasted_tensor.shape == torch.Size([state.num_processes]				)
					assert broadcasted_tensor.tolist() == list(range(1		,	state.num_processes + 1				)				)





def 				A__ (snake_case   :		Tuple				)     ->						Dict:
					# We need to pad the tensor with one more element if we are the main process
					# to ensure that we can pad
					if state.is_main_process:
										__UpperCamelCase					:	List[Any]             =      torch.arange(state.num_processes + 1				).to(state.device				)
					else:
										__UpperCamelCase					:	List[str]             =      torch.arange(state.num_processes				).to(state.device				)
					__UpperCamelCase					:	List[str]             =      pad_across_processes(snake_case				)
					assert padded_tensor.shape == torch.Size([state.num_processes + 1]				)
					if not state.is_main_process:
										assert padded_tensor.tolist() == list(range(0		,	state.num_processes				)				) + [0]





def 				A__ (snake_case   :		Tuple				)     ->						Dict:
					# For now runs on only two processes
					if state.num_processes != 2:
										return
					__UpperCamelCase					:	Optional[int]             =      create_tensor(snake_case				)
					__UpperCamelCase					:	str             =      reduce(snake_case		,	"""sum"""				)
					__UpperCamelCase					:	Optional[int]             =      torch.tensor([4.0, 6]				).to(state.device				)
					assert torch.allclose(snake_case		,	snake_case				), F'''{reduced_tensor} != {truth_tensor}'''





def 				A__ (snake_case   :		Optional[Any]				)     ->						Optional[Any]:
					# For now runs on only two processes
					if state.num_processes != 2:
										return
					__UpperCamelCase					:	List[Any]             =      create_tensor(snake_case				)
					__UpperCamelCase					:	str             =      reduce(snake_case		,	"""mean"""				)
					__UpperCamelCase					:	Union[str, Any]             =      torch.tensor([2.0, 3]				).to(state.device				)
					assert torch.allclose(snake_case		,	snake_case				), F'''{reduced_tensor} != {truth_tensor}'''





def 				A__ (snake_case   :		Tuple				)     ->						int:
					# For xla_spawn (TPUs)
					main()





def 				A__ ()     ->						List[Any]:
					__UpperCamelCase					:	List[Any]             =      PartialState()
					state.print(F'''State: {state}'''				)
					state.print("""testing gather"""				)
					test_gather(snake_case				)
					state.print("""testing gather_object"""				)
					test_gather_object(snake_case				)
					state.print("""testing broadcast"""				)
					test_broadcast(snake_case				)
					state.print("""testing pad_across_processes"""				)
					test_pad_across_processes(snake_case				)
					state.print("""testing reduce_sum"""				)
					test_reduce_sum(snake_case				)
					state.print("""testing reduce_mean"""				)
					test_reduce_mean(snake_case				)


if __name__ == "__main__":
	main()






