By "attached below", I meant "it will be attached in a followup, once I realize
I forgot to attach below".
On Aug 18, 2015, at 13:30 , Justin C. Walker wrote:
>
> On Aug 5, 2015, at 15:31 , Volker Braun wrote:
>
>> As always, you can get the latest beta version from the "develop" git
>> branch. Alternatively, the self-contained source tarball is at
>> http://www.sagemath.org/download-latest.html
>
> Built from the tarball on OS X, 10.6.8 (Dual 6-core Xeons) and 10.10.5
> (Quad-core Core i7). On each platform, the build completed w/o problems, and
> all tests ('ptestlong') passed!
>
> As before, the first attempt to test (on 10.6.8) produced three failures, but
> a complete re-test passed. The failures were
> ----------------------------------------------------------------------
> sage -t --long --warn-long 101.8 src/sage/combinat/affine_permutation.py #
> Bad
> exit: 2
> sage -t --long --warn-long 101.8 src/sage/combinat/combinat.py # Bad exit: 2
> sage -t --long --warn-long 101.8
> src/sage/coding/codecan/autgroup_can_label.pyx
> # Bad exit: 2
> ----------------------------------------------------------------------
>
> Portions of the testlog attached below. Full logs available if desired.
--
You received this message because you are subscribed to the Google Groups
"sage-release" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-release+unsubscr...@googlegroups.com.
To post to this group, send email to sage-release@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-release.
For more options, visit https://groups.google.com/d/optout.
sage -t --long --warn-long 101.8 src/sage/combinat/affine_permutation.py
Bad exit: 2
**********************************************************************
Tests run before process (pid=77783) failed:
sage: A=AffinePermutationGroup(['A',7,1]) ## line 38 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 39 ##
sage: p ## line 40 ##
Type A affine permutation with window [3, -1, 0, 6, 5, 4, 10, 9]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 42 ##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 57 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) #indirect doctest ## line 58 ##
sage: p ## line 59 ##
Type A affine permutation with window [3, -1, 0, 6, 5, 4, 10, 9]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 61 ##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 80 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 81 ##
sage: p ## line 82 ##
Type A affine permutation with window [3, -1, 0, 6, 5, 4, 10, 9]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 84 ##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 97 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 98 ##
sage: q=A([0, 2, 3, 4, 5, 6, 7, 9]) ## line 99 ##
sage: p.__rmul__(q) ## line 100 ##
Type A affine permutation with window [1, -1, 0, 6, 5, 4, 10, 11]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 102
##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 116 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 117 ##
sage: q=A([0,2,3,4,5,6,7,9]) ## line 118 ##
sage: p.__lmul__(q) ## line 119 ##
Type A affine permutation with window [3, -1, 1, 6, 5, 4, 10, 8]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 121
##
0
sage: p=AffinePermutationGroup(['A',7,1])([3, -1, 0, 6, 5, 4, 10, 9]) ## line
138 ##
sage: s1=AffinePermutationGroup(['A',7,1]).one().apply_simple_reflection(1) ##
line 139 ##
sage: p*s1 ## line 140 ##
Type A affine permutation with window [-1, 3, 0, 6, 5, 4, 10, 9]
sage: p.apply_simple_reflection(1, 'right') ## line 142 ##
Type A affine permutation with window [-1, 3, 0, 6, 5, 4, 10, 9]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 145
##
0
sage: p=AffinePermutationGroup(['A',7,1])([3, -1, 0, 6, 5, 4, 10, 9]) ## line
155 ##
sage: p.inverse() ## line 156 ##
Type A affine permutation with window [0, -1, 1, 6, 5, 4, 10, 11]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 158
##
0
sage: p=AffinePermutationGroup(['A',7,1])([3, -1, 0, 6, 5, 4, 10, 9]) ## line
175 ##
sage: p.apply_simple_reflection(3) ## line 176 ##
Type A affine permutation with window [3, -1, 6, 0, 5, 4, 10, 9]
sage: p.apply_simple_reflection(11) ## line 178 ##
Type A affine permutation with window [3, -1, 6, 0, 5, 4, 10, 9]
sage: p.apply_simple_reflection(3, 'left') ## line 180 ##
Type A affine permutation with window [4, -1, 0, 6, 5, 3, 10, 9]
sage: p.apply_simple_reflection(11, 'left') ## line 182 ##
Type A affine permutation with window [4, -1, 0, 6, 5, 3, 10, 9]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 184
##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 196 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 197 ##
sage: p.value(1) #indirect doctest ## line 198 ##
3
sage: p.value(9) ## line 200 ##
11
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 202
##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 217 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 218 ##
sage: p.is_i_grassmannian() ## line 219 ##
False
sage: q=A.from_word([3,2,1,0]) ## line 221 ##
sage: q.is_i_grassmannian() ## line 222 ##
True
sage: q=A.from_word([2,3,4,5]) ## line 224 ##
sage: q.is_i_grassmannian(5) ## line 225 ##
True
sage: q.is_i_grassmannian(2, side='left') ## line 227 ##
True
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 229
##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 240 ##
sage: A.index_set() ## line 241 ##
(0, 1, 2, 3, 4, 5, 6, 7)
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 243
##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 256 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 257 ##
sage: p.lower_covers() ## line 258 ##
[Type A affine permutation with window [-1, 3, 0, 6, 5, 4, 10, 9],
Type A affine permutation with window [3, -1, 0, 5, 6, 4, 10, 9],
Type A affine permutation with window [3, -1, 0, 6, 4, 5, 10, 9],
Type A affine permutation with window [3, -1, 0, 6, 5, 4, 9, 10]]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 261
##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 271 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 272 ##
sage: p.is_one() ## line 273 ##
False
sage: q=A.one() ## line 275 ##
sage: q.is_one() ## line 276 ##
True
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 278
##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 287 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 288 ##
sage: p.reduced_word() ## line 289 ##
[0, 7, 4, 1, 0, 7, 5, 4, 2, 1]
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 291
##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 310 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 311 ##
sage: p.signature() ## line 312 ##
1
sage: sig_on_count() # check sig_on/off pairings (virtual doctest) ## line 314
##
0
sage: A=AffinePermutationGroup(['A',7,1]) ## line 324 ##
sage: p=A([3, -1, 0, 6, 5, 4, 10, 9]) ## line 325 ##
sage: p.to_weyl_group_element() ## line 326 ##
**********************************************************************
sage -t --long --warn-long 101.8 src/sage/combinat/combinat.py
Bad exit: 2
**********************************************************************
Tests run before process (pid=77799) failed:
sage: bell_number(10) ## line 291 ##
115975
sage: bell_number(2) ## line 293 ##
2
sage: bell_number(-10) ## line 295 ##
sage: bell_number(1) ## line 299 ##
1
sage: bell_number(1/3) ## line 301 ##
sage: k = bell_number(30, 'mpmath'); k ## line 311 ##
846749014511809332450147
sage: k == bell_number(30) ## line 313 ##
True
sage: k2 = bell_number(30, 'mpmath', prec=30); k2 ## line 319 ##
846749014511809332450147
sage: k == k2 ## line 321 ##
True
sage: k = bell_number(30, 'mpmath', prec=15); k ## line 329 ##
846749014511809388871680
sage: k == bell_number(30) ## line 331 ##
False
sage: all([bell_number(n) == bell_number(n,'dobinski') for n in range(200)]) ##
line 336 ##
True
sage: all([bell_number(n) == bell_number(n,'gap') for n in range(200)]) ## line
338 ##
**********************************************************************
sage -t --long --warn-long 101.8 src/sage/coding/codecan/autgroup_can_label.pyx
Bad exit: 2
**********************************************************************
Tests run before process (pid=77851) failed:
sage: from sage.coding.codecan.autgroup_can_label import
LinearCodeAutGroupCanLabel ## line 49 ##
sage: C = codes.HammingCode(3, GF(3)).dual_code() ## line 50 ##
sage: P = LinearCodeAutGroupCanLabel(C) ## line 51 ##
**********************************************************************
--
Justin C. Walker, Curmudgeon at Large
Institute for the Absorption of Federal Funds
-----------
I want to die, peacefully in my sleep, like my grandfather;
not screaming in terror, like his passengers.
--
You received this message because you are subscribed to the Google Groups
"sage-release" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-release+unsubscr...@googlegroups.com.
To post to this group, send email to sage-release@googlegroups.com.
Visit this group at http://groups.google.com/group/sage-release.
For more options, visit https://groups.google.com/d/optout.
