Skip to content

fix: correct docstrings in prime_numbers.py (list -> generator, grammar fix) #14300

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.

Sign up for GitHub

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

Open
23f2000188 wants to merge 2 commits into
base: master
Choose a base branch
from
+3 −3
Open

fix: correct docstrings in prime_numbers.py (list -> generator, grammar fix) #14300

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
c26b61a
fix: correct docstrings in prime_numbers.py
23f2000188 Feb 21, 2026
fab473a
fix: correct docstrings in prime_numbers.py
23f2000188 Feb 21, 2026
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
6 changes: 3 additions & 3 deletions maths/prime_numbers.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@

def slow_primes(max_n: int) -> Generator[int]:
"""
Return a list of all primes numbers up to max.
Return a generator of all prime numbers up to max_n.
>>> list(slow_primes(0))
[]
>>> list(slow_primes(-1))
Expand All @@ -31,7 +31,7 @@ def slow_primes(max_n: int) -> Generator[int]:

def primes(max_n: int) -> Generator[int]:
"""
Return a list of all primes numbers up to max.
Return a generator of all prime numbers up to max_n.
>>> list(primes(0))
[]
>>> list(primes(-1))
Expand Down Expand Up @@ -60,7 +60,7 @@ def primes(max_n: int) -> Generator[int]:

def fast_primes(max_n: int) -> Generator[int]:
"""
Return a list of all primes numbers up to max.
Return a generator of all prime numbers up to max_n.
>>> list(fast_primes(0))
[]
>>> list(fast_primes(-1))
Expand Down
Loading