public List getParamterTypes() { int size = getParameterCount(); if (size <= 0) { return Collections.EMPTY_LIST; } List params = new ArrayList(size); for (int i = 0; i < size; i++) { params.add(getParameterType(i)); } return params; }
public boolean equals(MethodKey that) { int size; if (sender!=that.sender) return false; if (isCallToSuper!=that.isCallToSuper) return false; if (!name.equals(that.name)) return false; if ((size = getParameterCount()) != that.getParameterCount()) return false; for (int i = 0; i < size; i++) { if (getParameterType(i) != that.getParameterType(i)) { return false; } } return true; }
protected int createHashCode() { int answer = name.hashCode(); int size = getParameterCount(); /** @todo we should use the real Josh Bloch algorithm here */ // can't remember the exact Josh Bloch algorithm and I've not got the book handy // but its something like this IIRC for (int i = 0; i < size; i++) { answer *= 37; answer += 1 + getParameterType(i).hashCode(); } answer *= 37; answer += isCallToSuper?1:0; answer *= 37; answer += 1 + sender.hashCode(); return answer; } }
/** * Creates an immutable copy that we can cache. */ public MethodKey createCopy() { int size = getParameterCount(); Class[] paramTypes = new Class[size]; for (int i = 0; i < size; i++) { paramTypes[i] = getParameterType(i); } return new DefaultMethodKey(sender, name, paramTypes, isCallToSuper); }
public List getParamterTypes() { int size = getParameterCount(); if (size <= 0) { return Collections.EMPTY_LIST; } List params = new ArrayList(size); for (int i = 0; i < size; i++) { params.add(getParameterType(i)); } return params; }
public List getParamterTypes() { int size = getParameterCount(); if (size <= 0) { return Collections.EMPTY_LIST; } List params = new ArrayList(size); for (int i = 0; i < size; i++) { params.add(getParameterType(i)); } return params; }
public List getParamterTypes() { int size = getParameterCount(); if (size <= 0) { return Collections.EMPTY_LIST; } List params = new ArrayList(size); for (int i = 0; i < size; i++) { params.add(getParameterType(i)); } return params; }
public boolean equals(MethodKey that) { int size; if (sender!=that.sender) return false; if (isCallToSuper!=that.isCallToSuper) return false; if (!name.equals(that.name)) return false; if ((size = getParameterCount()) != that.getParameterCount()) return false; for (int i = 0; i < size; i++) { if (getParameterType(i) != that.getParameterType(i)) { return false; } } return true; }
public boolean equals(MethodKey that) { int size; if (sender!=that.sender) return false; if (isCallToSuper!=that.isCallToSuper) return false; if (!name.equals(that.name)) return false; if ((size = getParameterCount()) != that.getParameterCount()) return false; for (int i = 0; i < size; i++) { if (getParameterType(i) != that.getParameterType(i)) { return false; } } return true; }
public List getParamterTypes() { int size = getParameterCount(); if (size <= 0) { return Collections.EMPTY_LIST; } List params = new ArrayList(size); for (int i = 0; i < size; i++) { params.add(getParameterType(i)); } return params; }
public boolean equals(MethodKey that) { int size; if (sender!=that.sender) return false; if (isCallToSuper!=that.isCallToSuper) return false; if (!name.equals(that.name)) return false; if ((size = getParameterCount()) != that.getParameterCount()) return false; for (int i = 0; i < size; i++) { if (getParameterType(i) != that.getParameterType(i)) { return false; } } return true; }
public boolean equals(MethodKey that) { int size; if (sender!=that.sender) return false; if (isCallToSuper!=that.isCallToSuper) return false; if (!name.equals(that.name)) return false; if ((size = getParameterCount()) != that.getParameterCount()) return false; for (int i = 0; i < size; i++) { if (getParameterType(i) != that.getParameterType(i)) { return false; } } return true; }
protected int createHashCode() { int answer = name.hashCode(); int size = getParameterCount(); /** @todo we should use the real Josh Bloch algorithm here */ // can't remember the exact Josh Bloch algorithm and I've not got the book handy // but its something like this IIRC for (int i = 0; i < size; i++) { answer *= 37; answer += 1 + getParameterType(i).hashCode(); } answer *= 37; answer += isCallToSuper?1:0; answer *= 37; answer += 1 + sender.hashCode(); return answer; } }
protected int createHashCode() { int answer = name.hashCode(); int size = getParameterCount(); /** @todo we should use the real Josh Bloch algorithm here */ // can't remember the exact Josh Bloch algorithm and I've not got the book handy // but its something like this IIRC for (int i = 0; i < size; i++) { answer *= 37; answer += 1 + getParameterType(i).hashCode(); } answer *= 37; answer += isCallToSuper?1:0; answer *= 37; answer += 1 + sender.hashCode(); return answer; } }
protected int createHashCode() { int answer = name.hashCode(); int size = getParameterCount(); /** @todo we should use the real Josh Bloch algorithm here */ // can't remember the exact Josh Bloch algorithm and I've not got the book handy // but its something like this IIRC for (int i = 0; i < size; i++) { answer *= 37; answer += 1 + getParameterType(i).hashCode(); } answer *= 37; answer += isCallToSuper?1:0; answer *= 37; answer += 1 + sender.hashCode(); return answer; } }
protected int createHashCode() { int answer = name.hashCode(); int size = getParameterCount(); /** @todo we should use the real Josh Bloch algorithm here */ // can't remember the exact Josh Bloch algorithm and I've not got the book handy // but its something like this IIRC for (int i = 0; i < size; i++) { answer *= 37; answer += 1 + getParameterType(i).hashCode(); } answer *= 37; answer += isCallToSuper?1:0; answer *= 37; answer += 1 + sender.hashCode(); return answer; } }
/** * Creates an immutable copy that we can cache. */ public MethodKey createCopy() { int size = getParameterCount(); Class[] paramTypes = new Class[size]; for (int i = 0; i < size; i++) { paramTypes[i] = getParameterType(i); } return new DefaultMethodKey(sender, name, paramTypes, isCallToSuper); }
/** * Creates an immutable copy that we can cache. */ public MethodKey createCopy() { int size = getParameterCount(); Class[] paramTypes = new Class[size]; for (int i = 0; i < size; i++) { paramTypes[i] = getParameterType(i); } return new DefaultMethodKey(sender, name, paramTypes, isCallToSuper); }
/** * Creates an immutable copy that we can cache. */ public MethodKey createCopy() { int size = getParameterCount(); Class[] paramTypes = new Class[size]; for (int i = 0; i < size; i++) { paramTypes[i] = getParameterType(i); } return new DefaultMethodKey(sender, name, paramTypes, isCallToSuper); }
/** * Creates an immutable copy that we can cache. */ public MethodKey createCopy() { int size = getParameterCount(); Class[] paramTypes = new Class[size]; for (int i = 0; i < size; i++) { paramTypes[i] = getParameterType(i); } return new DefaultMethodKey(sender, name, paramTypes, isCallToSuper); }