[3.14] Doc: fix duplicated words (GH-136086) (#136108)

Doc: fix duplicated words (GH-136086)

---------
(cherry picked from commit 698bab5a4031c8f54e04e1dd42bcbe3e4564eba5)

Co-authored-by: Weilin Du <108666168+LamentXU123@users.noreply.github.com>
Co-authored-by: Terry Jan Reedy <tjreedy@udel.edu>

diff --git a/Include/internal/mimalloc/mimalloc/types.h b/Include/internal/mimalloc/mimalloc/types.h
index 4f77bd7bc525db80167e2f9f5a5c81be8dde41bb..70c600e920bad198bcf8810ea068c59471433b9f 100644 (file)
--- a/Include/internal/mimalloc/mimalloc/types.h
+++ b/Include/internal/mimalloc/mimalloc/types.h
@@ -678,7 +678,7 @@ void _mi_stat_counter_increase(mi_stat_counter_t* stat, size_t amount);
 // Thread Local data
 // ------------------------------------------------------
 
-// A "span" is is an available range of slices. The span queues keep
+// A "span" is an available range of slices. The span queues keep
 // track of slice spans of at most the given `slice_count` (but more than the previous size class).
 typedef struct mi_span_queue_s {
   mi_slice_t* first;

diff --git a/Include/refcount.h b/Include/refcount.h
index 177bbdaf0c5977262cb6a03023b91ad2de9b59e9..8df981eec1b8df783b113183204da852dc4181da 100644 (file)
--- a/Include/refcount.h
+++ b/Include/refcount.h
@@ -33,7 +33,7 @@ increase and decrease the objects reference count.
 
 In order to offer sufficient resilience to C extensions using the stable ABI
 compiled against 3.11 or earlier, we set the initial value near the
-middle of the range (2**31, 2**32). That way the the refcount can be
+middle of the range (2**31, 2**32). That way the refcount can be
 off by ~1 billion without affecting immortality.
 
 Reference count increases will use saturated arithmetic, taking advantage of

diff --git a/InternalDocs/garbage_collector.md b/InternalDocs/garbage_collector.md
index 4da6cd47dc859e0d708b3d04e544a8f75024f844..9c35684c945b3eaf438582e00f718171788f40c3 100644 (file)
--- a/InternalDocs/garbage_collector.md
+++ b/InternalDocs/garbage_collector.md
@@ -286,7 +286,7 @@ object, the GC does not process it twice.
 
 Notice that an object that was marked as "tentatively unreachable" and was later
 moved back to the reachable list will be visited again by the garbage collector
-as now all the references that that object has need to be processed as well. This
+as now all the references that the object has need to be processed as well. This
 process is really a breadth first search over the object graph. Once all the objects
 are scanned, the GC knows that all container objects in the tentatively unreachable
 list are really unreachable and can thus be garbage collected.

diff --git a/Lib/test/test_iter.py b/Lib/test/test_iter.py
index 1b9f3cf76240ad4e33189070dddd162648d95680..18e4b676c5323686facc6f8ee4149dc22bf4081e 100644 (file)
--- a/Lib/test/test_iter.py
+++ b/Lib/test/test_iter.py
@@ -1147,7 +1147,7 @@ class TestCase(unittest.TestCase):
 
     def test_exception_locations(self):
         # The location of an exception raised from __init__ or
-        # __next__ should should be the iterator expression
+        # __next__ should be the iterator expression
 
         def init_raises():
             try:

diff --git a/Lib/test/test_listcomps.py b/Lib/test/test_listcomps.py
index ef8f3d492dfc46d86e36fca5622e4196a741b52f..ad7f62fbf78d607c8f8d82497c64811eaf7da87b 100644 (file)
--- a/Lib/test/test_listcomps.py
+++ b/Lib/test/test_listcomps.py
@@ -716,7 +716,7 @@ class ListComprehensionTest(unittest.TestCase):
 
     def test_exception_locations(self):
         # The location of an exception raised from __init__ or
-        # __next__ should should be the iterator expression
+        # __next__ should be the iterator expression
 
         def init_raises():
             try:

diff --git a/Tools/scripts/summarize_stats.py b/Tools/scripts/summarize_stats.py
index 68cfad3f92cdc78224466f85a9e6c7e4ef14e4f7..905af9dcfd802ead95cfbfe2f40200ea97caad3f 100644 (file)
--- a/Tools/scripts/summarize_stats.py
+++ b/Tools/scripts/summarize_stats.py
@@ -492,7 +492,7 @@ class Stats:
             ): (trace_too_long, attempts),
             Doc(
                 "Trace too short",
-                "A potential trace is abandoned because it it too short.",
+                "A potential trace is abandoned because it is too short.",
             ): (trace_too_short, attempts),
             Doc(
                 "Inner loop found", "A trace is truncated because it has an inner loop"

diff --git a/iOS/README.rst b/iOS/README.rst
index 13b885144932e479483b938873940241a121cd8d..f0979ba152eb207184fe67703cbda4f08ebda331 100644 (file)
--- a/iOS/README.rst
+++ b/iOS/README.rst
@@ -196,7 +196,7 @@ simulator build with a deployment target of 15.4.
 Merge thin frameworks into fat frameworks
 -----------------------------------------
 
-Once you've built a ``Python.framework`` for each ABI and and architecture, you
+Once you've built a ``Python.framework`` for each ABI and architecture, you
 must produce a "fat" framework for each ABI that contains all the architectures
 for that ABI.