rapydscript-ns 0.8.1 → 0.8.3

package/test/python_features.pyj

@@ -0,0 +1,1271 @@
+# globals: assrt
+# vim:fileencoding=utf-8
+#
+# python_features.pyj
+# Survey of Python syntax features and their support status in RapydScript.
+# Sections marked SKIP are known parse-time or runtime unsupported features.
+# All other tests exercise features that were uncertain before this survey.
+
+ae = assrt.equal
+ade = assrt.deepEqual
+ok = assrt.ok
+
+# ── 1. super() with zero arguments ──────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+class _Base:
+    def greet(self):
+        return 'base'
+
+class _Child(_Base):
+    def greet(self):
+        return super().greet() + '+child'
+
+ae(_Child().greet(), 'base+child')
+
+class _Child2(_Base):
+    def greet(self):
+        return super(_Child2, self).greet() + '+child2'
+
+ae(_Child2().greet(), 'base+child2')
+
+# ── 2. Multiple exception types — comma form ─────────────────────────────────
+# STATUS: ✓ WORKS
+
+def _multi_except():
+    for exc_cls in [TypeError, ValueError]:
+        caught_type = None
+        try:
+            raise exc_cls('test')
+        except TypeError, ValueError as e:
+            caught_type = type(e)
+        ae(caught_type, exc_cls)
+
+_multi_except()
+
+# ── 3. Multiple exception types — tuple form ─────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+def _multi_except_tuple():
+    caught = False
+    try:
+        raise ValueError('boom')
+    except (TypeError, ValueError) as e:
+        caught = True
+    ae(caught, True)
+
+_multi_except_tuple()
+
+# ── 4. try / else ────────────────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+def _try_else():
+    ran = []
+    try:
+        x = 1
+    except:
+        ran.push('except')
+    else:
+        ran.push('else')
+    ade(ran, ['else'])
+
+    ran = []
+    try:
+        raise ValueError('oops')
+    except ValueError:
+        ran.push('except')
+    else:
+        ran.push('else')
+    ade(ran, ['except'])
+
+_try_else()
+
+# ── 5. for / else ────────────────────────────────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+def _for_else():
+    # else runs when loop finishes without break
+    ran_else = False
+    for x in [1, 2, 3]:
+        pass
+    else:
+        ran_else = True
+    ae(ran_else, True)
+
+    # else is skipped when break occurs
+    ran_else = False
+    for x in [1, 2, 3]:
+        if x == 2:
+            break
+    else:
+        ran_else = True
+    ae(ran_else, False)
+
+    # else runs for empty iterable (no break possible)
+    ran_else = False
+    for x in []:
+        pass
+    else:
+        ran_else = True
+    ae(ran_else, True)
+
+    # typical search pattern: find item or report not found
+    def find_item(lst, target):
+        for item in lst:
+            if item == target:
+                return 'found'
+        else:
+            return 'not found'
+
+    ae(find_item([1, 2, 3], 2), 'found')
+    ae(find_item([1, 2, 3], 9), 'not found')
+
+    # nested loops: break in inner should NOT affect outer for/else
+    outer_else = False
+    for i in [1, 2]:
+        for j in [10, 20]:
+            if j == 10:
+                break   # breaks inner only
+    else:
+        outer_else = True
+    ae(outer_else, True)
+
+_for_else()
+
+# ── 6. Multiple context managers in a single with statement ─────────────────
+# STATUS: ✓ WORKS — enters L→R, exits R→L (LIFO, Python-correct)
+
+class _CM:
+    def __init__(self, name, log):
+        self.name = name
+        self.log = log
+    def __enter__(self):
+        self.log.push('enter:' + self.name)
+        return self
+    def __exit__(self):
+        self.log.push('exit:' + self.name)
+        return False
+
+def _test_multi_with():
+    log = []
+    with _CM('a', log) as a, _CM('b', log) as b:
+        log.push('body')
+    ae(log[0], 'enter:a')
+    ae(log[1], 'enter:b')
+    ae(log[2], 'body')
+    # LIFO exit order: b exits before a (Python-correct)
+    ae(log[3], 'exit:b')
+    ae(log[4], 'exit:a')
+
+_test_multi_with()
+
+# ── 7. callable() ────────────────────────────────────────────────────────────
+# STATUS: ✓ WORKS — checks typeof function AND __call__ method
+
+ae(callable(len),  True)
+ae(callable(42),   False)
+ae(callable(None), False)
+ae(callable(def(): pass;), True)
+
+class _WithCall:
+    def __call__(self):
+        return 42
+
+class _WithoutCall:
+    pass
+
+ae(callable(_WithCall()),    True)
+ae(callable(_WithoutCall()), False)
+
+# ── 8. round(x, ndigits) ─────────────────────────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+ae(round(3),          3)
+ae(round(3.7),        4)
+ae(round(3.14159, 2), 3.14)
+ae(round(3.145,   2), 3.15)
+ae(round(1234,   -2), 1200)
+ae(round(0.5),        1)
+
+# ── 9. enumerate(iterable, start) ────────────────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+ade(list(enumerate(['a', 'b', 'c'], 1)), [[1, 'a'], [2, 'b'], [3, 'c']])
+ade(list(enumerate(['x', 'y'],      5)), [[5, 'x'], [6, 'y']])
+ade(list(enumerate(['a', 'b'])),         [[0, 'a'], [1, 'b']])  # default still works
+
+# ── 10. String predicates ─────────────────────────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+# isalpha
+ae(str.isalpha('abc'), True)
+ae(str.isalpha('ab3'), False)
+ae(str.isalpha(''),    False)
+
+# isdigit
+ae(str.isdigit('123'), True)
+ae(str.isdigit('12a'), False)
+ae(str.isdigit(''),    False)
+
+# isalnum
+ae(str.isalnum('abc123'), True)
+ae(str.isalnum('abc!'),   False)
+ae(str.isalnum(''),       False)
+
+# isidentifier
+ae(str.isidentifier('hello'),       True)
+ae(str.isidentifier('hello_world'), True)
+ae(str.isidentifier('123abc'),      False)
+ae(str.isidentifier(''),            False)
+
+# isspace — was already supported; smoke test
+ae(str.isspace('   '), True)
+ae(str.isspace('a '),  False)
+
+# ── 11. str.casefold() ───────────────────────────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+ae(str.casefold('Hello World'), 'hello world')
+ae(str.casefold('ABC'),         'abc')
+ae(str.casefold('already'),     'already')
+# Unicode: Latin capital letters with diacritics fold to lowercase equivalents
+ae(str.casefold('ÄÖÜ'), 'äöü')
+ae(str.casefold('ÄÖÜ'), str.casefold('äöü'))
+
+# ── 12. str.removeprefix() / str.removesuffix() ──────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+ae(str.removeprefix('HelloWorld', 'Hello'), 'World')
+ae(str.removeprefix('HelloWorld', 'World'), 'HelloWorld')  # no match → unchanged
+ae(str.removeprefix('Hello',      ''),      'Hello')
+
+ae(str.removesuffix('HelloWorld', 'World'), 'Hello')
+ae(str.removesuffix('HelloWorld', 'Hello'), 'HelloWorld')  # no match → unchanged
+ae(str.removesuffix('Hello',      ''),      'Hello')
+
+# ── 13. String repetition: str * n ───────────────────────────────────────────
+# STATUS: ✓ WORKS with overload_operators flag
+
+def _test_str_multiply():
+    from __python__ import overload_operators
+    ae('ha' * 3, 'hahaha')
+    ae(3 * 'ha', 'hahaha')
+    ae('x' * 0, '')
+
+_test_str_multiply()
+
+# ── 14. List repetition: [x] * n ─────────────────────────────────────────────
+# STATUS: ✓ WORKS with overload_operators flag (added in this release)
+
+def _test_list_multiply():
+    from __python__ import overload_operators
+    ade([0] * 3,    [0, 0, 0])
+    ade([1, 2] * 2, [1, 2, 1, 2])
+    ade(3 * [0],    [0, 0, 0])
+    ade([1] * 0,    [])
+
+_test_list_multiply()
+
+# ── 15. except (Type,) tuple form ────────────────────────────────────────────
+# STATUS: ✓ WORKS (added in this release) — see §3 above
+
+# ── 16. frozenset ─────────────────────────────────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+def _test_frozenset():
+    # Construction from list
+    fs = frozenset([1, 2, 3])
+    ae(len(fs), 3)
+    ok(1 in fs)
+    ok(2 in fs)
+    ok(not (4 in fs))
+
+    # Construction from set
+    fs2 = frozenset({4, 5})
+    ae(len(fs2), 2)
+    ok(4 in fs2)
+
+    # Empty frozenset
+    empty = frozenset()
+    ae(len(empty), 0)
+    ok(not (1 in empty))
+
+    # Iteration
+    total = 0
+    for x in frozenset([10, 20, 30]):
+        total += x
+    ae(total, 60)
+
+    # isinstance
+    ok(isinstance(fs, frozenset))
+    ok(not isinstance([1, 2], frozenset))
+
+    # copy returns a frozenset with same elements
+    fc = fs.copy()
+    ok(isinstance(fc, frozenset))
+    ae(len(fc), len(fs))
+    ok(1 in fc)
+    ok(3 in fc)
+
+    # union — returns frozenset
+    u = frozenset([1, 2]).union(frozenset([2, 3]))
+    ok(isinstance(u, frozenset))
+    ae(len(u), 3)
+    ok(1 in u and 2 in u and 3 in u)
+
+    # union with multiple args
+    u2 = frozenset([1]).union(frozenset([2]), frozenset([3]))
+    ae(len(u2), 3)
+
+    # intersection — returns frozenset
+    inter = frozenset([1, 2, 3]).intersection(frozenset([2, 3, 4]))
+    ok(isinstance(inter, frozenset))
+    ae(len(inter), 2)
+    ok(2 in inter and 3 in inter)
+    ok(not (1 in inter))
+
+    # difference — returns frozenset
+    diff = frozenset([1, 2, 3]).difference(frozenset([2]))
+    ok(isinstance(diff, frozenset))
+    ae(len(diff), 2)
+    ok(1 in diff and 3 in diff)
+    ok(not (2 in diff))
+
+    # symmetric_difference — returns frozenset
+    sd = frozenset([1, 2, 3]).symmetric_difference(frozenset([2, 3, 4]))
+    ok(isinstance(sd, frozenset))
+    ae(len(sd), 2)
+    ok(1 in sd and 4 in sd)
+
+    # issubset / issuperset
+    ok(frozenset([1, 2]).issubset(frozenset([1, 2, 3])))
+    ok(not frozenset([1, 4]).issubset(frozenset([1, 2, 3])))
+    ok(frozenset([1, 2, 3]).issuperset(frozenset([2, 3])))
+    ok(not frozenset([1, 2]).issuperset(frozenset([1, 2, 3])))
+
+    # isdisjoint
+    ok(frozenset([1, 2]).isdisjoint(frozenset([3, 4])))
+    ok(not frozenset([1, 2]).isdisjoint(frozenset([2, 3])))
+
+    # __eq__ with another frozenset
+    ok(frozenset([1, 2, 3]).__eq__(frozenset([1, 2, 3])))
+    ok(not frozenset([1, 2]).__eq__(frozenset([1, 2, 3])))
+
+    # frozenset and set compare equal when same elements
+    ok(frozenset([1, 2, 3]).__eq__({1, 2, 3}))
+    ok({1, 2, 3}.__eq__(frozenset([1, 2, 3])))
+
+    # Mutation raises — these would throw TypeError in Python.
+    # frozenset has no add/remove/clear methods (immutable by design).
+    ok(not hasattr(fs, 'add'))
+    ok(not hasattr(fs, 'remove'))
+    ok(not hasattr(fs, 'discard'))
+    ok(not hasattr(fs, 'clear'))
+    ok(not hasattr(fs, 'update'))
+
+_test_frozenset()
+
+# ── 17. int.bit_length() ─────────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — Number prototype does not have bit_length.
+#
+#  ae((255).bit_length(), 8)
+
+# ── 18. float.is_integer() ───────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — Number prototype does not have is_integer.
+#
+#  ae((1.0).is_integer(), True)
+
+# ── 19. dict | merge operator (Python 3.9+) ──────────────────────────────────
+# STATUS: ✓ WORKS — requires `from __python__ import overload_operators, dict_literals`
+
+def _test_dict_merge_operator():
+    from __python__ import overload_operators, dict_literals
+    d1 = {'x': 1, 'y': 2}
+    d2 = {'y': 99, 'z': 3}
+
+    # d1 | d2 creates a new merged dict; d2 values win on conflict
+    merged = d1 | d2
+    ade(merged, {'x': 1, 'y': 99, 'z': 3})
+
+    # original dicts are unchanged
+    ade(d1, {'x': 1, 'y': 2})
+    ade(d2, {'y': 99, 'z': 3})
+
+    # empty dict merge
+    ade(d1 | {}, {'x': 1, 'y': 2})
+    ade({} | d1, {'x': 1, 'y': 2})
+
+    # |= updates in place
+    d3 = {'a': 1, 'b': 2}
+    d3 |= {'b': 20, 'c': 3}
+    ade(d3, {'a': 1, 'b': 20, 'c': 3})
+
+    # chained merges
+    base = {'k': 0}
+    r = base | {'k': 1} | {'k': 2}
+    ade(r, {'k': 2})
+
+_test_dict_merge_operator()
+
+# ── 20. for / else ───────────────────────────────────────────────────────────
+# STATUS: ✓ WORKS — see §5 above
+
+# ── 21. while / else ─────────────────────────────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+def _while_else():
+    # else runs when loop condition becomes False (no break)
+    ran_else = False
+    i = 0
+    while i < 3:
+        i += 1
+    else:
+        ran_else = True
+    ae(ran_else, True)
+    ae(i, 3)
+
+    # else is skipped when break occurs
+    ran_else = False
+    i = 0
+    while i < 5:
+        if i == 2:
+            break
+        i += 1
+    else:
+        ran_else = True
+    ae(ran_else, False)
+
+    # else runs when condition is False from the start (zero iterations)
+    ran_else = False
+    i = 10
+    while i < 3:
+        i += 1
+    else:
+        ran_else = True
+    ae(ran_else, True)
+
+    # nested loops: break in inner should NOT affect outer while/else
+    outer_else = False
+    i = 0
+    while i < 2:
+        j = 0
+        while j < 2:
+            if j == 0:
+                break  # breaks inner only
+            j += 1
+        i += 1
+    else:
+        outer_else = True
+    ae(outer_else, True)
+
+_while_else()
+
+# ── 22. raise X from Y (exception chaining) ──────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+def _test_raise_from():
+    cause_set = False
+    cause_val = None
+    try:
+        try:
+            raise ValueError('original')
+        except ValueError as orig:
+            raise TypeError('chained') from orig
+    except TypeError as e:
+        cause_set = hasattr(e, '__cause__')
+        cause_val = e.__cause__
+    ae(cause_set, True)
+    ok(cause_val is not None)
+    ae(cause_val.message, 'original')
+
+_test_raise_from()
+
+def _test_raise_from_none():
+    # raise X from None: __cause__ is explicitly set to None
+    caught = None
+    try:
+        try:
+            raise ValueError('inner')
+        except ValueError:
+            raise TypeError('outer') from None
+    except TypeError as e:
+        caught = e
+    ok(caught is not None)
+    ae(caught.__cause__, None)
+
+_test_raise_from_none()
+
+# ── 23. __slots__ ────────────────────────────────────────────────────────────
+# STATUS: ✗ NOT ENFORCED — __slots__ is accepted but does not restrict attrs.
+
+# ── 24. Nested classes ───────────────────────────────────────────────────────
+# STATUS: ✓ WORKS — added in commit 44c9802; tested fully in test/classes.pyj
+
+# ── 25. Generator .throw() ───────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+def _gen_throw():
+    try:
+        yield 1
+    except ValueError as e:
+        yield 'caught'
+
+g = _gen_throw()
+ae(g.next().value, 1)
+ae(g.throw(ValueError('err')).value, 'caught')
+
+# ── 26. Generator .send() ────────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+def _gen_send():
+    data = yield 1
+    yield data
+
+g = _gen_send()
+ae(g.next().value,    1)
+ae(g.next('hello').value, 'hello')
+
+# ── 27. zip(strict=True) ─────────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — zip() silently truncates to shortest.
+
+ade(list(zip([1, 2], [3, 4])), [[1, 3], [2, 4]])  # basic zip still works
+
+# ── 28. Walrus operator := ────────────────────────────────────────────────────
+# STATUS: ✓ WORKS — hoisting in if/while conditions; comprehension filter scope
+
+_wn = 10
+if (_wm := _wn * 2) > 15:
+    ae(_wm, 20)
+
+# walrus in a nested binary condition
+_wa = 3
+if (_wb := _wa + 7) >= 10:
+    ae(_wb, 10)
+
+# walrus available after the if-block (variable persists in enclosing scope)
+ae(_wb, 10)
+
+# comprehension filter with walrus — y assigned in enclosing scope
+_wdata = [1, 2, 3, 4, 5]
+_wresult = [_wy for _wx in _wdata if (_wy := _wx * 2) > 6]
+ade(_wresult, [8, 10])
+ae(_wy, 10)  # last walrus-assigned value is visible in enclosing scope
+
+# ── 29. Chained comparisons ──────────────────────────────────────────────────
+# STATUS: ✓ WORKS — same-direction and mixed-direction chains both correct
+
+ae(1 < 2 < 3, True)
+ae(3 > 2 > 1, True)
+ae(1 < 3 < 2, False)
+ae(1 < 2 > 3, False)   # mixed-direction: 1<2 AND 2>3 = True AND False = False
+ae(1 < 2 > 0, True)    # mixed-direction: 1<2 AND 2>0 = True AND True = True
+ae(5 > 3 < 4, True)    # mixed-direction: 5>3 AND 3<4 = True AND True = True
+ae(5 > 3 < 1, False)   # mixed-direction: 5>3 AND 3<1 = True AND False = False
+
+# ── 30. **= power-assign ─────────────────────────────────────────────────────
+# STATUS: ✓ WORKS (added in this release)
+
+n = 3
+n **= 2
+ae(n, 9)
+
+n = 2
+n **= 10
+ae(n, 1024)
+
+n = 5
+n **= 0
+ae(n, 1)
+
+n = 4
+n **= 0.5
+ae(n, 2)
+
+# ── 31. Augmented assignment operators ───────────────────────────────────────
+# STATUS: ✓ WORKS — +=, -=, *=, /=, //=, %=, &=, |=, ^=, <<=, >>=
+
+n = 10
+n += 5;  ae(n, 15)
+n -= 3;  ae(n, 12)
+n *= 2;  ae(n, 24)
+n //= 5; ae(n, 4)
+n %= 3;  ae(n, 1)
+n |= 6;  ae(n, 7)   # 1 | 6 = 7
+n &= 5;  ae(n, 5)   # 7 & 5 = 5
+n ^= 3;  ae(n, 6)   # 5 ^ 3 = 6
+n <<= 2; ae(n, 24)  # 6 << 2 = 24
+n >>= 1; ae(n, 12)  # 24 >> 1 = 12
+
+# ── 32. Starred assignment ───────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+a, *b, c = [1, 2, 3, 4, 5]
+ae(a, 1)
+ade(b, [2, 3, 4])
+ae(c, 5)
+
+# ── 33. match / case ─────────────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+def _classify(x):
+    match x:
+        case 0:
+            return 'zero'
+        case 1:
+            return 'one'
+        case _:
+            return 'other'
+
+ae(_classify(0), 'zero')
+ae(_classify(1), 'one')
+ae(_classify(5), 'other')
+
+# ── 34. dict.fromkeys() ──────────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+from __python__ import dict_literals
+ade(dict.fromkeys(['a', 'b'], 0), {'a': 0, 'b': 0})
+
+# ── 35. @classmethod / @staticmethod ─────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+class _Counted:
+    _n = 0
+    @classmethod
+    def bump(cls):
+        cls._n += 1
+    @classmethod
+    def count(cls):
+        return cls._n
+
+_Counted.bump()
+_Counted.bump()
+ae(_Counted.count(), 2)
+
+class _Util:
+    @staticmethod
+    def add(a, b):
+        return a + b
+
+ae(_Util.add(3, 4), 7)
+
+# ── 36. yield from ───────────────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+def _sub():
+    yield 10
+    yield 20
+
+def _outer():
+    yield from _sub()
+    yield 30
+
+ade(list(_outer()), [10, 20, 30])
+
+# ── 37. lambda keyword ───────────────────────────────────────────────────────
+# STATUS: ✓ WORKS — compiles to anonymous JS function expression
+
+double = lambda x: x * 2
+ae(double(3), 6)
+ae(double(0), 0)
+
+add = lambda a, b: a + b
+ae(add(2, 3), 5)
+
+ae((lambda: 42)(), 42)
+
+abs_val = lambda x: x if x >= 0 else -x
+ae(abs_val(-5), 5)
+ae(abs_val(3),  3)
+
+greet = lambda name='world': 'hello ' + name
+ae(greet(),        'hello world')
+ae(greet('there'), 'hello there')
+
+# lambda captures enclosing scope
+def _make_adder(n):
+    return lambda x: x + n
+
+add10 = _make_adder(10)
+ae(add10(5), 15)
+
+# ── 38. Operator overloading (__add__, __sub__, etc.) ────────────────────────
+# STATUS: ✓ WORKS — requires `from __python__ import overload_operators`
+
+def _test_operator_overloading():
+    from __python__ import overload_operators
+
+    class Vec:
+        def __init__(self, x, y):
+            self.x = x
+            self.y = y
+        def __add__(self, other):
+            return Vec(self.x + other.x, self.y + other.y)
+        def __sub__(self, other):
+            return Vec(self.x - other.x, self.y - other.y)
+        def __mul__(self, n):
+            return Vec(self.x * n, self.y * n)
+        def __eq__(self, other):
+            return self.x == other.x and self.y == other.y
+
+    v1 = Vec(1, 2)
+    v2 = Vec(3, 4)
+    ok((v1 + v2) == Vec(4, 6))
+    ok((v2 - v1) == Vec(2, 2))
+    ok((v1 * 3)  == Vec(3, 6))
+
+    class Num:
+        def __init__(self, n):
+            self.n = n
+        def __neg__(self):
+            return Num(-self.n)
+        def __eq__(self, other):
+            return self.n == other.n
+
+    ok(-Num(5) == Num(-5))
+    ok(-Num(-3) == Num(3))
+
+    # Comparison dunders defined — called directly (< > <= >= are NOT re-dispatched)
+    class Version:
+        def __init__(self, n):
+            self.n = n
+        def __lt__(self, other):
+            return self.n < other.n
+        def __le__(self, other):
+            return self.n <= other.n
+        def __gt__(self, other):
+            return self.n > other.n
+        def __ge__(self, other):
+            return self.n >= other.n
+
+    v1 = Version(1)
+    v2 = Version(2)
+    ok(v1.__lt__(v2))
+    ok(v2.__gt__(v1))
+    ok(v1.__le__(Version(1)))
+    ok(v2.__ge__(Version(2)))
+
+    # __floordiv__ and __mod__
+    class Int:
+        def __init__(self, n):
+            self.n = n
+        def __floordiv__(self, other):
+            return Int(Math.floor(self.n / other.n))
+        def __mod__(self, other):
+            return Int(self.n % other.n)
+        def __eq__(self, other):
+            return self.n == other.n
+
+    ok(Int(7) // Int(2) == Int(3))
+    ok(Int(7) % Int(3)  == Int(1))
+
+_test_operator_overloading()
+
+# ── 39. Nested comprehensions (multi-for) ────────────────────────────────────
+# STATUS: ✓ WORKS
+
+# Flatten nested list
+ade([x for row in [[1,2],[3,4]] for x in row], [1,2,3,4])
+
+# Filter within nested comprehension
+ade([x for row in [[1,2,3],[4,5,6]] for x in row if x % 2 == 0], [2,4,6])
+
+# Nested list comprehension — column extraction
+matrix = [[1,2,3],[4,5,6],[7,8,9]]
+ade([row[0] for row in matrix], [1,4,7])
+
+# Three-level nesting
+ade([i+j+k for i in [1] for j in [10] for k in [100]], [111])
+
+# Dict comprehension over pairs
+ade({k: v for k, v in [['a',1],['b',2]]}, {'a':1, 'b':2})
+
+# Set comprehension with two for-clauses
+ok({x+y for x in [1,2] for y in [10,20]} == {11, 12, 21, 22})
+
+from __python__ import truthiness
+
+# ── 40. __bool__ / Python truthiness ─────────────────────────────────────────
+# STATUS: ✓ WORKS — requires `from __python__ import truthiness`
+#         Empty list/dict/set are falsy; __bool__ dunder is dispatched.
+
+# Empty containers are falsy (Python semantics)
+ok(not [])
+ok(not {})
+ok(not set())
+ok(not '')
+
+# Non-empty containers are truthy
+ok([0])
+ok([1, 2])
+ok({'a': 1})
+ok({1})
+ok('x')
+
+# numbers: 0 is falsy, nonzero is truthy
+ok(not 0)
+ok(1)
+ok(-1)
+
+# None/undefined are falsy
+ok(not None)
+
+# __bool__ dunder is dispatched by bool()
+class _AlwaysFalse:
+    def __bool__(self):
+        return False
+
+class _AlwaysTrue:
+    def __bool__(self):
+        return True
+
+ok(not bool(_AlwaysFalse()))
+ok(bool(_AlwaysTrue()))
+
+# bool() on containers
+ok(not bool([]))
+ok(not bool({}))
+ok(bool([1]))
+ok(bool({'a': 1}))
+
+# `not` operator uses Python truthiness
+ok(not [])
+ok(not not [1])
+
+# `and` / `or` return values (not just booleans), use Python truthiness
+ok([] or 'fallback')          # [] is falsy → return 'fallback'
+ae([] or 'fallback', 'fallback')
+_t12 = [1, 2]
+ae(_t12 or 'fallback', _t12)      # [1,2] is truthy → return [1,2]
+_t0 = []
+ae(_t0 and 'nope', _t0)           # [] is falsy → return []
+ae([1] and 'yes', 'yes')          # [1] is truthy → return 'yes'
+
+# `x if cond else y` uses Python truthiness for cond
+ae('yes' if [1] else 'no', 'yes')
+ae('yes' if [] else 'no', 'no')
+
+# ── 41. __call__ as callable dispatch ────────────────────────────────────────
+# STATUS: ✓ WORKS — requires `from __python__ import truthiness`
+#         obj() dispatches to obj.__call__() for callable objects.
+
+class _Adder:
+    def __init__(self, n):
+        self.n = n
+    def __call__(self, x):
+        return self.n + x
+
+add5 = _Adder(5)
+ae(add5(3), 8)            # obj() dispatches to __call__
+ae(add5.__call__(3), 8)   # explicit __call__ still works
+ae(callable(add5), True)  # callable() detects __call__ (§7 above)
+
+# callable object with no args
+class _Counter:
+    def __init__(self):
+        self.count = 0
+    def __call__(self):
+        self.count += 1
+        return self.count
+
+_c = _Counter()
+ae(_c(), 1)
+ae(_c(), 2)
+ae(_c(), 3)
+
+# ── 42. Complex number literals 3+4j ─────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — no j suffix; no complex type.
+# SKIP:
+#   c = 3+4j
+#   ae(c.real, 3)
+#   ae(c.imag, 4)
+
+# ── 43. b'...' bytes literals ────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — no b prefix; no native bytes type.
+#         Use the encodings module for encoding work.
+# SKIP:
+#   data = b'hello'
+#   ae(data[0], 104)
+
+# ── 44. except* (exception groups) ───────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — Python 3.11+ syntax; no parser support.
+# SKIP:
+#   try:
+#       raise ExceptionGroup('eg', [ValueError('v'), TypeError('t')])
+#   except* ValueError as eg:
+#       pass
+
+# ── 45. __new__ constructor ───────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — no alternative constructor hook.
+# SKIP:
+#   class _Singleton:
+#       _instance = None
+#       def __new__(cls):
+#           if cls._instance is None:
+#               cls._instance = super().__new__(cls)
+#           return cls._instance
+#   ae(_Singleton() is _Singleton(), True)
+
+# ── 46. __del__ destructor ────────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — no destructor/finalizer.
+# SKIP:
+#   class _Tracked:
+#       def __del__(self):
+#           pass  # never called
+
+# ── 47. __hash__ dunder ───────────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — set/dict use object identity (=== semantics).
+#         Two instances with equal fields are different keys even with __hash__.
+# SKIP:
+#   class _Point:
+#       def __init__(self, x, y):
+#           self.x = x
+#           self.y = y
+#       def __hash__(self):
+#           return self.x * 31 + self.y
+#       def __eq__(self, other):
+#           return self.x == other.x and self.y == other.y
+#   s = {_Point(1, 2)}
+#   ok(_Point(1, 2) in s)   # FAILS — __hash__ not dispatched
+
+# ── 48. __getattr__ / __setattr__ / __delattr__ ───────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — no attribute-access interception.
+# SKIP:
+#   class _Dynamic:
+#       def __getattr__(self, name):
+#           return 'default'
+#   ae(_Dynamic().anything, 'default')   # FAILS
+
+# ── 49. __getattribute__ ─────────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — no attribute-lookup override.
+
+# ── 50. __format__ dunder ────────────────────────────────────────────────────
+# STATUS: ✓ WORKS — format(obj, spec) dispatches to obj.__format__(spec).
+#         Tested fully in test/str.pyj.
+
+# ── 51. __class_getitem__ ────────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — no generic subscript MyClass[T] syntax.
+# SKIP:
+#   class _Box:
+#       def __class_getitem__(cls, item):
+#           return cls
+#   ok(_Box[int] is _Box)
+
+# ── 52. __init_subclass__ ────────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — no subclass hook.
+# SKIP:
+#   class _Plugin:
+#       registry = []
+#       def __init_subclass__(cls, **kwargs):
+#           _Plugin.registry.push(cls)
+#   class _MyPlugin(_Plugin): pass
+#   ok(_MyPlugin in _Plugin.registry)
+
+# ── 53. issubclass() ─────────────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+class _ISC_Animal:
+    pass
+
+class _ISC_Dog(_ISC_Animal):
+    pass
+
+class _ISC_Poodle(_ISC_Dog):
+    pass
+
+class _ISC_Cat(_ISC_Animal):
+    pass
+
+class _ISC_Unrelated:
+    pass
+
+# every class is a subclass of itself
+ok(issubclass(_ISC_Dog, _ISC_Dog))
+ok(issubclass(_ISC_Animal, _ISC_Animal))
+
+# direct inheritance
+ok(issubclass(_ISC_Dog, _ISC_Animal))
+
+# transitive inheritance (grandchild)
+ok(issubclass(_ISC_Poodle, _ISC_Animal))
+ok(issubclass(_ISC_Poodle, _ISC_Dog))
+
+# sibling is not a subclass
+ok(not issubclass(_ISC_Cat, _ISC_Dog))
+ok(not issubclass(_ISC_Dog, _ISC_Cat))
+
+# parent is not a subclass of child
+ok(not issubclass(_ISC_Animal, _ISC_Dog))
+
+# unrelated class
+ok(not issubclass(_ISC_Unrelated, _ISC_Animal))
+
+# tuple form — True if subclass of any
+ok(issubclass(_ISC_Dog, (_ISC_Cat, _ISC_Animal)))
+ok(issubclass(_ISC_Poodle, (_ISC_Cat, _ISC_Dog)))
+ok(not issubclass(_ISC_Unrelated, (_ISC_Cat, _ISC_Dog)))
+
+# TypeError for non-class first arg
+_isc_err = None
+try:
+    issubclass(42, _ISC_Animal)
+except TypeError as e:
+    _isc_err = str(e)
+ok(_isc_err is not None)
+
+# TypeError for non-class second arg
+_isc_err2 = None
+try:
+    issubclass(_ISC_Dog, 'not_a_class')
+except TypeError as e:
+    _isc_err2 = str(e)
+ok(_isc_err2 is not None)
+
+# ── 54. hash() builtin ───────────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+
+# None → 0
+ae(hash(None), 0)
+
+# booleans
+ae(hash(True), 1)
+ae(hash(False), 0)
+
+# integers — hash is the integer itself
+ae(hash(0), 0)
+ae(hash(42), 42)
+ae(hash(-1), -1)
+
+# floats that are whole numbers hash like ints
+ae(hash(3.0), 3)
+ae(hash(-7.0), -7)
+
+# strings — same string always gives same hash
+ae(hash('hello'), hash('hello'))
+ae(hash(''), hash(''))
+ok(hash('abc') != hash('xyz'))
+
+# result is always an integer
+ok(jstype(hash(42)) is 'number')
+ok(jstype(hash('hi')) is 'number')
+
+# objects with __hash__ — dispatched
+class _Hashable:
+    def __init__(self, val):
+        self.val = val
+    def __hash__(self):
+        return self.val * 7
+
+ae(hash(_Hashable(3)), 21)
+ae(hash(_Hashable(0)), 0)
+
+# class instances without __hash__ — stable identity hash
+_h1 = _Hashable(99)
+ae(hash(_h1), hash(_h1))   # consistent
+
+# distinct instances have different hashes (identity-based)
+class _Plain:
+    pass
+
+_p1 = _Plain()
+_p2 = _Plain()
+ok(hash(_p1) != hash(_p2))
+
+# unhashable types raise TypeError
+def _check_unhashable(val):
+    _caught = False
+    try:
+        hash(val)
+    except TypeError:
+        _caught = True
+    ok(_caught)
+
+_check_unhashable([1, 2, 3])
+_check_unhashable({1, 2})
+_check_unhashable({'a': 1})
+
+# ── 55. format(value, spec) builtin ──────────────────────────────────────────
+# STATUS: ✓ WORKS — format(value, spec) is defined and dispatches to __format__.
+#         Tested fully in test/str.pyj.
+#
+#   ae(format(3.14159, '.2f'), '3.14')
+
+# ── 56. next(iterator[, default]) builtin ────────────────────────────────────
+# Basic list iteration
+it = iter([10, 20, 30])
+ae(next(it), 10)
+ae(next(it), 20)
+ae(next(it), 30)
+# Default value when exhausted
+ae(next(it, 'done'), 'done')
+ae(next(it, None), None)
+# StopIteration raised when exhausted and no default
+it2 = iter([])
+raised = False
+try:
+    next(it2)
+except StopIteration:
+    raised = True
+ae(raised, True)
+# Works with range iterator
+it3 = iter(range(3))
+ae(next(it3), 0)
+ae(next(it3), 1)
+ae(next(it3), 2)
+ae(next(it3, -1), -1)
+# Works with enumerate iterator
+it4 = iter(enumerate(['a', 'b']))
+_n4a = next(it4)
+ae(_n4a[0], 0); ae(_n4a[1], 'a')
+_n4b = next(it4)
+ae(_n4b[0], 1); ae(_n4b[1], 'b')
+ae(next(it4, 'end'), 'end')
+# Works with generator
+def _next_gen():
+    yield 100
+    yield 200
+g = _next_gen()
+ae(next(g), 100)
+ae(next(g), 200)
+ae(next(g, 'stop'), 'stop')
+
+# ── 57. iter(callable, sentinel) two-arg form ────────────────────────────────
+# Basic usage: collect values until sentinel
+_count57 = [0]
+def _counter57():
+    _count57[0] += 1
+    return _count57[0]
+ade(list(iter(_counter57, 3)), [1, 2])
+# Sentinel never reached: stops at exact match
+_vals57 = ['a', 'b', 'c', None]
+_idx57 = [0]
+def _src57():
+    v = _vals57[_idx57[0]]
+    _idx57[0] += 1
+    return v
+ade(list(iter(_src57, None)), ['a', 'b', 'c'])
+# Sentinel on first call returns empty iterator
+_first57 = [0]
+def _fn57():
+    _first57[0] += 1
+    return 'stop'
+ade(list(iter(_fn57, 'stop')), [])
+# Works with for-loop
+_out57 = []
+_i57 = [0]
+def _seq57():
+    _i57[0] += 1
+    return _i57[0]
+for _v57 in iter(_seq57, 4):
+    _out57.append(_v57)
+ade(_out57, [1, 2, 3])
+# Works with next()
+_j57 = [0]
+def _f57():
+    _j57[0] += 1
+    return _j57[0]
+_it57 = iter(_f57, 5)
+ae(next(_it57), 1)
+ae(next(_it57), 2)
+ae(next(_it57), 3)
+ae(next(_it57), 4)
+ae(next(_it57, 'done'), 'done')
+# Callable object with __call__
+class _Caller57:
+    def __init__(self):
+        self.n = 0
+    def __call__(self):
+        self.n += 1
+        return self.n
+_caller57 = _Caller57()
+ade(list(iter(_caller57, 3)), [1, 2])
+
+# ── 58. slice() as builtin object ────────────────────────────────────────────
+# STATUS: ✓ WORKS — implemented (see item #63 below for full tests).
+# NOTE: This item was previously marked NOT IMPLEMENTED but was added in a
+#       recent release. Full tests live in item #63 and test/slice.pyj.
+
+# ── 59. complex() builtin ────────────────────────────────────────────────────
+# STATUS: ✗ NOT SUPPORTED — no complex number type.
+# SKIP:
+#   c = complex(3, 4)
+#   ae(c.real, 3)
+#   ae(c.imag, 4)
+
+# ── 60. vars() / locals() / globals() ────────────────────────────────────────
+# STATUS: ✗ NOT IMPLEMENTED — these Python builtins are not defined.
+# SKIP:
+#   g = globals()
+#   ok(isinstance(g, dict))
+
+# ── 61. Positional-only parameters def f(a, /, b): ────────────────────────────
+# STATUS: ✓ WORKS — tested in test/starargs.pyj
+
+def _po(a, b, /):
+    return [a, b]
+
+ade(_po(1, 2), [1, 2])
+
+def _po_mix(a, /, b):
+    return [a, b]
+
+ade(_po_mix(1, 2),   [1, 2])
+ade(_po_mix(1, b=2), [1, 2])
+
+# ── 62. Keyword-only parameters def f(a, *, b): ───────────────────────────────
+# STATUS: ✓ WORKS — tested in test/starargs.pyj
+
+def _ko(a, *, b):
+    return [a, b]
+
+ade(_ko(1, b=2),   [1, 2])
+ade(_ko(b=2, a=1), [1, 2])
+
+# ── 63. slice() builtin ───────────────────────────────────────────────────────
+# STATUS: ✓ WORKS
+# Subscript read/write tests (lst[s], lst[s]=val) are in test/slice.pyj
+# because they require `from __python__ import overload_getitem`.
+
+# Construction forms
+_s1 = slice(5)
+ae(_s1.start, None)
+ae(_s1.stop,  5)
+ae(_s1.step,  None)
+
+_s2 = slice(2, 8)
+ae(_s2.start, 2)
+ae(_s2.stop,  8)
+ae(_s2.step,  None)
+
+_s3 = slice(1, 9, 2)
+ae(_s3.start, 1)
+ae(_s3.stop,  9)
+ae(_s3.step,  2)
+
+# None values preserved
+_sn = slice(None, None, -1)
+ae(_sn.start, None)
+ae(_sn.stop,  None)
+ae(_sn.step,  -1)
+
+# indices() method
+ade(_s2.indices(10), [2, 8, 1])
+ade(slice(None, None, 1).indices(5), [0, 5, 1])
+ade(slice(-3, -1).indices(10), [7, 9, 1])
+ade(slice(None, None, -1).indices(5), [4, -1, -1])
+
+# repr / str
+ae(str(slice(1, 5, None)), 'slice(1, 5, None)')
+ae(str(slice(None, 5, 2)), 'slice(None, 5, 2)')
+
+# Equality
+ok(slice(1, 5) == slice(1, 5))
+ok(not (slice(1, 5) == slice(1, 6)))
+
+# isinstance
+ok(isinstance(slice(1, 5), slice))
+
+# Delete with slice object uses ρσ_delitem (no overload_getitem needed)
+_b = [0, 1, 2, 3, 4]
+del _b[slice(1, 3)]
+ade(_b, [0, 3, 4])