public int search(CharNode node, char[] sen, int offset, int tailLen) {
		if(node != null) {
			return node.indexOf(sen, offset, tailLen);
		}
		return -1;
	}
public int search(CharNode node, char[] sen, int offset, int tailLen) {
		if(node != null) {
			return node.indexOf(sen, offset, tailLen);
		}
		return -1;
	}
public int search ( CharNode node , char [ ] sen , int offset , int tailLen ) { if ( node != null ) { return node . indexOf ( sen , offset , tailLen ) ; } return - 1 ; }
sen[offset] 后 tailLen 长的词是否存在.
@see CharNode#indexOf(char[], int, int)
@author chenlb 2009-4-8 下午11:13:49
sen [ offset ] 后 tailLen 长的词是否存在 .