#16430: Small speedup for OA(None,p^c)
-------------------------------------+---------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: combinatorial designs | Keywords:
Merged in: | Authors: Nathann Cohen
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-------------------------------------+---------------------------------
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
--
Ticket URL: <http://trac.sagemath.org/ticket/16430>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
