https://github.com/python/cpython/commit/698bab5a4031c8f54e04e1dd42bcbe3e4564eba5
commit: 698bab5a4031c8f54e04e1dd42bcbe3e4564eba5
branch: main
author: Weilin Du <108666168+lamentxu...@users.noreply.github.com>
committer: terryjreedy <tjre...@udel.edu>
date: 2025-06-29T18:04:02-04:00
summary:
Doc: fix duplicated words (#136086)
---------
Co-authored-by: Terry Jan Reedy <tjre...@udel.edu>
files:
M Include/internal/mimalloc/mimalloc/types.h
M Include/refcount.h
M InternalDocs/garbage_collector.md
M Lib/test/test_iter.py
M Lib/test/test_listcomps.py
M Tools/scripts/summarize_stats.py
M iOS/README.rst
diff --git a/Include/internal/mimalloc/mimalloc/types.h
b/Include/internal/mimalloc/mimalloc/types.h
index a04169f7fb84e8..a17f637fe68236 100644
--- a/Include/internal/mimalloc/mimalloc/types.h
+++ b/Include/internal/mimalloc/mimalloc/types.h
@@ -705,7 +705,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 034c453f449f5b..65a4e63a8b0952 100644
--- a/Include/refcount.h
+++ b/Include/refcount.h
@@ -30,7 +30,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 4da6cd47dc859e..9c35684c945b3e 100644
--- 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 1b9f3cf76240ad..18e4b676c53236 100644
--- a/Lib/test/test_iter.py
+++ b/Lib/test/test_iter.py
@@ -1147,7 +1147,7 @@ def test_error_iter(self):
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 cffdeeacc5d73b..70148dc30fc957 100644
--- a/Lib/test/test_listcomps.py
+++ b/Lib/test/test_listcomps.py
@@ -716,7 +716,7 @@ def test_multiple_comprehension_name_reuse(self):
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 68cfad3f92cdc7..905af9dcfd802e 100644
--- a/Tools/scripts/summarize_stats.py
+++ b/Tools/scripts/summarize_stats.py
@@ -492,7 +492,7 @@ def get_optimization_stats(self) -> dict[str, tuple[int,
int | None]]:
): (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 13b885144932e4..f0979ba152eb20 100644
--- 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.
_______________________________________________
Python-checkins mailing list -- python-checkins@python.org
To unsubscribe send an email to python-checkins-le...@python.org
https://mail.python.org/mailman3//lists/python-checkins.python.org
Member address: arch...@mail-archive.com
