动态哈夫曼压缩算法代码,C代码库,德仔网

代码语言

代码分类

【C】动态哈夫曼压缩算法

作者:刘地 / 发布于2013/10/11/ 695


	#include <stdio.h>

	namespace huffman
	{
	const char leaf[16]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};

	typedef unsigned char byte;

	class node
	{
	 public:
	 node *Basic;
	 node *Lside;
	 node *Rside;
	 long Symbol;
	 byte Volume;
	 public:
	 node(){Basic=Lside=Rside=(node*)leaf;Symbol=1;}
	 node(long n,const byte &t):Symbol(n),Volume(t){Basic=Lside=Rside=(node*)leaf;}
	};
	node *original(node *t)
	{
	 node *p,*r;

	 for(r=t;r-t<256;r++)
	 {
	 r->Symbol=0;
	 r->Volume=r-t;
	 }
	 for(p=t;p+1<r;p++,r++)
	 {
	 r->Symbol=0;
	 r->Volume=0;
	 r->Lside=p;
	 p->Basic=r;
	 p++;
	 r->Rside=p;
	 p->Basic=r;
	 }
	 return p;
	}
	node *maintain(node *r)
	{
	 node *p,*q,*a,*b,*t;
	 for(p=r->Basic;leaf!=(char*)p;p=r->Basic)
	 {
	 r=p;
	 p=r->Lside;
	 q=r->Rside;
	 if(p->Symbol>q->Symbol)
	 {
	 r->Lside=q;
	 r->Rside=p;
	 t=p,p=q,q=t;
	 }
	 if(p->Symbol<q->Symbol)
	 {
	 a=q->Lside;
	 b=q->Rside;
	 if(b->Symbol>p->Symbol)
	 {
	 t=r->Basic;
	 if(leaf!=(char*)t)
	 {
	 if(t->Lside==r)t->Lside=q;else t->Rside=q;
	 }

	 r->Rside=a;
	 if(leaf!=(char*)a)a->Basic=r;
	 r->Symbol=p->Symbol+a->Symbol;

	 q->Basic=t;
	 r->Basic=q;
	 q->Symbol=r->Symbol+b->Symbol;

	 p=r,r=q,q=b;
	 if(p->Symbol>q->Symbol)
	 {
	 r->Lside=q;
	 r->Rside=p;
	 }
	 else
	 {
	 r->Lside=p;
	 r->Rside=q;
	 }
	 continue;
	 }
	 }
	 r->Symbol=p->Symbol+q->Symbol;
	 }
	 return r;
	}
	void encode(const char *to,const char *from)
	{
	 FILE *src=fopen(from,"rb");
	 FILE *hfm=fopen(to,"wb");
	 node *p,*q,*r;
	 node arr[512];
	 bool t[256];
	 int i,j;
	 byte c,o;

	 if(src==NULL || hfm==NULL)return;
	 original(arr);
	 c=0,i=j=0;
	 for(;;)
	 {
	 o=fgetc(src);
	 if(feof(src))break;

	 r=arr+byte(o);
	 for(p=r;;p=q)
	 {
	 q=p->Basic;
	 if(leaf==(char*)q)
	 {
	 break;
	 }
	 if(q->Lside==p)
	 {
	 t[i++]=0;
	 }
	 else
	 {
	 t[i++]=1;
	 }
	 }
	 r->Symbol++;
	 maintain(r);
	 while(i)
	 {
	 i--;
	 c= c<<1 | int(t[i]);
	 j++;
	 if(j==8)
	 {
	 putc(c,hfm);
	 c=0,j=0;
	 }
	 }
	 }
	 if(j)
	 {
	 putc(c<<(8-j),hfm);
	 }
	 fclose(src);
	 fclose(hfm);
	}
	void decode(const char *to,const char *from)
	{
	 FILE *hfm=fopen(from,"rb");
	 FILE *dst=fopen(to,"wb");
	 node arr[512];
	 node *p,*q;
	 char c;
	 int i;

	 if(hfm==NULL || dst==NULL)return;
	 p=original(arr);
	 for(;;)
	 {
	 c=fgetc(hfm);
	 if(feof(hfm))break;

	 for(i=7;i>=0;i--)
	 {
	 q = (c>>i)&1 ? p->Rside : p->Lside;
	 if(leaf==(char*)q)
	 {
	 putc((char)p->Volume,dst);
	 p->Symbol++;
	 p=maintain(p);
	 i++;
	 }
	 else p=q;
	 }
	 }
	 if(leaf==(char*)p->Lside && leaf==(char*)p->Rside)
	 {
	 putc((char)p->Volume,dst);
	 }
	 fclose(hfm);
	 fclose(dst);
	}
	}

评论列表

本站所提供的代码，版权归原作者所有，若有侵犯作者版权，请与我们联系，我们将立即删除或修改。谢谢!
本站所有代码发布及提供者。

试试其它关键字

　动态哈夫曼　

同语言下

可能有用的

刘地贡献的其它代码(3)