if (newNodePath != null) {
_tree.makeVisible(newNodePath);
_tree.expandPath(newNodePath);
_tree.startEditingAtPath(newNodePath);
}
Arrays.sort(completions);
completionInfos.addAll(0,Arrays.asList(completions));
return true;
Clone fragments detected by clone detection tool
File path: /sql12/plugins/favs/src/net/sourceforge/squirrel_sql/plugins/favs/NewSavedQueriesFolderCommand.java
|
|
File path: /sql12/plugins/codecompletion/src/net/sourceforge/squirrel_sql/plugins/codecompletion/CodeCompletionInfoCollection.java
|
Method name: void execute()
|
|
Method name: boolean addCompletionsAtListBegin(String, String, CodeCompletionInfo[])
|
Number of AST nodes: 4
|
|
Number of AST nodes: 3
|
|
1 | if (newNodePath != null) {↵ | | |
|
2 | _tree.makeVisible(newNodePath);↵ | | |
|
3 | _tree.expandPath(newNodePath);↵ | | |
|
4 | _tree.startEditingAtPath(newNodePath);↵ | | |
|
5 | } | | 1 | Arrays.sort(completions);↵
|
| | | 2 | completionInfos.addAll(0,Arrays.asList(completions));↵
|
| | | 3 | return true;
|
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 | 9 |