



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


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

UpperCAmelCase_									=							"\\nMAUVE is a library built on PyTorch and HuggingFace Transformers to measure the gap between neural text and human text with the eponymous MAUVE measure.\n\nMAUVE summarizes both Type I and Type II errors measured softly using Kullback–Leibler (KL) divergences.\n\nFor details, see the MAUVE paper: https://arxiv.org/abs/2102.01454 (Neurips, 2021).\n\nThis metrics is a wrapper around the official implementation of MAUVE:\nhttps://github.com/krishnap25/mauve\n"

UpperCAmelCase_									=							"\nCalculates MAUVE scores between two lists of generated text and reference text.\nArgs:\n    predictions: list of generated text to score. Each predictions\n        should be a string with tokens separated by spaces.\n    references: list of reference for each prediction. Each\n        reference should be a string with tokens separated by spaces.\nOptional Args:\n    num_buckets: the size of the histogram to quantize P and Q. Options: 'auto' (default) or an integer\n    pca_max_data: the number data points to use for PCA dimensionality reduction prior to clustering. If -1, use all the data. Default -1\n    kmeans_explained_var: amount of variance of the data to keep in dimensionality reduction by PCA. Default 0.9\n    kmeans_num_redo: number of times to redo k-means clustering (the best objective is kept). Default 5\n    kmeans_max_iter: maximum number of k-means iterations. Default 500\n    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'].\n    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\n    max_text_length: maximum number of tokens to consider. Default 1024\n    divergence_curve_discretization_size: Number of points to consider on the divergence curve. Default 25\n    mauve_scaling_factor: \"c\" from the paper. Default 5.\n    verbose: If True (default), print running time updates\n    seed: random seed to initialize k-means cluster assignments.\nReturns:\n    mauve: MAUVE score, a number between 0 and 1. Larger values indicate that P and Q are closer,\n    frontier_integral: Frontier Integral, a number between 0 and 1. Smaller values indicate that P and Q are closer,\n    divergence_curve: a numpy.ndarray of shape (m, 2); plot it with matplotlib to view the divergence curve,\n    p_hist: a discrete distribution, which is a quantized version of the text distribution p_text,\n    q_hist: same as above, but with q_text.\nExamples:\n\n    >>> # faiss segfaults in doctest for some reason, so the .compute call is not tested with doctest\n    >>> import datasets\n    >>> mauve = datasets.load_metric('mauve')\n    >>> predictions = [\"hello there\", \"general kenobi\"]\n    >>> references = [\"hello there\", \"general kenobi\"]\n    >>> out = mauve.compute(predictions=predictions, references=references) # doctest: +SKIP\n    >>> print(out.mauve) # doctest: +SKIP\n    1.0\n"





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





   def 	__lowerCAmelCase							(	self			):
         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       ,     _lowerCAmelCase       ,     _lowerCAmelCase       ,     _lowerCAmelCase=None       ,     _lowerCAmelCase=None       ,     _lowerCAmelCase=None       ,     _lowerCAmelCase=None       ,     _lowerCAmelCase="auto"       ,     _lowerCAmelCase=-1       ,     _lowerCAmelCase=0.9       ,     _lowerCAmelCase=5       ,     _lowerCAmelCase=500       ,     _lowerCAmelCase="gpt2-large"       ,     _lowerCAmelCase=-1       ,     _lowerCAmelCase=1_024       ,     _lowerCAmelCase=25       ,     _lowerCAmelCase=5       ,     _lowerCAmelCase=True       ,     _lowerCAmelCase=25       ,     ):
         _lowerCAmelCase 			=  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




import numpy as np
import torch
from torch.utils.data import Dataset, IterableDataset

from ..utils.generic import ModelOutput





class 		UpperCAmelCase						(						snake_case_				):





   def __init__(	self       ,     _lowerCAmelCase       ,     _lowerCAmelCase       ,     _lowerCAmelCase			):
         _lowerCAmelCase 			=  dataset
         _lowerCAmelCase 			=  process
         _lowerCAmelCase 			=  params





   def __len__(	self			):
         return len(self.dataset			)





   def __getitem__(	self       ,     _lowerCAmelCase			):
         _lowerCAmelCase 			=  self.dataset[i]
         _lowerCAmelCase 			=  self.process(_lowerCAmelCase       ,     **self.params			)
         return processed






