github.com/lab47/exprcore@v0.0.0-20210525052339-fb7d6bd9331e/exprcore/testdata/int.star

# Tests of Starlark 'int'
# option:float

load("assert.star", "assert")

# basic arithmetic
assert.eq(0 - 1, -1)
assert.eq(0 + 1, +1)
assert.eq(1 + 1, 2)
assert.eq(5 + 7, 12)
assert.eq(5 * 7, 35)
assert.eq(5 - 7, -2)

# int boundaries
maxint64 = (1 << 63) - 1
minint64 = -1 << 63
maxint32 = (1 << 31) - 1
minint32 = -1 << 31
assert.eq(maxint64, 9223372036854775807)
assert.eq(minint64, -9223372036854775808)
assert.eq(maxint32, 2147483647)
assert.eq(minint32, -2147483648)


# truth
def truth() {
  assert.true(not 0)
  for m in [1, maxint32] { # Test small/big ranges
    assert.true(123*m)
    assert.true(-1*m)
  }
}
truth()

# floored division
# (For real division, see float.star.)
def division() {
  for m in [1, maxint32] { # Test small/big ranges
    assert.eq((100*m) // (7*m), 14)
    assert.eq((100*m) // (-7*m), -15)
    assert.eq((-100*m) // (7*m), -15) # NB: different from Go/Java
    assert.eq((-100*m) // (-7*m), 14) # NB: different from Go/Java
    assert.eq((98*m) // (7*m), 14)
    assert.eq((98*m) // (-7*m), -14)
    assert.eq((-98*m) // (7*m), -14)
    assert.eq((-98*m) // (-7*m), 14)
  }
}

division()

# remainder
def remainder() {
  for m in [1, maxint32] { # Test small/big ranges
    assert.eq((100*m) % (7*m), 2*m)
    assert.eq((100*m) % (-7*m), -5*m) # NB: different from Go/Java
    assert.eq((-100*m) % (7*m), 5*m) # NB: different from Go/Java
    assert.eq((-100*m) % (-7*m), -2*m)
    assert.eq((98*m) % (7*m), 0)
    assert.eq((98*m) % (-7*m), 0)
    assert.eq((-98*m) % (7*m), 0)
    assert.eq((-98*m) % (-7*m), 0)
  }
}
remainder()

# compound assignment
def compound() {
  x = 1
  x += 1
  assert.eq(x, 2)
  x -= 3
  assert.eq(x, -1)
  x *= 39
  assert.eq(x, -39)
  x //= 4
  assert.eq(x, -10)
  x /= -2
  assert.eq(x, 5)
  x %= 3
  assert.eq(x, 2)
  # use resolve.AllowBitwise to enable the ops:
  x = 2
  x &= 1
  assert.eq(x, 0)
  x |= 2
  assert.eq(x, 2)
  x ^= 3
  assert.eq(x, 1)
  x <<= 2
  assert.eq(x, 4)
  x >>=2
  assert.eq(x, 1)
}
compound()

# int conversion
# See float.star for float-to-int conversions.
# We follow Python 3 here, but I can't see the method in its madness.
# int from bool/int/float
assert.fails(int, 'missing argument')  # int()
assert.eq(int(False), 0)
assert.eq(int(True), 1)
assert.eq(int(3), 3)
assert.eq(int(3.1), 3)
assert.fails(=> int(3, base:10), "non-string with explicit base")
assert.fails(=> int(True, 10), "non-string with explicit base")
# int from string, base implicitly 10
assert.eq(int("100000000000000000000"), 10000000000 * 10000000000)
assert.eq(int("-100000000000000000000"), -10000000000 * 10000000000)
assert.eq(int("123"), 123)
assert.eq(int("-123"), -123)
assert.eq(int("0123"), 123) # not octal
assert.eq(int("-0123"), -123)
assert.fails(=> int("0x12"), "invalid literal with base 10")
assert.fails(=> int("-0x12"), "invalid literal with base 10")
assert.fails(=> int("0o123"), "invalid literal.*base 10")
assert.fails(=> int("-0o123"), "invalid literal.*base 10")
# int from string, explicit base
assert.eq(int("0"), 0)
assert.eq(int("00"), 0)
assert.eq(int("0", base:10), 0)
assert.eq(int("00", base:10), 0)
assert.eq(int("0", base:8), 0)
assert.eq(int("00", base:8), 0)
assert.eq(int("-0"), 0)
assert.eq(int("-00"), 0)
assert.eq(int("-0", base:10), 0)
assert.eq(int("-00", base:10), 0)
assert.eq(int("-0", base:8), 0)
assert.eq(int("-00", base:8), 0)
assert.eq(int("+0"), 0)
assert.eq(int("+00"), 0)
assert.eq(int("+0", base:10), 0)
assert.eq(int("+00", base:10), 0)
assert.eq(int("+0", base:8), 0)
assert.eq(int("+00", base:8), 0)
assert.eq(int("11", base:9), 10)
assert.eq(int("-11", base:9), -10)
assert.eq(int("10011", base:2), 19)
assert.eq(int("-10011", base:2), -19)
assert.eq(int("123", 8), 83)
assert.eq(int("-123", 8), -83)
assert.eq(int("0123", 8), 83) # redundant zeros permitted
assert.eq(int("-0123", 8), -83)
assert.eq(int("00123", 8), 83)
assert.eq(int("-00123", 8), -83)
assert.eq(int("0o123", 8), 83)
assert.eq(int("-0o123", 8), -83)
assert.eq(int("123", 7), 66) # 1*7*7 + 2*7 + 3
assert.eq(int("-123", 7), -66)
assert.eq(int("12", 16), 18)
assert.eq(int("-12", 16), -18)
assert.eq(int("0x12", 16), 18)
assert.eq(int("-0x12", 16), -18)
assert.eq(0x1000000000000001 * 0x1000000000000001, 0x1000000000000002000000000000001)
assert.eq(int("1010", 2), 10)
assert.eq(int("111111101", 2), 509)
assert.eq(int("0b0101", 0), 5)
assert.eq(int("0b00000", 0), 0)
assert.eq(1111111111111111 * 1111111111111111, 1234567901234567654320987654321)
assert.fails(=> int("0x123", 8), "invalid literal.*base 8")
assert.fails(=> int("-0x123", 8), "invalid literal.*base 8")
assert.fails(=> int("0o123", 16), "invalid literal.*base 16")
assert.fails(=> int("-0o123", 16), "invalid literal.*base 16")
assert.fails(=> int("0x110", 2), "invalid literal.*base 2")
# int from string, auto detect base
assert.eq(int("123", 0), 123)
assert.eq(int("+123", 0), +123)
assert.eq(int("-123", 0), -123)
assert.eq(int("0x12", 0), 18)
assert.eq(int("+0x12", 0), +18)
assert.eq(int("-0x12", 0), -18)
assert.eq(int("0o123", 0), 83)
assert.eq(int("+0o123", 0), +83)
assert.eq(int("-0o123", 0), -83)
assert.fails(=> int("0123", 0), "invalid literal.*base 0") # valid in Python 2.7
assert.fails(=> int("-0123", 0), "invalid literal.*base 0")
# github.com/google/starlark-go/issues/108
assert.fails(=> int("0Oxa", 8), "invalid literal with base 8: 0Oxa")
# follow-on bugs to issue 108
assert.fails(=> int("--4"), "invalid literal with base 10: --4")
assert.fails(=> int("++4"), "invalid literal with base 10: \\+\\+4")
assert.fails(=> int("+-4"), "invalid literal with base 10: \\+-4")
assert.fails(=> int("0x-4", 16), "invalid literal with base 16: 0x-4")

# bitwise union (int|int), intersection (int&int), XOR (int^int), unary not (~int),
# left shift (int<<int), and right shift (int>>int).
# use resolve.AllowBitwise to enable the ops.
# TODO(adonovan): this is not yet in the Starlark spec,
# but there is consensus that it should be.
assert.eq(1|2, 3)
assert.eq(3|6, 7)
assert.eq((1|2) & (2|4), 2)
assert.eq(1 ^ 2, 3)
assert.eq(2 ^ 2, 0)
assert.eq(1 | 0 ^ 1, 1) # check | and ^ operators precedence
assert.eq(~1, -2)
assert.eq(~-2, 1)
assert.eq(~0, -1)
assert.eq(1 << 2, 4)
assert.eq(2 >> 1, 1)
assert.fails(=> 2 << -1, "negative shift count")
assert.fails(=> 1 << 512, "shift count too large")

# comparisons
# TODO(adonovan): test: < > == != etc
def comparisons() {
  for m in [1, maxint32/2, maxint32] { # Test small/big ranges
    assert.lt(-2*m, -1*m)
    assert.lt(-1*m, 0*m)
    assert.lt(0*m, 1*m)
    assert.lt(1*m, 2*m)
    assert.true(2*m >= 2*m)
    assert.true(2*m > 1*m)
    assert.true(1*m >= 1*m)
    assert.true(1*m > 0*m)
    assert.true(0*m >= 0*m)
    assert.true(0*m > -1*m)
    assert.true(-1*m >= -1*m)
    assert.true(-1*m > -2*m)
  }
}

comparisons()

# precision
assert.eq(str(maxint64), "9223372036854775807")
assert.eq(str(maxint64+1), "9223372036854775808")
assert.eq(str(minint64), "-9223372036854775808")
assert.eq(str(minint64-1), "-9223372036854775809")
assert.eq(str(minint64 * minint64), "85070591730234615865843651857942052864")
assert.eq(str(maxint32+1), "2147483648")
assert.eq(str(minint32-1), "-2147483649")
assert.eq(str(minint32 * minint32), "4611686018427387904")
assert.eq(str(minint32 | maxint32), "-1")
assert.eq(str(minint32 & minint32), "-2147483648")
assert.eq(str(minint32 ^ maxint32), "-1")
assert.eq(str(minint32 // -1), "2147483648")

# string formatting
assert.eq("%o %x %d" % (0o755, 0xDEADBEEF, 42), "755 deadbeef 42")
nums = [-95, -1, 0, +1, +95]
assert.eq(' '.join(["%o" % x for x in nums]), "-137 -1 0 1 137")
assert.eq(' '.join(["%d" % x for x in nums]), "-95 -1 0 1 95")
assert.eq(' '.join(["%i" % x for x in nums]), "-95 -1 0 1 95")
assert.eq(' '.join(["%x" % x for x in nums]), "-5f -1 0 1 5f")
assert.eq(' '.join(["%X" % x for x in nums]), "-5F -1 0 1 5F")
assert.eq("%o %x %d" % (123, 123, 123), "173 7b 123")
assert.eq("%o %x %d" % (123.1, 123.1, 123.1), "173 7b 123") # non-int operands are acceptable
assert.fails(=> "%d" % True, "cannot convert bool to int")