M test/integermath.py => test/integermath.py +1 -1
@@ 42,7 42,7 @@ from type_stack_calc.ib.scope import scopify
def ignore(_x): pass
vs = scopify(intro)
-assert vs.get('Set')
+assert vs.get('Tp')
def is_single(got, x):
assert isinstance(got, tuple) and len(got) == 1
M type_stack_calc/intro/load.py => type_stack_calc/intro/load.py +2 -3
@@ 8,10 8,9 @@ from type_stack_calc.ib.scope import scopify
def _ignore(_c1): pass
class LoadCall(dict):
- def __repr__(self): return f"LoadCall"
+ def __repr__(self): return "LoadCall{a dict}}"
- fun_tp, n = 'method', 1
- c_name = 'LoadCall'
+ fun_tp, n, c_name = 'method', 1, 'LoadCall'
def load(self, sc, vs, path):
"""Gets loaded from dictionary if available, otherwise looks in `sc.paths`, and runs again."""
M type_stack_calc/sets/stepping.py => type_stack_calc/sets/stepping.py +3 -2
@@ 92,9 92,10 @@ NOTE: `None` results or omissions of methods often means it turns into a regular
nfr, nto = map(self.conform, y)
if nfr < fr: nfr += step
if nfr == nto:
- return type(y)(nfr, nfr)
+ return type(y)(nto, nto)
+ elif nfr > nto:
+ return the_empty
else:
- assert nfr < nto, (nfr, nto, y)
return [type(y)(nfr, nto), self]
def set_intersect(self, y):