if (userSettings.CaptureRawRecord && dataBuffer.Count > 0) { if (rawBuffer.Buffer.length - rawBuffer.Position < dataBuffer.Count - dataBuffer.LineStart) { int newLength = rawBuffer.Buffer.length + Math.max(dataBuffer.Count - dataBuffer.LineStart, rawBuffer.Buffer.length); char[] holder = new char[newLength]; System.arraycopy(rawBuffer.Buffer, 0, holder, 0, rawBuffer.Position); rawBuffer.Buffer = holder; } System.arraycopy(dataBuffer.Buffer, dataBuffer.LineStart, rawBuffer.Buffer, rawBuffer.Position, dataBuffer.Count - dataBuffer.LineStart); rawBuffer.Position += dataBuffer.Count - dataBuffer.LineStart; }
if (startedColumn && dataBuffer.ColumnStart < dataBuffer.Position) { if (columnBuffer.Buffer.length - columnBuffer.Position < dataBuffer.Position - dataBuffer.ColumnStart) { int newLength = columnBuffer.Buffer.length + Math.max( dataBuffer.Position - dataBuffer.ColumnStart, columnBuffer.Buffer.length); char[] holder = new char[newLength]; System.arraycopy(columnBuffer.Buffer, 0, holder, 0, columnBuffer.Position); columnBuffer.Buffer = holder; } System.arraycopy(dataBuffer.Buffer, dataBuffer.ColumnStart, columnBuffer.Buffer, columnBuffer.Position, dataBuffer.Position - dataBuffer.ColumnStart); columnBuffer.Position += dataBuffer.Position - dataBuffer.ColumnStart; }
Clone fragments detected by clone detection tool
File path: /sql12/plugins/dataimport/src/com/csvreader/CsvReader.java File path: /sql12/plugins/dataimport/src/com/csvreader/CsvReader.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
if (userSettings.CaptureRawRecord && dataBuffer.Count &gt; 0) {
1
if (startedColumn && dataBuffer.ColumnStart &lt; dataBuffer.Position) {
2
			if (rawBuffer.Buffer.length - rawBuffer.Position < dataBuffer.Count
2
			if (columnBuffer.Buffer.length - columnBuffer.Position < dataBuffer.Position
3
					- dataBuffer.LineStart) {
3
					- dataBuffer.ColumnStart) {
4
				int newLength = rawBuffer.Buffer.length
4
				int newLength = columnBuffer.Buffer.length
5
						+ Math.max(
5
						+ Math.max(
6
dataBuffer.Count - dataBuffer.LineStart,
6
								dataBuffer.Position - dataBuffer.ColumnStart,
7
								rawBuffer.Buffer.length);
7
								columnBuffer.Buffer.length);
8
				char[] holder = new char[newLength];
8
				char[] holder = new char[newLength];
9
				System.arraycopy(rawBuffer.Buffer, 0, holder, 0,
9
				System.arraycopy(columnBuffer.Buffer, 0, holder, 0,
10
						rawBuffer.Position);
10
						columnBuffer.Position);
11
				rawBuffer.Buffer = holder;
11
				columnBuffer.Buffer = holder;
12
			}
12
			}
13
			System.arraycopy(dataBuffer.Buffer, dataBuffer.LineStart,
13
			System.arraycopy(dataBuffer.Buffer, dataBuffer.ColumnStart,
14
					rawBuffer.Buffer, rawBuffer.Position, 
14
					columnBuffer.Buffer, columnBuffer.Position,
15
dataBuffer.Count
15
					dataBuffer.
16
							- dataBuffer.LineStart);
16
Position - dataBuffer.ColumnStart);
17
			rawBuffer.Position += dataBuffer.Count 
17
			columnBuffer.Position += dataBuffer.Position
18
- dataBuffer.LineStart;
18
					- dataBuffer.ColumnStart;
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