in = cache.get("test1");
in.read(test);
in.close();
for( int i=0; i<1000; i++) {
assertEquals(test[i], random[i]);
}
in = cache.get("test2");
in.read(test);
in.close();
for( int i=0; i<1000; i++) {
assertEquals(test[i], random2[i]);
}
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/core/src/test/java/org/columba/core/io/StreamCacheTest.java
|
|
File path: /columba-1.4-src/core/src/test/java/org/columba/core/io/StreamCacheTest.java
|
Method name: void testAdd()
|
|
Method name: void testMaxsize()
|
Number of AST nodes: 5
|
|
Number of AST nodes: 5
|
|
1 | in = cache.get("test1");↵ | | 1 | in = cache.get("test2");↵
|
2 | in.read(test);↵ | | 2 | in.read(test);↵
|
3 | in.close();↵ | | 3 | in.close();↵
|
4 | ↵ | | 4 | ↵
|
5 | for( int i=0; i<1000; i++) {↵ | | 5 | for( int i=0; i<1000; i++) {↵
|
6 | assertEquals(test[i], random[i]); ↵ | | 6 | assertEquals(test[i], random2[i]); ↵
|
7 | } | | 7 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 1 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.1 |
Clones location | Clones are declared in the same class |
Number of node comparisons | 13 |
-
{Refactorable}
Mapping Summary
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 1.5 |
Clone type | Type 2 |
Mapped Statements
ID |
Statement |
|
ID |
Statement |
9 | in = cache.get("test1"); | | 19 | in = cache.get("test2"); |
10 | in.read(test); | | 20 | in.read(test); |
11 | in.close(); | | 21 | in.close(); |
12 | for (int i = 0; i < 1000; i++) | | 22 | for (int i = 0; i < 1000; i++) |
13 | assertEquals(test[i], random[i]); | | 23 | assertEquals(test[i], random2[i]); |
Precondition Violations (0)
Row |
Violation |