#16879: OA caching in C
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: needs_info
Priority: major | Milestone: sage-6.4
Component: combinatorial | Resolution:
designs | Merged in:
Keywords: | Reviewers:
Authors: Nathann Cohen | Work issues:
Report Upstream: N/A | Commit:
Branch: public/16879 | 5b1977dca2ad045051e337f0f96c860ce245fdb6
Dependencies: #16875 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Hello,
More speed up at `public/16879c` (pass from 14.2sec to 13.6sec for the
first 1200 MOLS). Now that `is_available` is a cdef, it is the fastest to
call so we should always try this one first.
What do you think about moving the actual constructions in
`orthogonal_arrays.py` and globally import them in
`orthogonal_array_recursive.py`? I do not like to have them in Cython (it
takes lifetime to compile, you get ugly backtrace, ...).
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16879#comment:21>
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.
