



# Copyright 2021 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 argparse
import os

from accelerate.utils import ComputeEnvironment

from .cluster import get_cluster_input
from .config_args import cache_dir, default_config_file, default_yaml_config_file, load_config_from_file  # noqa: F401
from .config_utils import _ask_field, _ask_options, _convert_compute_environment  # noqa: F401
from .sagemaker import get_sagemaker_input


a_								=    """Launches a series of prompts to create and save a `default_config.yaml` configuration file for your training system. Should always be ran first on your machine"""





def 						a__	(						):
   __lowerCamelCase  							=			_ask_options(
       '''In which compute environment are you running?'''       ,['''This machine''', '''AWS (Amazon SageMaker)''']       ,_convert_compute_environment       ,)
   if compute_environment == ComputeEnvironment.AMAZON_SAGEMAKER:
      __lowerCamelCase  							=			get_sagemaker_input()
   else:
      __lowerCamelCase  							=			get_cluster_input()
   return config





def 						a__	(						_UpperCamelCase	:       Any=None							):
   if subparsers is not None:
      __lowerCamelCase  							=			subparsers.add_parser('''config'''       ,description=lowerCAmelCase_							)
   else:
      __lowerCamelCase  							=			argparse.ArgumentParser('''Accelerate config command'''       ,description=lowerCAmelCase_							)

   parser.add_argument(
       '''--config_file'''       ,default=lowerCAmelCase_       ,help=(
           '''The path to use to store the config file. Will default to a file named default_config.yaml in the cache '''
           '''location, which is the content of the environment `HF_HOME` suffixed with \'accelerate\', or if you don\'t have '''
           '''such an environment variable, your cache directory (\'~/.cache\' or the content of `XDG_CACHE_HOME`) suffixed '''
           '''with \'huggingface\'.'''
       )       ,)

   if subparsers is not None:
      parser.set_defaults(func=lowerCAmelCase_							)
   return parser





def 						a__	(						_UpperCamelCase	:       List[Any]							):
   __lowerCamelCase  							=			get_user_input()
   if args.config_file is not None:
      __lowerCamelCase  							=			args.config_file
   else:
      if not os.path.isdir(lowerCAmelCase_							):
         os.makedirs(lowerCAmelCase_							)
      __lowerCamelCase  							=			default_yaml_config_file

   if config_file.endswith('''.json'''							):
      config.to_json_file(lowerCAmelCase_							)
   else:
      config.to_yaml_file(lowerCAmelCase_							)
   print(F"""accelerate configuration saved at {config_file}"""							)





def 						a__	(						):
   __lowerCamelCase  							=			config_command_parser()
   __lowerCamelCase  							=			parser.parse_args()
   config_command(lowerCAmelCase_							)


if __name__ == "__main__":
  main()










from math import sqrt



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       bool:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (
				    number >= 0
				), "'number' must been an int and positive"

				lowerCAmelCase_       :					List[Any]			 = True

				# 0 and 1 are none primes.
				if number <= 1:
								lowerCAmelCase_       :					Optional[int]			 = False

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

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

				return status



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       Tuple:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (n > 2), "'N' must been an int and > 2"

				# beginList: contains all natural numbers from 2 up to N
				lowerCAmelCase_       :					Tuple			 = list(range(2       ,      n + 1       )       )

				lowerCAmelCase_       :					Optional[int]			 = []  # this list will be returns.

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

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

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

				return ans



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       Optional[Any]:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (n > 2), "'N' must been an int and > 2"

				lowerCAmelCase_       :					List[Any]			 = []

				# 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(lowerCAmelCase_       ):
												ans.append(lowerCAmelCase_       )

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

				return ans



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       List[Any]:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and number >= 0, "'number' must been an int and >= 0"

				lowerCAmelCase_       :					int			 = []  # this list will be returns of the function.

				# potential prime number factors.

				lowerCAmelCase_       :					List[Any]			 = 2

				lowerCAmelCase_       :					Optional[int]			 = number

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

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

				else:
								ans.append(lowerCAmelCase_       )

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

				return ans



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       Optional[int]:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (
				    number >= 0
				), "'number' bust been an int and >= 0"

				lowerCAmelCase_       :					Dict			 = 0

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

				lowerCAmelCase_       :					Tuple			 = max(lowerCAmelCase_       )

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

				return ans



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       int:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (
				    number >= 0
				), "'number' bust been an int and >= 0"

				lowerCAmelCase_       :					List[Any]			 = 0

				# prime factorization of 'number'
				lowerCAmelCase_       :					Dict			 = prime_factorization(lowerCAmelCase_       )

				lowerCAmelCase_       :					int			 = min(lowerCAmelCase_       )

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

				return ans



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       Optional[Any]:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ), "'number' must been an int"
				assert isinstance(number % 2 == 0       ,      lowerCAmelCase_       ), "compare bust been from type bool"

				return number % 2 == 0



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       List[Any]:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ), "'number' must been an int"
				assert isinstance(number % 2 != 0       ,      lowerCAmelCase_       ), "compare bust been from type bool"

				return number % 2 != 0



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       List[str]:
				assert (
				    isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (number > 2) and is_even(lowerCAmelCase_       )
				), "'number' must been an int, even and > 2"

				lowerCAmelCase_       :					str			 = []  # this list will returned

				# creates a list of prime numbers between 2 up to 'number'
				lowerCAmelCase_       :					int			 = get_prime_numbers(lowerCAmelCase_       )
				lowerCAmelCase_       :					List[str]			 = len(lowerCAmelCase_       )

				# run variable for while-loops.
				lowerCAmelCase_       :					Union[str, Any]			 = 0
				lowerCAmelCase_       :					Tuple			 = None

				# exit variable. for break up the loops
				lowerCAmelCase_       :					int			 = True

				while i < len_pn and loop:
								lowerCAmelCase_       :					int			 = i + 1

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

												j += 1

								i += 1

				# precondition
				assert (
				    isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       )
				    and (len(lowerCAmelCase_       ) == 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       (						lowerCAmelCase_       ,      lowerCAmelCase_       )->       Dict:
				assert (
				    isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       )
				    and isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       )
				    and (numbera >= 0)
				    and (numbera >= 0)
				), "'number1' and 'number2' must been positive integer."

				lowerCAmelCase_       :					int			 = 0

				while numbera != 0:
								lowerCAmelCase_       :					str			 = numbera % numbera
								lowerCAmelCase_       :					List[Any]			 = numbera
								lowerCAmelCase_       :					Any			 = rest

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

				return numbera



def 	lowerCAmelCase       (						lowerCAmelCase_       ,      lowerCAmelCase_       )->       Optional[int]:
				assert (
				    isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       )
				    and isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       )
				    and (numbera >= 1)
				    and (numbera >= 1)
				), "'number1' and 'number2' must been positive integer."

				lowerCAmelCase_       :					List[Any]			 = 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'
								lowerCAmelCase_       :					int			 = prime_factorization(lowerCAmelCase_       )
								lowerCAmelCase_       :					int			 = prime_factorization(lowerCAmelCase_       )

				elif numbera == 1 or numbera == 1:
								lowerCAmelCase_       :					Union[str, Any]			 = []
								lowerCAmelCase_       :					List[str]			 = []
								lowerCAmelCase_       :					Union[str, Any]			 = max(lowerCAmelCase_       ,      lowerCAmelCase_       )

				lowerCAmelCase_       :					Optional[int]			 = 0
				lowerCAmelCase_       :					Dict			 = 0

				lowerCAmelCase_       :					Union[str, Any]			 = []  # 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:
																lowerCAmelCase_       :					Optional[Any]			 = prime_fac_a.count(lowerCAmelCase_       )
																lowerCAmelCase_       :					Tuple			 = prime_fac_a.count(lowerCAmelCase_       )

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

												else:
																lowerCAmelCase_       :					List[str]			 = prime_fac_a.count(lowerCAmelCase_       )

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

												done.append(lowerCAmelCase_       )

    # iterates through primeFac2
				for n in prime_fac_a:
								if n not in done:
												lowerCAmelCase_       :					Optional[Any]			 = prime_fac_a.count(lowerCAmelCase_       )

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

												done.append(lowerCAmelCase_       )

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

				return ans



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       int:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (n >= 0), "'number' must been a positive int"

				lowerCAmelCase_       :					List[Any]			 = 0
				lowerCAmelCase_       :					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(lowerCAmelCase_       ):
												ans += 1

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

				return ans



def 	lowerCAmelCase       (						lowerCAmelCase_       ,      lowerCAmelCase_       )->       List[Any]:
				assert (
				    is_prime(lowerCAmelCase_       ) and is_prime(lowerCAmelCase_       ) and (p_number_a < p_number_a)
				), "The arguments must been prime numbers and 'pNumber1' < 'pNumber2'"

				lowerCAmelCase_       :					Union[str, Any]			 = p_number_a + 1  # jump to the next number

				lowerCAmelCase_       :					Optional[int]			 = []  # this list will be returns.

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

				while number < p_number_a:
								ans.append(lowerCAmelCase_       )

								number += 1

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

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

				# 'ans' contains not 'pNumber1' and 'pNumber2' !
				return ans



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       Tuple:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (n >= 1), "'n' must been int and >= 1"

				lowerCAmelCase_       :					List[Any]			 = []  # will be returned.

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

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

				return ans



def 	lowerCAmelCase       (						lowerCAmelCase_       )->       List[Any]:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (
				    number > 1
				), "'number' must been an int and >= 1"

				lowerCAmelCase_       :					Union[str, Any]			 = get_divisors(lowerCAmelCase_       )

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

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



def 	lowerCAmelCase       (						lowerCAmelCase_       ,      lowerCAmelCase_       )->       Union[str, Any]:
				assert (
				    isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       )
				    and isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       )
				    and (denominator != 0)
				), "The arguments must been from type int and 'denominator' != 0"

				# build the greatest common divisor of numerator and denominator.
				lowerCAmelCase_       :					Optional[Any]			 = gcd(abs(lowerCAmelCase_       )       ,      abs(lowerCAmelCase_       )       )

				# precondition
				assert (
				    isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       )
				    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       (						lowerCAmelCase_       )->       Tuple:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (n >= 0), "'n' must been a int and >= 0"

				lowerCAmelCase_       :					Any			 = 1  # this will be return.

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

				return ans




def 	lowerCAmelCase       (						lowerCAmelCase_       )->       int:
				assert isinstance(lowerCAmelCase_       ,      lowerCAmelCase_       ) and (n >= 0), "'n' must been an int and >= 0"

				lowerCAmelCase_       :					Any			 = 0
				lowerCAmelCase_       :					List[Any]			 = 1
				lowerCAmelCase_       :					Union[str, Any]			 = 1  # this will be return

				for _ in range(n - 1       ):
								lowerCAmelCase_       :					Union[str, Any]			 = ans
								ans += fiba
								lowerCAmelCase_       :					Optional[Any]			 = tmp

				return ans