switch (escape) { case ComplexEscape.UNICODE: escapeValue *= (char) 16; escapeValue += hexToDec(currentLetter); if (escapeLength == 4) { readingComplexEscape = false; } break; case ComplexEscape.OCTAL: escapeValue *= (char) 8; escapeValue += (char) (currentLetter - '0'); if (escapeLength == 3) { readingComplexEscape = false; } break; case ComplexEscape.DECIMAL: escapeValue *= (char) 10; escapeValue += (char) (currentLetter - '0'); if (escapeLength == 3) { readingComplexEscape = false; } break; case ComplexEscape.HEX: escapeValue *= (char) 16; escapeValue += hexToDec(currentLetter); if (escapeLength == 2) { readingComplexEscape = false; } break; }
switch (escape) { case ComplexEscape.UNICODE: escapeValue *= (char) 16; escapeValue += hexToDec(currentLetter); if (escapeLength == 4) { readingComplexEscape = false; } break; case ComplexEscape.OCTAL: escapeValue *= (char) 8; escapeValue += (char) (currentLetter - '0'); if (escapeLength == 3) { readingComplexEscape = false; } break; case ComplexEscape.DECIMAL: escapeValue *= (char) 10; escapeValue += (char) (currentLetter - '0'); if (escapeLength == 3) { readingComplexEscape = false; } break; case ComplexEscape.HEX: escapeValue *= (char) 16; escapeValue += hexToDec(currentLetter); if (escapeLength == 2) { readingComplexEscape = false; } break; }
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
switch (escape) {
1
switch (escape) {
2
									case ComplexEscape.UNICODE:
2
									case ComplexEscape.UNICODE:
3
										escapeValue *= (char) 16;
3
										escapeValue *= (char) 16;
4
										escapeValue += hexToDec(currentLetter);
4
										escapeValue += hexToDec(currentLetter);
5
										if (escapeLength == 4) {
5
										if (escapeLength == 4) {
6
											readingComplexEscape = false;
6
											readingComplexEscape = false;
7
										}
7
										}
8
										break;
8
										break;
9
									case ComplexEscape.OCTAL:
9
									case ComplexEscape.OCTAL:
10
										escapeValue *= (char) 8;
10
										escapeValue *= (char) 8;
11
										escapeValue += (char) (currentLetter - '0');
11
										escapeValue += (char) (currentLetter - '0');
12
										if (escapeLength == 3) {
12
										if (escapeLength == 3) {
13
											readingComplexEscape = false;
13
											readingComplexEscape = false;
14
										}
14
										}
15
										break;
15
										break;
16
									case ComplexEscape.DECIMAL:
16
									case ComplexEscape.DECIMAL:
17
										escapeValue *= (char) 10;
17
										escapeValue *= (char) 10;
18
										escapeValue += (char) (currentLetter - '0');
18
										escapeValue += (char) (currentLetter - '0');
19
										if (escapeLength == 3) {
19
										if (escapeLength == 3) {
20
											readingComplexEscape = false;
20
											readingComplexEscape = false;
21
										}
21
										}
22
										break;
22
										break;
23
									case ComplexEscape.HEX:
23
									case ComplexEscape.HEX:
24
										escapeValue *= (char) 16;
24
										escapeValue *= (char) 16;
25
										escapeValue += hexToDec(currentLetter);
25
										escapeValue += hexToDec(currentLetter);
26
										if (escapeLength == 2) {
26
										if (escapeLength == 2) {
27
											readingComplexEscape = false;
27
											readingComplexEscape = false;
28
										}
28
										}
29
										break;
29
										break;
30
									}
30
									}
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