hunterap23 / python_performance_optimization_test_suite Goto Github PK

• Finish table of contents with anchor links
• Add descriptions to all implementations
• Add installation section

Describe the feature that is being tested/implemented
Add the following iterable comprehension methods:

• Using tuples instead of lists entirely
  • Instead of creating a list and appending to it, create a tuple and recreate it every time a new element needs to be added
• list converted to tuples: tuple([i for i in range(10)])
• set: {i for i in range(10)}
• generator: (i for i in range(10))

List any relations to other issues in this repository or in other repositories
N/A

Describe the feature that is being tested/implemented
Add another prime number calculation method as per the bitshifting method used in https://github.com/PlummersSoftwareLLC/Primes
Can create multiple sub-tests based on the bitshifting used there.

List any relations to other issues in this repository or in other repositories
N/A

Describe the feature that is being tested/implemented
Move to using poetry tool for managing package installation, updating, and deployment.

List any relations to other issues in this repository or in other repositories
N/A

Describe the feature that is being tested/implemented
Replace any multithreading / multiprocessing implementation with the amped module.

List any relations to other issues in this repository or in other repositories
Requires completion of amped module: https://github.com/HunterAP23/amped

Describe the feature that is being tested/implemented
Refactor function calls to use single function with a boundary=None argument.
if boundary is None, then set it to n
else it should be n/2 or math.floor(math.sqrt(n))

Pre-calculate that boundary value before calling the function to lower the performance cost of the n/2 or squre root of n boundary functions.

• Rewrite is_prime_default(n: int, table: tuple) function to be is_prime(n: int, table: tuple, boundary=None)
• Replace any calls to is_prime_half and is_prime_sqrt with calls to the new is+prime function
• Rewrite inline versions of tests to also utilize this new boundary method

List any relations to other issues in this repository or in other repositories
N/A

Describe the feature that is being tested/implemented
Add test cases for using queues instead of lists for storing prime numbers in the prime number calculation testing.

List any relations to other issues in this repository or in other repositories
Related to HunterAP23/amped#9

Describe the feature that is being tested/implemented
Create prime number calculation tests where loops start at 3 and increment by 2, instead of starting at 1 and incrementing by 1 (which requires calculating if the number is even or odd)

List any relations to other issues in this repository or in other repositories
N/A

Describe the feature that is being tested/implemented
Replace usage of multiprocessing library's process and thread pools with concurrent.futures library's process and thread pools

List any relations to other issues in this repository or in other repositories
Relates to HunterAP23/amped#1

• Add missing Cython compilation scripts
• Test compilation process for each script
  • Cython
  • Cython Lambda
  • Cython LRU
  • Cython Numpy
  • Cython Numpy Lambda
  • Optimized
  • Optimized Lambda
  • Optimized LRU
  • Optimized Numpy
  • Optimized Numpy Lambda