#10963: More functorial constructions
-------------------------------------------------------------------------+--
       Reporter:  nthiery                                                |      
   Owner:  stumpc5                                                              
                        
           Type:  enhancement                                            |      
  Status:  needs_work                                                           
                        
       Priority:  major                                                  |     
Milestone:                                                                      
                         
      Component:  categories                                             |    
Resolution:                                                                     
                          
       Keywords:                                                         |   
Work issues:  Reduce startup time by 5%. Avoid "recursion depth exceeded 
(ignored)". Trivial doctest fixes.
Report Upstream:  N/A                                                    |     
Reviewers:  Simon King                                                          
                         
        Authors:  Nicolas M. ThiƩry                                      |     
Merged in:                                                                      
                         
   Dependencies:  #11224, #8327, #10193, #12895, #14516, #14722, #13589  |      
Stopgaps:                                                                       
                        
-------------------------------------------------------------------------+--
Changes (by SimonKing):

  * status:  needs_review => needs_work
  * work_issues:  Finish merging some changes in the primer => Reduce
                  startup time by 5%. Avoid "recursion
                  depth exceeded (ignored)". Trivial
                  doctest fixes.


Comment:

 Patchbot finds
 {{{
 sage -t --long
 
/mnt/storage2TB/patchbot/Sage/sage-5.11.beta3/devel/sage/sage/rings/number_field/number_field.py
 # 1 doctest failed
 sage -t --long
 
/mnt/storage2TB/patchbot/Sage/sage-5.11.beta3/devel/sage/doc/ru/tutorial/tour_groups.rst
 # 1 doctest failed
 sage -t --long
 
/mnt/storage2TB/patchbot/Sage/sage-5.11.beta3/devel/sage/sage/geometry/polyhedron/plot.py
 # 1 doctest failed
 sage -t --long
 
/mnt/storage2TB/patchbot/Sage/sage-5.11.beta3/devel/sage/sage/categories/category.py
 # 3 doctests failed
 sage -t --long
 
/mnt/storage2TB/patchbot/Sage/sage-5.11.beta3/devel/sage/sage/categories/category_with_axiom.py
 # 1 doctest failed
 }}}

 This sounds serious:
 {{{
 sage -t --long
 
/mnt/storage2TB/patchbot/Sage/sage-5.11.beta3/devel/sage/sage/rings/number_field/number_field.py
 **********************************************************************
 File
 
"/mnt/storage2TB/patchbot/Sage/sage-5.11.beta3/devel/sage/sage/rings/number_field/number_field.py",
 line 309, in sage.rings.number_field.number_field.?
 Failed example:
     RR.coerce_map_from(K)
 Expected:
     Composite map:
       From: Number Field in a with defining polynomial x^3 - 2
       To:   Real Field with 53 bits of precision
       Defn:   Generic morphism:
               From: Number Field in a with defining polynomial x^3 - 2
               To:   Real Lazy Field
               Defn: a -> 1.259921049894873?
             then
               Conversion via _mpfr_ method map:
               From: Real Lazy Field
               To:   Real Field with 53 bits of precision
 Got:
     Exception RuntimeError: 'maximum recursion depth exceeded while
 calling a Python object' in <function remove at 0x2820668> ignored
     Composite map:
       From: Number Field in a with defining polynomial x^3 - 2
       To:   Real Field with 53 bits of precision
       Defn:   Generic morphism:
               From: Number Field in a with defining polynomial x^3 - 2
               To:   Real Lazy Field
               Defn: a -> 1.259921049894873?
             then
               Conversion via _mpfr_ method map:
               From: Real Lazy Field
               To:   Real Field with 53 bits of precision
 }}}
 {{{
 File
 
"/mnt/storage2TB/patchbot/Sage/sage-5.11.beta3/devel/sage/doc/ru/tutorial/tour_groups.rst",
 line 14, in doc.ru.tutorial.tour_groups
 Failed example:
     G = PermutationGroup(['(1,2,3)(4,5)', '(3,4)'])
 Expected nothing
 Got:
     Exception RuntimeError: 'maximum recursion depth exceeded while
 calling a Python object' in <function remove at 0xfe16e0> ignored
 }}}
 {{{
 File
 
"/mnt/storage2TB/patchbot/Sage/sage-5.11.beta3/devel/sage/sage/geometry/polyhedron/plot.py",
 line 461, in sage.geometry.polyhedron.plot.Projection.__init__
 Failed example:
     p = polytopes.icosahedron()
 Expected nothing
 Got:
     Exception RuntimeError: 'maximum recursion depth exceeded while
 getting the str of an object' in <function remove at 0x2e03e60> ignored
     Exception RuntimeError: 'maximum recursion depth exceeded while
 getting the str of an object' in <function remove at 0x2e03e60> ignored
 }}}

 And the result of the startup time plugin is also a bad news.
 {{{
 +Average increase of 0.057 secs or 8.1%.

 +With 100% confidence, startup time increased by at least 5%
 +With 100% confidence, startup time increased by at least 2.5%
 +With 100% confidence, startup time increased by at least 1%
 +With 100% confidence, startup time increased by at least 0.5%
 +With 100% confidence, startup time increased by at least 0.25%
 }}}

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/10963#comment:39>
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/groups/opt_out.


Reply via email to