#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):
Replying to [comment:22 ncohen]:
> Yooooooooooo !
>
> > 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.
>
> Cool ! By the way wouldn't `is_available(q+1,q)` be faster than
`is_prime_power` at some point ? `:-PPPPPPPPPPPPP`
>
> Anyway, if this `is_prime_power` stuff keeps on slowing us down we will
just cache the first 10 000 values and get rid of the problem.
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.
> > 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, ...).
>
> I agree that it would be better to keep this code in Python for the
moment, and I began to implement it by moving the functions to
`orthogonal_arrays.py`, but I would prefer to keep this file for user-
exposed functions if possible. And things like "construction_3_3" does not
exactly answer that. Aaaaaaand there would be a
`orthogonal_arrays_recursive.pyx` which would contain no constructions at
all, sooo...
>
> What would you think of:
>
> 1) Creating a file `orthogonal_arrays_find_recursive.pyx` that contains
all the find functions.
>
> 2) Rename orthogonal_arrays_recursive to a .py file and keep the
constructions there.
Perfect... why not `orthogonal_arrays_build_recursive.py` it would be even
clearer.
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/16879#comment:23>
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.
