| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 146 | 2 | 3 | 0.991 | compilation_unit |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 146 | 11 | plugins/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/util/HashtableOfObjectToInt.java |
| 2 | 146 | 11 | plugins/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/util/HashtableOfObjectToIntArray.java |
| ||||
/*******************************************************************************
* Copyright (c) 2000, 2006 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.jdt.internal.compiler.util;
/**
* Hashtable of {Object --> int }
*/
public final class HashtableOfObjectToInt implements Cloneable {
// to avoid using Enumerations, walk the individual tables skipping nulls
public Object[] keyTable;
public int[] valueTable;
public int elementSize; // number of elements in the table
int threshold;
public HashtableOfObjectToInt() {
this(13);
}
public HashtableOfObjectToInt(int size) {
this.elementSize = 0;
this.threshold = size; // size represents the expected number of elements
int extraRoom = (int) (size * 1.75F);
if (this.threshold == extraRoom)
extraRoom++;
this.keyTable = new Object[extraRoom];
this.valueTable = new int[extraRoom];
}
public Object clone() throws CloneNotSupportedException {
HashtableOfObjectToInt result = (HashtableOfObjectToInt) super.clone();
result.elementSize = this.elementSize;
result.threshold = this.threshold;
int length = this.keyTable.length;
result.keyTable = new Object[length];
System.arraycopy(this.keyTable, 0, result.keyTable, 0, length);
length = this.valueTable.length;
result.valueTable = new int[length];
System.arraycopy(this.valueTable, 0, result.valueTable, 0, length);
return result;
}
public boolean containsKey(Object key) {
int length = this.keyTable.length,
index = (key.hashCode()& 0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key))
return true;
if ( ++index == length) {
index = 0;
}
}
return false;
}
public int get(Object key) {
int length = this.keyTable.length,
index = (key.hashCode()& 0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key))
return this.valueTable[index];
if ( ++index == length) {
index = 0;
}
}
return -1;
}
public void keysToArray(Object[] array) {
int index = 0;
for (int i = 0,length = this.keyTable.length; i < length; i++) {
if (this.keyTable[i] != null)
array[index++ ] = this.keyTable[i];
}
}
public int put(Object key, int value) {
int length = this.keyTable.length,
index = (key.hashCode()& 0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key))
return this.valueTable[index] = value;
if ( ++index == length) {
index = 0;
}
}
this.keyTable[index] = key;
this.valueTable[index] = value;
// assumes the threshold is never equal to the size of the table
if ( ++elementSize > threshold)
rehash();
return value;
}
public int removeKey(Object key) {
int length = this.keyTable.length,
index = (key.hashCode()& 0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key)) {
int value = this.valueTable[index];
elementSize--;
this.keyTable[index] = null;
rehash();
return value;
}
if ( ++index == length) {
index = 0;
}
}
return -1;
}
private void rehash() {
HashtableOfObjectToInt newHashtable = new HashtableOfObjectToInt(elementSize * 2); // double the number of expected elements
Object currentKey;
for (int i = this.keyTable.length; --i >= 0;)
if ((currentKey = this.keyTable[i]) != null)
newHashtable.put(currentKey, this.valueTable[i]);
this.keyTable = newHashtable.keyTable;
this.valueTable = newHashtable.valueTable;
this.threshold = newHashtable.threshold;
}
public int size() {
return elementSize;
}
public String toString() {
String s = ""; //$NON-NLS-1$
Object key;
for (int i = 0, length = this.keyTable.length; i < length; i++)
if ((key = this.keyTable[i]) != null)
s += key + " -> " + this.valueTable[i] + "\n"; //$NON-NLS-2$ //$NON-NLS-1$
return s;
}
}
|
| ||||
/*******************************************************************************
* Copyright (c) 2000, 2006 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.jdt.internal.compiler.util;
/**
* Hashtable of {Object --> int[] }
*/
public final class HashtableOfObjectToIntArray implements Cloneable {
// to avoid using Enumerations, walk the individual tables skipping nulls
public Object[] keyTable;
public int[][] valueTable;
public int elementSize; // number of elements in the table
int threshold;
public HashtableOfObjectToIntArray() {
this(13);
}
public HashtableOfObjectToIntArray(int size) {
this.elementSize = 0;
this.threshold = size; // size represents the expected number of elements
int extraRoom = (int) (size * 1.75F);
if (this.threshold == extraRoom)
extraRoom++;
this.keyTable = new Object[extraRoom];
this.valueTable = new int[extraRoom][];
}
public Object clone() throws CloneNotSupportedException {
HashtableOfObjectToIntArray result = (HashtableOfObjectToIntArray) super.clone();
result.elementSize = this.elementSize;
result.threshold = this.threshold;
int length = this.keyTable.length;
result.keyTable = new Object[length];
System.arraycopy(this.keyTable, 0, result.keyTable, 0, length);
length = this.valueTable.length;
result.valueTable = new int[length][];
System.arraycopy(this.valueTable, 0, result.valueTable, 0, length);
return result;
}
public boolean containsKey(Object key) {
int length = this.keyTable.length,
index = (key.hashCode()& 0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key))
return true;
if ( ++index == length) {
index = 0;
}
}
return false;
}
public int[] get(Object key) {
int length = this.keyTable.length,
index = (key.hashCode()& 0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key))
return this.valueTable[index];
if ( ++index == length) {
index = 0;
}
}
return null;
}
public void keysToArray(Object[] array) {
int index = 0;
for (int i = 0,length = this.keyTable.length; i < length; i++) {
if (this.keyTable[i] != null)
array[index++ ] = this.keyTable[i];
}
}
public int[] put(Object key, int[] value) {
int length = this.keyTable.length,
index = (key.hashCode()& 0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key))
return this.valueTable[index] = value;
if ( ++index == length) {
index = 0;
}
}
this.keyTable[index] = key;
this.valueTable[index] = value;
// assumes the threshold is never equal to the size of the table
if ( ++elementSize > threshold)
rehash();
return value;
}
public int[] removeKey(Object key) {
int length = this.keyTable.length,
index = (key.hashCode()& 0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key)) {
int[] value = this.valueTable[index];
elementSize--;
this.keyTable[index] = null;
rehash();
return value;
}
if ( ++index == length) {
index = 0;
}
}
return null;
}
private void rehash() {
HashtableOfObjectToIntArray newHashtable = new HashtableOfObjectToIntArray(elementSize * 2); // double the number of expected elements
Object currentKey;
for (int i = this.keyTable.length; --i >= 0;)
if ((currentKey = this.keyTable[i]) != null)
newHashtable.put(currentKey, this.valueTable[i]);
this.keyTable = newHashtable.keyTable;
this.valueTable = newHashtable.valueTable;
this.threshold = newHashtable.threshold;
}
public int size() {
return elementSize;
}
public String toString() {
String s = ""; //$NON-NLS-1$
Object key;
for (int i = 0, length = this.keyTable.length; i < length; i++)
if ((key = this.keyTable[i]) != null)
s += key + " -> " + this.valueTable[i] + "\n"; //$NON-NLS-2$ //$NON-NLS-1$
return s;
}
}
|
| |||
/*******************************************************************************
* Copyright (c) 2000, 2006 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.jdt.internal.compiler.util;
/**
* Hashtable of {Object --> int }
*/
/**
* Hashtable of {Object --> int[] }
*/
public final class [[#variable5e5e6940]]implements Cloneable {
// to avoid using Enumerations, walk the individual tables skipping nulls
public Object[] keyTable;
public int [[#variable5e5e6880]][] valueTable;
public int elementSize; // number of elements in the table
int threshold;
public [[#variable5e5e6940]]() {
this(13);
}
public [[#variable5e5e6940]](int size) {
this.elementSize = 0;
this.threshold = size; // size represents the expected number of elements
int extraRoom = (int) (size * 1.75F);
if (this.threshold == extraRoom)
extraRoom++;
this.keyTable = new Object[extraRoom];
this.valueTable = new int[extraRoom] [[#variable5e5e6880]];
}
public Object clone() throws CloneNotSupportedException {
[[#variable5e5e6940]] result = ( [[#variable5e5e6940]]) super.clone();
result.elementSize = this.elementSize;
result.threshold = this.threshold;
int length = this.keyTable.length;
result.keyTable = new Object[length];
System.arraycopy(this.keyTable, 0, result.keyTable, 0, length);
length = this.valueTable.length;
result.valueTable = new int[length] [[#variable5e5e6880]];
System.arraycopy(this.valueTable, 0, result.valueTable, 0, length);
return result;
}
public boolean containsKey(Object key) {
int length = this.keyTable.length, index = (key.hashCode()&0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key))
return true;
if ( ++index == length) {
index = 0;
}
}
return false;
}
public int [[#variable5e5e6880]] get(Object key) {
int length = this.keyTable.length, index = (key.hashCode()&0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key))
return this.valueTable[index];
if ( ++index == length) {
index = 0;
}
}
return [[#variable5e5e6760]];
}
public void keysToArray(Object[] array) {
int index = 0;
for (int i = 0, length = this.keyTable.length; i < length; i++) {
if (this.keyTable[i] != null)
array[index++ ] = this.keyTable[i];
}
}
public int [[#variable5e5e6880]] put(Object key, int [[#variable5e5e6880]] value) {
int length = this.keyTable.length, index = (key.hashCode()&0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key))
return this.valueTable[index] = value;
if ( ++index == length) {
index = 0;
}
}
this.keyTable[index] = key;
this.valueTable[index] = value;
// assumes the threshold is never equal to the size of the table
if ( ++elementSize > threshold)
rehash();
return value;
}
public int [[#variable5e5e6880]] removeKey(Object key) {
int length = this.keyTable.length, index = (key.hashCode()&0x7fffffff) % length;
Object currentKey;
while ((currentKey = this.keyTable[index]) != null) {
if (currentKey.equals(key)) {
int [[#variable5e5e6880]] value = this.valueTable[index];
elementSize--;
this.keyTable[index] = null;
rehash();
return value;
}
if ( ++index == length) {
index = 0;
}
}
return [[#variable5e5e6760]];
}
private void rehash() {
[[#variable5e5e6940]] newHashtable = new [[#variable5e5e6940]](elementSize * 2); // double the number of expected elements
Object currentKey;
for (int i = this.keyTable.length; --i >= 0;)
if ((currentKey = this.keyTable[i]) != null)
newHashtable.put(currentKey, this.valueTable[i]);
this.keyTable = newHashtable.keyTable;
this.valueTable = newHashtable.valueTable;
this.threshold = newHashtable.threshold;
}
public int size() {
return elementSize;
}
public String toString() {
String s = ""; //$NON-NLS-1$
Object key;
for (int i = 0, length = this.keyTable.length; i < length; i++)
if ((key = this.keyTable[i]) != null)
s += key + " -> " + this.valueTable[i] + "\n"; //$NON-NLS-2$ //$NON-NLS-1$
return s;
}
}
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#5e5e6940]] | HashtableOfObjectToInt |
| 1 | 2 | [[#5e5e6940]] | HashtableOfObjectToIntArray |
| 2 | 1 | [[#5e5e6880]] | |
| 2 | 2 | [[#5e5e6880]] | [] |
| 3 | 1 | [[#5e5e6760]] | -1 |
| 3 | 2 | [[#5e5e6760]] | null |