#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 | 789533babb6fde4a7745d9b2b846b4957dc9b12e
Dependencies: #16875 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by ncohen):
How is this for you ? I plan on modifying `orthogonal_array_recursive`
now, and turn it into a .pyx file. The only time-consuming operations that
occur there are the `find_*` functions which may benefit from C integer
variables.
Plus I plan on writing a small function `cdef bint _is_available(k,n)`
there that will 1) check the cache 2) call
orthogonal_array(k,n,existence=1) if needed: the point is that because
this function is a cdef one, for most calls no Python will be involved at
all.
Tell me what you think of this patch, for I cannot begin that if I am not
sure that the cache function stay in designs_pyx.
Have fuuuuuun !
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/16879#comment:13>
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.
