if(sort) { MiscUtilities.quicksort(menuItems, new MiscUtilities.MenuItemCompare()); for(int i = 0; i < menuItems.size(); i++) { if(menu.getMenuComponentCount() >= maxItems && i != 0) { JMenu newMenu = new JMenu( jEdit.getProperty("common.more")); menu.add(newMenu); menu = newMenu; } menu.add((JMenuItem)menuItems.elementAt(i));
if(sort) { MiscUtilities.quicksort(menuItems, new MiscUtilities.MenuItemCompare()); for(int i = 0; i < menuItems.size(); i++) { if(menu.getMenuComponentCount() >= maxItems && i != 0) { JMenu newMenu = new JMenu( jEdit.getProperty("common.more")); menu.add(newMenu); menu = newMenu; } menu.add((JMenuItem)menuItems.elementAt(i));
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/menu/RecentDirectoriesProvider.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/menu/RecentFilesProvider.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if(sort)
1
if(sort)
2
		{
2
		{
3
			MiscUtilities.quicksort(menuItems,
3
			MiscUtilities.quicksort(menuItems,
4
				new MiscUtilities.MenuItemCompare());
4
				new MiscUtilities.MenuItemCompare());
5
			for(int i = 0; i < menuItems.size(); i++)
5
			for(int i = 0; i < menuItems.size(); i++)
6
			{
6
			{
7
				if(menu.getMenuComponentCount() >= maxItems
7
				if(menu.getMenuComponentCount() >= maxItems
8
					&& i != 0)
8
					&& i != 0)
9
				{
9
				{
10
					JMenu newMenu = new JMenu(
10
					JMenu newMenu = new JMenu(
11
						jEdit.getProperty("common.more"));
11
						jEdit.getProperty("common.more"));
12
					menu.add(newMenu);
12
					menu.add(newMenu);
13
					menu = newMenu;
13
					menu = newMenu;
14
				}
14
				}
15
				menu.add((JMenuItem)menuItems.elementAt(i));
15
				menu.add((JMenuItem)menuItems.elementAt(i));
16
			
16
			
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