


from math import sqrt
def     __lowerCamelCase						(			UpperCAmelCase_						:		int						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (
          number >= 0
      ), "'number' must been an int and positive"

      a						:str										=	True

      # 0 and 1 are none primes.
      if number <= 1:
            a						:Union[str, Any]										=	False

      for divisor in range(2			,  int(round(sqrt(UpperCAmelCase_						)						)						) + 1						):
            # if 'number' divisible by 'divisor' then sets 'status'
            # of false and break up the loop.
            if number % divisor == 0:
                  a						:List[str]										=	False
                  break

    # precondition
      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						), "'status' must been from type bool"

      return status
def     __lowerCamelCase						(			UpperCAmelCase_						:		List[str]						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (n > 2), "'N' must been an int and > 2"

      # beginList: contains all natural numbers from 2 up to N
      a						:Optional[int]										=	list(range(2			,  n + 1						)						)

      a						:Union[str, Any]										=	[]  # this list will be returns.

      # actual sieve of erathostenes
      for i in range(len(UpperCAmelCase_						)						):
            for j in range(i + 1			,  len(UpperCAmelCase_						)						):
                  if (begin_list[i] != 0) and (begin_list[j] % begin_list[i] == 0):
                        a						:Optional[Any]										=	0

    # filters actual prime numbers.
      a						:int										=	[x for x in begin_list if x != 0]

      # precondition
      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						), "'ans' must been from type list"

      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		Dict						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (n > 2), "'N' must been an int and > 2"

      a						:List[str]										=	[]

      # iterates over all numbers between 2 up to N+1
      # if a number is prime then appends to list 'ans'
      for number in range(2			,  n + 1						):
            if is_prime(UpperCAmelCase_						):
                  ans.append(UpperCAmelCase_						)

    # precondition
      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						), "'ans' must been from type list"

      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		Optional[Any]						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and number >= 0, "'number' must been an int and >= 0"

      a						:str										=	[]  # this list will be returns of the function.

      # potential prime number factors.

      a						:Any										=	2

      a						:int										=	number

      if number == 0 or number == 1:
            ans.append(UpperCAmelCase_						)

      # if 'number' not prime then builds the prime factorization of 'number'
      elif not is_prime(UpperCAmelCase_						):
            while quotient != 1:
                  if is_prime(UpperCAmelCase_						) and (quotient % factor == 0):
                        ans.append(UpperCAmelCase_						)
                        quotient /= factor
                  else:
                        factor += 1

      else:
            ans.append(UpperCAmelCase_						)

      # precondition
      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						), "'ans' must been from type list"

      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		List[Any]						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (
          number >= 0
      ), "'number' bust been an int and >= 0"

      a						:Tuple										=	0

      # prime factorization of 'number'
      a						:Union[str, Any]										=	prime_factorization(UpperCAmelCase_						)

      a						:Tuple										=	max(UpperCAmelCase_						)

      # precondition
      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						), "'ans' must been from type int"

      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		Any						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (
          number >= 0
      ), "'number' bust been an int and >= 0"

      a						:Any										=	0

      # prime factorization of 'number'
      a						:Any										=	prime_factorization(UpperCAmelCase_						)

      a						:Any										=	min(UpperCAmelCase_						)

      # precondition
      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						), "'ans' must been from type int"

      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		Optional[Any]						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						), "'number' must been an int"
      assert isinstance(number % 2 == 0			,  UpperCAmelCase_						), "compare bust been from type bool"

      return number % 2 == 0
def     __lowerCamelCase						(			UpperCAmelCase_						:		Optional[int]						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						), "'number' must been an int"
      assert isinstance(number % 2 != 0			,  UpperCAmelCase_						), "compare bust been from type bool"

      return number % 2 != 0
def     __lowerCamelCase						(			UpperCAmelCase_						:		List[str]						):




      """simple docstring"""





      assert (
          isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (number > 2) and is_even(UpperCAmelCase_						)
      ), "'number' must been an int, even and > 2"

      a						:Optional[int]										=	[]  # this list will returned

      # creates a list of prime numbers between 2 up to 'number'
      a						:Optional[Any]										=	get_prime_numbers(UpperCAmelCase_						)
      a						:List[Any]										=	len(UpperCAmelCase_						)

      # run variable for while-loops.
      a						:int										=	0
      a						:Optional[int]										=	None

      # exit variable. for break up the loops
      a						:Optional[Any]										=	True

      while i < len_pn and loop:
            a						:List[Any]										=	i + 1

            while j < len_pn and loop:
                  if prime_numbers[i] + prime_numbers[j] == number:
                        a						:Optional[int]										=	False
                        ans.append(prime_numbers[i]						)
                        ans.append(prime_numbers[j]						)

                  j += 1

            i += 1

      # precondition
      assert (
          isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and (len(UpperCAmelCase_						) == 2)
          and (ans[0] + ans[1] == number)
          and is_prime(ans[0]						)
          and is_prime(ans[1]						)
      ), "'ans' must contains two primes. And sum of elements must been eq 'number'"

      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		str			,  UpperCAmelCase_						:		Tuple						):




      """simple docstring"""





      assert (
          isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and (numbera >= 0)
          and (numbera >= 0)
      ), "'number1' and 'number2' must been positive integer."

      a						:Dict										=	0

      while numbera != 0:
            a						:Any										=	numbera % numbera
            a						:str										=	numbera
            a						:Dict										=	rest

      # precondition
      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (
          numbera >= 0
      ), "'number' must been from type int and positive"

      return numbera
