for(int i = 0; i < abbrev.length(); i++)
{
if(abbrev.charAt(i) == '#')
{
pp.addElement(abbrev.substring(lastIndex,i));
lastIndex = i + 1;
for(int i = 0; i < message.length(); i++)
{
if(message.charAt(i) == '\n')
{
tokenizedMessage.addElement(message.substring(
lastIndex + 1,i));
lastIndex = i;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/Abbrevs.java
|
|
File path: /jEdit-4.2/src/org/gjt/sp/jedit/gui/ErrorListDialog.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | for(int i = 0; i < abbrev.length(); i++)↵ | | 1 | for(int i = 0; i < message.length(); i++)↵
|
2 | {↵ | | 2 | {↵
|
3 | if(abbrev.charAt(i) == '#')↵ | | 3 | if(message.charAt(i) == '\n')↵
|
4 | {↵ | | 4 | {↵
|
5 | pp.addElement(abbrev.substring(↵ | | 5 | tokenizedMessage.addElement(message.substring(↵
|
6 | lastIndex,i));↵ | | 6 | lastIndex + 1,i));↵
|
7 | lastIndex = i + 1;↵ | | 7 | lastIndex = i;↵
|
8 | | | 8 |
|
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 |