
def 				lowerCamelCase__				(						a__  :  str     )		->	str:
       UpperCamelCase_							       =       word.upper()
       UpperCamelCase_							       =       0
       UpperCamelCase_							       =       {}
       UpperCamelCase_							       =       []

       for letter in word:
              if letter not in letter_nums:
                     UpperCamelCase_							       =       str(a__     )
                     next_num += 1
              word_pattern.append(letter_nums[letter]     )
       return ".".join(a__     )


if __name__ == "__main__":
      import pprint
      import time

      _A	  =					time.time()
      with open('''dictionary.txt''') as in_file:
            _A	  =					in_file.read().splitlines()

      _A	  =					{}
      for word in word_list:
            _A	  =					get_word_pattern(word)
            if pattern in all_patterns:
                  all_patterns[pattern].append(word)
            else:
                  _A	  =					[word]

      with open('''word_patterns.txt''', '''w''') as out_file:
            out_file.write(pprint.pformat(all_patterns))

      _A	  =					round(time.time() - start_time, 2)
      print(F'''Done!  {len(all_patterns):,} word patterns found in {total_time} seconds.''')
      # Done!  9,581 word patterns found in 0.58 seconds.





def 				lowerCamelCase__				(						a__  :  int     )		->	str:
       UpperCamelCase_							       =       1
       UpperCamelCase_							       =       0
       UpperCamelCase_							       =       1
       UpperCamelCase_							       =       1
       UpperCamelCase_							       =       3
       UpperCamelCase_							       =       3
       UpperCamelCase_							       =       limit
       UpperCamelCase_							       =       0

       UpperCamelCase_							       =       """"""
       while counter != decimal + 1:
              if 4 * q + r - t < n * t:
                     result += str(a__     )
                     if counter == 0:
                            result += "."

                     if decimal == counter:
                            break

                     counter += 1
                     UpperCamelCase_							       =       10 * (r - n * t)
                     UpperCamelCase_							       =       ((10 * (3 * q + r)) // t) - 10 * n
                     q *= 10
                     UpperCamelCase_							       =       nr
              else:
                     UpperCamelCase_							       =       (2 * q + r) * l
                     UpperCamelCase_							       =       (q * (7 * k) + 2 + (r * l)) // (t * l)
                     q *= k
                     t *= l
                     l += 2
                     k += 1
                     UpperCamelCase_							       =       nn
                     UpperCamelCase_							       =       nr
       return result




def 				lowerCamelCase__				(						)		->	None:
       print(f'''{calculate_pi(50     ) = }'''     )
       import doctest

       doctest.testmod()


if __name__ == "__main__":
      main()



