
"""simple docstring"""


import numpy as np



def     _lowerCamelCase(__UpperCamelCase       )				-> Any:
	_lowerCAmelCase								=np.exp(__UpperCamelCase       )

	# Add up the all the exponentials
	_lowerCAmelCase								=np.sum(__UpperCamelCase       )

	# Divide every exponent by the sum of all exponents
	_lowerCAmelCase								=exponent_vector / sum_of_exponents

	return softmax_vector


if __name__ == "__main__":
			print(softmax((0,)))





"""simple docstring"""


from .hash_table import HashTable







class 		lowerCamelCase__					(					__magic_name__				):





			'''simple docstring'''



			def __init__(							self     ,     *__UpperCAmelCase     ,     **__UpperCAmelCase  ) ->     List[str]:
				super().__init__(*__UpperCAmelCase     ,     **__UpperCAmelCase  )



			def 					_lowerCAmelCase		(							self     ,     __UpperCAmelCase     ,     __UpperCAmelCase=None  ) ->     Union[str, Any]:
				_lowerCAmelCase								=1
				_lowerCAmelCase								=self.hash_function(key + i * i  )

				while self.values[new_key] is not None and self.values[new_key] != key:
					i += 1
					_lowerCAmelCase								=(
					    self.hash_function(key + i * i  )
					    if not self.balanced_factor() >= self.lim_charge
					    else None
					)

					if new_key is None:
						break

				return new_key



