Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - MemSet
Search - MemSet - List
在网上能够找到的最简单,最快速的哈夫曼编码。本方法不使用任何扩展动态库,比如STL或者组件。只使用简单的C函数,比如:memset,memmove,qsort,malloc,realloc和memcpy。-Online to find the simplest, fastest Huffman. This method does not use any extension of the dynamic libraries, such as STL or components. Only using a simple C function, such as: memset, memmove, qsort, malloc, realloc and memcpy.
Date : 2025-12-31 Size : 14kb User : zhaoyibin

本文描述在网上能够找到的最简单,最快速的哈夫曼编码。本方法不使用任何扩展动态库,比如STL或者组件。只使用简单的C函数,比如:memset,memmove,qsort,malloc,realloc和memcpy。 大家都会发现,理解甚至修改这个编码都很容易-This article describes the Internet to find the simplest, fastest Huffman. This method does not use any extension of the dynamic libraries, such as STL or components. Only using a simple C function, such as: memset, memmove, qsort, malloc, realloc and memcpy. We will find, understand and even modify the code easily
Date : 2025-12-31 Size : 142kb User : 李虚东

DES和RSA混合加密DES密码体制主要由3方面组成:密钥生成、加密函数以及解密函数。该算法在VC6.0的平台下以C++来实现。子函数说明-   Void SetKey(const char* Key, int len)    {     Memset(deskey,0,16)     Memcpy(deskey,key,len>16?16:len)     SetSubKey(&SubKey[0],&deskey[0])     Is3DES = len>8 ? (SetSubKey[1],&deskey[8]),ture) : false    }    Void SDES(char Out[8],char In[8],const PSubKey pSubKey,bool Type)    {     Static bool M[64],tmp[32],*Li=&M[0],*Ri=&M[32]     ByteToBit(M,In,64)     Transform(M,M,IP_Table,64)     If( Type == ENCRYPT){     For(int i=0 i<16 ++i){     Memcpy(tmp,Ri,32)     F_func(Ri,(*pSUBkEY)[I])     Xor(Ri,Li,32)     Memcpy(Li,tmp,32)     }     }else{     For(int i=15 i>=0 --i){     Memcpy(tmp.Li,32)     F_func(Li,(*pSubKey)[i])     Xor(Li,Ri,32)     Memcpy(Ri,tmp,32)     }     }     Transform(M,M,IPR_Table,64)     BitToByte(Out,M,64)    }
Date : 2025-12-31 Size : 128kb User : 何旭
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.