141 lines
4.5 KiB
C++
141 lines
4.5 KiB
C++
/*
|
|
PIP - Platform Independent Primitives
|
|
Byte array
|
|
Copyright (C) 2011 Ivan Pelipenko peri4ko@gmail.com
|
|
|
|
This program is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License as published by
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#ifndef PIBYTEARRAY_H
|
|
#define PIBYTEARRAY_H
|
|
|
|
#include "pibitarray.h"
|
|
|
|
#pragma pack(push, 1)
|
|
|
|
static const char base64Table[64] = {
|
|
0x41, 0x42, 0x43, 0x44, 0x45, 0x46, 0x47, 0x48,
|
|
0x49, 0x4a, 0x4b, 0x4c, 0x4d, 0x4e, 0x4f, 0x50,
|
|
0x51, 0x52, 0x53, 0x54, 0x55, 0x56, 0x57, 0x58,
|
|
0x59, 0x5a, 0x61, 0x62, 0x63, 0x64, 0x65, 0x66,
|
|
0x67, 0x68, 0x69, 0x6a, 0x6b, 0x6c, 0x6d, 0x6e,
|
|
0x6f, 0x70, 0x71, 0x72, 0x73, 0x74, 0x75, 0x76,
|
|
0x77, 0x78, 0x79, 0x7a, 0x30, 0x31, 0x32, 0x33,
|
|
0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x2b, 0x2f};
|
|
|
|
static const char base64InvTable[256] = {
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x3E, 0x0, 0x0, 0x0, 0x3F,
|
|
0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x3A, 0x3B,
|
|
0x3C, 0x3D, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x1, 0x2, 0x3, 0x4, 0x5, 0x6,
|
|
0x7, 0x8, 0x9, 0xA, 0xB, 0xC, 0xD, 0xE,
|
|
0xF, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16,
|
|
0x17, 0x18, 0x19, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x1A, 0x1B, 0x1C, 0x1D, 0x1E, 0x1F, 0x20,
|
|
0x21, 0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28,
|
|
0x29, 0x2A, 0x2B, 0x2C, 0x2D, 0x2E, 0x2F, 0x30,
|
|
0x31, 0x32, 0x33, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0,
|
|
0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0, 0x0};
|
|
|
|
#pragma pack(pop)
|
|
|
|
class PIByteArray;
|
|
|
|
class PIHuffman {
|
|
public:
|
|
PIVector<uchar> compress(const PIVector<uchar> & src);
|
|
|
|
private:
|
|
struct node {
|
|
int freq;
|
|
PIVector<uchar> word;
|
|
PIBitArray path;
|
|
node * parent;
|
|
node * right;
|
|
node * left;
|
|
};
|
|
static int nodeCompare(const void * f, const void * s);
|
|
void calcFrequencies(const PIVector<uchar> & src);
|
|
PIVector<node> nodes;
|
|
};
|
|
|
|
class PIByteArray: public PIVector<uchar> {
|
|
public:
|
|
PIByteArray() {;}
|
|
PIByteArray(const uint size) {resize(size);}
|
|
PIByteArray(const void * data, const uint size) {for (uint i = 0; i < size; ++i) push_back(((uchar * )data)[i]);}
|
|
|
|
PIByteArray & convertToBase64();
|
|
PIByteArray & convertFromBase64();
|
|
PIByteArray toBase64() {PIByteArray ba(*this); ba.convertToBase64(); return ba;}
|
|
PIByteArray fromBase64() {PIByteArray ba(*this); ba.convertFromBase64(); return ba;}
|
|
|
|
PIByteArray & compressRLE(uchar threshold = 192);
|
|
PIByteArray & decompressRLE(uchar threshold = 192);
|
|
PIByteArray compressedRLE(uchar threshold = 192) {PIByteArray ba(*this); ba.compressedRLE(threshold); return ba;}
|
|
PIByteArray decompressedRLE(uchar threshold = 192) {PIByteArray ba(*this); ba.decompressedRLE(threshold); return ba;}
|
|
|
|
PIByteArray & compressHuffman() {*this = huffman.compress(*this); return *this;}
|
|
|
|
uchar checksumPlain8();
|
|
uint checksumPlain32();
|
|
uchar checksumCRC8();
|
|
ushort checksumCRC16();
|
|
uint checksumCRC32();
|
|
|
|
void operator =(const PIVector<uchar> & d) {resize(d.size()); for (uint i = 0; i < size(); ++i) (*this)[i] = d[i];}
|
|
|
|
private:
|
|
union base64HelpStruct {
|
|
struct {
|
|
uchar ascii0: 6;
|
|
uchar ascii1: 6;
|
|
uchar ascii2: 6;
|
|
uchar ascii3: 6;
|
|
};
|
|
struct {
|
|
uchar byte0;
|
|
uchar byte1;
|
|
uchar byte2;
|
|
};
|
|
};
|
|
|
|
static PIHuffman huffman;
|
|
|
|
};
|
|
|
|
inline std::ostream & operator <<(std::ostream & s, const PIByteArray & ba) {for (uint i = 0; i < ba.size(); ++i) s << ba[i]; return s;}
|
|
|
|
#endif // PIBYTEARRAY_H
|