if(lastfvmget == fvmcount - 1 || line < fvm[lastfvmget + 1]) { return lastfvmget; }
for (Item i = tab[index]; i != null; i = i.next) { if (i.hashCode == hashCode && key.isEqualTo(i)) { return i; } }
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/objectweb/asm/ClassWriter.java
Method name: int fvmget(int) Method name: Item get(Item)
Number of AST nodes: 2 Number of AST nodes: 3
1
if(lastfvmget == fvmcount - 1
2
					|| line < fvm[lastfvmget + 1])
3
				{
4
					return lastfvmget;
5
				
1
for (Item i = tab[index]; i != null; i = i.next) {
2
      if (i.hashCode == hashCode && key.isEqualTo(i)) {
3
        return i;
4
      }
6
}
5
    }
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.3
Clones locationClones are in different classes
Number of node comparisons1