killpy 压缩代码有吗

Kisesy 日本某公司的压缩吧 [em_41]

可能是这种，和你写的这个几乎一样，不过也只有解压
https://github.com/shangjiaxuan/Crass-source/blob/4aff113b98fc39fb85f64501ab47c580df779a3d/cui-1.0.4/SystemC/SystemC.cpp#L85

看代码应该是个简单的 rle 压缩，而且稍微有规律，压缩完的数据，前面几段，每隔8位是一个0，不过靠后的数据就不一样了，比如这个2，很可能是判断出有重复文本了，不过你给的数据太少了，看不出多少规律来

不过其实根据解压代码写压缩应该不难，不过反正我实在是不想写。。。以前写过

这个是算法的乐趣上的代码，有 Rle 和 PcxRle 两种
他这个 Rle 压缩是只有3个或以上的重复的才会当作重复数据，你看着改改看吧

int PcxRle_Encode(unsigned char *inbuf, int inSize, unsigned char *outbuf, int onuBufSize)
{
    unsigned char *src = inbuf;
    int i;
    int encSize = 0;

    while(src < (inbuf + inSize))
    {
        unsigned char value = *src++;
        i = 1;
        while((*src == value) && (i < 63))
        {
            src++;
            i++;
        }

        if((encSize + i + 1) > onuBufSize) /*输出缓冲区空间不够了*/
        {
            return -1;
        }
        if(i > 1)
        {
            outbuf[encSize++] = i | 0xC0;
            outbuf[encSize++] = value;
        }
        else
        {
            /*如果非重复数据最高两位是1，插入标识字节*/
            if((value & 0xC0) == 0xC0) 
            {
                outbuf[encSize++] = 0xC1;
            }
            outbuf[encSize++] = value;
        }
    }

    return encSize;
}

int PcxRle_Decode(unsigned char *inbuf, int inSize, unsigned char *outbuf, int onuBufSize)
{
    unsigned char *src = inbuf;
    int i;
    int decSize = 0;
    int count = 0;

    while(src < (inbuf + inSize))
    {
        unsigned char value = *src++;
        int count = 1;
        if((value & 0xC0) == 0xC0) /*是否有块属性标志*/
        {
            count = value & 0x3F; /*低6位是count*/
            value = *src++;
        }
        else
        {
            count = 1;
        }
        if((decSize + count) > onuBufSize) /*输出缓冲区空间不够了*/
        {
            return -1;
        }
        for(i = 0; i < count; i++)
        {
            outbuf[decSize++] = value;
        }
    }

    return decSize;
}

bool IsRepetitionStart(unsigned char *start, int length)
{
    if(length <= 2)
        return false;

    if( (*(start + 1) == *start) && (*(start + 2) == *start) )
    {
        return true;
    }

    return false;
}

/*限制返回长度不超过127*/
int GetRepetitionCount(unsigned char *start, int length)
{
    if(length <= 1)
        return length;

    unsigned char value = *start;
    unsigned char *src = start + 1;
    int i = 1;
    while( (src < (start + length)) && (i < 127) )
    {
        if(*src != value)
        {
            break;
        }

        i++;
        src++;
    }

    return i;
}

/*限制返回长度不超过127*/
int GetNonRepetitionCount(unsigned char *start, int length)
{
    if(length <= 1)
        return length;

    unsigned char value = *start;
    unsigned char *src = start;
    int i = 0;
    while( (src < (start + length)) && (i < 127) )
    {
        if(IsRepetitionStart(src, length - i))
        {
            break;
        }

        i++;
        src++;
    }

    return i;
}

int Rle_Encode(unsigned char *inbuf, int inSize, unsigned char *outbuf, int onuBufSize)
{
    unsigned char *src = inbuf;
    int i;
    int encSize = 0;
    int srcLeft = inSize;

    while(srcLeft > 0)
    {
        int count = 0;
        if(IsRepetitionStart(src, srcLeft)) /*是否连续三个字节数据相同？*/
        {
            if((encSize + 2) > onuBufSize) /*输出缓冲区空间不够了*/
            {
                return -1;
            }
            count = GetRepetitionCount(src, srcLeft);
            outbuf[encSize++] = count | 0x80;
            outbuf[encSize++] = *src;
            src += count;
            srcLeft -= count;
        }
        else
        {
            count = GetNonRepetitionCount(src, srcLeft);
            if((encSize + count + 1) > onuBufSize) /*输出缓冲区空间不够了*/
            {
                return -1;
            }
            outbuf[encSize++] = count;
            for(i = 0; i < count; i++) /*逐个复制这些数据*/
            {
                outbuf[encSize++] = *src++;;
            }
            srcLeft -= count;
        }
    }
    return encSize;
}

int Rle_Decode(unsigned char *inbuf, int inSize, unsigned char *outbuf, int onuBufSize)
{
    unsigned char *src = inbuf;
    int i;
    int decSize = 0;
    int count = 0;

    while(src < (inbuf + inSize))
    {
        unsigned char sign = *src++;
        int count = sign & 0x3F;
        if((decSize + count) > onuBufSize) /*输出缓冲区空间不够了*/
        {
            return -1;
        }
        if((sign & 0x80) == 0x80) /*连续重复数据标志*/
        {
            for(i = 0; i < count; i++)
            {
                outbuf[decSize++] = *src;
            }
            src++;
        }
        else
        {
            for(i = 0; i < count; i++)
            {
                outbuf[decSize++] = *src++;
            }
        }
    }

    return decSize;
}

Kisesy 可能是这种，和你写的这个几乎一样，不过也只有解压 https://github.com/shangjiaxuan/Crass-source/blob/4aff113b98fc39fb85f64501 ...

crskyii 所以……[em_86]