#6202: [with patch, needs work] bitset "noise" on solaris sparc (mark)
---------------------+------------------------------------------------------
 Reporter:  was      |       Owner:  tbd       
     Type:  defect   |      Status:  new       
 Priority:  blocker  |   Milestone:  sage-4.0.2
Component:  solaris  |    Keywords:            
 Reviewer:           |      Author:            
   Merged:           |  
---------------------+------------------------------------------------------

Comment(by was):

 Woops.  It's no surprise but though you fixed the test on mark (the
 solaris box), it is now completely broke on sage.math:
 {{{
 ----------------------------------------------------------------------
 | Sage Version 4.0.1, Release Date: 2009-06-06                       |
 | Type notebook() for the GUI, and license() for information.        |
 ----------------------------------------------------------------------
 sage:
 Exiting SAGE (CPU time 0m0.04s, Wall time 0m1.13s).
 wst...@sage:~/build/sage-4.0.1$ ./sage -t devel/sage/sage/misc/misc_c.pyx
 sage -t  "devel/sage/sage/misc/misc_c.pyx"
 **********************************************************************
 File "/scratch/wstein/build/sage-4.0.1/devel/sage/sage/misc/misc_c.pyx",
 line 359:
     sage: test_bitset('00'*64, '01'*64, 64)
 Expected:
     a
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a.size 128
     len(a) 0
     a.limbs 4
     b
 
01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
     a.in(n)   False
     a.not_in(n)   True
     a.add(n)
 
00000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000
     a.discard(n)
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a.set_to(n)
 
00000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000
     a.flip(n)
 
00000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000
     a.isempty()  True
     a.eq(b)      False
     a.cmp(b)     -1
     a.issubset(b) True
     a.issuperset(b) False
     a.copy()
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     r.clear()
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     complement a
 
11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111
     a intersect b
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a union b
 
01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
     a minus b
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a symmetric_difference b
 
01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
     a.rshift(n)
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a.lshift(n)
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a.first()           -1
     a.next(n)           -1
     a.first_diff(b)     1
     a.next_diff(b, n)   65
     a.hamming_weight()  0
     a.hamming_weight_sparse()  0
     rshifts add  True
     lshifts add  True
     intersection commutes True
     union commutes  True
     not not = id True
     flipped bit  64
     add bit      64
     discard bit    64
     lshift add unset ok True
     rshift set unset ok True
 Got:
     a
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a.size 128
     len(a) 0
     a.limbs 2
     b
 
01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
     a.in(n)   False
     a.not_in(n)   True
     a.add(n)
 
00000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000
     a.discard(n)
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a.set_to(n)
 
00000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000
     a.flip(n)
 
00000000000000000000000000000000000000000000000000000000000000001000000000000000000000000000000000000000000000000000000000000000
     a.isempty()  True
     a.eq(b)      False
     a.cmp(b)     -1
     a.issubset(b) True
     a.issuperset(b) False
     a.copy()
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     r.clear()
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     complement a
 
11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111
     a intersect b
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a union b
 
01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
     a minus b
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a symmetric_difference b
 
01010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101
     a.rshift(n)
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a.lshift(n)
 
00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
     a.first()           -1
     a.next(n)           -1
     a.first_diff(b)     1
     a.next_diff(b, n)   65
     a.hamming_weight()  0
     a.hamming_weight_sparse()  0
     rshifts add  True
     lshifts add  True
     intersection commutes True
     union commutes  True
     not not = id True
     flipped bit  64
     add bit      64
     discard bit    64
     lshift add unset ok True
     rshift set unset ok True
 **********************************************************************
 1 items had failures:
    1 of   7 in __main__.example_8
 ***Test Failed*** 1 failures.
 For whitespace errors, see the file
 /scratch/wstein/build/sage-4.0.1/tmp/.doctest_misc_c.py
          [1.2 s]
 exit code: 1024

 ----------------------------------------------------------------------
 The following tests failed:


         sage -t  "devel/sage/sage/misc/misc_c.pyx"
 Total time for all tests: 1.2 seconds
 wst...@sage:~/build/sage-4.0.1$

 }}}

-- 
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6202#comment:13>
Sage <http://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 post to this group, send email to [email protected]
To unsubscribe from this group, send email to 
[email protected]
For more options, visit this group at 
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---

Reply via email to