Previous CloneSet | Next CloneSet | Back to Main Report |
Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
---|---|---|---|---|
10 | 2 | 0 | 1.000 | class_body_declaration |
Clone Abstraction | Parameter Bindings |
Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
---|---|---|---|
1 | 10 | 166 | plugins/org.eclipse.jdt.junit.runtime/src/org/eclipse/jdt/internal/junit/runner/CustomHashtable.java |
2 | 10 | 150 | plugins/org.eclipse.jdt.ui/ui/org/eclipse/jdt/internal/ui/packageview/CustomHashtable.java |
| ||||
/** * Constructs a new hash table with the given capacity and the given element * comparer. * * @param capacity the maximum number of elements that can be added without * rehashing * @param comparer the element comparer to use to compare keys and obtain * hash codes for keys, or <code>null</code> to use the normal * <code>equals</code> and <code>hashCode</code> methods */ public CustomHashtable(int capacity, IElementComparer comparer) { if (capacity >= 0) { elementCount = 0; elementData = new HashMapEntry[capacity == 0 ? 1: capacity]; firstSlot = elementData.length; loadFactor = 0.75F; computeMaxSize(); } else throw new IllegalArgumentException(); this.comparer = comparer; } |
| ||||
/** * Constructs a new hash table with the given capacity and the given * element comparer. * * @param capacity the maximum number of elements that can be added without * rehashing * @param comparer the element comparer to use to compare keys and obtain * hash codes for keys, or <code>null</code> to use the normal * <code>equals</code> and <code>hashCode</code> methods */ public CustomHashtable(int capacity, IElementComparer comparer) { if (capacity >= 0) { elementCount = 0; elementData = new HashMapEntry[capacity == 0 ? 1: capacity]; firstSlot = elementData.length; loadFactor = 0.75F; computeMaxSize(); } else throw new IllegalArgumentException(); this.comparer = comparer; } |
| |||
/** * Constructs a new hash table with the given capacity and the given * element comparer. * * @param capacity the maximum number of elements that can be added without * rehashing * @param comparer the element comparer to use to compare keys and obtain * hash codes for keys, or <code>null</code> to use the normal * <code>equals</code> and <code>hashCode</code> methods */ /** * Constructs a new hash table with the given capacity and the given element * comparer. * * @param capacity the maximum number of elements that can be added without * rehashing * @param comparer the element comparer to use to compare keys and obtain * hash codes for keys, or <code>null</code> to use the normal * <code>equals</code> and <code>hashCode</code> methods */ public CustomHashtable(int capacity, IElementComparer comparer) { if (capacity >= 0) { elementCount = 0; elementData = new HashMapEntry[capacity == 0 ? 1: capacity]; firstSlot = elementData.length; loadFactor = 0.75F; computeMaxSize(); } else throw new IllegalArgumentException(); this.comparer = comparer; } |
CloneAbstraction |
Parameter Index | Clone Instance | Parameter Name | Value |
---|---|---|---|
None |