#12996: Support for one-dimensional shifts of finite type
--------------------------------------+-------------------------------------
Reporter: mhs | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.6
Component: combinatorics | Resolution:
Keywords: symbolic dynamics | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Michael Schraudner | Merged in:
Dependencies: | Stopgaps:
--------------------------------------+-------------------------------------
Comment (by vdelecroix):
Hello,
Some more comments:
* At the begining of the file finite_type_shift.py you modify the
*global* behavior of warnings! It can not be done that way as you affect
the whole SAGE.
* the two methods admissible_words_iter and forbidden_words_iter may be
renamed in admissible_word_iterator and forbidden_word_iterator (which is
more how other iterator methods looks like within SAGE). Moreover, both of
them may use the SearchForest in sage.combinat.backtrack which is
dedicated to that sort of iteration... you will end up with 3 lines
algorithms! I may help if you are stuck with the use of SearchForest.
* a_point_iter must be renamed as random_element; or an_element if it is
not random (Sage standards).
Cheers,
Vincent
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12996#comment:32>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
