private int chainlength(byte[] b) { Hasher h = new Hasher(b, b.length); int hash = h.hash(); final int msk = mask; int i = hash & msk; final byte[][] tbl = table; byte[] obj; int n = 0; while ((obj = tbl[i]) != null) { if (equals(obj, b, b.length)) return n; i = (i + 1) & msk; ++n; } return -1; }
private int chainlength(byte[] b) { Hasher h = new Hasher(b, b.length); int hash = h.hash(); final int msk = mask; int i = hash & msk; final byte[][] tbl = table; byte[] obj; int n = 0; while ((obj = tbl[i]) != null) { if (equals(obj, b, b.length)) return n; i = (i + 1) & msk; ++n; } return -1; }
private void grow() { final byte[][] oldTable = table; final int oldSize = table.length; initTable(oldSize << 1); for (int i = 0; i < oldSize; i++) { final byte[] obj = oldTable[i]; if (obj != null) { hasher.init(obj, obj.length); insert(obj, hasher.hash()); } } }
private void grow() { final byte[][] oldTable = table; final int oldSize = table.length; initTable(oldSize << 1); for (int i = 0; i < oldSize; i++) { final byte[] obj = oldTable[i]; if (obj != null) { hasher.init(obj, obj.length); insert(obj, hasher.hash()); } } }
private int chainlength(byte[] b) { Hasher h = new Hasher(b, b.length); int hash = h.hash(); final int msk = mask; int i = hash & msk; final byte[][] tbl = table; byte[] obj; int n = 0; while ((obj = tbl[i]) != null) { if (equals(obj, b, b.length)) return n; i = (i + 1) & msk; ++n; } return -1; }
private void grow() { final byte[][] oldTable = table; final int oldSize = table.length; initTable(oldSize << 1); for (int i = 0; i < oldSize; i++) { final byte[] obj = oldTable[i]; if (obj != null) { hasher.init(obj, obj.length); insert(obj, hasher.hash()); } } }