public class MyEntity { private Long id; private String name; private MySibling sibling; private Set nonInverseChildren = new HashSet(); private Set inverseChildren = new HashSet(); public MyEntity() { } public MyEntity(String name) { this.name = name; } public Long getId() { return id; } public void setId(Long id) { this.id = id; } public String getName() { return name; } public void setName(String name) { this.name = name; } public MySibling getSibling() { return sibling; } public void setSibling(MySibling sibling) { this.sibling = sibling; } public Set getNonInverseChildren() { return nonInverseChildren; } public void setNonInverseChildren(Set nonInverseChildren) { this.nonInverseChildren = nonInverseChildren; } public Set getInverseChildren() { return inverseChildren; } public void setInverseChildren(Set inverseChildren) { this.inverseChildren = inverseChildren;
public class Container implements Serializable { private Long id; private String name; private Owner owner; private Info info; private Set dataPoints = new HashSet(); public Container() { } public Container(String name) { this.name = name; } public Long getId() { return id; } public void setId(Long id) { this.id = id; } public String getName() { return name; } public void setName(String name) { this.name = name; } public Owner getOwner() { return owner; } public void setOwner(Owner owner) { this.owner = owner; } public Info getInfo() { return info; } public void setInfo(Info info) { this.info = info; } public Set getDataPoints() { return dataPoints; } public void setDataPoints(Set dataPoints) { this.dataPoints = dataPoints;
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/generatedkeys/identity/MyEntity.java File path: /hibernate-distribution-3.3.2.GA/project/testsuite/src/test/java/org/hibernate/test/proxy/Container.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public class MyEntity {
1
public class Container implements Serializable {
2
	private Long id;
2
	private Long id;
3
	private String name;
3
	private String name;
4
	private MySibling sibling;
4
	private 
5
	private Set nonInverseChildren = new HashSet();
6
	private Set inverseChildren
5
Owner owner;
6
	private Info info;
7
 = new HashSet();
7
	private Set dataPoints = new HashSet();
8

9
	public MyEntity() {
8
	public Container() {
10
	}
9
	}
11

12
	public MyEntity(String name) {
10
	public Container(String name) {
13
		this.name = name;
11
		this.name = name;
14
	}
12
	}
15

16
	public Long getId() {
13
	public Long getId() {
17
		return id;
14
		return id;
18
	}
15
	}
19

20
	public void setId(Long id) {
16
	public void setId(Long id) {
21
		this.id = id;
17
		this.id = id;
22
	}
18
	}
23

24
	public String getName() {
19
	public String getName() {
25
		return name;
20
		return name;
26
	}
21
	}
27

28
	public void setName(String name) {
22
	public void setName(String name) {
29
		this.name = name;
23
		this.name = name;
30
	}
24
	}
31

32
	public MySibling getSibling() {
25
	public Owner getOwner() {
33
		return sibling;
26
		return 
34
	}
35

27
owner;
28
	}
36
	public void setSibling(MySibling sibling) {
29
	public void setOwner(Owner owner) {
37
		this.sibling = sibling;
30
		this.
38
	}
39

31
owner = owner;
32
	}
40
	public Set getNonInverseChildren() {
33
	public Info getInfo() {
41
		return nonInverseChildren;
34
		return 
42
	}
43
	public void setNonInverseChildren(Set nonInverseChildren
35
info;
36
	}
44
) {
37
	public void setInfo(Info info) {
45
		this.nonInverseChildren = nonInverseChildren;
38
		this.
46
	}
47

39
info = info;
40
	}
48
	public Set getInverseChildren() {
41
	public Set getDataPoints() {
49
		return inverseChildren;
42
		return 
50
	}
51
	public void setInverseChildren(Set inverseChildren
43
dataPoints;
44
	}
52
) {
45
	public void setDataPoints(Set dataPoints) {
53
		this.inverseChildren = inverseChildren;
46
		this.dataPoints = dataPoints;
54
	
47
	
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