final public int adjust(int n) { int i; if (pathType == RELATIVE_PATH) { i = Math.min(intHash.determineHashWidth(n),11); // hash width 64 } else { i = intHash.determineHashWidth(n); } if (ih!=null && i<= ih.e) {} else ih = new intHash(i); Step temp = s; while(temp!=null){ temp.adjust(n); temp = temp.nextS; } return i; }
final public int adjust(int n) { int i; if (pathType == RELATIVE_PATH) { i = Math.min(intHash.determineHashWidth(n),6); // hash width 64 } else { i = intHash.determineHashWidth(n); } if (ih!=null && i<= ih.e) {} else ih = new intHash(i); Step temp = s; while(temp!=null){ temp.adjust(n); temp = temp.nextS; } return i; }
final public int adjust(int n) { int i; if (pathType == RELATIVE_PATH) { i = Math.min(intHash.determineHashWidth(n),6); // hash width 64 } else { i = intHash.determineHashWidth(n); } if (ih!=null && i<= ih.e) {} else ih = new intHash(i); Step temp = s; while(temp!=null){ temp.adjust(n); temp = temp.nextS; } return i; }
flb = new FastLongBuffer(); fob = new FastObjectBuffer(); int i = intHash.determineHashWidth(md.vtdSize); insertHash = new intHash(i); deleteHash = new intHash(i);
flb = new FastLongBuffer(); fob = new FastObjectBuffer(); int i = intHash.determineHashWidth(md.vtdSize); insertHash = new intHash(i); deleteHash = new intHash(i);
flb = new FastLongBuffer(); fob = new FastObjectBuffer(); int i = intHash.determineHashWidth(md.vtdSize); insertHash = new intHash(i); deleteHash = new intHash(i);