| Previous CloneSet | Next CloneSet | Back to Main Report |
| Clone Mass | Clones in CloneSet | Parameter Count | Clone Similarity | Syntax Category [Sequence Length] |
|---|---|---|---|---|
| 10 | 10 | 1 | 0.997 | class_body_declaration |
| Clone Abstraction | Parameter Bindings |
| Clone Instance (Click to see clone) | Line Count | Source Line | Source File |
|---|---|---|---|
| 1 | 10 | 50 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| 2 | 10 | 61 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| 3 | 10 | 72 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| 4 | 10 | 83 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| 5 | 10 | 94 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| 6 | 10 | 105 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| 7 | 10 | 116 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| 8 | 10 | 127 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| 9 | 10 | 138 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| 10 | 10 | 149 | plugins/org.eclipse.jdt.core/search/org/eclipse/jdt/internal/core/search/matching/OrLocator.java |
| ||||
public int match(ASTNode node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| ||||
public int match(ConstructorDeclaration node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| ||||
public int match(Expression node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| ||||
public int match(FieldDeclaration node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| ||||
public int match(LocalDeclaration node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| ||||
public int match(MethodDeclaration node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| ||||
public int match(MessageSend node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| ||||
public int match(Reference node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| ||||
public int match(TypeDeclaration node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| ||||
public int match(TypeReference node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH) return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| |||
public int match( [[#variableb8448b40]] node, MatchingNodeSet nodeSet) {
int level = IMPOSSIBLE_MATCH;
for (int i = 0, length = this.patternLocators.length; i < length; i++) {
int newLevel = this.patternLocators[i].match(node, nodeSet);
if (newLevel > level) {
if (newLevel == ACCURATE_MATCH)
return ACCURATE_MATCH;
level = newLevel;
}
}
return level;
}
|
| CloneAbstraction |
| Parameter Index | Clone Instance | Parameter Name | Value |
|---|---|---|---|
| 1 | 1 | [[#b8448b40]] | ASTNode |
| 1 | 2 | [[#b8448b40]] | ConstructorDeclaration |
| 1 | 3 | [[#b8448b40]] | Expression |
| 1 | 4 | [[#b8448b40]] | FieldDeclaration |
| 1 | 5 | [[#b8448b40]] | LocalDeclaration |
| 1 | 6 | [[#b8448b40]] | MethodDeclaration |
| 1 | 7 | [[#b8448b40]] | MessageSend |
| 1 | 8 | [[#b8448b40]] | Reference |
| 1 | 9 | [[#b8448b40]] | TypeDeclaration |
| 1 | 10 | [[#b8448b40]] | TypeReference |