def is_prime(n):
r = parallel.get_rank()
print(f"Rank: {r}")
if n % 2 == 0:
return False
sqrt_n = int(math.floor(math.sqrt(n)))
for i in range(3, sqrt_n + 1, 2):
if n % i == 0:
return False
return True
def is_prime(n):
# Postprocess the processor MPI rank to check your job got the resources
# you requested
r = parallel.get_rank()
print(f"MPI Rank: {r}")
if n % 2 == 0:
return False
sqrt_n = int(math.floor(math.sqrt(n)))
for i in range(3, sqrt_n + 1, 2):
if n % i == 0:
return False
return True
# def asym_predicate((a,b)):
# print a, b, 'a' in a
# return 'a' in a
# mA = Codon()
# mA.setPredicates({'asym': asym_predicate})
def exponentiator_switch(switch):
import cogent3.evolve.substitution_calculation
cogent3.evolve.substitution_calculation.use_new = switch
if "relative" in sys.argv:
test = CompareImplementations(exponentiator_switch)
else:
test = evals_per_sec
parallel.inefficiency_forgiven = True
if parallel.get_rank() > 0:
# benchmarks(test)
quiet(benchmarks, test)
else:
try:
benchmarks(test)
except KeyboardInterrupt:
print(" OK")
def get_process_value(n):
# Sleep to accommodate Windows process creation overhead
time.sleep(1)
return (parallel.get_rank(), n)