复数的java简单实现

/**
 * 复数的简单实现
 * @author cui
 *
 */
public final class Complex {

	private final double re;
	private final double im;
	public Complex(double re, double im) {
		this.re = re;
		this.im = im;
	}
	public double realPart(){
		return re;
	}
	public double imaginaryPart(){
		return im;
	}
	public Complex add(Complex c) {
		return new Complex(re + c.re, im + c.im);
	}
	public Complex subtract(Complex c) {
		return new Complex(re - c.re, im - c.im);
	}
	
	public Complex multiply(Complex c) {
		return new Complex(re * c.re - im * c.im,
						   re * c.im + im * c.re);
	}

	public Complex divide(Complex c) {
		double tmp = c.re * c.re + c.im * c.im;
		return new Complex((re * c.re + im * c.im) / tmp,
						   (im * c.re - re* c.im)/ tmp);
	}
	
	@Override//复写equals方法的同时一定要复写hashCode方法
	public boolean equals(Object obj) {
		if (obj == this)
			return true;
		if (!(obj instanceof Complex))
			return false;
		Complex c = (Complex) obj;
		return Double.compare(c.re, re) == 0 && 
			   Double.compare(im, c.im) == 0;
	}
	
	
	@Override
	public int hashCode() {
		int result = 17 + hashDouble(re);
		result = 31 * result + hashDouble(im);
		return result;
	}
	
	private int hashDouble(double val) {
		long longBits = Double.doubleToLongBits(val);
		return (int) (longBits ^ (longBits >>> 32));
	}
	
	@Override
	public String toString() {
		return "(" + re + "+" + im + "i)";
	}
	
	
	
	public static void main(String[] args) {

		Complex c = new Complex(0, 3);
		System.out.println(c);

	}
	
}