class 		UpperCAmelCase						(						snake_case_				):





   def __init__(	self       ,     _lowerCAmelCase       ,     _lowerCAmelCase       ,     _lowerCAmelCase       ,     _lowerCAmelCase=None			):
         _lowerCAmelCase 			=  loader
         _lowerCAmelCase 			=  infer
         _lowerCAmelCase 			=  params
         if loader_batch_size == 1:
               # Let's spare some time by deactivating altogether
               _lowerCAmelCase 			=  None
         _lowerCAmelCase 			=  loader_batch_size

         # Internal bookkeeping
         _lowerCAmelCase 			=  None
         _lowerCAmelCase 			=  None





   def __len__(	self			):
         return len(self.loader			)





   def __iter__(	self			):
         _lowerCAmelCase 			=  iter(self.loader			)
         return self





   def 	__lowerCAmelCase							(	self			):
         if isinstance(self._loader_batch_data       ,     torch.Tensor			):
               # Batch data is simple tensor, just fetch the slice
               _lowerCAmelCase 			=  self._loader_batch_data[self._loader_batch_index]
         else:
               # Batch data is assumed to be BaseModelOutput (or dict)
               _lowerCAmelCase 			=  {}
               for k, element in self._loader_batch_data.items():
                     if isinstance(_lowerCAmelCase       ,     _lowerCAmelCase			):
                           # Convert ModelOutput to tuple first
                           _lowerCAmelCase 			=  element.to_tuple()
                           if isinstance(element[0]       ,     torch.Tensor			):
                                 _lowerCAmelCase 			=  tuple(el[self._loader_batch_index].unsqueeze(0			) for el in element			)
                           elif isinstance(element[0]       ,     np.ndarray			):
                                 _lowerCAmelCase 			=  tuple(np.expand_dims(el[self._loader_batch_index]       ,     0			) for el in element			)
                           continue
                     if k in {"hidden_states", "past_key_values", "attentions"} and isinstance(_lowerCAmelCase       ,     _lowerCAmelCase			):
                           # Those are stored as lists of tensors so need specific unbatching.
                           if isinstance(element[0]       ,     torch.Tensor			):
                                 _lowerCAmelCase 			=  tuple(el[self._loader_batch_index].unsqueeze(0			) for el in element			)
                           elif isinstance(element[0]       ,     np.ndarray			):
                                 _lowerCAmelCase 			=  tuple(np.expand_dims(el[self._loader_batch_index]       ,     0			) for el in element			)
                           continue
                     if element is None:
                           # This can happen for optional data that get passed around
                           _lowerCAmelCase 			=  None
                     elif isinstance(element[self._loader_batch_index]       ,     torch.Tensor			):
                           # Take correct batch data, but make it looked like batch_size=1
                           # For compatibility with other methods within transformers

                           _lowerCAmelCase 			=  element[self._loader_batch_index].unsqueeze(0			)
                     elif isinstance(element[self._loader_batch_index]       ,     np.ndarray			):
                           # Take correct batch data, but make it looked like batch_size=1
                           # For compatibility with other methods within transformers
                           _lowerCAmelCase 			=  np.expand_dims(element[self._loader_batch_index]       ,     0			)
                     else:
                           # This is typically a list, so no need to `unsqueeze`.
                           _lowerCAmelCase 			=  element[self._loader_batch_index]
            # Recreate the element by reusing the original class to make it look
            # batch_size=1
               _lowerCAmelCase 			=  self._loader_batch_data.__class__(_lowerCAmelCase			)
         self._loader_batch_index += 1
         return result





   def 	__lowerCAmelCase							(	self			):
         if self._loader_batch_index is not None and self._loader_batch_index < self.loader_batch_size:
               # We are currently unrolling a batch so we just need to return
               # the current item within a batch
               return self.loader_batch_item()

         # We're out of items within a batch
         _lowerCAmelCase 			=  next(self.iterator			)
         _lowerCAmelCase 			=  self.infer(_lowerCAmelCase       ,     **self.params			)
         # We now have a batch of "inferred things".
         if self.loader_batch_size is not None:
               # Try to infer the size of the batch
               if isinstance(_lowerCAmelCase       ,     torch.Tensor			):
                     _lowerCAmelCase 			=  processed
               else:
                     _lowerCAmelCase 			=  list(processed.keys()			)[0]
                     _lowerCAmelCase 			=  processed[key]
               if isinstance(_lowerCAmelCase       ,     _lowerCAmelCase			):
                     _lowerCAmelCase 			=  len(_lowerCAmelCase			)
               else:
                     _lowerCAmelCase 			=  first_tensor.shape[0]
               if 0 < observed_batch_size < self.loader_batch_size:
                     # could be last batch so we can't unroll as many
                     # elements.
                     _lowerCAmelCase 			=  observed_batch_size
               # Setting internal index to unwrap the batch
               _lowerCAmelCase 			=  processed
               _lowerCAmelCase 			=  0
               return self.loader_batch_item()
         else:
               # We're not unrolling batches
               return processed






