#6202: bitset "noise" on solaris sparc (mark)
---------------------+------------------------------------------------------
Reporter: was | Owner: tbd
Type: defect | Status: new
Priority: blocker | Milestone: sage-4.0.1
Component: algebra | Keywords:
---------------------+------------------------------------------------------
Description changed by was:
Old description:
> {{{
> sage -t devel/sage/sage/misc/misc_c.pyx
> **********************************************************************
> File "/home/wstein/build-4.4.0/mark/sage-4.0.1.alpha0/devel/sage-
> main/sage/misc/misc_c.pyx", line 359:
> sage: test_bitset('00'*32, '01'*32, 64)
> Expected:
> a 0000000000000000000000000000000000000000000000000000000000000000
> a.size 64
> len(a) 0
> a.limbs ...
> b 0101010101010101010101010101010101010101010101010101010101010101
> a.in(n) False
> a.not_in(n) True
> a.add(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.discard(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.set_to(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.flip(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.isempty() True
> a.eq(b) False
> a.cmp(b) -1
> a.issubset(b) True
> a.issuperset(b) False
> a.copy()
> 0000000000000000000000000000000000000000000000000000000000000000
> r.clear()
> 0000000000000000000000000000000000000000000000000000000000000000
> complement a
> 1111111111111111111111111111111111111111111111111111111111111111
> a intersect b
> 0000000000000000000000000000000000000000000000000000000000000000
> a union b
> 0101010101010101010101010101010101010101010101010101010101010101
> a minus b
> 0000000000000000000000000000000000000000000000000000000000000000
> a symmetric_difference b
> 0101010101010101010101010101010101010101010101010101010101010101
> a.rshift(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.lshift(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.first() -1
> a.next(n) -1
> a.first_diff(b) 1
> a.next_diff(b, n) -1
> a.hamming_weight() 0
> a.hamming_weight_sparse() 0
> Got:
> a 0000000000000000000000000000000000000000000000000000000000000000
> a.size 64
> len(a) 0
> a.limbs 2
> b 0101010101010101010101010101010101010101010101010101010101010101
> a.in(n) True
> a.not_in(n) False
> a.add(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.discard(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.set_to(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.flip(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.isempty() True
> a.eq(b) False
> a.cmp(b) -1
> a.issubset(b) True
> a.issuperset(b) False
> a.copy()
> 0000000000000000000000000000000000000000000000000000000000000000
> r.clear()
> 0000000000000000000000000000000000000000000000000000000000000000
> complement a
> 1111111111111111111111111111111111111111111111111111111111111111
> a intersect b
> 0000000000000000000000000000000000000000000000000000000000000000
> a union b
> 0101010101010101010101010101010101010101010101010101010101010101
> a minus b
> 0000000000000000000000000000000000000000000000000000000000000000
> a symmetric_difference b
> 0101010101010101010101010101010101010101010101010101010101010101
> a.rshift(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.lshift(n)
> 0000000000000000000000000000000000000000000000000000000000000000
> a.first() -1
> a.next(n) -1
> a.first_diff(b) 1
> a.next_diff(b, n) -1
> a.hamming_weight() 0
> a.hamming_weight_sparse() 0
> }}}
New description:
{{{
-bash-3.00$ pwd
/home/wstein/build-4.4.0/mark/sage-4.0.1.alpha0
sage -t devel/sage/sage/misc/misc_c.pyx
**********************************************************************
File "/home/wstein/build-4.4.0/mark/sage-4.0.1.alpha0/devel/sage-
main/sage/misc/misc_c.pyx", line 359:
sage: test_bitset('00'*32, '01'*32, 64)
Expected:
a 0000000000000000000000000000000000000000000000000000000000000000
a.size 64
len(a) 0
a.limbs ...
b 0101010101010101010101010101010101010101010101010101010101010101
a.in(n) False
a.not_in(n) True
a.add(n)
0000000000000000000000000000000000000000000000000000000000000000
a.discard(n)
0000000000000000000000000000000000000000000000000000000000000000
a.set_to(n)
0000000000000000000000000000000000000000000000000000000000000000
a.flip(n)
0000000000000000000000000000000000000000000000000000000000000000
a.isempty() True
a.eq(b) False
a.cmp(b) -1
a.issubset(b) True
a.issuperset(b) False
a.copy()
0000000000000000000000000000000000000000000000000000000000000000
r.clear()
0000000000000000000000000000000000000000000000000000000000000000
complement a
1111111111111111111111111111111111111111111111111111111111111111
a intersect b
0000000000000000000000000000000000000000000000000000000000000000
a union b
0101010101010101010101010101010101010101010101010101010101010101
a minus b
0000000000000000000000000000000000000000000000000000000000000000
a symmetric_difference b
0101010101010101010101010101010101010101010101010101010101010101
a.rshift(n)
0000000000000000000000000000000000000000000000000000000000000000
a.lshift(n)
0000000000000000000000000000000000000000000000000000000000000000
a.first() -1
a.next(n) -1
a.first_diff(b) 1
a.next_diff(b, n) -1
a.hamming_weight() 0
a.hamming_weight_sparse() 0
Got:
a 0000000000000000000000000000000000000000000000000000000000000000
a.size 64
len(a) 0
a.limbs 2
b 0101010101010101010101010101010101010101010101010101010101010101
a.in(n) True
a.not_in(n) False
a.add(n)
0000000000000000000000000000000000000000000000000000000000000000
a.discard(n)
0000000000000000000000000000000000000000000000000000000000000000
a.set_to(n)
0000000000000000000000000000000000000000000000000000000000000000
a.flip(n)
0000000000000000000000000000000000000000000000000000000000000000
a.isempty() True
a.eq(b) False
a.cmp(b) -1
a.issubset(b) True
a.issuperset(b) False
a.copy()
0000000000000000000000000000000000000000000000000000000000000000
r.clear()
0000000000000000000000000000000000000000000000000000000000000000
complement a
1111111111111111111111111111111111111111111111111111111111111111
a intersect b
0000000000000000000000000000000000000000000000000000000000000000
a union b
0101010101010101010101010101010101010101010101010101010101010101
a minus b
0000000000000000000000000000000000000000000000000000000000000000
a symmetric_difference b
0101010101010101010101010101010101010101010101010101010101010101
a.rshift(n)
0000000000000000000000000000000000000000000000000000000000000000
a.lshift(n)
0000000000000000000000000000000000000000000000000000000000000000
a.first() -1
a.next(n) -1
a.first_diff(b) 1
a.next_diff(b, n) -1
a.hamming_weight() 0
a.hamming_weight_sparse() 0
}}}
--
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6202#comment:1>
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
-~----------~----~----~----~------~----~------~--~---
