private void frontOrderSearch(TrieTreeNode n, String base, List<String> zipedFileList) {
		if (n.stopable) {
			zipedFileList.add(base);
		}
		if (n.acceptableNumberRange[0] != -1) {
			zipedFileList.add(base + dividChar + n.acceptableNumberRange[0]//
					+ dividChar + n.acceptableNumberRange[1]);
		}
		for (int i = 0; i < n.children.length; i++) {
			if (n.children[i] == null)
				continue;
			frontOrderSearch(n.children[i], base + acceptableCharactors.charAt(i), zipedFileList);
		}
	}