-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBitArray.cpp
More file actions
164 lines (123 loc) · 3.71 KB
/
BitArray.cpp
File metadata and controls
164 lines (123 loc) · 3.71 KB
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
#include<algorithm>
#include"BitArray.h"
namespace Succinct{
BitArray::BitArray(const BitArray &rhs):BitArrayBase(rhs.mTotalBits){
auto rhsBlock=rhs.mRootBlock.get();
if(rhsBlock){
L0Block *newBlock=new L0Block(*rhsBlock);
mRootBlock.reset(newBlock,&BlockDeleter);
mCurrentBlock=newBlock;
rhsBlock=rhsBlock->Next();
}
while(rhsBlock){
L0Block *newBlock=new L0Block(*rhsBlock);
mCurrentBlock->Append(newBlock);
mCurrentBlock=newBlock;
rhsBlock=rhsBlock->Next();
}
mCurrentBlock=mRootBlock.get();
}
BitArray::BitArray(const BitArrayCounter &rhs):BitArrayBase(rhs.mTotalBits){
auto rhsBlock=rhs.mRootBlock.get();
if(rhsBlock){
L0Block *newBlock=new L0Block(*rhsBlock);
mRootBlock.reset(newBlock,&BlockDeleter);
mCurrentBlock=newBlock;
rhsBlock=rhsBlock->Next();
}
while(rhsBlock){
L0Block *newBlock=new L0Block(*rhsBlock);
mCurrentBlock->Append(newBlock);
mCurrentBlock=newBlock;
rhsBlock=rhsBlock->Next();
}
mCurrentBlock=mRootBlock.get();
}
uint64_t BitArray::PopCount()const{
auto cb=mRootBlock.get();
uint64_t rollCount=0;
while(cb){
rollCount+=cb->PopCount();
cb=cb->Next();
}
return rollCount;
}
BitArray& BitArray::operator=(const BitArray &rhs){
mRootBlock=rhs.mRootBlock;
mTotalBits=rhs.mTotalBits;
Reset();
return *this;
}
BitArrayCounter::BitArrayCounter(const BitArrayCounter &rhs):BitArrayBase(rhs.mTotalBits){
auto rhsBlock=rhs.mRootBlock.get();
if(rhsBlock){
L0BlockCounter *newBlock=new L0BlockCounter(*rhsBlock);
mRootBlock.reset(newBlock,BlockDeleter);
mCurrentBlock=newBlock;
rhsBlock=rhsBlock->Next();
}
while(rhsBlock){
L0BlockCounter *newBlock=new L0BlockCounter(*rhsBlock);
mCurrentBlock->Append(newBlock);
mCurrentBlock=newBlock;
rhsBlock=rhsBlock->Next();
}
mCurrentBlock=mRootBlock.get();
}
BitArrayCounter::BitArrayCounter(const BitArray &rhs):BitArrayBase(rhs.mTotalBits){
auto rhsBlock=rhs.mRootBlock.get();
uint64_t count=0;
if(rhsBlock){
L0BlockCounter *newBlock=new L0BlockCounter(*rhsBlock);
mRootBlock.reset(newBlock,BlockDeleter);
mCurrentBlock=newBlock;
count=newBlock->PopCount();
rhsBlock=rhsBlock->Next();
}
while(rhsBlock){
L0BlockCounter *newBlock=new L0BlockCounter(*rhsBlock);
mCurrentBlock->Append(newBlock);
mCurrentBlock=newBlock;
newBlock->BaseCounter(count);
count=newBlock->PopCount();
rhsBlock=rhsBlock->Next();
}
mCurrentBlock=mRootBlock.get();
}
uint64_t BitArrayCounter::PopCount()const{
auto cb=mCurrentBlock;
auto lastBlock=cb;
while(cb){
lastBlock=cb;
cb=cb->Next();
}
return lastBlock->PopCount();
}
uint64_t BitArrayCounter::Rank(uint64_t pos)const{
Seek(pos);
return mCurrentBlock->Rank(pos);
}
uint64_t BitArrayCounter::Select(uint64_t count)const{
if(count<mCurrentBlock->BaseCounter()){
while(count<mCurrentBlock->BaseCounter()&&mCurrentBlock->Prev()){
mCurrentBlock=mCurrentBlock->Prev();
mCurrentOffset-=mCurrentBlock->Size();
}
} else{
while(count>mCurrentBlock->BaseCounter()&&mCurrentBlock->Next()){
mCurrentOffset+=mCurrentBlock->Size();
mCurrentBlock=mCurrentBlock->Next();
}
}
return mCurrentOffset+mCurrentBlock->Select(count);
}
BitArrayCounter& BitArrayCounter::operator=(const BitArrayCounter &rhs){
mRootBlock=rhs.mRootBlock;
mTotalBits=rhs.mTotalBits;
Reset();
return *this;
}
/* BitArrayCounter Compact(BitArray &val,BitArray &mask,size_t groupSize){
}
*/
}