


_A		:					Union[str, Any]          =							1_000



def      __lowerCAmelCase    (				snake_case						:     float			)							->				float:
   return x * x



def      __lowerCAmelCase    (				snake_case						:     Optional[int]    ,   snake_case						:     float    ,   snake_case						:     float    ,   snake_case						:     int = 4			)							->				float:
   assert callable(
       snake_case			), f'the function(object) passed should be callable your input : {function}'
   assert isinstance(snake_case    ,   (float, int)			), f'a should be float or integer your input : {a}'
   assert isinstance(function(snake_case			)    ,   (float, int)			), (
       "the function should return integer or float return type of your function, "
       f'{type(snake_case			)}'
   )
   assert isinstance(snake_case    ,   (float, int)			), f'b should be float or integer your input : {b}'
   assert (
       isinstance(snake_case    ,   snake_case			) and precision > 0
   ), f'precision should be positive integer your input : {precision}'

   # just applying the formula of simpson for approximate integration written in
   # mentioned article in first comment of this file and above this function

   __lowerCamelCase:					List[str]	 =						(b - a) / N_STEPS
   __lowerCamelCase:					Optional[Any]	 =						function(snake_case			) + function(snake_case			)

   for i in range(1    ,   snake_case			):
      __lowerCamelCase:					Dict	 =						a + h * i
      result += function(snake_case			) * (4 if i % 2 else 2)

   result *= h / 3
   return round(snake_case    ,   snake_case			)


if __name__ == "__main__":
   import doctest

   doctest.testmod()






from string import ascii_uppercase



def      __lowerCAmelCase    (				snake_case						:     str    ,   snake_case						:     str    ,   snake_case						:     bool = False    ,   snake_case						:     str = ascii_uppercase			)							->				str:
   __lowerCamelCase:					List[str]	 =						keyword.upper()
   __lowerCamelCase:					Tuple	 =						plaintext.upper()
   __lowerCamelCase:					Optional[Any]	 =						set(snake_case			)

   # create a list of unique characters in the keyword - their order matters
   # it determines how we will map plaintext characters to the ciphertext
   __lowerCamelCase:					Tuple	 =						[]
   for char in keyword:
      if char in alphabet_set and char not in unique_chars:
         unique_chars.append(snake_case			)
    # the number of those unique characters will determine the number of rows
   __lowerCamelCase:					Tuple	 =						len(snake_case			)

   # create a shifted version of the alphabet
   __lowerCamelCase:					List[str]	 =						unique_chars + [
       char for char in alphabet if char not in unique_chars
   ]

   # create a modified alphabet by splitting the shifted alphabet into rows
   __lowerCamelCase:					List[str]	 =						[
       shifted_alphabet[k : k + num_unique_chars_in_keyword]
       for k in range(0    ,   26    ,   snake_case			)
   ]

   # map the alphabet characters to the modified alphabet characters
   # going 'vertically' through the modified alphabet - consider columns first
   __lowerCamelCase:					Union[str, Any]	 =						{}
   __lowerCamelCase:					str	 =						0
   for column in range(snake_case			):
      for row in modified_alphabet:
         # if current row (the last one) is too short, break out of loop
         if len(snake_case			) <= column:
            break

         # map current letter to letter in modified alphabet
         __lowerCamelCase:					Union[str, Any]	 =						row[column]
         letter_index += 1

   if verbose:
      print(snake_case			)
   # create the encrypted text by mapping the plaintext to the modified alphabet
   return "".join(mapping[char] if char in mapping else char for char in plaintext			)


if __name__ == "__main__":
   # example use
   print(mixed_keyword('''college''', '''UNIVERSITY'''))


