





'''simple docstring'''





def    __UpperCamelCase      (    a) ->Optional[int]:
					lowerCamelCase__       =       0
					for ch in input_str:
										lowerCamelCase__       =       ord(__A)
										lowerCamelCase__       =       pow(2,     __A)

										# If we already turned on bit for current character's unicode
										if bitmap >> ch_unicode & 1 == 1:
															return False
										bitmap |= ch_bit_index_on
					return True


if __name__ == "__main__":
						import doctest

						doctest.testmod()








def    __UpperCamelCase      (    a,     a,     a=False) ->Dict:

					if isinstance(a,     a) and isinstance(a,     a):
										lowerCamelCase__       =       len(set_a.intersection(a))

										if alternative_union:
															lowerCamelCase__       =       len(a) + len(a)
										else:
															lowerCamelCase__       =       len(set_a.union(a))

										return intersection / union

					if isinstance(a,     (list, tuple)) and isinstance(a,     (list, tuple)):
										lowerCamelCase__       =       [element for element in set_a if element in set_b]

										if alternative_union:
															lowerCamelCase__       =       len(a) + len(a)
															return len(a) / union
										else:
															lowerCamelCase__       =       set_a + [element for element in set_b if element not in set_a]
															return len(a) / len(a)

										return len(a) / len(a)
					return None


if __name__ == "__main__":
						A_												=     {"a", "b", "c", "d", "e"}
						A_												=     {"c", "d", "e", "f", "h", "i"}
						print(jaccard_similarity(set_a, set_b))

