if (fi != null)
{
UIManager.put(keys[i], fi.createFont());
}
if(null != _parsingFinishedListener)
{
_parsingFinishedListener.parserExitedOnException(e);
}
e.printStackTrace();
Clone fragments detected by clone detection tool
File path: /sql12/plugins/laf/src/net/sourceforge/squirrel_sql/plugins/laf/LAFRegister.java
|
|
File path: /sql12/app/src/net/sourceforge/squirrel_sql/client/session/parser/kernel/ParserThread.java
|
Method name: void updateApplicationFonts()
|
|
Method name: void run()
|
Number of AST nodes: 2
|
|
Number of AST nodes: 3
|
|
1 | if (fi != null)↵ | | 1 | if(null != _parsingFinishedListener)↵
|
2 | {↵ | | 2 | {↵
|
3 | UIManager.put(keys[i], fi.createFont());↵ | | 3 | ↵
|
4 | } | | 4 | _parsingFinishedListener.parserExitedOnException(e);↵
|
| | | 5 | }↵
|
| | | 6 | e.printStackTrace();
|
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 | Clones are in different classes |
Number of node comparisons | 0 |