




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						float:

    """simple docstring"""


    return -num if num < 0 else num




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						int:

    """simple docstring"""


    if len(lowercase_   ) == 0:
        raise ValueError('''abs_min() arg is an empty sequence'''   )
    __UpperCamelCase			=    x[0]
    for i in x:
        if abs_val(lowercase_   ) < abs_val(lowercase_   ):
            __UpperCamelCase			=    i
    return j




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						int:

    """simple docstring"""


    if len(lowercase_   ) == 0:
        raise ValueError('''abs_max() arg is an empty sequence'''   )
    __UpperCamelCase			=    x[0]
    for i in x:
        if abs(lowercase_   ) > abs(lowercase_   ):
            __UpperCamelCase			=    i
    return j




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						int:

    """simple docstring"""


    if len(lowercase_   ) == 0:
        raise ValueError('''abs_max_sort() arg is an empty sequence'''   )
    return sorted(lowercase_       ,  key=lowercase_   )[-1]




def        __SCREAMING_SNAKE_CASE (	)							->						Tuple:

    """simple docstring"""


    assert abs_val(0   ) == 0
    assert abs_val(34   ) == 34
    assert abs_val(-10_00_00_00_00_00   ) == 10_00_00_00_00_00

    __UpperCamelCase			=    [-3, -1, 2, -11]
    assert abs_max(lowercase_   ) == -11
    assert abs_max_sort(lowercase_   ) == -11
    assert abs_min(lowercase_   ) == -1


if __name__ == "__main__":
 import doctest

 doctest.testmod()

 test_abs_val()
 print(abs_val(-34))  # --> 34












class 			_lowerCamelCase    :

      """simple docstring"""

      def __init__(  self       :			Optional[Any]			,							snake_case       :			int					):
          __UpperCamelCase			=    data
          __UpperCamelCase			=    42
          __UpperCamelCase			=    42







def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						None:

    """simple docstring"""


    __UpperCamelCase			=    0
    __UpperCamelCase			=    x




def        __SCREAMING_SNAKE_CASE (	lowercase_       ,  lowercase_   )							->						None:

    """simple docstring"""


    __UpperCamelCase		,   __UpperCamelCase			=    find_set(lowercase_   ), find_set(lowercase_   )
    if x == y:
        return

    elif x.rank > y.rank:
        __UpperCamelCase			=    x
    else:
        __UpperCamelCase			=    y
        if x.rank == y.rank:
            y.rank += 1




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						Node:

    """simple docstring"""


    if x != x.parent:
        __UpperCamelCase			=    find_set(x.parent   )
    return x.parent




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						set:

    """simple docstring"""


    __UpperCamelCase			=    ({0, 1, 2}, {3, 4, 5})
    for s in sets:
        if node.data in s:
            return s
    __UpperCamelCase			=    F"{node.data} is not in {sets}"
    raise ValueError(lowercase_   )




def        __SCREAMING_SNAKE_CASE (	)							->						None:

    """simple docstring"""


    __UpperCamelCase			=    [Node(lowercase_   ) for i in range(6   )]
    for v in vertex:
        make_set(lowercase_   )

    union_set(vertex[0]       ,  vertex[1]   )
    union_set(vertex[1]       ,  vertex[2]   )
    union_set(vertex[3]       ,  vertex[4]   )
    union_set(vertex[3]       ,  vertex[5]   )

    for nodea in vertex:
        for nodea in vertex:
            if find_python_set(lowercase_   ).isdisjoint(find_python_set(lowercase_   )   ):
                assert find_set(lowercase_   ) != find_set(lowercase_   )
            else:
                assert find_set(lowercase_   ) == find_set(lowercase_   )


if __name__ == "__main__":
 test_disjoint_set()






