public LocationPathExpr(){ state = START; s = null; pathType = RELATIVE_PATH; currentStep = null; //fib = new FastIntBuffer(8);// page size 256 = 2^ 8 ih = new intHash(); } final public void optimize2(){}
public FunctionalLocationPathExpr(FuncExpr fne1){ state = START; s = null; pathType = FUNC_PATH; currentStep = null; fne = fne1; //fib = new FastIntBuffer(8);// page size 256 = 2^ 8 ih = new intHash(); } public String toString(){
public FunctionalLocationPathExpr(FuncExpr fne1){ state = START; s = null; pathType = FUNC_PATH; currentStep = null; fne = fne1; //fib = new FastIntBuffer(8);// page size 256 = 2^ 8 ih = new intHash(); } public String toString(){
public LocationPathExpr(){ state = START; s = null; pathType = RELATIVE_PATH; currentStep = null; //fib = new FastIntBuffer(8);// page size 256 = 2^ 8 ih = new intHash(); } final public void optimize2(){}
public PathExpr(Expr f, LocationPathExpr l){ fe = f; lpe = l; //first_time = true; evalState = 0; //fib = new FastIntBuffer(8); ih = new intHash(); }
public LocationPathExpr(){ state = START; s = null; pathType = RELATIVE_PATH; currentStep = null; //fib = new FastIntBuffer(8);// page size 256 = 2^ 8 ih = new intHash(); } final public void optimize2(){}
public PathExpr(Expr f, LocationPathExpr l){ fe = f; lpe = l; //first_time = true; evalState = 0; //fib = new FastIntBuffer(8); ih = new intHash(); }
public PathExpr(Expr f, LocationPathExpr l){ fe = f; lpe = l; //first_time = true; evalState = 0; //fib = new FastIntBuffer(8); ih = new intHash(); }
public FunctionalLocationPathExpr(FuncExpr fne1){ state = START; s = null; pathType = FUNC_PATH; currentStep = null; fne = fne1; //fib = new FastIntBuffer(8);// page size 256 = 2^ 8 ih = new intHash(); } public String toString(){
public static void main(String[] args) { intHash a = new intHash(6); for(int i=0;i<667;i++) System.out.println("" + i + " " + a.isUnique(i)); for(int i=0;i<667;i++) System.out.println("" + i + " " + a.isUnique(i)); }
public static void main(String[] args) { intHash a = new intHash(6); for(int i=0;i<667;i++) System.out.println("" + i + " " + a.isUnique(i)); for(int i=0;i<667;i++) System.out.println("" + i + " " + a.isUnique(i)); }
final public int adjust(int n){ int i = fe.adjust(n); lpe.adjust(n); if (ih!=null && i==ih.e) {} else ih = new intHash(i); return i; }
final public int adjust(int n){ int i = fe.adjust(n); lpe.adjust(n); if (ih!=null && i==ih.e) {} else ih = new intHash(i); return i; }
final public int adjust(int n){ int i = fe.adjust(n); lpe.adjust(n); if (ih!=null && i==ih.e) {} else ih = new intHash(i); return i; }
final public int adjust(int n){ int i = e.adjust(n); if (this.next == null) return i; // no need to create hash table here if (ih!=null && i==ih.e) {} else ih = new intHash(i); UnionExpr tmp = this.next; while (tmp != null) { tmp.e.adjust(n); tmp = tmp.next; } return i; }
final public int adjust(int n){ int i = e.adjust(n); if (this.next == null) return i; // no need to create hash table here if (ih!=null && i==ih.e) {} else ih = new intHash(i); UnionExpr tmp = this.next; while (tmp != null) { tmp.e.adjust(n); tmp = tmp.next; } return i; }
final public int adjust(int n){ int i = e.adjust(n); if (this.next == null) return i; // no need to create hash table here if (ih!=null && i==ih.e) {} else ih = new intHash(i); UnionExpr tmp = this.next; while (tmp != null) { tmp.e.adjust(n); tmp = tmp.next; } return i; }
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; }