```python
import math

def ngcd(x, y):
    """
    Finds all positive common divisors between two integers.
    """
    # The set of common divisors of x and y is equivalent to the set of
    # divisors of their greatest common divisor (GCD).
    # math.gcd correctly handles all integer inputs, including zeros and negatives.
    # For example, gcd(12, 0) is 12, and gcd(0, 0) is 0.
    greatest_common_divisor = math.gcd(x, y)

    # If the GCD is 0, it means both input numbers were 0.
    # In this case, any integer is a common divisor, which is an infinite set.
    # We return an empty list as a practical way to handle this edge case.
    if greatest_common_divisor == 0:
        return []

    # Find all positive divisors of the GCD.
    # These will be all the positive common divisors of the original numbers.
    common_divisors = []
    for i in range(1, greatest_common_divisor + 1):
        if greatest_common_divisor % i == 0:
            common_divisors.append(i)

    return common_divisors
```