from typing import Set


def digit_rotations(n: int) -> Set[int]:
    """Finds all unique digit rotations of a positive integer in base 10.

    Args:
        n: A positive integer value.

    Returns:
        A set of all distinct integers that result from rotating the base-10
        digits of ``n``. A rotation is given by truncating the ``d`` least
        significant digits of ``n`` and prepending them to the resulting
        number, where ``d`` is any integer from 0 to the number of digits in
        the base-10 representation of ``n``, inclusive.
    """
    n_str = str(n)
    rotations = set()
    for i in range(len(n_str)):
        rotations.add(int(n_str[i:] + n_str[:i]))
    return rotations