1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
package structures;
public class RawBitSet extends AbstractBitSet {
RawBitSet(long capacity_){
setCapacity(capacity_, 0);
}
RawBitSet(long capacity_, int extra){
setCapacity(capacity_, extra);
}
@Override
public void addToCell(final int cell, final int mask){
int old=array[cell];
int update=old|mask;
array[cell]=update;
}
@Override
public void setToMax(final int cell, final int mask){
addToCell(cell, mask);
}
@Override
public void increment(int x, int amt){
assert(amt>0);
assert(x>=0 && x<=capacity);
final int cell=x/32;
final int bit=x&31;
final int mask=1<<bit;
final int old=array[cell];
final int update=old|mask;
array[cell]=update;
}
@Override
public int getCount(int x){
assert(x>=0 && x<=capacity);
final int cell=x/32;
final int bit=x&31;
final int mask=1<<bit;
final int value=array[cell];
return (value&mask)==mask ? 1 : 0;
}
@Override
public void clear(){
for(int i=0; i<length; i++){
array[i]=0;
}
}
@Override
public long cardinality(){
long sum=0;
for(int i=0; i<length; i++){
int value=array[i];
sum+=Integer.bitCount(value);
}
return sum;
}
@Override
public void setCapacity(long capacity_, int extra){
capacity=capacity_;
length=(int)((capacity+31)/32);
if(maxCapacity<capacity){
maxLength=length+extra;
maxCapacity=length*32;
array=new int[maxLength];
}
}
@Override
public long capacity(){return capacity;}
@Override
public int length(){return length;}
@Override
public final int bits(){return 1;}
public int[] array(){return array;}
private long maxCapacity=0;
private long capacity=0;
private int maxLength=0;
private int length=0;
private int[] array;
}
|
