forked from fast-pack/JavaFastPFOR
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathOptPFD.java
More file actions
177 lines (161 loc) · 5.07 KB
/
Copy pathOptPFD.java
File metadata and controls
177 lines (161 loc) · 5.07 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
165
166
167
168
169
170
171
172
173
174
175
176
177
/**
* This code is released under the
* Apache License Version 2.0 http://www.apache.org/licenses/.
*
* (c) Daniel Lemire, http://lemire.me/en/
*/
package me.lemire.integercompression;
/**
* OptPFD implemented by Daniel Lemire
*
* Follows:
*
* H. Yan, S. Ding, T. Suel, Inverted index compression and query processing
* with optimized document ordering, in: WWW �09, 2009, pp. 401�410.
*
* using Simple16 as the secondary coder.
*
* @author Daniel Lemire
*
*/
public final class OptPFD implements IntegerCODEC {
final int PageSize;
final static int BlockSize = 128;
int[] exceptbuffer = new int[2 * BlockSize];
int[] sillybuffer = new int[2 * BlockSize];
public OptPFD() {
PageSize = 65536;
}
@Override
public void compress(int[] in, IntWrapper inpos, int inlength, int[] out,
IntWrapper outpos) {
// Util.assertTrue(inpos.get()+inlength <= in.length);
inlength = inlength / BlockSize * BlockSize;
final int finalinpos = inpos.get() + inlength;
out[outpos.get()] = inlength;
outpos.increment();
while (inpos.get() != finalinpos) {
int thissize = finalinpos > PageSize + inpos.get() ? PageSize
: (finalinpos - inpos.get());
encodePage(in, inpos, thissize, out, outpos);
}
}
public static final int[] bits = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
12, 13, 16, 20, 32 };
public static final int[] invbits = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
12, 13, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16,
16, 16, 16, 16 };
void getBestBFromData(int[] in, int pos, IntWrapper bestb,
IntWrapper bestexcept) {
final int mb = Util.maxbits(in, pos, BlockSize);
int mini = 0;
if (mini + 28 < bits[invbits[mb]])
mini = bits[invbits[mb]] - 28; // 28 is the max for exceptions
int besti = bits.length - 1;
int bestcost = bits[besti] * 4;
int exceptcounter = 0;
for (int i = mini; i < bits.length - 1; ++i) {
int tmpcounter = 0;
final int maxv = 1 << bits[i];
for (int k = pos; k < BlockSize + pos; ++k)
if (in[k] >= maxv) {
++tmpcounter;
}
if (tmpcounter == BlockSize)
continue; // no need
for (int k = pos, c = 0; k < pos + BlockSize; ++k)
if (in[k] >= maxv) {
exceptbuffer[tmpcounter + c] = k - pos;
exceptbuffer[c] = in[k] >>> bits[i];
++c;
}
final int thiscost = bits[i] * 4
+ S16.estimatecompress(exceptbuffer, 0, 2 * tmpcounter);
if (thiscost <= bestcost) {
bestcost = thiscost;
besti = i;
exceptcounter = tmpcounter;
}
}
bestb.set(besti);
bestexcept.set(exceptcounter);
}
private void encodePage(int[] in, IntWrapper inpos, int thissize,
int[] out, IntWrapper outpos) {
int tmpoutpos = outpos.get();
int tmpinpos = inpos.get();
IntWrapper bestb = new IntWrapper();
IntWrapper bestexcept = new IntWrapper();
for (final int finalinpos = tmpinpos + thissize; tmpinpos + BlockSize <= finalinpos; tmpinpos += BlockSize) {
getBestBFromData(in, tmpinpos, bestb, bestexcept);
int tmpbestb = bestb.get();
int nbrexcept = bestexcept.get();
int exceptsize = 0;
int remember = tmpoutpos;
tmpoutpos++;
if (nbrexcept > 0) {
final int maxv = 1 << bits[tmpbestb];
int c = 0;
for (int i = 0; i < BlockSize; ++i) {
if (in[tmpinpos + i] >= maxv) {
exceptbuffer[c + nbrexcept] = i;
exceptbuffer[c] = in[tmpinpos + i] >>> bits[tmpbestb];
++c;
}
}
exceptsize = S16.compress(exceptbuffer, 0, 2 * nbrexcept, out,
tmpoutpos);
tmpoutpos += exceptsize;
}
out[remember] = tmpbestb | (nbrexcept << 8) | (exceptsize << 16);
for (int k = 0; k < BlockSize; k += 32) {
BitPacking.fastpack(in, tmpinpos + k, out, tmpoutpos,
bits[tmpbestb]);
tmpoutpos += bits[tmpbestb];
}
}
inpos.set(tmpinpos);
outpos.set(tmpoutpos);
}
@Override
public void uncompress(int[] in, IntWrapper inpos, int inlength, int[] out,
IntWrapper outpos) {
// Util.assertTrue(inpos.get()+inlength <= in.length);
int mynvalue = in[inpos.get()];
inpos.increment();
int finalout = outpos.get() + mynvalue;
while (outpos.get() != finalout) {
int thissize = finalout > PageSize + outpos.get() ? PageSize
: (finalout - outpos.get());
decodePage(in, inpos, out, outpos, thissize);
}
}
private void decodePage(int[] in, IntWrapper inpos, int[] out,
IntWrapper outpos, int thissize) {
int tmpoutpos = outpos.get();
int tmpinpos = inpos.get();
for (int run = 0; run < thissize / BlockSize; ++run, tmpoutpos += BlockSize) {
final int b = in[tmpinpos] & 0xFF;
final int cexcept = (in[tmpinpos] >>> 8) & 0xFF;
final int exceptsize = (in[tmpinpos] >>> 16);
++tmpinpos;
S16.uncompress(in, tmpinpos, exceptsize, exceptbuffer, 0,
2 * cexcept);
tmpinpos += exceptsize;
for (int k = 0; k < BlockSize; k += 32) {
BitPacking
.fastunpack(in, tmpinpos, out, tmpoutpos + k, bits[b]);
tmpinpos += bits[b];
}
for (int k = 0; k < cexcept; ++k) {
out[tmpoutpos + exceptbuffer[k + cexcept]] |= (exceptbuffer[k] << bits[b]);
}
}
outpos.set(tmpoutpos);
inpos.set(tmpinpos);
}
@Override
public String toString() {
return this.getClass().getName();
}
}