Common base class for copy tests
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
package com.vyazelenko.blog.copyobject.primitives; | |
import com.vyazelenko.blog.copyobject.Copyable; | |
import com.vyazelenko.blog.copyobject.HashUtils; | |
abstract class Root implements Copyable { | |
private int field1; | |
private char field2; | |
public boolean field6; | |
byte abc; | |
public long min; | |
public long max; | |
private double maxExponent; | |
public Root() { | |
} | |
public void init() { | |
field1 = 100; | |
field2 = '\t'; | |
field6 = false; | |
abc = -100; | |
min = Long.MIN_VALUE; | |
max = Long.MAX_VALUE; | |
maxExponent = Double.MAX_VALUE; | |
} | |
public Root(Root copyFrom) { | |
field1 = copyFrom.field1; | |
field2 = copyFrom.field2; | |
field6 = copyFrom.field6; | |
abc = copyFrom.abc; | |
min = copyFrom.min; | |
max = copyFrom.max; | |
maxExponent = copyFrom.maxExponent; | |
} | |
@Override | |
public boolean equals(Object obj) { | |
if (obj == this) { | |
return true; | |
} else if (!(obj instanceof Root)) { | |
return false; | |
} else { | |
Root tmp = (Root) obj; | |
return field1 == tmp.field1 && field2 == tmp.field2 && field6 == tmp.field6 | |
&& abc == tmp.abc && min == tmp.min && max == tmp.max | |
&& Double.compare(maxExponent, tmp.maxExponent) == 0; | |
} | |
} | |
@Override | |
public int hashCode() { | |
int hash = 17; | |
hash += 31 * hash + field1; | |
hash += 31 * hash + field2; | |
hash += 31 * hash + (field6 ? 1 : 0); | |
hash += 31 * hash + abc; | |
hash += 31 * hash + HashUtils.longHash(min); | |
hash += 31 * hash + HashUtils.longHash(max); | |
hash += 31 * hash + HashUtils.doubleHash(maxExponent); | |
return hash; | |
} | |
} | |
public abstract class BaseClass extends Root { | |
private double anotherField; | |
private int field1; | |
protected long youCanSeeMe; | |
private short m1; | |
public short m2; | |
public short m3; | |
public short m4; | |
short m5; | |
public short m6; | |
public short m7; | |
protected short m8; | |
public short m9; | |
public short m10; | |
private char x; | |
public BaseClass() { | |
super(); | |
} | |
@Override | |
public void init() { | |
super.init(); | |
anotherField = 10.5; | |
field1 = Integer.MIN_VALUE; | |
youCanSeeMe = -1; | |
m1 = 10; | |
m2 = 20; | |
m3 = 30; | |
m4 = 40; | |
m5 = 50; | |
m6 = 60; | |
m7 = 70; | |
m8 = 80; | |
m9 = 90; | |
m10 = 100; | |
x = '\n'; | |
} | |
public BaseClass(BaseClass copyFrom) { | |
super(copyFrom); | |
anotherField = copyFrom.anotherField; | |
field1 = copyFrom.field1; | |
youCanSeeMe = copyFrom.youCanSeeMe; | |
m1 = copyFrom.m1; | |
m2 = copyFrom.m2; | |
m3 = copyFrom.m3; | |
m4 = copyFrom.m4; | |
m5 = copyFrom.m5; | |
m6 = copyFrom.m6; | |
m7 = copyFrom.m7; | |
m8 = copyFrom.m8; | |
m9 = copyFrom.m9; | |
m10 = copyFrom.m10; | |
x = copyFrom.x; | |
} | |
@Override | |
public boolean equals(Object obj) { | |
if (obj == this) { | |
return true; | |
} else if (!(obj instanceof BaseClass)) { | |
return false; | |
} else { | |
BaseClass tmp = (BaseClass) obj; | |
return super.equals(tmp) && Double.compare(anotherField, tmp.anotherField) == 0 | |
&& field1 == tmp.field1 && youCanSeeMe == tmp.youCanSeeMe | |
&& m1 == tmp.m1 && m2 == tmp.m2 && m3 == tmp.m3 && m4 == tmp.m4 | |
&& m5 == tmp.m5 && m6 == tmp.m6 && m7 == tmp.m7 && m8 == tmp.m8 | |
&& m9 == tmp.m9 && m10 == tmp.m10 && x == tmp.x; | |
} | |
} | |
@Override | |
public int hashCode() { | |
int hash = super.hashCode(); | |
hash = 31 * hash + HashUtils.doubleHash(anotherField); | |
hash = 31 * hash + field1; | |
hash = 31 * hash + HashUtils.longHash(youCanSeeMe); | |
hash = 31 * hash + m1; | |
hash = 31 * hash + m2; | |
hash = 31 * hash + m3; | |
hash = 31 * hash + m4; | |
hash = 31 * hash + m5; | |
hash = 31 * hash + m6; | |
hash = 31 * hash + m7; | |
hash = 31 * hash + m8; | |
hash = 31 * hash + m9; | |
hash = 31 * hash + m10; | |
hash = 31 * hash + x; | |
return hash; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment