


def      _snake_case						(						_snake_case				:			List[Any] ,   _snake_case				:			Optional[Any]			):
      return base * power(_SCREAMING_SNAKE_CASE ,   (exponent - 1)			) if exponent else 1


if __name__ == "__main__":
 print('''Raise base to the power of exponent using recursion...''')
 snake_case__		:     List[Any]    				=				int(input('''Enter the base: ''').strip())
 snake_case__		:     List[Any]    				=				int(input('''Enter the exponent: ''').strip())
 snake_case__		:     Optional[int]    				=				power(base, abs(exponent))
 if exponent < 0:  # power() does not properly deal w/ negative exponents
  snake_case__		:     List[Any]    				=				1 / result
 print(f"""{base} to the power of {exponent} is {result}""")






"""simple docstring"""





from __future__ import annotations



class 		snake_case_:






     def __init__(	self  :					int					,				UpperCamelCase_  :					str					,				UpperCamelCase_  :					str				):
           lowerCAmelCase,      lowerCAmelCase					:	List[str]       =   text, pattern
           lowerCAmelCase,      lowerCAmelCase					:	Union[str, Any]       =   len(UpperCamelCase_				), len(UpperCamelCase_				)






     def      lowerCamelCase__     (	self  :					List[Any]					,				UpperCamelCase_  :					str				):

           for i in range(self.patLen - 1					,				-1					,				-1				):
                 if char == self.pattern[i]:
                       return i
           return -1






     def      lowerCamelCase__     (	self  :					Optional[Any]					,				UpperCamelCase_  :					int				):

           for i in range(self.patLen - 1					,				-1					,				-1				):
                 if self.pattern[i] != self.text[current_pos + i]:
                       return current_pos + i
           return -1






     def      lowerCamelCase__     (	self  :					Dict				):
           # searches pattern in text and returns index positions
           lowerCAmelCase					:	Union[str, Any]       =   []
           for i in range(self.textLen - self.patLen + 1				):
                 lowerCAmelCase					:	str       =   self.mismatch_in_text(UpperCamelCase_				)
                 if mismatch_index == -1:
                       positions.append(UpperCamelCase_				)
                 else:
                       lowerCAmelCase					:	Optional[Any]       =   self.match_in_pattern(self.text[mismatch_index]				)
                       lowerCAmelCase					:	int       =   (
                           mismatch_index - match_index
                       )  # shifting index lgtm [py/multiple-definition]
           return positions



snake_case__		:     str    				=				'''ABAABA'''
snake_case__		:     List[str]    				=				'''AB'''
snake_case__		:     Union[str, Any]    				=				BoyerMooreSearch(text, pattern)
snake_case__		:     Optional[Any]    				=				bms.bad_character_heuristic()

if len(positions) == 0:
 print('''No match found''')
else:
 print('''Pattern found in following positions: ''')
 print(positions)


