# HG changeset patch
# User Jeroen Demeyer <jdemeyer@cage.ugent.be>
# Date 1348217992 7200
# Node ID 1595ed017a578b00b0e0456455770bdaaafa1d87
# Parent 377ac41422925868d788595d023d3f73173a3400
Add # long time where needed, second patch
diff git a/sage/combinat/sf/jack.py b/sage/combinat/sf/jack.py
a

b


307  307  sage: JJ = Sym.jack(t=1).J() 
308  308  sage: s = Sym.schur() 
309  309  sage: p = Partition([3,2,1,1]) 
310   sage: s(JJ(p)) == p.hook_product(1)*s(p) 
 310  sage: s(JJ(p)) == p.hook_product(1)*s(p) # long time (4s on sage.math, 2012) 
311  311  True 
312  312  
313  313  At `t = 2`, the Jack polynomials in the `J` basis are scalar multiples 
diff git a/sage/combinat/sf/llt.py b/sage/combinat/sf/llt.py
a

b


742  742  :: 
743  743  
744  744  sage: HS3t2 = SymmetricFunctions(QQ).llt(3,t=2).hspin() 
745   sage: TestSuite(HS3t2).run() # products are too expensive 
 745  sage: TestSuite(HS3t2).run() # products are too expensive, long time (7s on sage.math, 2012) 
746  746  
747  747  :: 
748  748  
… 
… 

812  812  :: 
813  813  
814  814  sage: HC3t2 = SymmetricFunctions(QQ).llt(3,t=2).hcospin() 
815   sage: TestSuite(HC3t2).run() # products are too expensive 
 815  sage: TestSuite(HC3t2).run() # products are too expensive, long time (6s on sage.math, 2012) 
816  816  
817  817  :: 
818  818  