






"""simple docstring"""



from timeit import timeit




def      _lowerCAmelCase		(							UpperCAmelCase__       :					int      )		->int:
						if number < 0:
												raise ValueError("""the value of input must not be negative"""      )
						A__						:  Optional[int]		  =  0
						while number:
												number &= number - 1
												result += 1
						return result




def      _lowerCAmelCase		(							UpperCAmelCase__       :					int      )		->int:
						if number < 0:
												raise ValueError("""the value of input must not be negative"""      )
						A__						:  Tuple		  =  0
						while number:
												if number % 2 == 1:
																		result += 1
												number >>= 1
						return result




def      _lowerCAmelCase		(							)		->None:

						def do_benchmark(UpperCAmelCase__       :					int      ) -> None:
												A__						:  Optional[int]		  =  """import __main__ as z"""
												print(f'Benchmark when {number = }:'      )
												print(f'{get_set_bits_count_using_modulo_operator(UpperCAmelCase__      ) = }'      )
												A__						:  Any		  =  timeit("""z.get_set_bits_count_using_modulo_operator(25)""",						setup=UpperCAmelCase__      )
												print(f'timeit() runs in {timing} seconds'      )
												print(f'{get_set_bits_count_using_brian_kernighans_algorithm(UpperCAmelCase__      ) = }'      )
												A__						:  List[str]		  =  timeit(
												    """z.get_set_bits_count_using_brian_kernighans_algorithm(25)""",						setup=UpperCAmelCase__,						)
												print(f'timeit() runs in {timing} seconds'      )

						for number in (2_5, 3_7, 5_8, 0):
												do_benchmark(UpperCAmelCase__      )
												print()


if __name__ == "__main__":
						import doctest

						doctest.testmod()
						benchmark()














"""simple docstring"""



from __future__ import annotations






class 							__SCREAMING_SNAKE_CASE						:


							def __init__(			self      :						Any			,    snake_case      :						str			,    snake_case      :						str							):
													'''simple docstring'''





													A__  ,  A__						:  List[str]		  =  text, pattern
													A__  ,  A__						:  List[str]		  =  len(snake_case							), len(snake_case							)


							def 						_UpperCamelCase       (			self      :						str			,    snake_case      :						str							):
													'''simple docstring'''





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


							def 						_UpperCamelCase       (			self      :						Any			,    snake_case      :						int							):
													'''simple docstring'''





													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 						_UpperCamelCase       (			self      :						Union[str, Any]							):
													'''simple docstring'''





													A__						:  str		  =  []
													for i in range(self.textLen - self.patLen + 1							):
																			A__						:  List[Any]		  =  self.mismatch_in_text(snake_case							)
																			if mismatch_index == -1:
																									positions.append(snake_case							)
																			else:
																									A__						:  Dict		  =  self.match_in_pattern(self.text[mismatch_index]							)
																									A__						:  Union[str, Any]		  =  (
																									    mismatch_index - match_index
																									)  # shifting index lgtm [py/multiple-definition]
													return positions




A_    =							'''ABAABA'''
A_    =							'''AB'''
A_    =							BoyerMooreSearch(text, pattern)
A_    =							bms.bad_character_heuristic()

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






