buf.get(p.hashloc);
p.pos = 0;
p.len = Main.CHUNK_LENGTH;
p.nlen = p.len;
p.offset = 0;
<BUG>ar.add(p);
} else if (version == 1) {</BUG>
this.doop = buf.getInt();
<BUG>ar = new ArrayList<HashLocPair>();
byte[] hash = new byte[HashFunctionPool.hashLength * HashFunctionPool.max_hash_cluster];</BUG>
buf.get(hash);

buf.get(p.hashloc);
p.pos = 0;
p.len = Main.CHUNK_LENGTH;
p.nlen = p.len;
p.offset = 0;
ar.put(p.pos,p);
} else if (version == 1) {
this.doop = buf.getInt();
ar = new TreeMap<Integer,HashLocPair>();
byte[] hash = new byte[HashFunctionPool.hashLength * HashFunctionPool.max_hash_cluster];
buf.get(hash);