def     __lowerCamelCase						(			UpperCAmelCase_						:		Union[str, Any]			,  UpperCAmelCase_						:		Union[str, Any]						):




      """simple docstring"""





      assert (
          isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and (numbera >= 1)
          and (numbera >= 1)
      ), "'number1' and 'number2' must been positive integer."

      a						:List[str]										=	1  # actual answer that will be return.

      # for kgV (x,1)
      if numbera > 1 and numbera > 1:
            # builds the prime factorization of 'number1' and 'number2'
            a						:Tuple										=	prime_factorization(UpperCAmelCase_						)
            a						:Tuple										=	prime_factorization(UpperCAmelCase_						)

      elif numbera == 1 or numbera == 1:
            a						:str										=	[]
            a						:Any										=	[]
            a						:List[Any]										=	max(UpperCAmelCase_			,  UpperCAmelCase_						)

      a						:List[Any]										=	0
      a						:Optional[int]										=	0

      a						:Optional[int]										=	[]  # captured numbers int both 'primeFac1' and 'primeFac2'

      # iterates through primeFac1
      for n in prime_fac_a:
            if n not in done:
                  if n in prime_fac_a:
                        a						:Union[str, Any]										=	prime_fac_a.count(UpperCAmelCase_						)
                        a						:int										=	prime_fac_a.count(UpperCAmelCase_						)

                        for _ in range(max(UpperCAmelCase_			,  UpperCAmelCase_						)						):
                              ans *= n

                  else:
                        a						:Optional[Any]										=	prime_fac_a.count(UpperCAmelCase_						)

                        for _ in range(UpperCAmelCase_						):
                              ans *= n

                  done.append(UpperCAmelCase_						)

    # iterates through primeFac2
      for n in prime_fac_a:
            if n not in done:
                  a						:Dict										=	prime_fac_a.count(UpperCAmelCase_						)

                  for _ in range(UpperCAmelCase_						):
                        ans *= n

                  done.append(UpperCAmelCase_						)

    # precondition
      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (
          ans >= 0
      ), "'ans' must been from type int and positive"

      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		Optional[int]						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (n >= 0), "'number' must been a positive int"

      a						:int										=	0
      a						:Optional[int]										=	2  # this variable holds the answer

      while index < n:
            index += 1

            ans += 1  # counts to the next number

            # if ans not prime then
            # runs to the next prime number.
            while not is_prime(UpperCAmelCase_						):
                  ans += 1

    # precondition
      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and is_prime(
          UpperCAmelCase_						), "'ans' must been a prime number and from type int"

      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		Union[str, Any]			,  UpperCAmelCase_						:		Optional[int]						):




      """simple docstring"""





      assert (
          is_prime(UpperCAmelCase_						) and is_prime(UpperCAmelCase_						) and (p_number_a < p_number_a)
      ), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

      a						:Any										=	p_number_a + 1  # jump to the next number

      a						:Optional[Any]										=	[]  # this list will be returns.

      # if number is not prime then
      # fetch the next prime number.
      while not is_prime(UpperCAmelCase_						):
            number += 1

      while number < p_number_a:
            ans.append(UpperCAmelCase_						)

            number += 1

            # fetch the next prime number.
            while not is_prime(UpperCAmelCase_						):
                  number += 1

    # precondition
      assert (
          isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and ans[0] != p_number_a
          and ans[len(UpperCAmelCase_						) - 1] != p_number_a
      ), "'ans' must been a list without the arguments"

      # 'ans' contains not 'pNumber1' and 'pNumber2' !
      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		Dict						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (n >= 1), "'n' must been int and >= 1"

      a						:Dict										=	[]  # will be returned.

      for divisor in range(1			,  n + 1						):
            if n % divisor == 0:
                  ans.append(UpperCAmelCase_						)

    # precondition
      assert ans[0] == 1 and ans[len(UpperCAmelCase_						) - 1] == n, "Error in function getDivisiors(...)"

      return ans
