#8386: move iet from sage.combinat to sage.dynamics
--------------------------------------+-------------------------------------
       Reporter:  vdelecroix          |         Owner:  vdelecroix       
           Type:  defect              |        Status:  positive_review  
       Priority:  major               |     Milestone:  sage-5.10        
      Component:  combinatorics       |    Resolution:                   
       Keywords:  iet, combinatorics  |   Work issues:                   
Report Upstream:  N/A                 |     Reviewers:  Vincent Delecroix
        Authors:  Frédéric Chapoton   |     Merged in:                   
   Dependencies:  #12643, #13677      |      Stopgaps:                   
--------------------------------------+-------------------------------------
Changes (by {'newvalue': u'Fr\xe9d\xe9ric Chapoton', 'oldvalue': u'Vincent 
Delecroix'}):

  * status:  needs_review => positive_review
  * work_issues:  save the new datatype ? =>
  * author:  Vincent Delecroix => Frédéric Chapoton
  * reviewer:  Frédéric Chapoton => Vincent Delecroix


Old description:

> 1) The library for iet is moved from sage.combinat.iet to
> sage.dynamics.interval_exchanges which seems more natural.
>
> 2) The old version for iet uses two kinds of datatype for reduced and
> labeled versions. The new implementation makes them coherent.
>
> 3) As a by product of 2), the following behavior is corrected
> {{{
> sage: p = iet.Permutation('a b','b a')
> sage: q = iet.Permutation('b a','a b')
> sage: p == q
> True
> }}}
>
> Apply
> * [attachment:trac_8386_really_just_moving-fc.patch]
> * [attachment:trac_8386_big_clean_fc.patch]

New description:

 1) The library for iet is moved from sage.combinat.iet to
 sage.dynamics.interval_exchanges which seems more natural.

 We postpone 2) and 3) below to #14683

 2) The old version for iet uses two kinds of datatype for reduced and
 labeled versions. The new implementation makes them coherent.

 3) As a by product of 2), the following behavior is corrected
 {{{
 sage: p = iet.Permutation('a b','b a')
 sage: q = iet.Permutation('b a','a b')
 sage: p == q
 True
 }}}

 Apply
 * [attachment:trac_8386_really_just_moving-fc.patch]
 * [attachment:trac_8386_big_clean_fc.patch]

--

Comment:

 Thanks Frederic.

 I put you as an author and me as a reviewer as it is more like that now. I
 postponed the modification of the implementation to #14683.

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8386#comment:34>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.


Reply via email to