#14516: Refactoring of crystals for speedup
-----------------------------+----------------------------------------------
Reporter: tscrim | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.10
Component: combinatorics | Keywords: crystals speedup
Work issues: | Report Upstream: N/A
Reviewers: | Authors: Travis Scrimshaw
Merged in: | Dependencies: #14402 #2023
Stopgaps: |
-----------------------------+----------------------------------------------
In order to speed up many of the crystals computations, I'm proposing the
following:
- Cythonize `CrystalOfLetters`
- Instead of e, f, epsilon, phi checking the index set each time, these
functions will check to make sure i is in the index set, then call _e, _f,
_epsilon, _phi which assume i is valid input and respectively call the
private methods.
- Make index_set a cached method. Subsequently this requires it to be
returned as a tuple instead of a list
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14516>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
