private String locateAppropriateDialectFunctionNameForAliasTest() { for (Iterator itr = getDialect().getFunctions().entrySet().iterator(); itr.hasNext(); ) { final Map.Entry entry = (Map.Entry) itr.next(); final SQLFunction function = (SQLFunction) entry.getValue(); if ( !function.hasArguments() && !function.hasParenthesesIfNoArguments() ) { return (String) entry.getKey(); } } return null;
private String locateAppropriateDialectFunctionNameForAliasTest() { for (Iterator itr = getDialect().getFunctions().entrySet().iterator(); itr.hasNext(); ) { final Map.Entry entry = (Map.Entry) itr.next(); final SQLFunction function = (SQLFunction) entry.getValue(); if ( !function.hasArguments() && !function.hasParenthesesIfNoArguments() ) { return (String) entry.getKey(); } } return null;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/dialect/functional/cache/SQLFunctionsInterSystemsTest.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/legacy/SQLFunctionsTest.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
private String locateAppropriateDialectFunctionNameForAliasTest() {
1
private String locateAppropriateDialectFunctionNameForAliasTest() {
2
		for (Iterator itr = getDialect().getFunctions().entrySet().iterator(); itr.hasNext(); ) {
2
		for (Iterator itr = getDialect().getFunctions().entrySet().iterator(); itr.hasNext(); ) {
3
			final Map.Entry entry = (Map.Entry) itr.next();
3
			final Map.Entry entry = (Map.Entry) itr.next();
4
			final SQLFunction function = (SQLFunction) entry.getValue();
4
			final SQLFunction function = (SQLFunction) entry.getValue();
5
			if ( !function.hasArguments() && !function.hasParenthesesIfNoArguments() ) {
5
			if ( !function.hasArguments() && !function.hasParenthesesIfNoArguments() ) {
6
				return (String) entry.getKey();
6
				return (String) entry.getKey();
7
			}
7
			}
8
		}
8
		}
9
		return null;
9
		return null;
10
	
10
	
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0