@@ -348,7 +348,7 @@ def inner(n, w):
348348 # off-by-1 error too low. So we add 2 instead of 1 if chopping lost
349349 # a fraction > 0.9.
350350
351- # The "WASI" test platfrom can complain about `len(s)` if it's too
351+ # The "WASI" test platform can complain about `len(s)` if it's too
352352 # large to fit in its idea of "an index-sized integer".
353353 lenS = s .__len__ ()
354354 log_ub = lenS * _LOG_10_BASE_256
@@ -613,7 +613,7 @@ def int_divmod(a, b):
613613# ctx.prec = max(n.adjusted() - p256.adjusted(), 0) + GUARD
614614# hi = +n * +recip # unary `+` chops to ctx.prec digits
615615#
616- # we have 3 visible chopped operationa , but there's also a 4th:
616+ # we have 3 visible chopped operations , but there's also a 4th:
617617# precomputing a truncated `recip` as part of setup.
618618#
619619# So the computed product is exactly equal to the true product times
@@ -703,7 +703,7 @@ def int_divmod(a, b):
703703# Enable for brute-force testing of compute_powers(). This takes about a
704704# minute, because it tries millions of cases.
705705if 0 :
706- def consumer (w , limir , need_hi ):
706+ def consumer (w , limit , need_hi ):
707707 seen = set ()
708708 need = set ()
709709 def inner (w ):
@@ -718,7 +718,7 @@ def inner(w):
718718 inner (lo )
719719 inner (hi )
720720 inner (w )
721- exp = compute_powers (w , 1 , limir , need_hi = need_hi )
721+ exp = compute_powers (w , 1 , limit , need_hi = need_hi )
722722 assert exp .keys () == need
723723
724724 from itertools import chain
0 commit comments