Vector v = new Vector(); StringTokenizer st = new StringTokenizer(s, delim); while ( st.hasMoreTokens() ) v.addElement( st.nextToken() ); String [] sa = new String [ v.size() ]; v.copyInto( sa ); return sa;
Vector v = new Vector(); while ( e.hasMoreElements() ) v.addElement( e.nextElement() ); String [] sa = new String [ v.size() ]; v.copyInto( sa ); return sa;
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/bsh/StringUtil.java File path: /jEdit-4.2/src/bsh/NameSpace.java
Method name: String[] split(String, String) Method name: String[] enumerationToStringArray(Enumeration)
Number of AST nodes: 7 Number of AST nodes: 6
1
Vector v = new Vector();
1
Vector v = new Vector();
2
		StringTokenizer st = new StringTokenizer(s, delim);
2
		
3
		while ( st.hasMoreTokens() )
3
while ( e.hasMoreElements() )
4
			v.addElement( st.nextToken() );
4
			v.addElement( e.nextElement() );
5
		String [] sa = new String [ v.size() ];
5
		String [] sa = new String [ v.size() ];
6
		v.copyInto( sa );
6
		v.copyInto( sa );
7
		return sa;
7
		return sa;
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.1
Clones locationClones are in different classes
Number of node comparisons1