#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 ncohen):
Yoooooooo !
> It's not the job of `sage.combinat.design`... and note that I work hard
to make `is_prime`, `is_prime_power`, `prime_range` and
`prime_power_range` faster.
I wonder about that: guys who work on number theory may work differently,
or work on very large numbers for which it makes no difference. Or use the
heuristics directly. What you do is useful for everybody indeed (and
clearly for us too), but if we can save some new seconds with a small
cache, why not ?
> Perfect... why not `orthogonal_arrays_build_recursive.py` it would be
even clearer.
Because the file already exists like that... But yes, why not ? I will
upload a commit for that.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16879#comment:24>
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.
