//對霍夫曼樹進行編碼，生成編碼和編碼文件
#ifndef HuffEncode_H
#define HuffEncode_H
#include<iostream.h>
void HuffEncode(HuffTree *htree,huffcode *hcode,FreqPair* letter,char * f_code){
    int hcodecount=0;   
    ofstream f_out(f_code);
char *path=new char[20];
int pathcount=0;
f_out.setf(ios::left,ios::adjustfield);
  htree->encode(htree->root(),hcode,hcodecount,path,pathcount);	
	f_out<<setw(15)<<"letter"<<setw(15)<<"weight"<<setw(15)<<"code"<<endl;
	for(int i=0;i<hcodecount;i++)
		for(int j=0;j<hcodecount;j++)
			if(hcode[j].letter==letter[i].val())
					f_out<<setw(15)<<letter[i].val()<<setw(15)<<letter[i].weight()<<setw(15)<<hcode[j].code<<endl;
				
	f_out.close();
}
#endif