def test_load_factor():
from primes import primes
N = 50
p1 = primes.index(5003) # 3271
p2 = primes.index(6007)
sizes = primes[p1:p2]
pairs_dict = get_pairs_dict()
items = [(make_kern_pair_key(*k), v) for k, v in pairs_dict.iteritems()]
cells = 1
maximize_load_factor(N, items, sizes, hfuns_generator(2), cells)
def test_load_factor():
from primes import primes
N = 50
p1 = primes.index(5003) # 3271
p2 = primes.index(6007)
sizes = primes[p1:p2]
pairs_dict = get_pairs_dict()
items = [(make_kern_pair_key(*k), v) for k, v in pairs_dict.iteritems()]
cells = 1
maximize_load_factor(N, items, sizes, hfuns_generator(2), cells)
def prime_sum(primes):
length = 0
for prime in primes:
for i in range(0, primes.index(prime)):
val = 0
for j in range(i,primes.index(prime)):
val += primes[j]
#if ((str(i)+","+str(j)) in prime_dict.keys()):
#val = prime_dict[str(i)+","+str(j)]
#else:
#val += primes[j]
#prime_dict[str(i)+","+str(j)] = val
if (val == prime):
if ((j - i + 1) > length):
print val
length = j - i + 1
if (val > prime):
break
return length
