






"""simple docstring"""





from sklearn.metrics import precision_score

import datasets


UpperCamelCase_						:					Optional[int]      				=			"""
Precision is the fraction of correctly labeled positive examples out of all of the examples that were labeled as positive. It is computed via the equation:
Precision = TP / (TP + FP)
where TP is the True positives (i.e. the examples correctly labeled as positive) and FP is the False positive examples (i.e. the examples incorrectly labeled as positive).
"""


UpperCamelCase_						:					List[str]      				=			"""
Args:
    predictions (`list` of `int`): Predicted class labels.
    references (`list` of `int`): Actual class labels.
    labels (`list` of `int`): The set of labels to include when `average` is not set to `'binary'`. If `average` is `None`, it should be the label order. Labels present in the data can be excluded, for example to calculate a multiclass average ignoring a majority negative class. Labels not present in the data will result in 0 components in a macro average. For multilabel targets, labels are column indices. By default, all labels in `predictions` and `references` are used in sorted order. Defaults to None.
    pos_label (`int`): The class to be considered the positive class, in the case where `average` is set to `binary`. Defaults to 1.
    average (`string`): This parameter is required for multiclass/multilabel targets. If set to `None`, the scores for each class are returned. Otherwise, this determines the type of averaging performed on the data. Defaults to `'binary'`.

        - 'binary': Only report results for the class specified by `pos_label`. This is applicable only if the classes found in `predictions` and `references` are binary.
        - 'micro': Calculate metrics globally by counting the total true positives, false negatives and false positives.
        - 'macro': Calculate metrics for each label, and find their unweighted mean. This does not take label imbalance into account.
        - 'weighted': Calculate metrics for each label, and find their average weighted by support (the number of true instances for each label). This alters `'macro'` to account for label imbalance. This option can result in an F-score that is not between precision and recall.
        - 'samples': Calculate metrics for each instance, and find their average (only meaningful for multilabel classification).
    sample_weight (`list` of `float`): Sample weights Defaults to None.
    zero_division (`int` or `string`): Sets the value to return when there is a zero division. Defaults to 'warn'.

        - 0: Returns 0 when there is a zero division.
        - 1: Returns 1 when there is a zero division.
        - 'warn': Raises warnings and then returns 0 when there is a zero division.

Returns:
    precision (`float` or `array` of `float`): Precision score or list of precision scores, depending on the value passed to `average`. Minimum possible value is 0. Maximum possible value is 1. Higher values indicate that fewer negative examples were incorrectly labeled as positive, which means that, generally, higher scores are better.

Examples:

    Example 1-A simple binary example
        >>> precision_metric = datasets.load_metric(\"precision\")
        >>> results = precision_metric.compute(references=[0, 1, 0, 1, 0], predictions=[0, 0, 1, 1, 0])
        >>> print(results)
        {'precision': 0.5}

    Example 2-The same simple binary example as in Example 1, but with `pos_label` set to `0`.
        >>> precision_metric = datasets.load_metric(\"precision\")
        >>> results = precision_metric.compute(references=[0, 1, 0, 1, 0], predictions=[0, 0, 1, 1, 0], pos_label=0)
        >>> print(round(results['precision'], 2))
        0.67

    Example 3-The same simple binary example as in Example 1, but with `sample_weight` included.
        >>> precision_metric = datasets.load_metric(\"precision\")
        >>> results = precision_metric.compute(references=[0, 1, 0, 1, 0], predictions=[0, 0, 1, 1, 0], sample_weight=[0.9, 0.5, 3.9, 1.2, 0.3])
        >>> print(results)
        {'precision': 0.23529411764705882}

    Example 4-A multiclass example, with different values for the `average` input.
        >>> predictions = [0, 2, 1, 0, 0, 1]
        >>> references = [0, 1, 2, 0, 1, 2]
        >>> results = precision_metric.compute(predictions=predictions, references=references, average='macro')
        >>> print(results)
        {'precision': 0.2222222222222222}
        >>> results = precision_metric.compute(predictions=predictions, references=references, average='micro')
        >>> print(results)
        {'precision': 0.3333333333333333}
        >>> results = precision_metric.compute(predictions=predictions, references=references, average='weighted')
        >>> print(results)
        {'precision': 0.2222222222222222}
        >>> results = precision_metric.compute(predictions=predictions, references=references, average=None)
        >>> print([round(res, 2) for res in results['precision']])
        [0.67, 0.0, 0.0]
"""