def     __lowerCamelCase						(			UpperCAmelCase_						:		Union[str, Any]						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (
          number > 1
      ), "'number' must been an int and >= 1"

      a						:int										=	get_divisors(UpperCAmelCase_						)

      # precondition
      assert (
          isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and (divisors[0] == 1)
          and (divisors[len(UpperCAmelCase_						) - 1] == number)
      ), "Error in help-function getDivisiors(...)"

      # summed all divisors up to 'number' (exclusive), hence [:-1]
      return sum(divisors[:-1]						) == number
def     __lowerCamelCase						(			UpperCAmelCase_						:		int			,  UpperCAmelCase_						:		int						):




      """simple docstring"""





      assert (
          isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and (denominator != 0)
      ), "The arguments must been from type int and 'denominator' != 0"

      # build the greatest common divisor of numerator and denominator.
      a						:Tuple										=	gcd(abs(UpperCAmelCase_						)			,  abs(UpperCAmelCase_						)						)

      # precondition
      assert (
          isinstance(UpperCAmelCase_			,  UpperCAmelCase_						)
          and (numerator % gcd_of_fraction == 0)
          and (denominator % gcd_of_fraction == 0)
      ), "Error in function gcd(...,...)"

      return (numerator // gcd_of_fraction, denominator // gcd_of_fraction)
def     __lowerCamelCase						(			UpperCAmelCase_						:		Any						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (n >= 0), "'n' must been a int and >= 0"

      a						:str										=	1  # this will be return.

      for factor in range(1			,  n + 1						):
            ans *= factor

      return ans






def     __lowerCamelCase						(			UpperCAmelCase_						:		int						):




      """simple docstring"""





      assert isinstance(UpperCAmelCase_			,  UpperCAmelCase_						) and (n >= 0), "'n' must been an int and >= 0"

      a						:List[str]										=	0
      a						:List[str]										=	1
      a						:int										=	1  # this will be return

      for _ in range(n - 1						):
            a						:Tuple										=	ans
            ans += fiba
            a						:Optional[Any]										=	tmp

      return ans









from typing import List, Union

from ..utils import (
    add_end_docstrings,
    is_tf_available,
    is_torch_available,
    is_vision_available,
    logging,
    requires_backends,
)
from .base import PIPELINE_INIT_ARGS, Pipeline


if is_vision_available():
     from PIL import Image

     from ..image_utils import load_image

if is_tf_available():
     import tensorflow as tf

     from ..models.auto.modeling_tf_auto import TF_MODEL_FOR_IMAGE_CLASSIFICATION_MAPPING
     from ..tf_utils import stable_softmax

if is_torch_available():
     from ..models.auto.modeling_auto import MODEL_FOR_IMAGE_CLASSIFICATION_MAPPING

snake_case    :   str	    =					logging.get_logger(__name__)







@add_end_docstrings(_snake_case							)
class 		_snake_case  (				_snake_case							):




 def __init__(		self ,  *_lowerCamelCase ,  **_lowerCamelCase   ):
       super().__init__(*_lowerCamelCase ,  **_lowerCamelCase   )
       requires_backends(self ,  '''vision'''   )
       self.check_model_type(
           TF_MODEL_FOR_IMAGE_CLASSIFICATION_MAPPING
           if self.framework == '''tf'''
           else MODEL_FOR_IMAGE_CLASSIFICATION_MAPPING   )




 def 	SCREAMING_SNAKE_CASE__    (		self ,  _lowerCamelCase=None   ):
       a						:Tuple										=	{}
       if top_k is not None:
             a						:int										=	top_k
       return {}, {}, postprocess_params




 def __call__(		self ,  _lowerCamelCase ,  **_lowerCamelCase   ):
       return super().__call__(_lowerCamelCase ,  **_lowerCamelCase   )




 def 	SCREAMING_SNAKE_CASE__    (		self ,  _lowerCamelCase   ):
       a						:str										=	load_image(_lowerCamelCase   )
       a						:Any										=	self.image_processor(images=_lowerCamelCase ,  return_tensors=self.framework   )
       return model_inputs




 def 	SCREAMING_SNAKE_CASE__    (		self ,  _lowerCamelCase   ):
       a						:List[str]										=	self.model(**_lowerCamelCase   )
       return model_outputs




 def 	SCREAMING_SNAKE_CASE__    (		self ,  _lowerCamelCase ,  _lowerCamelCase=5   ):
       if top_k > self.model.config.num_labels:
             a						:List[Any]										=	self.model.config.num_labels

       if self.framework == "pt":
             a						:int										=	model_outputs.logits.softmax(-1   )[0]
             a							,    a						:Union[str, Any]										=	probs.topk(_lowerCamelCase   )
       elif self.framework == "tf":
             a						:Optional[Any]										=	stable_softmax(model_outputs.logits ,  axis=-1   )[0]
             a						:Union[str, Any]										=	tf.math.top_k(_lowerCamelCase ,  k=_lowerCamelCase   )
             a							,    a						:Optional[int]										=	topk.values.numpy(), topk.indices.numpy()
       else:
             raise ValueError(F'''Unsupported framework: {self.framework}'''   )

       a						:Optional[int]										=	scores.tolist()
       a						:str										=	ids.tolist()
       return [{"score": score, "label": self.model.config.idalabel[_id]} for score, _id in zip(_lowerCamelCase ,  _lowerCamelCase   )]





