int n = lowercase[(name[j + start]) & 0xFF] - lowercase[(arg.name[j + astart]) & 0xFF];
int n = lowercase[(name[j + start + 1]) & 0xFF] - lowercase[(arg.name[j + astart + 1]) & 0xFF];
compareTo(Object o) {	Name arg = (Name) o;	if (this == arg)		return (0);	byte labels = labels();	byte alabels = arg.labels();	int compares = labels > alabels ? alabels : labels;	for (int i = 1; i <= compares; i++) {		int start = offset(labels - i);		int astart = arg.offset(alabels - i);		int length = name[start];		int alength = arg.name[astart];		for (int j = 0; j < length && j < alength; j++) {			int n = lowercase[(name[j + start]) & 0xFF] -				lowercase[(arg.name[j + astart]) & 0xFF];			if (n != 0)				return (n);		}		if (length != alength)			return (length - alength);	}	return (labels - alabels);}