UpperCamelCase_						:					List[Any]      				=			"""
@article{scikit-learn,
    title={Scikit-learn: Machine Learning in {P}ython},
    author={Pedregosa, F. and Varoquaux, G. and Gramfort, A. and Michel, V.
    and Thirion, B. and Grisel, O. and Blondel, M. and Prettenhofer, P.
    and Weiss, R. and Dubourg, V. and Vanderplas, J. and Passos, A. and
    Cournapeau, D. and Brucher, M. and Perrot, M. and Duchesnay, E.},
    journal={Journal of Machine Learning Research},
    volume={12},
    pages={2825--2830},
    year={2011}
}
"""


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


      def _UpperCamelCase    (     self					:						Any    ):





            """simple docstring"""







            return datasets.MetricInfo(
                description=_DESCRIPTION				, citation=_CITATION				, inputs_description=_KWARGS_DESCRIPTION				, features=datasets.Features(
                    {
                        '''predictions''': datasets.Sequence(datasets.Value('''int32'''    )    ),
                        '''references''': datasets.Sequence(datasets.Value('''int32'''    )    ),
                    }
                    if self.config_name == '''multilabel'''
                    else {
                        '''predictions''': datasets.Value('''int32'''    ),
                        '''references''': datasets.Value('''int32'''    ),
                    }    )				, reference_urls=['''https://scikit-learn.org/stable/modules/generated/sklearn.metrics.precision_score.html''']				, )







      def _UpperCamelCase    (     self					:						str				, a					:						Tuple				, a					:						int				, a					:						str=None				, a					:						List[str]=1				, a					:						Tuple="binary"				, a					:						Optional[Any]=None				, a					:						int="warn"				, ):





            """simple docstring"""







            __snake_case   :     int	      =precision_score(
                a				, a				, labels=a				, pos_label=a				, average=a				, sample_weight=a				, zero_division=a				, )
            return {"precision": float(a    ) if score.size == 1 else score}










"""simple docstring"""





import numpy as np



def      __lowercase       (     a			:					Union[str, Any]							,		a			:					Optional[Any]							,		a			:					List[str]			)       ->       Dict:
      __snake_case   :     Dict	      =n_draws * class_counts / class_counts.sum()
      # floored means we don't overshoot n_samples, but probably undershoot
      __snake_case   :     int	      =np.floor(a			)
      # we add samples according to how much "left over" probability
      # they had, until we arrive at n_samples
      __snake_case   :     Dict	      =int(n_draws - floored.sum()			)
      if need_to_add > 0:
            __snake_case   :     List[str]	      =continuous - floored
            __snake_case   :     str	      =np.sort(np.unique(a			)			)[::-1]
            # add according to remainder, but break ties
            # randomly to avoid biases
            for value in values:
                  ((__snake_case)      ,					)   :     Tuple	      =np.where(remainder == value			)
                  # if we need_to_add less than what's in inds
                  # we draw randomly from them.
                  # if we need to add more, we add them all and
                  # go to the next value
                  __snake_case   :     int	      =min(len(a			)							,		a			)
                  __snake_case   :     Any	      =rng.choice(a							,		size=a							,		replace=a			)
                  floored[inds] += 1
                  need_to_add -= add_now
                  if need_to_add == 0:
                        break
      return floored.astype(np.intaa			)



def      __lowercase       (     a			:					Any							,		a			:					str							,		a			:					Dict							,		a			:					Union[str, Any]							,		a			:					Union[str, Any]=10			)       ->       Any:
      __snake_case      ,					__snake_case   :     int	      =np.unique(a							,		return_inverse=a			)
      __snake_case   :     Dict	      =classes.shape[0]
      __snake_case   :     int	      =np.bincount(a			)
      if np.min(a			) < 2:
            raise ValueError('''Minimum class count error'''			)
      if n_train < n_classes:
            raise ValueError(
                '''The train_size = %d should be greater or ''' '''equal to the number of classes = %d''' % (n_train, n_classes)			)
      if n_test < n_classes:
            raise ValueError(
                '''The test_size = %d should be greater or ''' '''equal to the number of classes = %d''' % (n_test, n_classes)			)
      __snake_case   :     str	      =np.split(np.argsort(a							,		kind='''mergesort'''			)							,		np.cumsum(a			)[:-1]			)
      for _ in range(a			):
            __snake_case   :     str	      =approximate_mode(a							,		a							,		a			)
            __snake_case   :     List[str]	      =class_counts - n_i
            __snake_case   :     Union[str, Any]	      =approximate_mode(a							,		a							,		a			)

            __snake_case   :     int	      =[]
            __snake_case   :     Union[str, Any]	      =[]

            for i in range(a			):
                  __snake_case   :     Union[str, Any]	      =rng.permutation(class_counts[i]			)
                  __snake_case   :     Dict	      =class_indices[i].take(a							,		mode='''clip'''			)
                  train.extend(perm_indices_class_i[: n_i[i]]			)
                  test.extend(perm_indices_class_i[n_i[i] : n_i[i] + t_i[i]]			)
            __snake_case   :     Any	      =rng.permutation(a			)
            __snake_case   :     int	      =rng.permutation(a			)

            yield train, test


