package huffman;

import java.util.Arrays;

/**
 * 压缩和解压缩的测试类
 * 
 * @author dongyunqi
 * @date 2018年7月30日上午10:27:37
 * @description
 */
public class ConAndUnTest {

	public static void main(String[] args) throws Exception {
		Conpress conpress = new Conpress();
		conpress.countTimes("d:\\test\\makeFile.txt");
		HuffmanNode1 root = conpress.createTree();
		// qianxuDigui(root);
		// 获取哈夫曼编码
		conpress.getHuffmCode(root, "");
//		for (int i = 0 ; i < conpress.huffmCodes.length; i++) {
//			System.out.println(i + "***********" + conpress.huffmCodes[i]);
//		}
		// 压缩文件
		conpress.compress("d:\\\\test\\\\makeFile.txt", "d:\\\\\\\\test\\\\\\\\makeFile_conpress.zip");
		DeConpress deConpress = new DeConpress();
		deConpress.decompress("d:\\test\\makeFile_conpress.zip", "d:\\test\\makeFile_conpress.txt");
	}
	
	/**
	 * 前序递归方式遍历 根左右
	 * 
	 * @param searchTree
	 */
	public static void qianxuDigui(HuffmanNode1 node) {
		if (node != null) {
			System.out.println(node.getData() + "-！！-" + node.getWeight());
			qianxuDigui(node.getLeftNode());
			qianxuDigui(node.getRightNode());
		}
	}
}