#11187: Implementation of finite reflection groups
-------------------------------------+-------------------------------------
Reporter: stumpc5 | Owner: tbd
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-7.2
Component: combinatorics | Resolution:
Keywords: reflection group, | Merged in:
days49, days 64.5 | Reviewers:
Authors: Christian Stump | Work issues:
Report Upstream: N/A | Commit:
Branch: public/11187 | def701588736edda81a86ddd1a9cbdbc849657be
Dependencies: #20107 | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by stumpc5):
Travis, could you have a look at the diffset 8497f5d; I commented out that
the change is actually used, see {{{#for i in self.noncom[first]}}}, it
seems to slow down the test even though much less is actually tested.
Maybe you see how to get rid of the overhead the line {{{for i in
self.noncom[first]}}} has compared to {{{for i in
range(first+1,self.n)}}}.
--
Ticket URL: <http://trac.sagemath.org/ticket/11187#comment:210>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
