public void setProgressIncrement(int progressIncrement)
{
this.progressIncrement = progressIncrement;
}
public void setLower(int lower)
{
this.lower = lower;
oldValue = lower;
}
public int getLower()
{
return lower;
}
public void setUpper(int upper)
{
this.upper = upper;
}
public int getUpper()
{
return upper;
public void setProgressIncrement(int progressIncrement)
{
this.progressIncrement = progressIncrement;
}
public void setLower(int lower)
{
this.lower = lower;
oldValue = lower;
}
public int getLower()
{
return lower;
}
public void setUpper(int upper)
{
this.upper = upper;
}
public int getUpper()
{
return upper;
Clone fragments detected by clone detection tool
File path: /emf-2.4.1/src/org/eclipse/emf/importer/rose/parser/RoseLoader.java
|
|
File path: /emf-2.4.1/src/org/eclipse/emf/importer/rose/parser/RoseWriter.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public void setProgressIncrement(int progressIncrement)↵ | | 1 | public void setProgressIncrement(int progressIncrement)↵
|
2 | {↵ | | 2 | {↵
|
3 | this.progressIncrement = progressIncrement;↵ | | 3 | this.progressIncrement = progressIncrement;↵
|
4 | }↵ | | 4 | }↵
|
|
5 | public void setLower(int lower)↵ | | 5 | public void setLower(int lower)↵
|
6 | {↵ | | 6 | {↵
|
7 | this.lower = lower;↵ | | 7 | this.lower = lower;↵
|
8 | oldValue = lower;↵ | | 8 | oldValue = lower;↵
|
9 | }↵ | | 9 | }↵
|
|
10 | public int getLower()↵ | | 10 | public int getLower()↵
|
11 | {↵ | | 11 | {↵
|
12 | return lower;↵ | | 12 | return lower;↵
|
13 | }↵ | | 13 | }↵
|
|
14 | public void setUpper(int upper)↵ | | 14 | public void setUpper(int upper)↵
|
15 | {↵ | | 15 | {↵
|
16 | this.upper = upper;↵ | | 16 | this.upper = upper;↵
|
17 | }↵ | | 17 | }↵
|
|
18 | public int getUpper()↵ | | 18 | public int getUpper()↵
|
19 | {↵ | | 19 | {↵
|
20 | return upper; | | 20 | return upper;
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |