Fix typos in comments and test code (#122846)

Author: xyb

Lib/_pylong.py

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

Lib/_pyrepl/completing_reader.py

@@ -91,7 +91,7 @@ def build_menu(
         #          D E F                       B E
         #          G                           C F
         #
-        # "fill" the table with empty words, so we always have the same amout
+        # "fill" the table with empty words, so we always have the same amount
         # of rows for each column
         missing = cols*rows - len(wordlist)
         wordlist = wordlist + ['']*missing

Lib/_pyrepl/unix_console.py

@@ -109,7 +109,7 @@ def add_baudrate_if_supported(dictionary: dict[int, int], rate: int) -> None:
 try:
     poll: type[select.poll] = select.poll
 except AttributeError:
-    # this is exactly the minumum necessary to support what we
+    # this is exactly the minimum necessary to support what we
     # do with poll objects
     class MinimalPoll:
         def __init__(self):
@@ -613,7 +613,7 @@ def __write_changed_line(self, y, oldline, newline, px_coord):
 
         # reuse the oldline as much as possible, but stop as soon as we
         # encounter an ESCAPE, because it might be the start of an escape
-        # sequene
+        # sequence
         while (
             x_coord < minlen
             and oldline[x_pos] == newline[x_pos]

Lib/_pyrepl/windows_console.py

@@ -231,7 +231,7 @@ def __write_changed_line(
 
         # reuse the oldline as much as possible, but stop as soon as we
         # encounter an ESCAPE, because it might be the start of an escape
-        # sequene
+        # sequence
         while (
             x_coord < minlen
             and oldline[x_pos] == newline[x_pos]

Lib/dataclasses.py

@@ -656,7 +656,7 @@ def _init_fn(fields, std_fields, kw_only_fields, frozen, has_post_init,
     if kw_only_fields:
         # Add the keyword-only args.  Because the * can only be added if
         # there's at least one keyword-only arg, there needs to be a test here
-        # (instead of just concatenting the lists together).
+        # (instead of just concatenating the lists together).
         _init_params += ['*']
         _init_params += [_init_param(f) for f in kw_only_fields]
     func_builder.add_fn('__init__',

Lib/test/libregrtest/main.py

@@ -536,7 +536,7 @@ def _run_tests(self, selected: TestTuple, tests: TestList | None) -> int:
                 self._run_tests_mp(runtests, self.num_workers)
             else:
                 # gh-117783: don't immortalize deferred objects when tracking
-                # refleaks. Only releveant for the free-threaded build.
+                # refleaks. Only relevant for the free-threaded build.
                 with suppress_immortalization(runtests.hunt_refleak):
                     self.run_tests_sequentially(runtests)
 

Lib/test/libregrtest/single.py

@@ -305,7 +305,7 @@ def run_single_test(test_name: TestName, runtests: RunTests) -> TestResult:
     pgo = runtests.pgo
     try:
         # gh-117783: don't immortalize deferred objects when tracking
-        # refleaks. Only releveant for the free-threaded build.
+        # refleaks. Only relevant for the free-threaded build.
         with support.suppress_immortalization(runtests.hunt_refleak):
             _runtest(result, runtests)
     except:

Lib/test/support/asynchat.py

@@ -1,5 +1,5 @@
 # TODO: This module was deprecated and removed from CPython 3.12
-# Now it is a test-only helper. Any attempts to rewrite exising tests that
+# Now it is a test-only helper. Any attempts to rewrite existing tests that
 # are using this module and remove it completely are appreciated!
 # See: https://github.com/python/cpython/issues/72719
 

Lib/test/support/asyncore.py

@@ -1,5 +1,5 @@
 # TODO: This module was deprecated and removed from CPython 3.12
-# Now it is a test-only helper. Any attempts to rewrite exising tests that
+# Now it is a test-only helper. Any attempts to rewrite existing tests that
 # are using this module and remove it completely are appreciated!
 # See: https://github.com/python/cpython/issues/72719
 

Lib/test/support/bytecode_helper.py

@@ -71,7 +71,7 @@ class Label:
 
     def assertInstructionsMatch(self, actual_seq, expected):
         # get an InstructionSequence and an expected list, where each
-        # entry is a label or an instruction tuple. Construct an expcted
+        # entry is a label or an instruction tuple. Construct an expected
         # instruction sequence and compare with the one given.
 
         self.assertIsInstance(expected, list)

Lib/test/test_ast/test_ast.py

@@ -2701,13 +2701,13 @@ def test_source_segment_missing_info(self):
 
 
 class NodeTransformerTests(ASTTestMixin, unittest.TestCase):
-    def assertASTTransformation(self, tranformer_class,
+    def assertASTTransformation(self, transformer_class,
                                 initial_code, expected_code):
         initial_ast = ast.parse(dedent(initial_code))
         expected_ast = ast.parse(dedent(expected_code))
 
-        tranformer = tranformer_class()
-        result_ast = ast.fix_missing_locations(tranformer.visit(initial_ast))
+        transformer = transformer_class()
+        result_ast = ast.fix_missing_locations(transformer.visit(initial_ast))
 
         self.assertASTEqual(result_ast, expected_ast)
 

Lib/test/test_asyncio/test_locks.py

@@ -1194,14 +1194,14 @@ async def c3(result):
         self.assertEqual([2, 3], result)
 
     async def test_acquire_fifo_order_4(self):
-        # Test that a successfule `acquire()` will wake up multiple Tasks
+        # Test that a successful `acquire()` will wake up multiple Tasks
         # that were waiting in the Semaphore queue due to FIFO rules.
         sem = asyncio.Semaphore(0)
         result = []
         count = 0
 
         async def c1(result):
-            # First task immediatlly waits for semaphore.  It will be awoken by c2.
+            # First task immediately waits for semaphore.  It will be awoken by c2.
             self.assertEqual(sem._value, 0)
             await sem.acquire()
             # We should have woken up all waiting tasks now.
@@ -1475,7 +1475,7 @@ async def coro():
             # first time waiting
             await barrier.wait()
 
-            # after wainting once for all tasks
+            # after waiting once for all tasks
             if rewait_n > 0:
                 rewait_n -= 1
                 # wait again only for rewait tasks

Lib/test/test_asyncio/test_subprocess.py

@@ -783,7 +783,7 @@ async def main() -> None:
 
     def test_subprocess_protocol_events(self):
         # gh-108973: Test that all subprocess protocol methods are called.
-        # The protocol methods are not called in a determistic order.
+        # The protocol methods are not called in a deterministic order.
         # The order depends on the event loop and the operating system.
         events = []
         fds = [1, 2]

Lib/test/test_capi/test_opt.py

@@ -176,7 +176,7 @@ def f{n}():
             self.assertTrue(exe.is_valid())
         # Assert that the correct executors are invalidated
         # and check that nothing crashes when we invalidate
-        # an executor mutliple times.
+        # an executor multiple times.
         for i in (4,3,2,1,0):
             _testinternalcapi.invalidate_executors(objects[i])
             for exe in executors[i:]:

Lib/test/test_concurrent_futures/test_deadlock.py

@@ -236,7 +236,7 @@ def test_shutdown_deadlock_pickle(self):
         executor_manager.join()
 
     def test_crash_big_data(self):
-        # Test that there is a clean exception instad of a deadlock when a
+        # Test that there is a clean exception instead of a deadlock when a
         # child process crashes while some data is being written into the
         # queue.
         # https://github.com/python/cpython/issues/94777

Lib/test/test_email/test__header_value_parser.py

@@ -2773,7 +2773,7 @@ def test_get_msg_id_no_id_right(self):
             parser.get_msg_id("<simplelocal@")
 
     def test_get_msg_id_with_brackets(self):
-        # Microsof Outlook generates non-standard one-off addresses:
+        # Microsoft Outlook generates non-standard one-off addresses:
         # https://learn.microsoft.com/en-us/office/client-developer/outlook/mapi/one-off-addresses
         with self.assertRaises(errors.HeaderParseError):
             parser.get_msg_id("<[[email protected]]>")

Lib/test/test_import/__init__.py

@@ -405,7 +405,7 @@ def test_case_sensitivity(self):
 
     def test_double_const(self):
         # Importing double_const checks that float constants
-        # serialiazed by marshal as PYC files don't lose precision
+        # serialized by marshal as PYC files don't lose precision
         # (SF bug 422177).
         from test.test_import.data import double_const
         unload('test.test_import.data.double_const')
@@ -2926,7 +2926,7 @@ def test_basic_multiple_interpreters_main_no_reset(self):
         #  * alive in 1 interpreter (main)
         #  * module def still in _PyRuntime.imports.extensions
         #  * mod init func ran again
-        #  * m_copy is NULL (claered when the interpreter was destroyed)
+        #  * m_copy is NULL (cleared when the interpreter was destroyed)
         #    (was from main interpreter)
         #  * module's global state was updated, not reset
 
@@ -3061,7 +3061,7 @@ def test_basic_multiple_interpreters_reset_each(self):
         #  * alive in 0 interpreters
         #  * module def in _PyRuntime.imports.extensions
         #  * mod init func ran for the first time (since reset, at least)
-        #  * m_copy is NULL (claered when the interpreter was destroyed)
+        #  * m_copy is NULL (cleared when the interpreter was destroyed)
         #  * module's global state was initialized, not reset
 
         # Use a subinterpreter that sticks around.

Lib/xml/sax/handler.py

@@ -371,7 +371,7 @@ def startDTD(self, name, public_id, system_id):
 
         name is the name of the document element type, public_id the
         public identifier of the DTD (or None if none were supplied)
-        and system_id the system identfier of the external subset (or
+        and system_id the system identifier of the external subset (or
         None if none were supplied)."""
 
     def endDTD(self):