#16499: Cheap speedup in the OA recursive constructions
-------------------------------------+---------------------------------
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: |
-------------------------------------+---------------------------------
There is a lot to save by not trying to build an Orthogonal Array when ...
we already know that we are going to fail.
This is the case when `orthogonal_arrays(k-1,n)` was called and returned
"Unknown" : there is no point in trying to build an
`orthogonal_array(k,n)` later.
This can be cheaply fixed by querying the cache before trying to build the
design.
The "clean" fix would be to introduce a `is_available` along with the
`existence` parameter, but this interface will probably change very soon
so it is not the right time to touch all functions and deal with all
combinations of existence/available/etc because of that. Besides, the
current fix already does the job quite well.
This will all become an Object Oriented Hell quite soon anyway .... `:-P`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16499>
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.
