id summary reporter owner description type status priority milestone component resolution keywords cc merged author reviewer upstream work_issues branch commit dependencies stopgaps
16430 Small speedup for OA(None,p^c) ncohen "When n is a prime power we know from the start the maximum value of k. With a couple of lines, we avoid calling `is_prime_power` n+1 times for nothing.
Nathann
A dishonest timing:
{{{
sage: %timeit designs.orthogonal_array(None,2**16,t=2,existence=True) # before
1 loops, best of 3: 1.16 s per loop
sage: %timeit designs.orthogonal_array(None,2**16,t=2,existence=True) # after
10000 loops, best of 3: 19.9 µs per loop
}}}
This ticket also fixes a couple of bugs, i.e. `designs.orthogonal_array(None,n,t=30,existence=True)` and `designs.orthogonal_array(None,0,existence=True)`.
Nathann
Nathann" enhancement closed major sage-6.3 combinatorial designs fixed vdelecroix Nathann Cohen Vincent Delecroix N/A 81b9448a730769e28af52c3ea36faa5b8156232a 81b9448a730769e28af52c3ea36faa5b8156232a