class 		UpperCAmelCase						(						snake_case_				):





   def __init__(	self       ,     _lowerCAmelCase       ,     _lowerCAmelCase       ,     _lowerCAmelCase       ,     _lowerCAmelCase=None			):
         super().__init__(_lowerCAmelCase       ,     _lowerCAmelCase       ,     _lowerCAmelCase			)





   def __iter__(	self			):
         _lowerCAmelCase 			=  iter(self.loader			)
         _lowerCAmelCase 			=  None
         return self





   def 	__lowerCAmelCase							(	self			):
         if self.subiterator is None:
               _lowerCAmelCase 			=  self.infer(next(self.iterator			)       ,     **self.params			)
         try:
               # Try to return next item
               _lowerCAmelCase 			=  next(self.subiterator			)
         except StopIteration:
               # When a preprocess iterator ends, we can start lookig at the next item
               # ChunkIterator will keep feeding until ALL elements of iterator
               # all have created their subiterator and have been iterating against.
               #
               # Another way to look at it, is we're basically flattening lists of lists
               # into a single list, but with generators
               _lowerCAmelCase 			=  self.infer(next(self.iterator			)       ,     **self.params			)
               _lowerCAmelCase 			=  next(self.subiterator			)
         return processed






class 		UpperCAmelCase						(						snake_case_				):





   def __iter__(	self			):
         _lowerCAmelCase 			=  iter(self.loader			)
         return self





   def 	__lowerCAmelCase							(	self			):
         # Extremely similar to PipelineIterator in its unpacking mechanism
         # BUT, we have an extra required item which is the presence of `is_last`
         # That is because everything is flattened by `PipelineChunkIterator` we
         # need to keep track of how to regroup here in the original `process`
         # boundaries so that `process` and `postprocess` see the same data.

         # This iterator accumulates items (possibly while unbatching) until it
         # its a `is_last` and then just passes it on to the caller.
         _lowerCAmelCase 			=  False
         _lowerCAmelCase 			=  []
         if self._loader_batch_index is not None and self._loader_batch_index < self.loader_batch_size:
               while self._loader_batch_index < self.loader_batch_size:
                     _lowerCAmelCase 			=  self.loader_batch_item()
                     _lowerCAmelCase 			=  item.pop('''is_last'''			)
                     accumulator.append(_lowerCAmelCase			)
                     if is_last:
                           return accumulator

         while not is_last:
               _lowerCAmelCase 			=  self.infer(next(self.iterator			)       ,     **self.params			)
               if self.loader_batch_size is not None:
                     if isinstance(_lowerCAmelCase       ,     torch.Tensor			):
                           _lowerCAmelCase 			=  processed
                     else:
                           _lowerCAmelCase 			=  list(processed.keys()			)[0]
                           _lowerCAmelCase 			=  processed[key]
                     if isinstance(_lowerCAmelCase       ,     _lowerCAmelCase			):
                           _lowerCAmelCase 			=  len(_lowerCAmelCase			)
                     else:
                           _lowerCAmelCase 			=  first_tensor.shape[0]
                     if 0 < observed_batch_size < self.loader_batch_size:
                           # could be last batch so we can't unroll as many
                           # elements.
                           _lowerCAmelCase 			=  observed_batch_size
                     _lowerCAmelCase 			=  processed
                     _lowerCAmelCase 			=  0
                     while self._loader_batch_index < self.loader_batch_size:
                           _lowerCAmelCase 			=  self.loader_batch_item()
                           _lowerCAmelCase 			=  item.pop('''is_last'''			)
                           accumulator.append(_lowerCAmelCase			)
                           if is_last:
                                 return accumulator
               else:
                     _lowerCAmelCase 			=  processed
                     _lowerCAmelCase 			=  item.pop('''is_last'''			)
                     accumulator.append(_lowerCAmelCase			)
         return accumulator






class 		UpperCAmelCase						(						snake_case_				):





   def __init__(	self       ,     _lowerCAmelCase       ,     _lowerCAmelCase			):
         _lowerCAmelCase 			=  dataset
         _lowerCAmelCase 			=  key





   def __len__(	self			):
         return len(self.dataset			)





   def __getitem__(	self       ,     _lowerCAmelCase			):
         return self.dataset[i][self.key]






class 		UpperCAmelCase						(						snake_case_				):





   def __init__(	self       ,     _lowerCAmelCase       ,     _lowerCAmelCase       ,     _lowerCAmelCase			):
         _lowerCAmelCase 			=  dataset
         _lowerCAmelCase 			=  keya
         _lowerCAmelCase 			=  keya





   def __len__(	self			):
         return len(self.dataset			)





   def __getitem__(	self       ,     _lowerCAmelCase			):
         return {"text": self.dataset[i][self.keya], "text_pair": self.dataset[i][self.keya]}