#16264: Rotate error on childless binay trees
-------------------------------------------------+-------------------------
Reporter: VivianePons | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.2
Component: combinatorics | Resolution:
Keywords: combinat, Tamari, binary | Merged in:
trees, FindStat | Reviewers:
Authors: Viviane Pons | Work issues:
Report Upstream: N/A | Commit:
Branch: | Stopgaps:
Dependencies: |
-------------------------------------------------+-------------------------
Comment (by VivianePons):
Let me summarize here:
- raising an exception is consistent mathematically but breaks everything
unexpectedly. Let say you have a big set of objects on which you want to
apply the rotation, you can't do it easily without checking every single
element. Also, the ty catch my be slow.
- returning None does not break everything right away but it might lead to
errors later that might be difficult to understand.
- doing nothing is also problematic because you then don't know if your
tree has been changed or not.
- the iterator for something that returns at most one element seems
somehow a bad idea (and is definitely not natural for a non advanced user)
I would really like to know if there are other combinatorial objects that
have something like that and how it's dealt with. One possible solution
proposed by Darij would be to have a default behavior and some kind of
optional argument so that people can make it do what they want.
--
Ticket URL: <http://trac.sagemath.org/ticket/16264#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.
