java判断字符范围（URI的实现）

核心思想：字符有个数字，然后再进行移位，再与原先的字符进行与比较，如下：

private static long lowMask(String chars) {
		int n = chars.length();
		long m = 0;
		for (int i = 0; i < n; i++) {
			char c = chars.charAt(i);
			if (c < 64)
				m |= (1L << c);
		}
		return m;
	}

	// Compute the high-order mask for the characters in the given string
	private static long highMask(String chars) {
		int n = chars.length();
		long m = 0;
		for (int i = 0; i < n; i++) {
			char c = chars.charAt(i);
			if ((c >= 64) && (c < 128))
				m |= (1L << (c - 64));
		}
		return m;
	}

	// Compute a low-order mask for the characters
	// between first and last, inclusive
	private static long lowMask(char first, char last) {
		long m = 0;
		long result = 0;
		int f = Math.max(Math.min(first, 63), 0);
		int l = Math.max(Math.min(last, 63), 0);
		for (int i = f; i <= l; i++){
			long temp = 1L << i;
			result += temp;
			m |= 1L << i;
			//m |= i;
		}
		return m;
	}

	// Compute a high-order mask for the characters
	// between first and last, inclusive
	private static long highMask(char first, char last) {
		long m = 0;
		int f = Math.max(Math.min(first, 127), 64) - 64;
		int l = Math.max(Math.min(last, 127), 64) - 64;
		for (int i = f; i <= l; i++)
			m |= 1L << i;
		return m;
	}

	// Tell whether the given character is permitted by the given mask pair
	private static boolean match(char c, long lowMask, long highMask) {
		if (c < 64)
			return ((1L << c) & lowMask) != 0;
		if (c < 128)
			return ((1L << (c - 64)) & highMask) != 0;
		return false;
	}
    @Test
	public void testMatch(){
        long lowMask = lowMask('0','9');
        System.out.println("x=="+(int)'x');
        boolean ismatch = match('x',lowMask,0l);
        
        System.out.println("lowMask============="+lowMask+","+ismatch);
	}