-
-
Notifications
You must be signed in to change notification settings - Fork 45.7k
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
Duplicate algorithms in maths/primelib.py
#10703
Comments
This comment was marked as off-topic.
This comment was marked as off-topic.
@casanova1510 Clearly you did not read the contributing guidelines, much less the content of this issue. |
@tianyizheng02 this sounds like a microservices or monolithic kind of question. Of course using the single |
@tianyizheng02 @olandodeflexy Shall we delete |
@tianyizheng02 When deciding whether to delete maths/primelib.py and distribute the implementation of related algorithms to other files, several factors need to be weighed: Modularity and readability: Placing the implementation of each algorithm in a separate file can improve code readability and modularity. Each function or class is in a separate file, which makes it easier for readers to find the definition of a specific function or class. In general, there is no absolute answer to this question. Depending on the specific needs and context of the project, you may need to weigh these factors and make the best decision. |
Feature description
maths/primelib.py
contains multiple functions for commonly-used computations related to primes (sieve of Eratosthenes, least common multiple, prime factors, etc.), and most if not all of these are also implemented in other files. In an effort to remove duplicate algorithms, should we deletemaths/primelib.py
in favor of separate files for each algorithm, or should we delete the other files and consolidate their implementations intomaths/primelib.py
?The text was updated successfully, but these errors were encountered: