public static String[] slice(String[] strings, int begin, int length) { String[] result = new String[length]; for ( int i=0; i<length; i++ ) { result[i] = strings[begin+i]; } return result;
public static Object[] slice(Object[] objects, int begin, int length) { Object[] result = new Object[length]; for ( int i=0; i<length; i++ ) { result[i] = objects[begin+i]; } return result;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/ArrayHelper.java File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/ArrayHelper.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public static String[] slice(String[] strings, int begin, int length) {
1
public static Object[] slice(Object[] objects, int begin, int length) {
2
		String[] result = new String[length];
2
		Object[] result = new Object[length];
3
		for ( int i=0; i<length; i++ ) {
3
		for ( int i=0; i<length; i++ ) {
4
			result[i] = strings[begin+i];
4
			result[i] = objects[begin+i];
5
		}
5
		}
6
		return result;
6
		return result;
7
	
7
	
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