public char[][] add(char[][] qualifiedName) { int qLength = qualifiedName.length; if (qLength == 0) return CharOperation.NO_CHAR_CHAR; int length = this.qualifiedNames.length; int index = CharOperation.hashCode(qualifiedName[qLength - 1]) % length; char[][] current; while ((current = this.qualifiedNames[index]) != null) { if (CharOperation.equals(current, qualifiedName)) return current; if (++index == length) index = 0; } this.qualifiedNames[index] = qualifiedName; // assumes the threshold is never equal to the size of the table if (++this.elementSize > this.threshold) rehash(); return qualifiedName; }
public char[][] add(char[][] qualifiedName) { int qLength = qualifiedName.length; if (qLength == 0) return CharOperation.NO_CHAR_CHAR; int length = this.qualifiedNames.length; int index = CharOperation.hashCode(qualifiedName[qLength - 1]) % length; char[][] current; while ((current = this.qualifiedNames[index]) != null) { if (CharOperation.equals(current, qualifiedName)) return current; if (++index == length) index = 0; } this.qualifiedNames[index] = qualifiedName; // assumes the threshold is never equal to the size of the table if (++this.elementSize > this.threshold) rehash(); return qualifiedName; }
public char[][] add(char[][] qualifiedName) { int qLength = qualifiedName.length; if (qLength == 0) return CharOperation.NO_CHAR_CHAR; int length = this.qualifiedNames.length; int index = CharOperation.hashCode(qualifiedName[qLength - 1]) % length; char[][] current; while ((current = this.qualifiedNames[index]) != null) { if (CharOperation.equals(current, qualifiedName)) return current; if (++index == length) index = 0; } this.qualifiedNames[index] = qualifiedName; // assumes the threshold is never equal to the size of the table if (++this.elementSize > this.threshold) rehash(); return qualifiedName; }
public char[][] add(char[][] qualifiedName) { int qLength = qualifiedName.length; if (qLength == 0) return CharOperation.NO_CHAR_CHAR; int length = this.qualifiedNames.length; int index = CharOperation.hashCode(qualifiedName[qLength - 1]) % length; char[][] current; while ((current = this.qualifiedNames[index]) != null) { if (CharOperation.equals(current, qualifiedName)) return current; if (++index == length) index = 0; } this.qualifiedNames[index] = qualifiedName; // assumes the threshold is never equal to the size of the table if (++this.elementSize > this.threshold) rehash(); return qualifiedName; }
public char[][] add(char[][] qualifiedName) { int qLength = qualifiedName.length; if (qLength == 0) return CharOperation.NO_CHAR_CHAR; int length = this.qualifiedNames.length; int index = CharOperation.hashCode(qualifiedName[qLength - 1]) % length; char[][] current; while ((current = this.qualifiedNames[index]) != null) { if (CharOperation.equals(current, qualifiedName)) return current; if (++index == length) index = 0; } this.qualifiedNames[index] = qualifiedName; // assumes the threshold is never equal to the size of the table if (++this.elementSize > this.threshold) rehash(); return qualifiedName; }
public char[][] add(char[][] qualifiedName) { int qLength = qualifiedName.length; if (qLength == 0) return CharOperation.NO_CHAR_CHAR; int length = this.qualifiedNames.length; int index = CharOperation.hashCode(qualifiedName[qLength - 1]) % length; char[][] current; while ((current = this.qualifiedNames[index]) != null) { if (CharOperation.equals(current, qualifiedName)) return current; if (++index == length) index = 0; } this.qualifiedNames[index] = qualifiedName; // assumes the threshold is never equal to the size of the table if (++this.elementSize > this.threshold) rehash(); return qualifiedName; }