#19494: Make finite word method nb_subword_occurences_in much faster
-------------------------------------+-------------------------------------
Reporter: slabbe | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.10
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Sébastien Labbé | Reviewers: Vincent Delecroix
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/slabbe/19494-folded | 580eb72f9868895e6cb7e773324bcf22995ac15e
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by slabbe):
Replying to [comment:15 vdelecroix]:
> Note that infinite words have a cache. So `iter` is much faster the
second time...
You are right. I took attention to this earlier this week but not this
morning.
So we only need to fix the other issue. Maybe I would keep two
implementations : yours and the matrices one. The recursive one, we can
delete. And the original loop recursive one too I think.
--
Ticket URL: <http://trac.sagemath.org/ticket/19494#comment:17>
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.
