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
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
|
/**
* ============LICENSE_START====================================================
* org.onap.aaf
* ===========================================================================
* Copyright (c) 2018 AT&T Intellectual Property. All rights reserved.
* ===========================================================================
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
* ============LICENSE_END====================================================
*
*/
package org.onap.aaf.auth.local;
import java.io.File;
import java.io.IOException;
import java.io.RandomAccessFile;
import java.nio.ByteBuffer;
import java.nio.IntBuffer;
import java.nio.channels.FileChannel;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedList;
import java.util.List;
import org.onap.aaf.auth.local.DataFile.Token;
import org.onap.aaf.auth.local.DataFile.Token.Field;
import org.onap.aaf.misc.env.Env;
import org.onap.aaf.misc.env.TimeTaken;
import org.onap.aaf.misc.env.Trans;
public class TextIndex {
private static final int REC_SIZE=8;
private File file;
private DataFile dataFile=null;
public TextIndex(File theFile) {
file = theFile;
}
public void open() throws IOException {
dataFile = new DataFile(file,"r");
dataFile.open();
}
public void close() throws IOException {
if (dataFile!=null) {
dataFile.close();
dataFile=null;
}
}
public int find(Object key, AbsData.Reuse reuse, int offset) throws IOException {
return find(key,reuse.tokenData,reuse.getFieldData(),offset);
}
public int find(Object key, DataFile.Token dtok, Field df, int offset) throws IOException {
if (dataFile==null) {
throw new IOException("File not opened");
}
long hash = hashToLong(key.hashCode());
int min=0, max = (int)(dataFile.size()/REC_SIZE);
Token ttok = dataFile.new Token(REC_SIZE);
IntBuffer tib = ttok.getIntBuffer();
long lhash;
int curr;
while ((max-min)>100) {
ttok.pos((curr=(min+(max-min)/2))*REC_SIZE);
tib.rewind();
lhash = hashToLong(tib.get());
if (lhash<hash) {
min=curr+1;
} else if (lhash>hash) {
max=curr-1;
} else {
min=curr-40;
max=curr+40;
break;
}
}
List<Integer> entries = new ArrayList<>();
for (int i=min;i<=max;++i) {
ttok.pos(i*REC_SIZE);
tib.rewind();
lhash = hashToLong(tib.get());
if (lhash==hash) {
entries.add(tib.get());
} else if (lhash>hash) {
break;
}
}
for (Integer i : entries) {
dtok.pos(i);
if (df.at(offset).equals(key)) {
return i;
}
}
return -1;
}
/*
* Have to change Bytes into a Long, to avoid the inevitable signs in the Hash
*/
private static long hashToLong(int hash) {
long rv;
if (hash<0) {
rv = 0xFFFFFFFFL & hash;
} else {
rv = hash;
}
return rv;
}
public void create(final Trans trans,final DataFile data, int maxLine, char delim, int fieldOffset, int skipLines) throws IOException {
FileChannel fos;
List<Idx> list = new LinkedList<>(); // Some hashcodes will double... DO NOT make a set
TimeTaken tt2 = trans.start("Open Files", Env.SUB);
RandomAccessFile raf=null;
try {
try {
raf = new RandomAccessFile(file,"rw");
raf.setLength(0L);
fos = raf.getChannel();
} finally {
tt2.done();
}
try {
Token t = data.new Token(maxLine);
Field f = t.new Field(delim);
int count = 0;
if (skipLines>0) {
trans.info().log("Skipping",skipLines,"line"+(skipLines==1?" in":"s in"),data.file().getName());
}
for (int i=0;i<skipLines;++i) {
t.nextLine();
}
tt2 = trans.start("Read", Env.SUB);
try {
while (t.nextLine()) {
list.add(new Idx(f.at(fieldOffset),t.pos()));
++count;
}
} finally {
tt2.done();
}
trans.checkpoint(" Read " + count + " records");
tt2 = trans.start("Sort List", Env.SUB);
Collections.sort(list);
tt2.done();
tt2 = trans.start("Write Idx", Env.SUB);
try {
ByteBuffer bb = ByteBuffer.allocate(8*1024);
IntBuffer ib = bb.asIntBuffer();
for (Idx idx : list) {
if (!ib.hasRemaining()) {
fos.write(bb);
ib.clear();
bb.rewind();
}
ib.put(idx.hash);
ib.put(idx.pos);
}
bb.limit(4*ib.position());
fos.write(bb);
} finally {
tt2.done();
}
} finally {
fos.close();
}
} finally {
if (raf!=null) {
raf.close(); // closed by fos
}
}
}
public class Iter {
private int idx;
private Token t;
private long end;
private IntBuffer ib;
public Iter() {
try {
idx = 0;
end = dataFile.size();
t = dataFile.new Token(REC_SIZE);
ib = t.getIntBuffer();
} catch (IOException e) {
end = -1L;
}
}
public int next() {
t.pos(idx);
ib.clear();
ib.get();
int rec = ib.get();
idx += REC_SIZE;
return rec;
}
public boolean hasNext() {
return idx<end;
}
}
private static class Idx implements Comparable<Idx> {
public int hash, pos;
public Idx(Object obj, int pos) {
hash = obj.hashCode();
this.pos = pos;
}
@Override
public int compareTo(Idx ib) {
long a = hashToLong(hash);
long b = hashToLong(ib.hash);
return a>b?1:a<b?-1:0;
}
/* (non-Javadoc)
* @see java.lang.Object#equals(java.lang.Object)
*/
@Override
public boolean equals(Object o) {
if (o!=null && o instanceof Idx) {
return hash == ((Idx)o).hash;
}
return false;
}
/* (non-Javadoc)
* @see java.lang.Object#hashCode()
*/
@Override
public int hashCode() {
return hash;
}
}
}
|