搜索资源列表
my_lzw_coding
- LZW算法的编码器，使之能对大写英文字母构成的字符串编码 -LZW algorithm for the encoder, so it will be able to capitalize alphabetical constitute string coding
LZW算法源码C语言
- LZW压缩算法简介 作者:宋成 描述:一篇关于LZW压缩算法简介的文章，通俗易懂，值得一看！ 备注:该文章整理自软件报1998年合订本上册。 LZW压缩算法是一种新颖的压缩方法，由Lemple-Ziv-Welch 三人共同创造，用他们的名字命名。它采用了一种先进的串表压缩不，将每个第一次出现的串放在一个串表中，用一个数字来表示串，压缩文件只存贮数字，则不存贮串，从而使图象文件的压缩效率得到较大的提高。奇妙的是，不管是在压缩还是在解压缩的过程中都能正确的建立这个串表，
afirst
- a开头和a结尾的字符串-a beginning and the end of a string
qms
- Quick Mutli Search算法，对QuickSearch算法的改进，支持一次搜索多个子串、正/反向查找、不区分大小写查找-Quick Search algorithm, right QuickSearch algorithm, to support a number of search-string is / Reverse Search, Search is case insensitive
dist2
- 字符串匹配的BM算法,完全自己做出来的, 大家可以拿去参考,一切分享-BM string matching algorithm, completely on my own to do it, we can spend reference, all sharing
String-Similarity-0.02.tar
- 此程序是关于字符串 模糊相似度的计算程序（C语言）-this program is a string of vague similarity calculation procedures (C language)
chf
- 递归的字符串逆序,将带有空格的一行字符串按照单词的顺序逆序排列.例如:this is a string. 转化为string a is this.-recursive string reversal, with his string of blanks in accordance with the order of words printed in reverse chronological order. For example : this is a string. into a string
bianyizlh
- 自动生成一个LL(1)文法。对输入文法，由程序自动生成它的LL(1)分析表；对于给定的输入串，应能判断识别该串是否为给定文法的句型-LL (1) grammar. On the importation of grammar, automatically generated from the LL (1) Analysis Table; For a given input string, Recognition should be able to judge whether the series
zip&unzip
- 利用Java实现zip压缩/解压缩。randomData()函数随机生成50个double数据,并放在doc字符串变量中 openFile()函数读取ZIP压缩文件 saveFile()函数将随机生成的数据存到ZIP格式的压缩文件中。-use Java zip compression / decompression. RandomData () function randomly generated 50 double data and on the doc string variable op
lzss_huf
- This scheme is initiated by Ziv and Lempel [1]. A slightly modified version is described by Storer and Szymanski [2]. An implementation using a binary tree is proposed by Bell [3]. The algorithm is quite simple: Keep a ring buffer, which initially co
lzw3
- 字符串的压缩与解压，输入一字符串文件，压缩后得一文件，在经解压得原文件。大家一起分享。-string compression and decompression, the importation of a string, in a compressed file, after decompression in the original document. To share with everyone.
huffmantree
- 动态对文件和字符串统计个字符出现的次数作为其权值，以实现霍夫曼编码，达到节省存储空间的目的。-Dynamic string of documents and statistics on the number of characters appear as part of its weight in order to achieve the Huffman coding to achieve the purpose of saving storage space.
HuffmanCode
- /*哈夫曼编/译码器 完成Huffman 编码的译码过程。 即输入一个码串，请翻译成相应的字符串。 要求有编码过程和解码过程。*/-/* Huffman encoder/decoder to complete the decoding process of Huffman encoding. That the input string 1 yards, please be translated into the corresponding string. Requirements
huffman_me
- 对输入的字符串各个字符出现次数的概率进行霍夫曼编码，并对其过程进行详细图形显示-Enter the string of characters appear in all probability the number of Huffman code, and a detailed graphical display process
substr
- 把链表S中从第m个元素起共n个元素存储到s中，成功返回1，否则返回0int LEN(STRING S) -S in the list from the first m elements from a total of n elements stored in the s successful one back, otherwise return 0int LEN (STRING S)
LL1
- c++词法分析器。可以分析简单的输入字符串。希望对大家有帮助。-c++ lexical analyzer. Easy to analyze the input string. I hope there is help for everyone.
bianmayuanli
- 算术编码方法是将被编码的一则消息或符号串（序列）表示成0和1之间的一个间隔（Interval），即对一串符号直接编码成[0,1]区间上的一个浮点小数。符号序列越长，编码表示它的间隔越小，表示这一间隔所需的位数就越多。信源中的符号序列仍然要根据某种模式生成概率的大小来减少间隔。可能出现的符号概率要比不太可能出现的符号减少范围小，因此，只正加较少的比特位。-Arithmetic coding method is to be a coded message or symbol strings (seq
string
- 解决string的基本操作 赋值，判相等，联接，求长度，求子串，子串定位，串替换，显示，删除，退出。-string
huffman-src
- Generate a Huffman Tree for an input String.
String
- 手工实现string的功能，包括添加，删除，查找，连接运算等功能。-string code