final List<ObjectTreeNode> childNodes = new ArrayList<ObjectTreeNode>();
IProcedureInfo[] procs =
session.getSchemaInfo().getStoredProceduresInfos(catalogName, schemaName, new ObjFilterMatcher(session.getProperties()));
for (int i = 0; i < procs.length; ++i)
{
if (procs[i].getProcedureType() == DatabaseMetaData.procedureNoResult)
childNodes.add(new ObjectTreeNode(session, procs[i]));
}
return childNodes;
final List<ObjectTreeNode> childNodes = new ArrayList<ObjectTreeNode>();
IProcedureInfo[] procs = session.getSchemaInfo().getStoredProceduresInfos(catalogName, schemaName, new ObjFilterMatcher(session.getProperties()));
for (int i = 0; i < procs.length; ++i)
{
childNodes.add(new ObjectTreeNode(session, procs[i]));
}
return childNodes;
Clone fragments detected by clone detection tool
File path: /sql12/plugins/oracle/src/net/sourceforge/squirrel_sql/plugins/oracle/expander/ProcedureExpander.java
|
|
File path: /sql12/plugins/oracle/src/net/sourceforge/squirrel_sql/plugins/oracle/expander/PackageExpander.java
|
Method name: List createProcedureNodes(ISession, String, String)
|
|
Method name: List createProcedureNodes(ISession, String, String)
|
Number of AST nodes: 6
|
|
Number of AST nodes: 5
|
|
1 | final List<ObjectTreeNode> childNodes = new ArrayList<ObjectTreeNode>();↵ | | 1 | final List<ObjectTreeNode> childNodes = new ArrayList<ObjectTreeNode>();↵
|
2 | IProcedureInfo[] procs =↵ | | 2 | IProcedureInfo[] procs =↵
|
3 | session.getSchemaInfo().getStoredProceduresInfos(catalogName, schemaName, new ObjFilterMatcher(session.getProperties()));↵ | | 3 | session.getSchemaInfo().getStoredProceduresInfos(catalogName, schemaName, new ObjFilterMatcher(session.getProperties()));↵
|
|
4 | for (int i = 0; i < procs.length; ++i)↵ | | 4 | for (int i = 0; i < procs.length; ++i)↵
|
5 | {↵ | | |
|
6 | if (procs[i].getProcedureType() == DatabaseMetaData.procedureNoResult)↵ | | |
|
7 | ↵ | | 5 | {↵
|
8 | childNodes.add(new ObjectTreeNode(session, procs[i]));↵ | | 6 | childNodes.add(new ObjectTreeNode(session, procs[i]));↵
|
9 | }↵ | | |
|
10 | ↵ | | 7 | }↵
|
11 | return childNodes; | | 8 | return childNodes;
|
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 | 4 |