





'''simple docstring'''







def  _lowerCamelCase				( lowercase						:      bytes						)	->	str:
				return "".join([hex(lowercase						)[2:].zfill(2						).upper() for byte in list(lowercase						)]						)






def  _lowerCamelCase				( lowercase						:      str						)	->	bytes:
				# Check data validity, following RFC3548
				# https://www.ietf.org/rfc/rfc3548.txt
				if (len(lowercase						) % 2) != 0:
								raise ValueError(
								    "Base16 encoded data is invalid:\nData does not have an even number of hex digits."						)
				# Check the character set - the standard base16 alphabet
				# is uppercase according to RFC3548 section 6
				if not set(lowercase						) <= set("0123456789ABCDEF"						):
								raise ValueError(
								    "Base16 encoded data is invalid:\nData is not uppercase hex or it contains invalid characters."						)
				# For every two hexadecimal digits (= a byte), turn it into an integer.
				# Then, string the result together into bytes, and return it.
				return bytes(int(data[i] + data[i + 1]    ,							16						) for i in range(0    ,							len(lowercase						)    ,							2						)						)


if __name__ == "__main__":
					import doctest

					doctest.testmod()







from __future__ import annotations
def      _A       (		SCREAMING_SNAKE_CASE     :   list						):





  """simple docstring"""



  if len(SCREAMING_SNAKE_CASE						) == 0:
    return []
  a__					,							a__	:					int										=min(SCREAMING_SNAKE_CASE						), max(SCREAMING_SNAKE_CASE						)
  a__	:					Optional[int]										=int(max_value - min_value						) + 1
  a__	:					list[list]										=[[] for _ in range(SCREAMING_SNAKE_CASE						)]

  for i in my_list:
    buckets[int(i - min_value						)].append(SCREAMING_SNAKE_CASE						)

  return [v for bucket in buckets for v in sorted(SCREAMING_SNAKE_CASE						)]


if __name__ == "__main__":
     from doctest import testmod

     testmod()
     assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
     assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]






