Skip to content

[3.13] Doc: fix duplicated words (GH-136086) #137357

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Aug 3, 2025
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion Include/internal/mimalloc/mimalloc/types.h
Original file line number Diff line number Diff line change
Expand Up @@ -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;
Expand Down
2 changes: 1 addition & 1 deletion Lib/test/test_iter.py
Original file line number Diff line number Diff line change
Expand Up @@ -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:
Expand Down
2 changes: 1 addition & 1 deletion Lib/test/test_listcomps.py
Original file line number Diff line number Diff line change
Expand Up @@ -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:
Expand Down
2 changes: 1 addition & 1 deletion Tools/scripts/summarize_stats.py
Original file line number Diff line number Diff line change
Expand Up @@ -477,7 +477,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"
Expand Down
2 changes: 1 addition & 1 deletion iOS/README.rst
Original file line number Diff line number Diff line change
Expand Up @@ -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.

Expand Down
Loading
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy