
'''simple docstring'''





import os
import sys
import time

from . import transposition_cipher as trans_cipher
def 	snake_case_							(				):
      snake_case_    							=				"Prehistoric Men.txt"
      snake_case_    							=				"Output.txt"
      snake_case_    							=				int(input("Enter key: "      )      )
      snake_case_    							=				input("Encrypt/Decrypt [e/d]: "      )

      if not os.path.exists(_a      ):
            print(F'''File {input_file} does not exist. Quitting...'''      )
            sys.exit()
      if os.path.exists(_a      ):
            print(F'''Overwrite {output_file}? [y/n]'''      )
            snake_case_    							=				input("> "      )
            if not response.lower().startswith("y"      ):
                  sys.exit()

      snake_case_    							=				time.time()
      if mode.lower().startswith("e"      ):
            with open(_a      ) as f:
                  snake_case_    							=				f.read()
            snake_case_    							=				trans_cipher.encrypt_message(_a			,       _a      )
      elif mode.lower().startswith("d"      ):
            with open(_a      ) as f:
                  snake_case_    							=				f.read()
            snake_case_    							=				trans_cipher.decrypt_message(_a			,       _a      )

      with open(_a			,       "w"      ) as output_obj:
            output_obj.write(_a      )

      snake_case_    							=				round(time.time() - start_time			,       2      )
      print(("Done (", total_time, "seconds )")      )


if __name__ == "__main__":
     main()







from string import ascii_uppercase

def       lowerCAmelCase_      (	lowerCamelCase:							str  ,					lowerCamelCase:							str  ,					lowerCamelCase:							bool = False  ,					lowerCamelCase:							str = ascii_uppercase    )       ->      str:


      '''simple docstring'''




      lowerCamelCase__   	=					keyword.upper()
      lowerCamelCase__   	=					plaintext.upper()
      lowerCamelCase__   	=					set(lowerCamelCase    )

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

      # create a shifted version of the alphabet
      lowerCamelCase__   	=					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__   	=					[
          shifted_alphabet[k : k + num_unique_chars_in_keyword]
          for k in range(0  ,					26  ,					lowerCamelCase    )
      ]

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

                  # map current letter to letter in modified alphabet
                  lowerCamelCase__   	=					row[column]
                  letter_index += 1

      if verbose:
            print(lowerCamelCase    )
      # 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"""))