#19494: Make finite word method nb_subword_occurences_in much faster
-------------------------+-------------------------------------------------
Reporter: | Owner:
slabbe | Status: needs_info
Type: | Milestone: sage-6.10
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers: Vincent Delecroix
combinatorics | Work issues:
Keywords: | Commit:
Authors: | 0d9247f733118d16ce49cbc38b9f8e9e92791a28
Sébastien Labbé | Stopgaps:
Report Upstream: N/A |
Branch: |
u/slabbe/19494 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by slabbe):
Replying to [comment:7 vdelecroix]:
> Hola Sebastien,
Hola !! Como esta tu en el Chile ahora!?
> Here is an example where `original` is much faster
How did you come up with this example? I mean what should be the heuristic
for when using the recursive or the matrices implementation?
> So we should definitely keep it.
I renamed it `'recursive'`.
> For sparsity of matrices I was a bit wrong.
Ok. I removed the sparse argument.
> Note that the old implementation suffers several problems
Yes. I have seen that...
> What do you think?
Ok, let me take a deeper look at it and see if I can remove bad Python
uses.
--
Ticket URL: <http://trac.sagemath.org/ticket/19494#comment:9>
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.
