protected int getIndexInList(Object obj) { final int limit = getSize(); final String objStr = obj.toString(); for (int i = 0; i < limit; ++i) { if (objStr.compareToIgnoreCase(getElementAt(i).toString()) <= 0) { return i; } } return limit;
protected int getIndexInList(Object obj) { final int limit = getSize(); final String objStr = obj.toString(); for (int i = 0; i < limit; ++i) { if (objStr.compareToIgnoreCase(get(i).toString()) <= 0) { return i; } } return limit;
Clone fragments detected by clone detection tool
File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/gui/SortedComboBoxModel.java File path: /sql12/fw/src/net/sourceforge/squirrel_sql/fw/gui/SortedListModel.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
protected int getIndexInList(Object obj)
1
protected int getIndexInList(Object obj)
2
	{
2
	{
3
		final int limit = getSize();
3
		final int limit = getSize();
4
		final String objStr = obj.toString();
4
		final String objStr = obj.toString();
5
		for (int i = 0; i < limit; ++i)
5
		for (int i = 0; i < limit; ++i)
6
		{
6
		{
7
			if (objStr.compareToIgnoreCase(getElementAt(i).toString()) <= 0)
7
			if (objStr.compareToIgnoreCase(get(i).toString()) <= 0)
8
			{
8
			{
9
				return i;
9
				return i;
10
			}
10
			}
11
		}
11
		}
12
		return limit;
12
		return limit;
13
	
13
	
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