public HashableWeakReference(char[] referent, ReferenceQueue queue) { super(referent, queue); this.hashCode = CharOperation.hashCode(referent); } @Override
@Override public int hashCode() { return CharOperation.hashCode(this.targetModule); } }
public HashableWeakReference(char[] referent, ReferenceQueue queue) { super(referent, queue); this.hashCode = CharOperation.hashCode(referent); } public boolean equals(Object obj) {
public HashableWeakReference(char[] referent, ReferenceQueue queue) { super(referent, queue); this.hashCode = CharOperation.hashCode(referent); } public boolean equals(Object obj) {
public HashableWeakReference(char[] referent, ReferenceQueue queue) { super(referent, queue); this.hashCode = CharOperation.hashCode(referent); } public boolean equals(Object obj) {
public int hashCode() { final int prime = 31; int result = 1; result = prime * result + CharOperation.hashCode(this.name); result = prime * result + ((this.value == null) ? 0 : this.value.hashCode()); return result; } public boolean equals(Object obj) {
public int hashCode() { // ensure ReferenceBindings hash to the same position as UnresolvedReferenceBindings so they can be replaced without rehashing // ALL ReferenceBindings are unique when created so equals() is the same as == return (this.compoundName == null || this.compoundName.length == 0) ? super.hashCode() : CharOperation.hashCode(this.compoundName[this.compoundName.length - 1]); }
public int hashCode() { if (this.compoundName == null) return super.hashCode(); int hashCode = 0; for (int i = 0, length = this.compoundName.length; i < length; i++) hashCode += CharOperation.hashCode(this.compoundName[i]); return hashCode; } public boolean ignoreOptionalProblems() {
public int hashCode() { // ensure ReferenceBindings hash to the same posiiton as UnresolvedReferenceBindings so they can be replaced without rehashing // ALL ReferenceBindings are unique when created so equals() is the same as == return (this.compoundName == null || this.compoundName.length == 0) ? super.hashCode() : CharOperation.hashCode(this.compoundName[this.compoundName.length - 1]); }
public int hashCode() { if (this.compoundName == null) return super.hashCode(); int hashCode = 0; for (int i = 0, length = this.compoundName.length; i < length; i++) hashCode += CharOperation.hashCode(this.compoundName[i]); return hashCode; } void setSimilarMatch(PossibleMatch possibleMatch) {
public int hashCode() { final int prime = 31; int result = 1; result = prime * result + Util.hashCode(this.pairs); result = prime * result + CharOperation.hashCode(this.typename); return result; } public boolean equals(Object obj) {
public boolean includes(char[] object) { int length = this.values.length; int index = (CharOperation.hashCode(object) & 0x7FFFFFFF) % length; char[] current; while ((current = this.values[index]) != null) { if (CharOperation.equals(current, object)) return true; if (++index == length) index = 0; } return false; }
private int hashCode(char[][] element, int length) { int hash = 0; for (int i = length-1; i >= 0; i--) hash = Util.combineHashCodes(hash, CharOperation.hashCode(element[i])); return hash & 0x7FFFFFFF; }
public int hashCode() { final int prime = 31; int result = 1; result = prime * result + Util.hashCode(this.pairs); result = prime * result + CharOperation.hashCode(this.typename); return result; } public boolean equals(Object obj) {
private int hashCode(char[][] element, int length) { int hash = 0; for (int i = length-1; i >= 0; i--) hash = Util.combineHashCodes(hash, CharOperation.hashCode(element[i])); return hash & 0x7FFFFFFF; }
public boolean includes(char[] object) { int length = this.values.length; int index = (CharOperation.hashCode(object) & 0x7FFFFFFF) % length; char[] current; while ((current = this.values[index]) != null) { if (CharOperation.equals(current, object)) return true; if (++index == length) index = 0; } return false; }
public boolean includes(char[] object) { int length = this.values.length; int index = (CharOperation.hashCode(object) & 0x7FFFFFFF) % length; char[] current; while ((current = this.values[index]) != null) { if (CharOperation.equals(current, object)) return true; if (++index == length) index = 0; } return false; }
public boolean includes(char[] object) { int length = this.values.length; int index = (CharOperation.hashCode(object) & 0x7FFFFFFF) % length; char[] current; while ((current = this.values[index]) != null) { if (CharOperation.equals(current, object)) return true; if (++index == length) index = 0; } return false; }