Object getFromMap( Object map, Object key )
{
// Hashtable implements Map
return ((Map)map).get(key);
}
public Object putInMap( Object map, Object key, Object value )
{
// Hashtable implements Map
return ((Map)map).put(key, value);
}
Object getFromMap( Object map, Object key ) {
return ((Hashtable)map).get(key);
}
public Object putInMap( Object map, Object key, Object value )
{
return ((Hashtable)map).put(key, value);
}
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/bsh/collection/CollectionManagerImpl.java
|
|
File path: /jEdit-4.2/src/bsh/CollectionManager.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | Object getFromMap( Object map, Object key ) ↵ | | 1 | Object getFromMap( Object map, Object key ) ↵
|
2 | {↵ | | 2 | {↵
|
3 | // Hashtable implements Map↵ | | 3 | ↵
|
4 | return ((Map)map).get(key);↵ | | 4 | return ((Hashtable)map).get(key);↵
|
5 | }↵ | | 5 | }↵
|
|
6 | public Object putInMap( Object map, Object key, Object value ) ↵ | | 6 | public Object putInMap( Object map, Object key, Object value ) ↵
|
7 | {↵ | | 7 | {↵
|
8 | // Hashtable implements Map↵ | | 8 | ↵
|
9 | return ((Map)map).put(key, value);↵ | | 9 | return ((Hashtable)map).put(key, value);↵
|
10 | } | | 10 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |