public Set entrySet() {
Set set = new HashSet( map.size() );
Iterator iter = map.entrySet().iterator();
while ( iter.hasNext() ) {
Map.Entry me = (Map.Entry) iter.next();
set.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) );
}
return set;
public List entryList() {
ArrayList list = new ArrayList( map.size() );
Iterator iter = map.entrySet().iterator();
while ( iter.hasNext() ) {
Map.Entry me = (Map.Entry) iter.next();
list.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) );
}
return list;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/IdentityMap.java
|
|
File path: /hibernate-distribution-3.3.2.GA/project/core/src/main/java/org/hibernate/util/IdentityMap.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public Set entrySet() {↵ | | 1 | public List entryList() {↵
|
2 | Set set = new HashSet( map.size() );↵ | | 2 | ArrayList list = new ArrayList( map.size() );↵
|
3 | Iterator iter = map.entrySet().iterator();↵ | | 3 | Iterator iter = map.entrySet().iterator();↵
|
4 | while ( iter.hasNext() ) {↵ | | 4 | while ( iter.hasNext() ) {↵
|
5 | Map.Entry me = (Map.Entry) iter.next();↵ | | 5 | Map.Entry me = (Map.Entry) iter.next();↵
|
6 | set.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) );↵ | | 6 | list.add( new IdentityMapEntry( ( (IdentityKey) me.getKey() ).key, me.getValue() ) );↵
|
7 | }↵ | | 7 | }↵
|
8 | return set;↵ | | 8 | return list;↵
|
9 | | | 9 |
|
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 |