| 网站首页 | 业界新闻 | 小组 | 威客 | 人才 | 下载频道 | 博客 | 代码贴 | 在线编程 | 编程论坛
欢迎加入我们,一同切磋技术
用户名:   
 
密 码:  
共有 1578 人关注过本帖
标题:求:LZW压缩算法!!!急急!!
只看楼主 加入收藏
jdrwsl
Rank: 1
等 级:新手上路
帖 子:8
专家分:0
注 册:2005-3-20
收藏
 问题点数:0 回复次数:3 
求:LZW压缩算法!!!急急!!
求LZW压缩字符算法程序!!!用c++写的!!
要求:
可以压缩也可以解压!!!
将输入的字符存到文件中!!
然后在从文件中解压出来!!
搜索更多相关主题的帖子: LZW 算法 压缩 字符 解压出 
2005-04-23 07:52
tary
Rank: 1
等 级:新手上路
帖 子:780
专家分:0
注 册:2004-10-5
收藏
得分:0 

说实在的, 这种算法我没接触过, 不过我在网上帮你找了些, 你看一下有没有用?

#include <stdio.h> #include <stdlib.h> #include <string.h> #include "errhand.h" #include "bitio.h" #include "main.h"

#define BITS 15 #define MAX_CODE ( ( 1<<BITS )-1 ) #define TABLE_SIZE 35023l #define TABLE_BANKS ( ( TABLE_SIZE>>8 )+1 ) #define END_OF_STREAM 256 #define BUMP_CODE 257 #define FLUSH_CODE 258 #define FIRST_CODE 259 #define UNUSED -1

void InitializeDictionary(); void InitializeStorage(); unsigned int find_child_node( int parent_code,int child_character ); unsigned int decode_string( unsigned int offset,unsigned int code );

char * CompressionName="LZW 15 Bits Variable Rate Encode"; char * Usage="infile outfile\n\n";

struct dictionary{ int code_value; int parent_code; char character; } * dict[TABLE_BANKS];

#define DICT(i) dict[i>>8][i&0xff]

char decode_stack[TABLE_SIZE]; unsigned int next_code; int current_code_bits; unsigned int next_bump_code;

void InitializeDictionary() { unsigned int i;

for( i=0;i<TABLE_SIZE;i++ ) DICT(i).code_value=UNUSED; next_code=FIRST_CODE; putc( 'F',stdout ); current_code_bits=9; next_bump_code=511; }

void InitializeStorage() { int i;

for( i=0;i<TABLE_BANKS;i++ ) { dict[i]=( struct dictionary * )calloc( 256,sizeof( struct dictionary ) ); if( dict[i]==NULL ) { printf( "TABLE_BANKS=%ld TABLE_SIZE=%ld i=%d\n",TABLE_BANKS,TABLE_SIZE,i ); fatal_error( "Error allocating dictionary space!(1)" ); } } }

void CompressFile( FILE * input,BIT_FILE * output,int argc,char * argv[] ) { int character; int string_code; unsigned int index;

InitializeStorage(); InitializeDictionary(); if( ( string_code=getc( input ) )==EOF ) string_code=END_OF_STREAM; while( ( character=getc( input ) )!=EOF ){ printf("%d",character); putc('#',stdout); index=find_child_node( string_code,character ); if( DICT( index ).code_value!=-1 ) string_code=DICT( index ).code_value; else { DICT( index ).code_value=next_code++; DICT( index ).parent_code=string_code; DICT( index ).character=( char )character; OutputBits( output,( unsigned long )string_code,current_code_bits ); string_code=character; if( next_code>MAX_CODE ) { OutputBits( output,( unsigned long )FLUSH_CODE,current_code_bits ); InitializeDictionary(); } else if( next_code>next_bump_code ){ OutputBits( output,( unsigned long )BUMP_CODE,current_code_bits ); current_code_bits++; next_bump_code<<=1; next_bump_code|=1; putc( 'B',stdout ); } } } OutputBits( output,( unsigned long )string_code,current_code_bits ); OutputBits( output,( unsigned long )END_OF_STREAM,current_code_bits ); while( argc-->0 ) printf( "Unknown argunent:%s\n",* argv++ ); }

void ExpandFile( BIT_FILE * input,FILE * output,int argc,char * argv[] ) { unsigned int new_code; unsigned int old_code; int character; unsigned int count;

InitializeStorage(); while( argc-->0 ) printf( "Unknown argumenr:%s\n",* argv++ ); for( ; ; ) { InitializeDictionary(); old_code=( unsigned int )InputBits( input,current_code_bits ); if( old_code==END_OF_STREAM ) return; character=old_code; putc( old_code,output ); for( ; ; ) { new_code=( unsigned int )InputBits( input,current_code_bits ); if( new_code==END_OF_STREAM ) return; if( new_code==FLUSH_CODE ) break; if( new_code==BUMP_CODE ) { current_code_bits++; putc( 'B',stdout ); continue; } if( new_code>=next_code ) { decode_stack[0]=( char )character; count=decode_string( 1,old_code ); } else count=decode_string( 0,new_code ); character=decode_stack[count-1]; while( count>0 ) putc( decode_stack[--count],output ); DICT( next_code ).parent_code=old_code; DICT( next_code ).character=( char )character; next_code++; old_code=new_code; } } }

unsigned int find_child_node( int parent_code,int child_character ) { unsigned int index; int offset; index=( child_character<<( BITS-8 ) )^parent_code; if( index==0 ) offset=1; else offset=TABLE_SIZE-index; for( ; ; ) { if( DICT( index ).code_value==UNUSED ) return( ( unsigned int )index ); if( DICT( index ).parent_code==parent_code && DICT( index ).character==( char )child_character ) return( index ); if( ( int )index>=offset ) index-=offset; else index+=TABLE_SIZE-offset; } }

unsigned int decode_string( unsigned int count,unsigned int code ) { while( code>256 ){ decode_stack[count++]=DICT( code ).character; code=DICT( code ).parent_code; } decode_stack[count++]=( char )code; return( count ); }



[此贴子已经被作者于2005-4-26 14:00:36编辑过]


┌→¨ ≮我可以学会对你很冷落≯¨←┐ │  <却学不╓══╦══╖会将爱> │ │¨←┐ ╭╩╮哭‖哭╭╩╮ ┌→¨│ └──┘收 ╲╱ ◇‖◇ ╲╱回└──┘
2005-04-26 13:59
tary
Rank: 1
等 级:新手上路
帖 子:780
专家分:0
注 册:2004-10-5
收藏
得分:0 
程序还没完, 其它的不知道在哪? 这些你先看着吧. 希望有点用.

┌→¨ ≮我可以学会对你很冷落≯¨←┐ │  <却学不╓══╦══╖会将爱> │ │¨←┐ ╭╩╮哭‖哭╭╩╮ ┌→¨│ └──┘收 ╲╱ ◇‖◇ ╲╱回└──┘
2005-04-26 14:01
live41
Rank: 10Rank: 10Rank: 10
等 级:贵宾
威 望:67
帖 子:12442
专家分:0
注 册:2004-7-22
收藏
得分:0 
2005-04-27 19:17
快速回复:求:LZW压缩算法!!!急急!!
数据加载中...
 
   



关于我们 | 广告合作 | 编程中国 | 清除Cookies | TOP | 手机版

编程中国 版权所有,并保留所有权利。
Powered by Discuz, Processed in 0.037156 second(s), 7 queries.
Copyright©2004-2024, BCCN.NET, All Rights Reserved