mirror of
https://github.com/kuhyx/WUT_Computer_Science.git
synced 2026-11-10 18:47:11 +01:00
Krzysztof kuhy Rudnicki
a8a2710ebd
kuhy chose the strict branch: no per-file-ignores at all, not even the S101 block that ruff's own docs and the rest of this fleet carry for test code. So 125 test assertions were rewritten to raise instead of assert. Rather than 125 copies of `if x != y: raise AssertionError(...)`, each course grows a small expect module -- expect_equal / expect_in / expect_true / expect_false. That is also strictly better output than a bare assert here: pytest's assertion rewriting does not reach into a helper, so the helper has to print both values, and it does. The rewrite itself went through ast, not a regex, because seven of ECOTE's asserts were wrapped over several lines. Everything else in the two courses is gone as well: - 66 argument and 37 return annotations on the translator, worked out from what each function actually returns rather than stamped on as Any -- `list[str] | str` where a function returns "Error!" or the parsed columns. - 16 prints became logger.error with %-style arguments. The messages still reach stderr with no basicConfig, via logging's last-resort handler, so the translator behaves exactly as before. - Two `open()` calls became Path.open / Path.write_text, six RET504 assign-then-return pairs collapsed, one 380-character expected-HTML literal split into implicitly concatenated pieces (it cannot be wrapped any other way, which is what ISC001 being off is for), and one block of commented-out code deleted. - ECRYPT_PROJECT/__init__.py removed. It made the COURSE directory a package, which nothing imports, and it was the sole cause of `N999 Invalid module name: 'ECRYPT_PROJECT'`; with it gone, sieve is the top-level package and its name is fine. Verified by running both, not by reading: ECOTE 26 tests pass and `python -m translator.main --filename examples/complicated/table1.tex` still writes the same HTML with the same three column-count warnings on stderr; ECRYPT_PROJECT 99 tests pass. Repo-wide: 3,686 findings -> 3,159. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_0172dj34FDpao6wsix8ZuCzE
56 lines
1.5 KiB
Python
56 lines
1.5 KiB
Python
"""Sieve of Eratosthenes: every prime up to and including N."""
|
|
|
|
import math
|
|
import sys
|
|
|
|
|
|
def sieve_of_eratosthenes(num: int) -> list[int]:
|
|
"""Return every prime from 1 to num.
|
|
|
|
Args:
|
|
num (int): Number up to which the prime numbers should be printed
|
|
|
|
Returns:
|
|
list[int]: List of prime numbers
|
|
|
|
"""
|
|
if num <= 0:
|
|
msg = "Number should not be negative."
|
|
raise ValueError(msg)
|
|
# boolean list to store if a number is prime or not
|
|
prime = [True] * (num + 1)
|
|
p = 2 # starting prime number
|
|
# Stop at sqrt(num): a composite always has a factor at or below its
|
|
# square root, so anything still marked prime past that point stays prime.
|
|
while p <= math.sqrt(num):
|
|
# If prime[p] is not
|
|
# changed, then it is a prime
|
|
if prime[p]:
|
|
i = p << 1 # i = p * 2
|
|
# Updating all multiples of p
|
|
while i <= num:
|
|
prime[i] = False
|
|
i += p
|
|
p += 1
|
|
return [p for p in range(2, num + 1) if prime[p]]
|
|
|
|
|
|
def print_sieve(num: int) -> None:
|
|
"""Print every prime from 1 to num, space separated.
|
|
|
|
Args:
|
|
num (int): Number up to which the prime numbers should be printed
|
|
|
|
"""
|
|
sys.stdout.write(" ".join(str(n) for n in sieve_of_eratosthenes(num)))
|
|
sys.stdout.write("\n")
|
|
|
|
|
|
# Driver code
|
|
if __name__ == "__main__":
|
|
bound = int(input("Enter a number: "))
|
|
sys.stdout.write(
|
|
f"Following are the prime numbers smaller than or equal to {bound}\n"
|
|
)
|
|
print_sieve(bound)
|