String源码

//类修饰符(final) -> 安全(底层用到String)、性能(字符串常量池)
public final class String{}

//属性(char[],hash)
private final char value[];
private int hash;

//构造函数(char[],String,StringBuffer,StringBuilder)

//hashCode方法(s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1]*31^0)
public int hashCode() {
	int h = hash;
	if (h == 0 && value.length > 0) {
		char val[] = value;

		for (int i = 0; i < value.length; i++) {
                        //性能好、不容易hash碰撞、不容易溢出(31*i = 32*i - i = i<<5 - i)
			h = 31 * h + val[i];
		}
		hash = h;
	}
	return h;
}

//重写equals方法(先比较对象地址,再比较长度,再比较每个字符)
public boolean equals(Object anObject) {
	if (this == anObject) {
		return true;
	}
	if (anObject instanceof String) {
		String anotherString = (String)anObject;
		int n = value.length;
		if (n == anotherString.value.length) {
			char v1[] = value;
			char v2[] = anotherString.value;
			int i = 0;
			while (n-- != 0) {
				if (v1[i] != v2[i])
					return false;
				i++;
			}
			return true;
		}
	}
	return false;
}

//compareTo方法(先比较每个字符,再比较长度)
public int compareTo(String anotherString) {
	int len1 = value.length;
	int len2 = anotherString.value.length;
	int lim = Math.min(len1, len2);
	char v1[] = value;
	char v2[] = anotherString.value;

	int k = 0;
	while (k < lim) {
		char c1 = v1[k];
		char c2 = v2[k];
		if (c1 != c2) {
			return c1 - c2;
		}
		k++;
	}
	return len1 - len2;
}

//== 和 equals
//==:     若比较基础类型,比较的是值;若比较对象,比较的是对象地址
//equals: 比较的是对象的equals方法