255 lines
13 KiB
C++
255 lines
13 KiB
C++
/*! \file pibytearray.h
|
|
* \brief Byte array
|
|
*/
|
|
/*
|
|
PIP - Platform Independent Primitives
|
|
Byte array
|
|
Copyright (C) 2013 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
|
|
|
|
#ifdef DOXYGEN
|
|
//! This macro allow stream template operators for write and read any type from byte array. Use it with attention!
|
|
# define PIP_BYTEARRAY_STREAM_ANY_TYPE
|
|
#endif
|
|
|
|
#include "pibitarray.h"
|
|
|
|
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 PIP_EXPORT PIByteArray: public PIVector<uchar>
|
|
{
|
|
public:
|
|
|
|
//! Constructs an empty byte array
|
|
PIByteArray() {;}
|
|
|
|
//! Constructs 0-filled byte array with size "size"
|
|
PIByteArray(const uint size) {resize(size);}
|
|
|
|
//! Constructs byte array from data "data" and size "size"
|
|
PIByteArray(const void * data, const uint size) {for (uint i = 0; i < size; ++i) push_back(((uchar * )data)[i]);}
|
|
|
|
|
|
//! Help struct to store/restore custom blocks of data to/from PIByteArray
|
|
struct RawData {
|
|
friend PIByteArray & operator <<(PIByteArray & s, const PIByteArray::RawData & v);
|
|
friend PIByteArray & operator >>(PIByteArray & s, PIByteArray::RawData v);
|
|
public:
|
|
//! Constructs data block
|
|
RawData(void * data, int size) {d = data; s = size;}
|
|
//! Constructs data block
|
|
RawData(const void * data, const int size) {d = const_cast<void * >(data); s = size;}
|
|
RawData & operator =(const RawData & o) {d = o.d; s = o.s; return *this;}
|
|
private:
|
|
void * d;
|
|
int s;
|
|
};
|
|
|
|
//! Return resized byte array
|
|
PIByteArray resized(int new_size) {PIByteArray tv(*this); tv.resize(new_size); return tv;}
|
|
|
|
//! Convert data to Base 64 and return this byte array
|
|
PIByteArray & convertToBase64();
|
|
|
|
//! Convert data from Base 64 and return this byte array
|
|
PIByteArray & convertFromBase64();
|
|
|
|
//! Return converted to Base 64 data
|
|
PIByteArray toBase64() {PIByteArray ba(*this); ba.convertToBase64(); return ba;}
|
|
|
|
//! Return converted from Base 64 data
|
|
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.compressRLE(threshold); return ba;}
|
|
PIByteArray decompressedRLE(uchar threshold = 192) {PIByteArray ba(*this); ba.decompressRLE(threshold); return ba;}
|
|
|
|
PIByteArray & compressHuffman() {*this = huffman.compress(*this); return *this;}
|
|
|
|
//! Add to the end data "data" with size "size"
|
|
PIByteArray & append(const void * data_, int size_) {uint ps = size(); enlarge(size_); memcpy(data(ps), data_, size_); return *this;}
|
|
|
|
//! Add to the end byte array "data"
|
|
PIByteArray & append(const PIByteArray & data_) {uint ps = size(); enlarge(data_.size_s()); memcpy(data(ps), data_.data(), data_.size()); return *this;}
|
|
/*PIByteArray & operator <<(short v) {for (uint i = 0; i < sizeof(v); ++i) push_back(((uchar*)(&v))[i]); return *this;}
|
|
PIByteArray & operator <<(ushort v) {for (uint i = 0; i < sizeof(v); ++i) push_back(((uchar*)(&v))[i]); return *this;}
|
|
PIByteArray & operator <<(int v) {for (uint i = 0; i < sizeof(v); ++i) push_back(((uchar*)(&v))[i]); return *this;}
|
|
PIByteArray & operator <<(uint v) {for (uint i = 0; i < sizeof(v); ++i) push_back(((uchar*)(&v))[i]); return *this;}
|
|
PIByteArray & operator <<(llong v) {for (uint i = 0; i < sizeof(v); ++i) push_back(((uchar*)(&v))[i]); return *this;}
|
|
PIByteArray & operator <<(ullong v) {for (uint i = 0; i < sizeof(v); ++i) push_back(((uchar*)(&v))[i]); return *this;}*/
|
|
//PIByteArray & operator <<(const PIByteArray & v) {for (uint i = 0; i < v.size(); ++i) push_back(v[i]); return *this;}
|
|
|
|
//! Returns plain 8-bit checksum
|
|
uchar checksumPlain8();
|
|
|
|
//! Returns plain 32-bit checksum
|
|
uint checksumPlain32();
|
|
|
|
//! Returns CRC 8-bit checksum
|
|
uchar checksumCRC8();
|
|
|
|
//! Returns CRC 16-bit checksum
|
|
ushort checksumCRC16();
|
|
|
|
//! Returns CRC 32-bit checksum
|
|
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 {
|
|
base64HelpStruct() {memset(this, 0, sizeof(base64HelpStruct));}
|
|
struct {
|
|
uchar ascii0: 6;
|
|
uchar ascii1: 6;
|
|
uchar ascii2: 6;
|
|
uchar ascii3: 6;
|
|
} ascii;
|
|
struct {
|
|
uchar byte0;
|
|
uchar byte1;
|
|
uchar byte2;
|
|
} byte;
|
|
};
|
|
|
|
static const char base64Table[64];
|
|
static const char base64InvTable[256];
|
|
static PIHuffman huffman;
|
|
|
|
};
|
|
|
|
//! \relatesalso PIByteArray \brief Output to std::ostream operator
|
|
inline std::ostream & operator <<(std::ostream & s, const PIByteArray & ba) {s << "{"; for (uint i = 0; i < ba.size(); ++i) {s << ba[i]; if (i < ba.size() - 1) s << ", ";} s << "}"; return s;}
|
|
|
|
//! \relatesalso PIByteArray \brief Output to PICout operator
|
|
inline PICout operator <<(PICout s, const PIByteArray & ba) {s.space(); s.setControl(0, true); s << "{"; for (uint i = 0; i < ba.size(); ++i) {s << ba[i]; if (i < ba.size() - 1) s << ", ";} s << "}"; s.restoreControl(); return s;}
|
|
|
|
#define PBA_OPERATOR_TO int os = s.size_s(); s.enlarge(sizeof(v)); memcpy(s.data(os), &v, sizeof(v));
|
|
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, uchar v) {s.push_back(v); return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const short v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const int v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const long & v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const llong & v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const ushort v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const uint v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const ulong & v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const ullong & v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const float v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
inline PIByteArray & operator <<(PIByteArray & s, const double & v) {PBA_OPERATOR_TO return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator, see \ref PIByteArray_sec1 for details
|
|
inline PIByteArray & operator <<(PIByteArray & s, const PIByteArray & v) {s << v.size_s(); int os = s.size_s(); s.enlarge(v.size_s()); if (v.size_s() > 0) memcpy(s.data(os), v.data(), v.size()); return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator, see \ref PIByteArray_sec1 for details
|
|
inline PIByteArray & operator <<(PIByteArray & s, const PIByteArray::RawData & v) {int os = s.size_s(); s.enlarge(v.s); if (v.s > 0) memcpy(s.data(os), v.d, v.s); return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
template <typename T>
|
|
inline PIByteArray & operator <<(PIByteArray & s, const PIVector<T> & v) {s << v.size_s(); for (uint i = 0; i < v.size(); ++i) s << v[i]; return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
template <typename T>
|
|
inline PIByteArray & operator <<(PIByteArray & s, const PIList<T> & v) {s << v.size_s(); for (uint i = 0; i < v.size(); ++i) s << v[i]; return s;}
|
|
//! \relatesalso PIByteArray \brief Store operator
|
|
template <typename T>
|
|
inline PIByteArray & operator <<(PIByteArray & s, const PIDeque<T> & v) {s << v.size_s(); for (uint i = 0; i < v.size(); ++i) s << v[i]; return s;}
|
|
#ifdef PIP_BYTEARRAY_STREAM_ANY_TYPE
|
|
template <typename T>
|
|
inline PIByteArray & operator <<(PIByteArray & s, const T & v) {PBA_OPERATOR_TO return s;}
|
|
#endif
|
|
|
|
#undef PBA_OPERATOR_TO
|
|
#define PBA_OPERATOR_FROM memcpy(&v, s.data(), sizeof(v)); s.remove(0, sizeof(v));
|
|
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, uchar & v) {assert(s.size() >= 1u); v = s.take_front(); return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, short & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, int & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, long & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, llong & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, ushort & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, uint & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, ulong & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, ullong & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, float & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
inline PIByteArray & operator >>(PIByteArray & s, double & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator, see \ref PIByteArray_sec1 for details
|
|
inline PIByteArray & operator >>(PIByteArray & s, PIByteArray & v) {assert(s.size_s() >= 4); int sz; s >> sz; v.resize(sz); if (sz > 0) memcpy(v.data(), s.data(), v.size()); s.remove(0, v.size()); return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator, see \ref PIByteArray_sec1 for details
|
|
inline PIByteArray & operator >>(PIByteArray & s, PIByteArray::RawData v) {assert(s.size_s() >= v.s); if (v.s > 0) memcpy(v.d, s.data(), v.s); s.remove(0, v.s); return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
template <typename T>
|
|
inline PIByteArray & operator >>(PIByteArray & s, PIVector<T> & v) {assert(s.size_s() >= 4); int sz; s >> sz; v.resize(sz); for (int i = 0; i < sz; ++i) s >> v[i]; return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
template <typename T>
|
|
inline PIByteArray & operator >>(PIByteArray & s, PIList<T> & v) {assert(s.size_s() >= 4); int sz; s >> sz; v.resize(sz); for (int i = 0; i < sz; ++i) s >> v[i]; return s;}
|
|
//! \relatesalso PIByteArray \brief Restore operator
|
|
template <typename T>
|
|
inline PIByteArray & operator >>(PIByteArray & s, PIDeque<T> & v) {assert(s.size_s() >= 4); int sz; s >> sz; v.resize(sz); for (int i = 0; i < sz; ++i) s >> v[i]; return s;}
|
|
#ifdef PIP_BYTEARRAY_STREAM_ANY_TYPE
|
|
template <typename T>
|
|
inline PIByteArray & operator >>(PIByteArray & s, T & v) {assert(s.size() >= sizeof(v)); PBA_OPERATOR_FROM return s;}
|
|
#endif
|
|
|
|
#undef PBA_OPERATOR_FROM
|
|
|
|
//! \relatesalso PIByteArray \brief Byte arrays compare operator
|
|
inline bool operator ==(PIByteArray & f, PIByteArray & s) {if (f.size_s() != s.size_s()) return false; for (int i = 0; i < f.size_s(); ++i) if (f[i] != s[i]) return false; return true;}
|
|
//! \relatesalso PIByteArray \brief Byte arrays compare operator
|
|
inline bool operator !=(PIByteArray & f, PIByteArray & s) {if (f.size_s() != s.size_s()) return true; for (int i = 0; i < f.size_s(); ++i) if (f[i] != s[i]) return true; return false;}
|
|
|
|
#endif // PIBYTEARRAY_H
|