#15456: fix bug in has_right/left_descents in Weyl group code
-------------------------+-------------------------------------------------
Reporter: | Owner:
zabrocki | Status: needs_review
Type: | Milestone: sage-6.2
defect | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
combinatorics | Work issues:
Keywords: | Commit:
Authors: | bef966f7e6f1ce42da5578c8da4df8d5ebdf9f9b
Frédéric Chapoton | Stopgaps:
Report Upstream: N/A |
Branch: |
u/chapoton/15456 |
Dependencies: |
-------------------------+-------------------------------------------------
Comment (by chapoton):
So, what shall we do here ?
If I understand your proposal, when no `has_something` is implemented in
an instance of Coxeter group, one has two different possibilities of
infinite loop instead of one.
Supose now that I only implement `has_left` and that I call `has_right`.
This will result in an infinite loop in your proposal, no ?
--
Ticket URL: <http://trac.sagemath.org/ticket/15456#comment:21>
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.
