if(textArea.maxLineLen <= 0) { softWrap = false; wrapMargin = 0; } else { // stupidity char[] foo = new char[textArea.maxLineLen]; for(int i = 0; i < foo.length; i++) { foo[i] = ' '; } TextAreaPainter painter = textArea.getPainter(); wrapMargin = (int)painter.getFont().getStringBounds( foo,0,foo.length, painter.getFontRenderContext()) .getWidth(); }
if(textArea.maxLineLen <= 0) { softWrap = false; wrapMargin = 0; } else { // stupidity char[] foo = new char[textArea.maxLineLen]; for(int i = 0; i < foo.length; i++) { foo[i] = ' '; } TextAreaPainter painter = textArea.getPainter(); wrapMargin = (int)painter.getFont().getStringBounds( foo,0,foo.length, painter.getFontRenderContext()) .getWidth(); }
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/org/gjt/sp/jedit/textarea/DisplayManager.java File path: /jEdit-4.2/src/org/gjt/sp/jedit/textarea/DisplayManager.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if(textArea.maxLineLen <= 0)
1
if(textArea.maxLineLen <= 0)
2
		{
2
			{
3
			softWrap = false;
3
				softWrap = false;
4
			wrapMargin = 0;
4
				wrapMargin = 0;
5
		}
5
			}
6
		else
6
			else
7
		{
7
			{
8
			// stupidity
8
				// stupidity
9
			char[] foo = new char[textArea.maxLineLen];
9
				char[] foo = new char[textArea.maxLineLen];
10
			for(int i = 0; i < foo.length; i++)
10
				for(int i = 0; i < foo.length; i++)
11
			{
11
				{
12
				foo[i] = ' ';
12
					foo[i] = ' ';
13
			}
13
				}
14
			TextAreaPainter painter = textArea.getPainter();
14
				TextAreaPainter painter = textArea.getPainter();
15
			wrapMargin = (int)painter.getFont().getStringBounds(
15
				wrapMargin = (int)painter.getFont().getStringBounds(
16
				foo,0,foo.length,
16
					foo,0,foo.length,
17
				painter.getFontRenderContext())
17
					painter.getFontRenderContext())
18
				.getWidth();
18
					.getWidth();
19
		}
19
			}
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