mirror of
https://github.com/fraillt/bitsery.git
synced 2026-10-10 02:45:46 +00:00
default renamed to substitution and covered with tests
This commit is contained in:
@@ -10,115 +10,120 @@
|
||||
#include <cassert>
|
||||
#include <algorithm>
|
||||
|
||||
struct BufferReader {
|
||||
namespace bitsery {
|
||||
|
||||
using value_type = uint8_t;
|
||||
BufferReader(const std::vector<uint8_t>& buf):_buf{buf}, _pos{std::begin(buf)}{
|
||||
struct BufferReader {
|
||||
|
||||
}
|
||||
using value_type = uint8_t;
|
||||
|
||||
template<size_t SIZE, typename T>
|
||||
bool readBytes(T& v) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
using UT = typename std::make_unsigned<T>::type;
|
||||
return !m_scratch
|
||||
? directRead(&v, 1)
|
||||
: readBits(reinterpret_cast<UT&>(v), BITS_SIZE<T>);
|
||||
}
|
||||
BufferReader(const std::vector<uint8_t> &buf) : _buf{buf}, _pos{std::begin(buf)} {
|
||||
|
||||
template<size_t SIZE, typename T>
|
||||
bool readBuffer(T* buf, size_t count) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
}
|
||||
|
||||
if (!m_scratchBits) {
|
||||
return directRead(buf, count);
|
||||
} else {
|
||||
template<size_t SIZE, typename T>
|
||||
bool readBytes(T &v) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
using UT = typename std::make_unsigned<T>::type;
|
||||
//todo improve implementation
|
||||
const auto end = buf + count;
|
||||
for (auto it = buf; it != end; ++it) {
|
||||
if (!readBits(reinterpret_cast<UT&>(*it), BITS_SIZE<T>))
|
||||
return false;
|
||||
return !m_scratch
|
||||
? directRead(&v, 1)
|
||||
: readBits(reinterpret_cast<UT &>(v), BITS_SIZE<T>);
|
||||
}
|
||||
|
||||
template<size_t SIZE, typename T>
|
||||
bool readBuffer(T *buf, size_t count) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
|
||||
if (!m_scratchBits) {
|
||||
return directRead(buf, count);
|
||||
} else {
|
||||
using UT = typename std::make_unsigned<T>::type;
|
||||
//todo improve implementation
|
||||
const auto end = buf + count;
|
||||
for (auto it = buf; it != end; ++it) {
|
||||
if (!readBits(reinterpret_cast<UT &>(*it), BITS_SIZE<T>))
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
template<typename T>
|
||||
bool readBits(T& v, size_t bitsCount) {
|
||||
static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
|
||||
assert(bitsCount <= BITS_SIZE<T>);
|
||||
template<typename T>
|
||||
bool readBits(T &v, size_t bitsCount) {
|
||||
static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
|
||||
assert(bitsCount <= BITS_SIZE<T>);
|
||||
|
||||
const auto bytesRequired = bitsCount > m_scratchBits
|
||||
? ((bitsCount - 1 - m_scratchBits) >> 3) + 1u
|
||||
: 0u;
|
||||
if (static_cast<size_t>(std::distance(_pos, std::end(_buf))) < bytesRequired )
|
||||
return false;
|
||||
readBitsInternal(v, bitsCount);
|
||||
return true;
|
||||
}
|
||||
|
||||
bool align() {
|
||||
if ( m_scratchBits ) {
|
||||
SCRATCH_TYPE tmp{};
|
||||
readBitsInternal(tmp, BITS_SIZE<value_type> - m_scratchBits);
|
||||
return tmp == 0;
|
||||
const auto bytesRequired = bitsCount > m_scratchBits
|
||||
? ((bitsCount - 1 - m_scratchBits) >> 3) + 1u
|
||||
: 0u;
|
||||
if (static_cast<size_t>(std::distance(_pos, std::end(_buf))) < bytesRequired)
|
||||
return false;
|
||||
readBitsInternal(v, bitsCount);
|
||||
return true;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
bool isCompleted() const {
|
||||
return _pos == std::end(_buf);
|
||||
}
|
||||
|
||||
private:
|
||||
const std::vector<value_type>& _buf;
|
||||
decltype(std::begin(_buf)) _pos;
|
||||
template <typename T>
|
||||
bool directRead(T* v, size_t count) {
|
||||
static_assert(!std::is_const<T>::value, "");
|
||||
const auto bytesCount = sizeof(T) * count;
|
||||
if (static_cast<size_t>(std::distance(_pos, std::end(_buf))) < bytesCount)
|
||||
return false;
|
||||
std::copy_n(_pos, bytesCount, reinterpret_cast<value_type *>(v));
|
||||
std::advance(_pos, bytesCount);
|
||||
return true;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void readBitsInternal(T& v, size_t size) {
|
||||
auto bitsLeft = size;
|
||||
T res{};
|
||||
while (bitsLeft > 0) {
|
||||
auto bits = std::min(bitsLeft, BITS_SIZE<value_type>);
|
||||
if ( m_scratchBits < bits ) {
|
||||
value_type tmp;
|
||||
|
||||
std::copy_n(_pos, 1, reinterpret_cast<value_type *>(&tmp));
|
||||
std::advance(_pos, 1);
|
||||
|
||||
m_scratch |= static_cast<SCRATCH_TYPE>(tmp) << m_scratchBits;
|
||||
m_scratchBits += BITS_SIZE<value_type>;
|
||||
bool align() {
|
||||
if (m_scratchBits) {
|
||||
SCRATCH_TYPE tmp{};
|
||||
readBitsInternal(tmp, BITS_SIZE<value_type> - m_scratchBits);
|
||||
return tmp == 0;
|
||||
}
|
||||
auto shiftedRes = static_cast<T>(m_scratch & ( (static_cast<SCRATCH_TYPE>(1)<<bits) - 1 )) << (size - bitsLeft);
|
||||
res |= shiftedRes;
|
||||
m_scratch >>= bits;
|
||||
m_scratchBits -= bits;
|
||||
bitsLeft -= bits;
|
||||
return true;
|
||||
}
|
||||
v = res;
|
||||
}
|
||||
|
||||
using SCRATCH_TYPE = typename BIGGER_TYPE<value_type>::type;
|
||||
bool isCompleted() const {
|
||||
return _pos == std::end(_buf);
|
||||
}
|
||||
|
||||
SCRATCH_TYPE m_scratch{};
|
||||
size_t m_scratchBits{}; ///< Number of bits currently in the scratch buffer. If the user wants to read more bits than this, we have to go fetch another dword from memory.
|
||||
private:
|
||||
const std::vector<value_type> &_buf;
|
||||
decltype(std::begin(_buf)) _pos;
|
||||
|
||||
};
|
||||
template<typename T>
|
||||
bool directRead(T *v, size_t count) {
|
||||
static_assert(!std::is_const<T>::value, "");
|
||||
const auto bytesCount = sizeof(T) * count;
|
||||
if (static_cast<size_t>(std::distance(_pos, std::end(_buf))) < bytesCount)
|
||||
return false;
|
||||
std::copy_n(_pos, bytesCount, reinterpret_cast<value_type *>(v));
|
||||
std::advance(_pos, bytesCount);
|
||||
return true;
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
void readBitsInternal(T &v, size_t size) {
|
||||
auto bitsLeft = size;
|
||||
T res{};
|
||||
while (bitsLeft > 0) {
|
||||
auto bits = std::min(bitsLeft, BITS_SIZE<value_type>);
|
||||
if (m_scratchBits < bits) {
|
||||
value_type tmp;
|
||||
|
||||
std::copy_n(_pos, 1, reinterpret_cast<value_type *>(&tmp));
|
||||
std::advance(_pos, 1);
|
||||
|
||||
m_scratch |= static_cast<SCRATCH_TYPE>(tmp) << m_scratchBits;
|
||||
m_scratchBits += BITS_SIZE<value_type>;
|
||||
}
|
||||
auto shiftedRes =
|
||||
static_cast<T>(m_scratch & ((static_cast<SCRATCH_TYPE>(1) << bits) - 1)) << (size - bitsLeft);
|
||||
res |= shiftedRes;
|
||||
m_scratch >>= bits;
|
||||
m_scratchBits -= bits;
|
||||
bitsLeft -= bits;
|
||||
}
|
||||
v = res;
|
||||
}
|
||||
|
||||
using SCRATCH_TYPE = typename BIGGER_TYPE<value_type>::type;
|
||||
|
||||
SCRATCH_TYPE m_scratch{};
|
||||
size_t m_scratchBits{}; ///< Number of bits currently in the scratch buffer. If the user wants to read more bits than this, we have to go fetch another dword from memory.
|
||||
|
||||
};
|
||||
|
||||
}
|
||||
|
||||
#endif //PROJECT_TEMPLATE_BUFFER_READER_H
|
||||
|
||||
@@ -10,138 +10,141 @@
|
||||
#include <algorithm>
|
||||
#include <iterator>
|
||||
|
||||
struct MeasureSize {
|
||||
namespace bitsery {
|
||||
|
||||
template<size_t SIZE, typename T>
|
||||
void writeBytes(const T& ) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
_bitsCount += BITS_SIZE<T>;
|
||||
}
|
||||
struct MeasureSize {
|
||||
|
||||
template<typename T>
|
||||
void writeBits(const T& , size_t bitsCount) {
|
||||
static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
|
||||
assert(bitsCount <= BITS_SIZE<T>);
|
||||
_bitsCount += bitsCount;
|
||||
}
|
||||
|
||||
template<size_t SIZE, typename T>
|
||||
void writeBuffer(const T* , size_t count) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
_bitsCount += BITS_SIZE<T> * count;
|
||||
}
|
||||
|
||||
//get size in bytes
|
||||
size_t getSize() const {
|
||||
return _bitsCount / 8;
|
||||
}
|
||||
private:
|
||||
size_t _bitsCount{};
|
||||
|
||||
};
|
||||
|
||||
|
||||
struct BufferWriter {
|
||||
using value_type = uint8_t;
|
||||
BufferWriter(std::vector<uint8_t>& buffer):_buf{buffer}, _outIt{std::back_inserter(buffer)} {
|
||||
static_assert(std::is_unsigned<value_type>::value, "");
|
||||
}
|
||||
|
||||
template<size_t SIZE, typename T>
|
||||
void writeBytes(const T& v) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
|
||||
if (!m_scratchBits) {
|
||||
directWrite(&v,1);
|
||||
} else {
|
||||
using UT = typename std::make_unsigned<T>::type;
|
||||
writeBits(reinterpret_cast<const UT&>(v), BITS_SIZE<T>);
|
||||
template<size_t SIZE, typename T>
|
||||
void writeBytes(const T &) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
_bitsCount += BITS_SIZE<T>;
|
||||
}
|
||||
}
|
||||
|
||||
template<size_t SIZE, typename T>
|
||||
void writeBuffer(const T* buf, size_t count) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
if (!m_scratchBits) {
|
||||
directWrite(buf, count);
|
||||
} else {
|
||||
using UT = typename std::make_unsigned<T>::type;
|
||||
//todo improve implementation
|
||||
const auto end = buf + count;
|
||||
for (auto it = buf; it != end; ++it)
|
||||
writeBits(reinterpret_cast<const UT&>(*it), BITS_SIZE<T>);
|
||||
template<typename T>
|
||||
void writeBits(const T &, size_t bitsCount) {
|
||||
static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
|
||||
assert(bitsCount <= BITS_SIZE<T>);
|
||||
_bitsCount += bitsCount;
|
||||
}
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
void writeBits(const T& v, size_t bitsCount) {
|
||||
static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
|
||||
assert(bitsCount <= BITS_SIZE<T>);
|
||||
assert( v <= (( 1ULL << bitsCount ) - 1 ) );
|
||||
writeBitsInternal(v, bitsCount);
|
||||
}
|
||||
|
||||
void align() {
|
||||
if ( m_scratchBits )
|
||||
writeBitsInternal(value_type{}, BITS_SIZE<value_type> - m_scratchBits);
|
||||
}
|
||||
|
||||
void flush() {
|
||||
if ( m_scratchBits )
|
||||
{
|
||||
auto tmp = static_cast<value_type>( m_scratch & bufTypeMask );
|
||||
directWrite(&tmp, 1);
|
||||
m_scratch >>= m_scratchBits;
|
||||
m_scratchBits -= m_scratchBits;
|
||||
template<size_t SIZE, typename T>
|
||||
void writeBuffer(const T *, size_t count) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
_bitsCount += BITS_SIZE<T> * count;
|
||||
}
|
||||
}
|
||||
|
||||
//get size in bytes
|
||||
size_t getSize() const {
|
||||
return _bitsCount / 8;
|
||||
}
|
||||
|
||||
private:
|
||||
size_t _bitsCount{};
|
||||
|
||||
};
|
||||
|
||||
|
||||
private:
|
||||
struct BufferWriter {
|
||||
using value_type = uint8_t;
|
||||
|
||||
template <typename T>
|
||||
void directWrite(const T* v, size_t count) {
|
||||
const auto bytesSize = sizeof(T) * count;
|
||||
const auto pos = _buf.size();
|
||||
_buf.resize(pos + bytesSize);
|
||||
std::copy_n(reinterpret_cast<const value_type *>(v), bytesSize, _buf.data()+pos);
|
||||
}
|
||||
BufferWriter(std::vector<uint8_t> &buffer) : _buf{buffer}, _outIt{std::back_inserter(buffer)} {
|
||||
static_assert(std::is_unsigned<value_type>::value, "");
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void writeBitsInternal(const T& v, size_t size) {
|
||||
auto value = v;
|
||||
auto bitsLeft = size;
|
||||
while (bitsLeft > 0) {
|
||||
auto bits = std::min(bitsLeft, BITS_SIZE<value_type>);
|
||||
m_scratch |= static_cast<SCRATCH_TYPE>( value ) << m_scratchBits;
|
||||
m_scratchBits += bits;
|
||||
if ( m_scratchBits >= BITS_SIZE<value_type> ) {
|
||||
auto tmp = static_cast<value_type>(m_scratch & bufTypeMask);
|
||||
directWrite(&tmp, 1);
|
||||
m_scratch >>= BITS_SIZE<value_type>;
|
||||
m_scratchBits -= BITS_SIZE<value_type>;
|
||||
template<size_t SIZE, typename T>
|
||||
void writeBytes(const T &v) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
|
||||
value >>= BITS_SIZE<value_type>;
|
||||
if (!m_scratchBits) {
|
||||
directWrite(&v, 1);
|
||||
} else {
|
||||
using UT = typename std::make_unsigned<T>::type;
|
||||
writeBits(reinterpret_cast<const UT &>(v), BITS_SIZE<T>);
|
||||
}
|
||||
bitsLeft -= bits;
|
||||
}
|
||||
}
|
||||
|
||||
const value_type bufTypeMask = 0xFF;
|
||||
using SCRATCH_TYPE = typename BIGGER_TYPE<value_type>::type;
|
||||
std::vector<value_type>& _buf;
|
||||
std::back_insert_iterator<std::vector<value_type>> _outIt;
|
||||
SCRATCH_TYPE m_scratch{};
|
||||
size_t m_scratchBits{};
|
||||
template<size_t SIZE, typename T>
|
||||
void writeBuffer(const T *buf, size_t count) {
|
||||
static_assert(std::is_integral<T>(), "");
|
||||
static_assert(sizeof(T) == SIZE, "");
|
||||
if (!m_scratchBits) {
|
||||
directWrite(buf, count);
|
||||
} else {
|
||||
using UT = typename std::make_unsigned<T>::type;
|
||||
//todo improve implementation
|
||||
const auto end = buf + count;
|
||||
for (auto it = buf; it != end; ++it)
|
||||
writeBits(reinterpret_cast<const UT &>(*it), BITS_SIZE<T>);
|
||||
}
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
void writeBits(const T &v, size_t bitsCount) {
|
||||
static_assert(std::is_integral<T>() && std::is_unsigned<T>(), "");
|
||||
assert(bitsCount <= BITS_SIZE<T>);
|
||||
assert(v <= ((1ULL << bitsCount) - 1));
|
||||
writeBitsInternal(v, bitsCount);
|
||||
}
|
||||
|
||||
void align() {
|
||||
if (m_scratchBits)
|
||||
writeBitsInternal(value_type{}, BITS_SIZE<value_type> - m_scratchBits);
|
||||
}
|
||||
|
||||
void flush() {
|
||||
if (m_scratchBits) {
|
||||
auto tmp = static_cast<value_type>( m_scratch & bufTypeMask );
|
||||
directWrite(&tmp, 1);
|
||||
m_scratch >>= m_scratchBits;
|
||||
m_scratchBits -= m_scratchBits;
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
//size_t _bufSize{};
|
||||
private:
|
||||
|
||||
};
|
||||
template<typename T>
|
||||
void directWrite(const T *v, size_t count) {
|
||||
const auto bytesSize = sizeof(T) * count;
|
||||
const auto pos = _buf.size();
|
||||
_buf.resize(pos + bytesSize);
|
||||
std::copy_n(reinterpret_cast<const value_type *>(v), bytesSize, _buf.data() + pos);
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
void writeBitsInternal(const T &v, size_t size) {
|
||||
auto value = v;
|
||||
auto bitsLeft = size;
|
||||
while (bitsLeft > 0) {
|
||||
auto bits = std::min(bitsLeft, BITS_SIZE<value_type>);
|
||||
m_scratch |= static_cast<SCRATCH_TYPE>( value ) << m_scratchBits;
|
||||
m_scratchBits += bits;
|
||||
if (m_scratchBits >= BITS_SIZE<value_type>) {
|
||||
auto tmp = static_cast<value_type>(m_scratch & bufTypeMask);
|
||||
directWrite(&tmp, 1);
|
||||
m_scratch >>= BITS_SIZE<value_type>;
|
||||
m_scratchBits -= BITS_SIZE<value_type>;
|
||||
|
||||
value >>= BITS_SIZE<value_type>;
|
||||
}
|
||||
bitsLeft -= bits;
|
||||
}
|
||||
}
|
||||
|
||||
const value_type bufTypeMask = 0xFF;
|
||||
using SCRATCH_TYPE = typename BIGGER_TYPE<value_type>::type;
|
||||
std::vector<value_type> &_buf;
|
||||
std::back_insert_iterator<std::vector<value_type>> _outIt;
|
||||
SCRATCH_TYPE m_scratch{};
|
||||
size_t m_scratchBits{};
|
||||
|
||||
|
||||
//size_t _bufSize{};
|
||||
|
||||
};
|
||||
}
|
||||
|
||||
#endif //PROJECT_TEMPLATE_BUFFER_WRITER_H
|
||||
|
||||
293
include/Common.h
293
include/Common.h
@@ -7,190 +7,193 @@
|
||||
|
||||
#include <stdint.h>
|
||||
|
||||
template <typename T>
|
||||
constexpr size_t BITS_SIZE = sizeof(T) << 3;
|
||||
namespace bitsery {
|
||||
|
||||
template <typename T>
|
||||
struct BIGGER_TYPE {};
|
||||
template<typename T>
|
||||
constexpr size_t BITS_SIZE = sizeof(T) << 3;
|
||||
|
||||
template <>
|
||||
struct BIGGER_TYPE<uint8_t> {
|
||||
typedef uint16_t type;
|
||||
};
|
||||
template<typename T>
|
||||
struct BIGGER_TYPE {
|
||||
};
|
||||
|
||||
template <>
|
||||
struct BIGGER_TYPE<uint16_t> {
|
||||
typedef uint32_t type;
|
||||
};
|
||||
template<>
|
||||
struct BIGGER_TYPE<uint8_t> {
|
||||
typedef uint16_t type;
|
||||
};
|
||||
|
||||
template <>
|
||||
struct BIGGER_TYPE<uint32_t> {
|
||||
typedef uint64_t type;
|
||||
};
|
||||
template<>
|
||||
struct BIGGER_TYPE<uint16_t> {
|
||||
typedef uint32_t type;
|
||||
};
|
||||
|
||||
template <>
|
||||
struct BIGGER_TYPE<int8_t> {
|
||||
typedef int16_t type;
|
||||
};
|
||||
template<>
|
||||
struct BIGGER_TYPE<uint32_t> {
|
||||
typedef uint64_t type;
|
||||
};
|
||||
|
||||
template <>
|
||||
struct BIGGER_TYPE<int16_t> {
|
||||
typedef int32_t type;
|
||||
};
|
||||
template<>
|
||||
struct BIGGER_TYPE<int8_t> {
|
||||
typedef int16_t type;
|
||||
};
|
||||
|
||||
template <>
|
||||
struct BIGGER_TYPE<int32_t> {
|
||||
typedef int64_t type;
|
||||
};
|
||||
template<>
|
||||
struct BIGGER_TYPE<int16_t> {
|
||||
typedef int32_t type;
|
||||
};
|
||||
|
||||
template <>
|
||||
struct BIGGER_TYPE<char> {
|
||||
typedef int16_t type;
|
||||
};
|
||||
template<>
|
||||
struct BIGGER_TYPE<int32_t> {
|
||||
typedef int64_t type;
|
||||
};
|
||||
|
||||
template <typename T>
|
||||
constexpr size_t ARITHMETIC_OR_ENUM_SIZE = std::is_arithmetic<T>::value || std::is_enum<T>::value ? sizeof(T) : 0;
|
||||
template<>
|
||||
struct BIGGER_TYPE<char> {
|
||||
typedef int16_t type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
constexpr size_t ARITHMETIC_OR_ENUM_SIZE = std::is_arithmetic<T>::value || std::is_enum<T>::value ? sizeof(T) : 0;
|
||||
|
||||
|
||||
template<typename T, typename Enable = void>
|
||||
struct SAME_SIZE_UNSIGNED_TYPE {
|
||||
typedef std::make_unsigned_t<T> type;
|
||||
};
|
||||
template<typename T, typename Enable = void>
|
||||
struct SAME_SIZE_UNSIGNED_TYPE {
|
||||
typedef std::make_unsigned_t<T> type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct SAME_SIZE_UNSIGNED_TYPE<T, typename std::enable_if<std::is_enum<T>::value>::type> {
|
||||
typedef std::make_unsigned_t<std::underlying_type_t<T>> type;
|
||||
};
|
||||
template<typename T>
|
||||
struct SAME_SIZE_UNSIGNED_TYPE<T, typename std::enable_if<std::is_enum<T>::value>::type> {
|
||||
typedef std::make_unsigned_t<std::underlying_type_t<T>> type;
|
||||
};
|
||||
|
||||
template<typename T>
|
||||
struct SAME_SIZE_UNSIGNED_TYPE<T, typename std::enable_if<std::is_floating_point<T>::value>::type> {
|
||||
typedef std::conditional_t<std::is_same<T,float>::value, uint32_t, uint64_t> type;
|
||||
};
|
||||
template<typename T>
|
||||
struct SAME_SIZE_UNSIGNED_TYPE<T, typename std::enable_if<std::is_floating_point<T>::value>::type> {
|
||||
typedef std::conditional_t<std::is_same<T, float>::value, uint32_t, uint64_t> type;
|
||||
};
|
||||
|
||||
template <typename T>
|
||||
using SAME_SIZE_UNSIGNED = typename SAME_SIZE_UNSIGNED_TYPE<T>::type;
|
||||
template<typename T>
|
||||
using SAME_SIZE_UNSIGNED = typename SAME_SIZE_UNSIGNED_TYPE<T>::type;
|
||||
|
||||
|
||||
template <size_t SIZE>
|
||||
struct ProcessAnyType {
|
||||
template <typename S, typename T>
|
||||
static void serialize(S& s, T&& v) {
|
||||
s.template value<SIZE>(std::forward<T>(v));
|
||||
}
|
||||
};
|
||||
template<size_t SIZE>
|
||||
struct ProcessAnyType {
|
||||
template<typename S, typename T>
|
||||
static void serialize(S &s, T &&v) {
|
||||
s.template value<SIZE>(std::forward<T>(v));
|
||||
}
|
||||
};
|
||||
|
||||
template <>
|
||||
struct ProcessAnyType<0> {
|
||||
template <typename S, typename T>
|
||||
static void serialize(S& s, T&& v) {
|
||||
s.object(std::forward<T>(v));
|
||||
}
|
||||
};
|
||||
template<>
|
||||
struct ProcessAnyType<0> {
|
||||
template<typename S, typename T>
|
||||
static void serialize(S &s, T &&v) {
|
||||
s.object(std::forward<T>(v));
|
||||
}
|
||||
};
|
||||
|
||||
|
||||
#define SERIALIZE(ObjectType) \
|
||||
template <typename S, typename T, typename std::enable_if<std::is_same<T, ObjectType>::value || std::is_same<T, const ObjectType>::value>::type* = nullptr> \
|
||||
S& serialize(S& s, T& o)
|
||||
|
||||
template <typename T>
|
||||
constexpr size_t calcRequiredBits(T min, T max) {
|
||||
size_t res{};
|
||||
for (auto diff = max - min; diff > 0; diff >>= 1)
|
||||
++res;
|
||||
return res;
|
||||
}
|
||||
|
||||
|
||||
template <typename T, typename Enable = void>
|
||||
struct RangeSpec {
|
||||
|
||||
constexpr RangeSpec(T minValue, T maxValue)
|
||||
:min{minValue},
|
||||
max{maxValue},
|
||||
bitsRequired{calcRequiredBits(min, max)}
|
||||
{
|
||||
template<typename T>
|
||||
constexpr size_t calcRequiredBits(T min, T max) {
|
||||
size_t res{};
|
||||
for (auto diff = max - min; diff > 0; diff >>= 1)
|
||||
++res;
|
||||
return res;
|
||||
}
|
||||
|
||||
const T min;
|
||||
const T max;
|
||||
const size_t bitsRequired;
|
||||
};
|
||||
|
||||
template<typename T, typename Enable = void>
|
||||
struct RangeSpec {
|
||||
|
||||
constexpr RangeSpec(T minValue, T maxValue)
|
||||
: min{minValue},
|
||||
max{maxValue},
|
||||
bitsRequired{calcRequiredBits(min, max)} {
|
||||
}
|
||||
|
||||
const T min;
|
||||
const T max;
|
||||
const size_t bitsRequired;
|
||||
};
|
||||
|
||||
|
||||
template <typename T>
|
||||
struct RangeSpec<T, typename std::enable_if<std::is_enum<T>::value>::type> {
|
||||
template<typename T>
|
||||
struct RangeSpec<T, typename std::enable_if<std::is_enum<T>::value>::type> {
|
||||
|
||||
constexpr RangeSpec(T minValue, T maxValue):
|
||||
min{minValue},
|
||||
max{maxValue},
|
||||
bitsRequired{calcRequiredBits(
|
||||
static_cast<std::underlying_type_t<T>>(min),
|
||||
static_cast<std::underlying_type_t<T>>(max))}
|
||||
{
|
||||
}
|
||||
const T min;
|
||||
const T max;
|
||||
const size_t bitsRequired;
|
||||
};
|
||||
constexpr RangeSpec(T minValue, T maxValue) :
|
||||
min{minValue},
|
||||
max{maxValue},
|
||||
bitsRequired{calcRequiredBits(
|
||||
static_cast<std::underlying_type_t<T>>(min),
|
||||
static_cast<std::underlying_type_t<T>>(max))} {
|
||||
}
|
||||
|
||||
const T min;
|
||||
const T max;
|
||||
const size_t bitsRequired;
|
||||
};
|
||||
|
||||
//this class is used to make default RangeSpec float specialization always prefer constructor with precision
|
||||
struct BitsConstraint {
|
||||
explicit constexpr BitsConstraint(size_t bits):value{bits} {}
|
||||
const size_t value;
|
||||
};
|
||||
struct BitsConstraint {
|
||||
explicit constexpr BitsConstraint(size_t bits) : value{bits} {}
|
||||
|
||||
template <typename T>
|
||||
struct RangeSpec<T, typename std::enable_if<std::is_floating_point<T>::value>::type> {
|
||||
const size_t value;
|
||||
};
|
||||
|
||||
constexpr RangeSpec(T minValue, T maxValue, BitsConstraint bits):
|
||||
min{minValue},
|
||||
max{maxValue},
|
||||
bitsRequired{bits.value}
|
||||
{
|
||||
}
|
||||
template<typename T>
|
||||
struct RangeSpec<T, typename std::enable_if<std::is_floating_point<T>::value>::type> {
|
||||
|
||||
constexpr RangeSpec(T minValue, T maxValue, T precision):
|
||||
min{minValue},
|
||||
max{maxValue},
|
||||
bitsRequired{calcRequiredBits<SAME_SIZE_UNSIGNED<T>>({}, ((max - min) / precision))}
|
||||
{
|
||||
|
||||
}
|
||||
constexpr RangeSpec(T minValue, T maxValue, BitsConstraint bits) :
|
||||
min{minValue},
|
||||
max{maxValue},
|
||||
bitsRequired{bits.value} {
|
||||
}
|
||||
|
||||
const T min;
|
||||
const T max;
|
||||
const size_t bitsRequired;
|
||||
};
|
||||
constexpr RangeSpec(T minValue, T maxValue, T precision) :
|
||||
min{minValue},
|
||||
max{maxValue},
|
||||
bitsRequired{calcRequiredBits<SAME_SIZE_UNSIGNED<T>>({}, ((max - min) / precision))} {
|
||||
|
||||
}
|
||||
|
||||
const T min;
|
||||
const T max;
|
||||
const size_t bitsRequired;
|
||||
};
|
||||
|
||||
|
||||
class ObjectMemoryPosition {
|
||||
public:
|
||||
class ObjectMemoryPosition {
|
||||
public:
|
||||
|
||||
template <typename T>
|
||||
ObjectMemoryPosition(const T& oldObj, const T& newObj)
|
||||
:ObjectMemoryPosition{reinterpret_cast<const char*>(&oldObj), reinterpret_cast<const char*>(&newObj), sizeof(T)}
|
||||
{
|
||||
}
|
||||
template<typename T>
|
||||
ObjectMemoryPosition(const T &oldObj, const T &newObj)
|
||||
:ObjectMemoryPosition{reinterpret_cast<const char *>(&oldObj), reinterpret_cast<const char *>(&newObj),
|
||||
sizeof(T)} {
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
bool isFieldsEquals(const T& newObjField) {
|
||||
return *getOldObjectField(newObjField) == newObjField;
|
||||
}
|
||||
template <typename T>
|
||||
const T* getOldObjectField(const T& field) {
|
||||
auto offset = reinterpret_cast<const char*>(&field) - newObj;
|
||||
return reinterpret_cast<const T*>(oldObj + offset);
|
||||
}
|
||||
private:
|
||||
template<typename T>
|
||||
bool isFieldsEquals(const T &newObjField) {
|
||||
return *getOldObjectField(newObjField) == newObjField;
|
||||
}
|
||||
|
||||
ObjectMemoryPosition(const char* objOld, const char* objNew, size_t )
|
||||
:oldObj{objOld},
|
||||
newObj{objNew}
|
||||
{
|
||||
}
|
||||
template<typename T>
|
||||
const T *getOldObjectField(const T &field) {
|
||||
auto offset = reinterpret_cast<const char *>(&field) - newObj;
|
||||
return reinterpret_cast<const T *>(oldObj + offset);
|
||||
}
|
||||
|
||||
const char* oldObj;
|
||||
const char* newObj;
|
||||
};
|
||||
private:
|
||||
|
||||
ObjectMemoryPosition(const char *objOld, const char *objNew, size_t)
|
||||
: oldObj{objOld},
|
||||
newObj{objNew} {
|
||||
}
|
||||
|
||||
const char *oldObj;
|
||||
const char *newObj;
|
||||
};
|
||||
|
||||
}
|
||||
#endif //TMP_COMMON_H
|
||||
|
||||
@@ -10,183 +10,191 @@
|
||||
#include <algorithm>
|
||||
#include "Deserializer.h"
|
||||
|
||||
template<typename Reader, typename TObj>
|
||||
class DeltaDeserializer {
|
||||
public:
|
||||
DeltaDeserializer(Reader& r, const TObj& oldObj, const TObj& newObj)
|
||||
:_deserializer{r},
|
||||
_reader{r},
|
||||
_oldObj{oldObj},
|
||||
_newObj{newObj},
|
||||
_objMemPos(std::deque<ObjectMemoryPosition>(1, ObjectMemoryPosition{oldObj, newObj})),
|
||||
_isNewElement{false}
|
||||
{
|
||||
};
|
||||
namespace bitsery {
|
||||
|
||||
template<size_t SIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
|
||||
DeltaDeserializer& value(T& v) {
|
||||
if (getChangedState(v)) {
|
||||
constexpr size_t ValueSize = SIZE == 0 ? sizeof(T) : SIZE;
|
||||
_reader.template readBytes<ValueSize>(v);
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
template<typename Reader, typename TObj>
|
||||
class DeltaDeserializer {
|
||||
public:
|
||||
DeltaDeserializer(Reader &r, const TObj &oldObj, const TObj &newObj)
|
||||
: _deserializer{r},
|
||||
_reader{r},
|
||||
_oldObj{oldObj},
|
||||
_newObj{newObj},
|
||||
_objMemPos(std::deque<ObjectMemoryPosition>(1, ObjectMemoryPosition{oldObj, newObj})),
|
||||
_isNewElement{false} {
|
||||
};
|
||||
|
||||
template <typename T>
|
||||
DeltaDeserializer& object(T&& obj) {
|
||||
if (getChangedState(obj))
|
||||
return serialize(*this, std::forward<T>(obj));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
DeltaDeserializer& text(T&& str) {
|
||||
if (getChangedState(str)) {
|
||||
_deserializer.text(str);
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
DeltaDeserializer & array(std::array<T,N> &arr, Fnc&& fnc) {
|
||||
if (getChangedState(arr)) {
|
||||
if (!_isNewElement) {
|
||||
const auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
processContainer(std::begin(old), std::end(old), std::begin(arr), std::end(arr), fnc);
|
||||
} else {
|
||||
for (auto& v:arr)
|
||||
fnc(v);
|
||||
template<size_t SIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
|
||||
DeltaDeserializer &value(T &v) {
|
||||
if (getChangedState(v)) {
|
||||
constexpr size_t ValueSize = SIZE == 0 ? sizeof(T) : SIZE;
|
||||
_reader.template readBytes<ValueSize>(v);
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
DeltaDeserializer &object(T &&obj) {
|
||||
if (getChangedState(obj))
|
||||
return serialize(*this, std::forward<T>(obj));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
DeltaDeserializer& array(T (&arr)[N], Fnc&& fnc) {
|
||||
if (getChangedState(arr)) {
|
||||
if (!_isNewElement) {
|
||||
const auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
T* tmp = arr;
|
||||
processContainer(old, old + N, tmp, tmp + N, fnc);
|
||||
} else {
|
||||
T* tmp = arr;
|
||||
for (auto i=0u; i < N; ++i, ++tmp)
|
||||
fnc(*tmp);
|
||||
template<size_t VSIZE = 1, typename T>
|
||||
DeltaDeserializer &text(std::basic_string<T> &str, size_t maxSize) {
|
||||
if (getChangedState(str)) {
|
||||
_deserializer.text<VSIZE>(str, maxSize);
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
template <typename T, typename Fnc>
|
||||
DeltaDeserializer& container(T& obj, Fnc&& fnc) {
|
||||
if(getChangedState(obj)) {
|
||||
size_t newSize{};
|
||||
_reader.readBits(newSize, 32);
|
||||
if (!_isNewElement) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(obj);
|
||||
if (old.size() != newSize)
|
||||
template<size_t VSIZE = 1, typename T, size_t N>
|
||||
DeltaDeserializer &text(T (&str)[N], size_t maxSize) {
|
||||
if (getChangedState(str)) {
|
||||
_deserializer.text<VSIZE>(str, maxSize);
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
DeltaDeserializer &array(std::array<T, N> &arr, Fnc &&fnc) {
|
||||
if (getChangedState(arr)) {
|
||||
if (!_isNewElement) {
|
||||
const auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
processContainer(std::begin(old), std::end(old), std::begin(arr), std::end(arr), fnc);
|
||||
} else {
|
||||
for (auto &v:arr)
|
||||
fnc(v);
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
DeltaDeserializer &array(T (&arr)[N], Fnc &&fnc) {
|
||||
if (getChangedState(arr)) {
|
||||
if (!_isNewElement) {
|
||||
const auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
T *tmp = arr;
|
||||
processContainer(old, old + N, tmp, tmp + N, fnc);
|
||||
} else {
|
||||
T *tmp = arr;
|
||||
for (auto i = 0u; i < N; ++i, ++tmp)
|
||||
fnc(*tmp);
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, typename Fnc>
|
||||
DeltaDeserializer &container(T &obj, Fnc &&fnc, size_t maxSize) {
|
||||
if (getChangedState(obj)) {
|
||||
size_t newSize{};
|
||||
_reader.readBits(newSize, 32);
|
||||
if (!_isNewElement) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(obj);
|
||||
if (old.size() != newSize)
|
||||
obj.resize(newSize);
|
||||
processContainer(std::begin(old), std::end(old), std::begin(obj), std::end(obj),
|
||||
std::forward<Fnc>(fnc));
|
||||
} else {
|
||||
obj.resize(newSize);
|
||||
processContainer(std::begin(old), std::end(old), std::begin(obj), std::end(obj), std::forward<Fnc>(fnc));
|
||||
} else {
|
||||
obj.resize(newSize);
|
||||
for (auto& v:obj)
|
||||
fnc(v);
|
||||
for (auto &v:obj)
|
||||
fnc(v);
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
private:
|
||||
Deserializer<Reader> _deserializer;
|
||||
Reader& _reader;
|
||||
private:
|
||||
Deserializer <Reader> _deserializer;
|
||||
Reader &_reader;
|
||||
|
||||
const TObj& _oldObj;
|
||||
const TObj& _newObj;
|
||||
std::stack<ObjectMemoryPosition> _objMemPos;
|
||||
bool _isNewElement;
|
||||
const TObj &_oldObj;
|
||||
const TObj &_newObj;
|
||||
std::stack<ObjectMemoryPosition> _objMemPos;
|
||||
bool _isNewElement;
|
||||
|
||||
template <typename T>
|
||||
bool getChangedState(T& obj) {
|
||||
if (!_isNewElement) {
|
||||
if (!readChangedState()) {
|
||||
obj = *_objMemPos.top().getOldObjectField(obj);
|
||||
return false;
|
||||
template<typename T>
|
||||
bool getChangedState(T &obj) {
|
||||
if (!_isNewElement) {
|
||||
if (!readChangedState()) {
|
||||
obj = *_objMemPos.top().getOldObjectField(obj);
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
template <typename T, size_t N>
|
||||
bool getChangedState(T (&arr)[N]) {
|
||||
if (!_isNewElement) {
|
||||
if (!readChangedState()) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
auto end = arr + N;
|
||||
auto pOld = old;
|
||||
for (auto p=arr; p != end; ++p, ++pOld)
|
||||
template<typename T, size_t N>
|
||||
bool getChangedState(T (&arr)[N]) {
|
||||
if (!_isNewElement) {
|
||||
if (!readChangedState()) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
auto end = arr + N;
|
||||
auto pOld = old;
|
||||
for (auto p = arr; p != end; ++p, ++pOld)
|
||||
*p = *pOld;
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
template<typename TConstIt, typename TIt, typename Fnc>
|
||||
bool processContainer(TConstIt oldBegin, TConstIt oldEnd, TIt begin, TIt end, Fnc &&fnc) {
|
||||
auto offset = readIndexOffset();
|
||||
auto p = begin;
|
||||
auto pOld = oldBegin;
|
||||
for (; p != end && pOld != oldEnd; ++p, ++pOld) {
|
||||
if (offset) {
|
||||
*p = *pOld;
|
||||
--offset;
|
||||
} else {
|
||||
_objMemPos.emplace(ObjectMemoryPosition{*pOld, *p});
|
||||
fnc(*p);
|
||||
_objMemPos.pop();
|
||||
offset = readIndexOffset();
|
||||
}
|
||||
}
|
||||
if (offset != 0 && pOld != oldEnd)
|
||||
return false;
|
||||
}
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
template <typename TConstIt, typename TIt, typename Fnc>
|
||||
bool processContainer(TConstIt oldBegin, TConstIt oldEnd, TIt begin, TIt end, Fnc&& fnc) {
|
||||
auto offset = readIndexOffset();
|
||||
auto p = begin;
|
||||
auto pOld = oldBegin;
|
||||
for (; p != end && pOld != oldEnd; ++p, ++pOld) {
|
||||
if (offset) {
|
||||
*p = *pOld;
|
||||
--offset;
|
||||
} else {
|
||||
_objMemPos.emplace(ObjectMemoryPosition{*pOld, *p});
|
||||
_isNewElement = true;
|
||||
for (; p != end; ++p, --offset)
|
||||
fnc(*p);
|
||||
_objMemPos.pop();
|
||||
offset = readIndexOffset();
|
||||
}
|
||||
_isNewElement = false;
|
||||
return offset == 0;
|
||||
|
||||
}
|
||||
if (offset != 0 && pOld != oldEnd)
|
||||
return false;
|
||||
_isNewElement = true;
|
||||
for (; p != end; ++p, --offset)
|
||||
fnc(*p);
|
||||
_isNewElement = false;
|
||||
return offset == 0;
|
||||
|
||||
}
|
||||
|
||||
bool readChangedState() {
|
||||
unsigned char res{};
|
||||
_reader.readBits(res, 1);
|
||||
return res;
|
||||
}
|
||||
|
||||
|
||||
|
||||
size_t readIndexOffset() {
|
||||
//special case, if items are updated sequentialy
|
||||
unsigned char tmp{};
|
||||
_reader.readBits(tmp, 1);
|
||||
if (tmp) {
|
||||
return 0u;
|
||||
}
|
||||
else {
|
||||
size_t res{};
|
||||
_reader.readBits(tmp, 1);
|
||||
if (tmp > 0)
|
||||
_reader.readBits(res, 4);
|
||||
else
|
||||
_reader.readBits(res, 32);
|
||||
bool readChangedState() {
|
||||
unsigned char res{};
|
||||
_reader.readBits(res, 1);
|
||||
return res;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
};
|
||||
size_t readIndexOffset() {
|
||||
//special case, if items are updated sequentialy
|
||||
unsigned char tmp{};
|
||||
_reader.readBits(tmp, 1);
|
||||
if (tmp) {
|
||||
return 0u;
|
||||
} else {
|
||||
size_t res{};
|
||||
_reader.readBits(tmp, 1);
|
||||
if (tmp > 0)
|
||||
_reader.readBits(res, 4);
|
||||
else
|
||||
_reader.readBits(res, 32);
|
||||
return res;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
}
|
||||
#endif //TMP_DELTADESERIALIZER_H
|
||||
|
||||
@@ -10,179 +10,191 @@
|
||||
#include <algorithm>
|
||||
#include "Serializer.h"
|
||||
|
||||
template<typename Writter, typename TObj>
|
||||
class DeltaSerializer {
|
||||
public:
|
||||
DeltaSerializer(Writter& w, const TObj& oldObj, const TObj& newObj)
|
||||
:_serializer{w},
|
||||
_writter{w},
|
||||
_oldObj{oldObj},
|
||||
_newObj{newObj},
|
||||
_objMemPos(std::deque<ObjectMemoryPosition>(1, ObjectMemoryPosition{oldObj, newObj})),
|
||||
_isNewElement{false}
|
||||
{
|
||||
namespace bitsery {
|
||||
|
||||
template<typename Writter, typename TObj>
|
||||
class DeltaSerializer {
|
||||
public:
|
||||
DeltaSerializer(Writter &w, const TObj &oldObj, const TObj &newObj)
|
||||
: _serializer{w},
|
||||
_writter{w},
|
||||
_oldObj{oldObj},
|
||||
_newObj{newObj},
|
||||
_objMemPos(std::deque<ObjectMemoryPosition>(1, ObjectMemoryPosition{oldObj, newObj})),
|
||||
_isNewElement{false} {
|
||||
|
||||
};
|
||||
|
||||
template<size_t SIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
|
||||
DeltaSerializer &value(const T &v) {
|
||||
if (setChangedState(v)) {
|
||||
constexpr size_t ValueSize = SIZE == 0 ? sizeof(T) : SIZE;
|
||||
_writter.template writeBytes<ValueSize>(v);
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
DeltaSerializer &object(T &&obj) {
|
||||
if (setChangedState(obj)) {
|
||||
serialize(*this, std::forward<T>(obj));
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE = 1, typename T>
|
||||
DeltaSerializer &text(const std::basic_string<T> &str, size_t maxSize) {
|
||||
if (setChangedState(str)) {
|
||||
_serializer.text<VSIZE>(str, maxSize);
|
||||
}
|
||||
return *this;
|
||||
|
||||
}
|
||||
|
||||
template<size_t VSIZE = 1, typename T, size_t N>
|
||||
DeltaSerializer &text(const T (&str)[N]) {
|
||||
if (setChangedState(str)) {
|
||||
_serializer.text<VSIZE>(str);
|
||||
}
|
||||
return *this;
|
||||
|
||||
}
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
DeltaSerializer &array(const std::array<T, N> &arr, Fnc &&fnc) {
|
||||
if (setChangedState(arr)) {
|
||||
if (!_isNewElement) {
|
||||
const auto &old = *_objMemPos.top().getOldObjectField(arr);
|
||||
processContainer(std::begin(old), std::end(old), std::begin(arr), std::end(arr), fnc);
|
||||
} else {
|
||||
for (auto &v:arr)
|
||||
fnc(v);
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
DeltaSerializer &array(const T (&arr)[N], Fnc &&fnc) {
|
||||
if (setChangedState(arr)) {
|
||||
if (!_isNewElement) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
const T *tmp = arr;
|
||||
processContainer(old, old + N, tmp, tmp + N, fnc);
|
||||
} else {
|
||||
const T *tmp = arr;
|
||||
for (auto i = 0u; i < N; ++i, ++tmp)
|
||||
fnc(*tmp);
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, typename Fnc>
|
||||
DeltaSerializer &container(T &&obj, Fnc &&fnc, size_t maxSize) {
|
||||
if (setChangedState(obj)) {
|
||||
_writter.writeBits(obj.size(), 32);
|
||||
if (!_isNewElement) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(obj);
|
||||
processContainer(std::begin(old), std::end(old), std::begin(obj), std::end(obj),
|
||||
std::forward<Fnc>(fnc));
|
||||
} else {
|
||||
for (auto &v:obj)
|
||||
fnc(v);
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
private:
|
||||
Serializer <Writter> _serializer;
|
||||
Writter &_writter;
|
||||
const TObj &_oldObj;
|
||||
const TObj &_newObj;
|
||||
std::stack<ObjectMemoryPosition> _objMemPos;
|
||||
bool _isNewElement;
|
||||
|
||||
template<typename T>
|
||||
bool setChangedState(const T &obj) {
|
||||
if (!_isNewElement) {
|
||||
auto res = !_objMemPos.top().isFieldsEquals(obj);
|
||||
writeChangedState(res);
|
||||
return res;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
template<typename T, size_t N>
|
||||
bool setChangedState(const T (&arr)[N]) {
|
||||
if (!_isNewElement) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
auto end = arr + N;
|
||||
bool changed{};
|
||||
for (auto p = arr, pOld = old; p != end; ++p, ++pOld) {
|
||||
if (!(*p == *pOld)) {
|
||||
changed = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
writeChangedState(changed);
|
||||
return changed;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
template<typename T, typename Fnc>
|
||||
void processContainer(const T oldBegin, const T oldEnd, const T begin, const T end, Fnc &&fnc) {
|
||||
auto misMatch = std::mismatch(oldBegin, oldEnd, begin, end);
|
||||
auto lastChanged = begin;
|
||||
while (misMatch.first != oldEnd && misMatch.second != end) {
|
||||
writeIndexOffset(std::distance(lastChanged, misMatch.second));
|
||||
_objMemPos.emplace(ObjectMemoryPosition{*misMatch.first, *misMatch.second});
|
||||
fnc(*misMatch.second);
|
||||
_objMemPos.pop();
|
||||
++misMatch.first;
|
||||
++misMatch.second;
|
||||
lastChanged = misMatch.second;
|
||||
misMatch = std::mismatch(misMatch.first, oldEnd, misMatch.second, end);
|
||||
}
|
||||
auto p = misMatch.second;
|
||||
//write items left
|
||||
writeIndexOffset(std::distance(lastChanged, end));
|
||||
//write old elements
|
||||
for (auto pOld = misMatch.first; p != end && pOld != oldEnd; ++p, ++pOld) {
|
||||
_objMemPos.emplace(ObjectMemoryPosition{*pOld, *p});
|
||||
fnc(*p);
|
||||
_objMemPos.pop();
|
||||
}
|
||||
|
||||
//write new elements
|
||||
_isNewElement = true;
|
||||
for (; p != end; ++p)
|
||||
fnc(*p);
|
||||
_isNewElement = false;
|
||||
}
|
||||
|
||||
void writeChangedState(bool state) {
|
||||
_writter.writeBits(state ? 1u : 0u, 1);
|
||||
}
|
||||
|
||||
void writeIndexOffset(const size_t offset) {
|
||||
//special case, if items are updated sequentialy
|
||||
if (offset == 0) {
|
||||
_writter.writeBits(1u, 1);
|
||||
} else {
|
||||
_writter.writeBits(0u, 1);
|
||||
auto smallOffset = offset < 16;
|
||||
_writter.writeBits(smallOffset ? 1u : 0u, 1);
|
||||
if (smallOffset)
|
||||
_writter.writeBits(offset, 4);
|
||||
else
|
||||
_writter.writeBits(offset, 32);
|
||||
}
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
template<size_t SIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
|
||||
DeltaSerializer& value(const T& v) {
|
||||
if (setChangedState(v)) {
|
||||
constexpr size_t ValueSize = SIZE == 0 ? sizeof(T) : SIZE;
|
||||
_writter.template writeBytes<ValueSize>(v);
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
DeltaSerializer& object(T&& obj) {
|
||||
if (setChangedState(obj)) {
|
||||
serialize(*this, std::forward<T>(obj));
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
DeltaSerializer& text(T&& str) {
|
||||
if(setChangedState(str)) {
|
||||
_serializer.text(str);
|
||||
}
|
||||
return *this;
|
||||
|
||||
}
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
DeltaSerializer & array(const std::array<T,N> &arr, Fnc&& fnc) {
|
||||
if (setChangedState(arr)) {
|
||||
if (!_isNewElement) {
|
||||
const auto& old = *_objMemPos.top().getOldObjectField(arr);
|
||||
processContainer(std::begin(old), std::end(old), std::begin(arr), std::end(arr), fnc);
|
||||
} else {
|
||||
for (auto& v:arr)
|
||||
fnc(v);
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
DeltaSerializer& array(const T (&arr)[N], Fnc&& fnc) {
|
||||
if (setChangedState(arr)) {
|
||||
if (!_isNewElement) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
const T* tmp = arr;
|
||||
processContainer(old, old + N, tmp, tmp + N, fnc);
|
||||
} else {
|
||||
const T* tmp = arr;
|
||||
for (auto i=0u; i < N; ++i, ++tmp)
|
||||
fnc(*tmp);
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
template <typename T, typename Fnc>
|
||||
DeltaSerializer& container(T&& obj, Fnc&& fnc) {
|
||||
if(setChangedState(obj)) {
|
||||
_writter.writeBits(obj.size(), 32);
|
||||
if (!_isNewElement) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(obj);
|
||||
processContainer(std::begin(old), std::end(old), std::begin(obj), std::end(obj), std::forward<Fnc>(fnc));
|
||||
} else {
|
||||
for (auto& v:obj)
|
||||
fnc(v);
|
||||
}
|
||||
}
|
||||
return *this;
|
||||
}
|
||||
|
||||
private:
|
||||
Serializer<Writter> _serializer;
|
||||
Writter& _writter;
|
||||
const TObj& _oldObj;
|
||||
const TObj& _newObj;
|
||||
std::stack<ObjectMemoryPosition> _objMemPos;
|
||||
bool _isNewElement;
|
||||
|
||||
template <typename T>
|
||||
bool setChangedState(const T& obj) {
|
||||
if (!_isNewElement) {
|
||||
auto res = !_objMemPos.top().isFieldsEquals(obj);
|
||||
writeChangedState(res);
|
||||
return res;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
template <typename T, size_t N>
|
||||
bool setChangedState(const T (&arr)[N]) {
|
||||
if (!_isNewElement) {
|
||||
auto old = *_objMemPos.top().getOldObjectField(arr);
|
||||
auto end = arr + N;
|
||||
bool changed{};
|
||||
for (auto p=arr, pOld=old; p != end; ++p, ++pOld) {
|
||||
if (!(*p == *pOld)) {
|
||||
changed = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
writeChangedState(changed);
|
||||
return changed;
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
|
||||
template <typename T, typename Fnc>
|
||||
void processContainer(const T oldBegin, const T oldEnd, const T begin, const T end, Fnc&& fnc) {
|
||||
auto misMatch = std::mismatch(oldBegin, oldEnd, begin, end);
|
||||
auto lastChanged = begin;
|
||||
while (misMatch.first != oldEnd && misMatch.second != end) {
|
||||
writeIndexOffset(std::distance(lastChanged, misMatch.second));
|
||||
_objMemPos.emplace(ObjectMemoryPosition{*misMatch.first, *misMatch.second});
|
||||
fnc(*misMatch.second);
|
||||
_objMemPos.pop();
|
||||
++misMatch.first;
|
||||
++misMatch.second;
|
||||
lastChanged = misMatch.second;
|
||||
misMatch = std::mismatch(misMatch.first, oldEnd, misMatch.second, end);
|
||||
}
|
||||
auto p = misMatch.second;
|
||||
//write items left
|
||||
writeIndexOffset(std::distance(lastChanged, end));
|
||||
//write old elements
|
||||
for (auto pOld = misMatch.first; p != end && pOld != oldEnd; ++p, ++pOld) {
|
||||
_objMemPos.emplace(ObjectMemoryPosition{*pOld, *p});
|
||||
fnc(*p);
|
||||
_objMemPos.pop();
|
||||
}
|
||||
|
||||
//write new elements
|
||||
_isNewElement = true;
|
||||
for (; p != end; ++p)
|
||||
fnc(*p);
|
||||
_isNewElement = false;
|
||||
}
|
||||
|
||||
void writeChangedState(bool state) {
|
||||
_writter.writeBits(state ? 1u : 0u, 1);
|
||||
}
|
||||
|
||||
void writeIndexOffset(const size_t offset) {
|
||||
//special case, if items are updated sequentialy
|
||||
if (offset == 0) {
|
||||
_writter.writeBits(1u, 1);
|
||||
} else {
|
||||
_writter.writeBits(0u, 1);
|
||||
auto smallOffset = offset < 16;
|
||||
_writter.writeBits(smallOffset ? 1u : 0u, 1);
|
||||
if (smallOffset)
|
||||
_writter.writeBits(offset, 4);
|
||||
else
|
||||
_writter.writeBits(offset, 32);
|
||||
}
|
||||
}
|
||||
|
||||
};
|
||||
|
||||
}
|
||||
#endif //TMP_DELTASERIALIZER_H
|
||||
|
||||
@@ -8,220 +8,246 @@
|
||||
#include "Common.h"
|
||||
#include <array>
|
||||
|
||||
template<typename Reader>
|
||||
class Deserializer {
|
||||
public:
|
||||
Deserializer(Reader& r):_reader{r} {};
|
||||
|
||||
template <typename T>
|
||||
Deserializer& object(T&& obj) {
|
||||
return serialize(*this, std::forward<T>(obj));
|
||||
}
|
||||
namespace bitsery {
|
||||
|
||||
/*
|
||||
* value overloads
|
||||
* functions for range
|
||||
*/
|
||||
template<typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
|
||||
void setRangeValue(T& v, const RangeSpec<T>& r) {
|
||||
v += r.min;
|
||||
};
|
||||
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_floating_point<T>::value>::type* = nullptr>
|
||||
Deserializer& value(T& v) {
|
||||
static_assert(std::numeric_limits<float>::is_iec559, "");
|
||||
static_assert(std::numeric_limits<double>::is_iec559, "");
|
||||
template<typename T, typename std::enable_if<std::is_enum<T>::value>::type* = nullptr>
|
||||
void setRangeValue(T& v, const RangeSpec<T>& r) {
|
||||
using VT = std::underlying_type_t<T>;
|
||||
reinterpret_cast<VT&>(v) += static_cast<VT>(r.min);
|
||||
};
|
||||
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_reader.template readBytes<ValueSize>(reinterpret_cast<SAME_SIZE_UNSIGNED<T>&>(v));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_enum<T>::value>::type* = nullptr>
|
||||
Deserializer& value(T& v) {
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
using UT = std::underlying_type_t<T>;
|
||||
_reader.template readBytes<ValueSize>(reinterpret_cast<UT&>(v));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
|
||||
Deserializer& value(T& v) {
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_reader.template readBytes<ValueSize>(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* range
|
||||
*/
|
||||
|
||||
template <typename T>
|
||||
Deserializer& range(T& v, const RangeSpec<T>& range) {
|
||||
_reader.template readBits(reinterpret_cast<SAME_SIZE_UNSIGNED<T>&>(v), range.bitsRequired);
|
||||
setRangeValue(v, range);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* default overloads
|
||||
*/
|
||||
template<size_t VSIZE = 0, typename T, size_t N>
|
||||
Deserializer& defaultV(T& v, const std::array<T,N>& defValues) {
|
||||
size_t index;
|
||||
_reader.template readBits(index, calcRequiredBits<size_t>({}, N + 1));
|
||||
if (index)
|
||||
v = defValues[index-1];
|
||||
else
|
||||
ProcessAnyType<VSIZE>::serialize(*this, v);
|
||||
template<typename T, typename std::enable_if<std::is_floating_point<T>::value>::type* = nullptr>
|
||||
void setRangeValue(T& v, const RangeSpec<T>& r) {
|
||||
using UIT = SAME_SIZE_UNSIGNED<T>;
|
||||
const auto intRep = reinterpret_cast<UIT&>(v);
|
||||
const UIT maxUint = (static_cast<UIT>(1) << r.bitsRequired) - 1;
|
||||
v = r.min + (static_cast<T>(intRep) / maxUint) * (r.max - r.min);
|
||||
};
|
||||
|
||||
|
||||
/*
|
||||
* text overloads
|
||||
*/
|
||||
template<typename Reader>
|
||||
class Deserializer {
|
||||
public:
|
||||
Deserializer(Reader& r):_reader{r} {};
|
||||
|
||||
template <size_t VSIZE = 1, typename T>
|
||||
Deserializer& text(std::basic_string<T>& str) {
|
||||
size_t size;
|
||||
readLength(size);
|
||||
std::vector<T> buf(size);
|
||||
_reader.template readBuffer<VSIZE>(buf.data(), size);
|
||||
str.assign(buf.data(), size);
|
||||
// str.resize(size);
|
||||
// if (size)
|
||||
// _reader.template readBuffer<VSIZE>(str.data(), size);
|
||||
return *this;
|
||||
}
|
||||
template <typename T>
|
||||
Deserializer& object(T&& obj) {
|
||||
return serialize(*this, std::forward<T>(obj));
|
||||
}
|
||||
|
||||
template<size_t VSIZE=1, typename T, size_t N>
|
||||
Deserializer& text(T (&str)[N]) {
|
||||
size_t size;
|
||||
readLength(size);
|
||||
_reader.template readBuffer<VSIZE>(str, size);
|
||||
str[size] = {};
|
||||
return *this;
|
||||
}
|
||||
/*
|
||||
* value overloads
|
||||
*/
|
||||
|
||||
/*
|
||||
* container overloads
|
||||
*/
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_floating_point<T>::value>::type* = nullptr>
|
||||
Deserializer& value(T& v) {
|
||||
static_assert(std::numeric_limits<float>::is_iec559, "");
|
||||
static_assert(std::numeric_limits<double>::is_iec559, "");
|
||||
|
||||
template <typename T, typename Fnc>
|
||||
Deserializer& container(T&& obj, Fnc&& fnc) {
|
||||
decltype(obj.size()) size{};
|
||||
readLength(size);
|
||||
obj.resize(size);
|
||||
for (auto& v:obj)
|
||||
fnc(v);
|
||||
return *this;
|
||||
}
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_reader.template readBytes<ValueSize>(reinterpret_cast<SAME_SIZE_UNSIGNED<T>&>(v));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template <size_t VSIZE, typename T>
|
||||
Deserializer& container(T& obj) {
|
||||
decltype(obj.size()) size{};
|
||||
readLength(size);
|
||||
obj.resize(size);
|
||||
procContainer<VSIZE>(obj);
|
||||
return *this;
|
||||
}
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_enum<T>::value>::type* = nullptr>
|
||||
Deserializer& value(T& v) {
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
using UT = std::underlying_type_t<T>;
|
||||
_reader.template readBytes<ValueSize>(reinterpret_cast<UT&>(v));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Deserializer& container(T& obj) {
|
||||
decltype(obj.size()) size{};
|
||||
readLength(size);
|
||||
obj.resize(size);
|
||||
procContainer<ARITHMETIC_OR_ENUM_SIZE<typename T::value_type>>(obj);
|
||||
return *this;
|
||||
}
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
|
||||
Deserializer& value(T& v) {
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_reader.template readBytes<ValueSize>(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* array overloads (fixed size array (std::array, and c-style array))
|
||||
*/
|
||||
/*
|
||||
* range
|
||||
*/
|
||||
|
||||
//std::array overloads
|
||||
template <typename T>
|
||||
Deserializer& range(T& v, const RangeSpec<T>& range) {
|
||||
_reader.template readBits(reinterpret_cast<SAME_SIZE_UNSIGNED<T>&>(v), range.bitsRequired);
|
||||
setRangeValue(v, range);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Deserializer & array(std::array<T,N> &arr, Fnc && fnc) {
|
||||
for (auto& v: arr)
|
||||
fnc(v);
|
||||
return *this;
|
||||
}
|
||||
/*
|
||||
* substitution overloads
|
||||
*/
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Deserializer& substitution(T& v, const std::array<T,N>& expectedValues, Fnc&& fnc) {
|
||||
size_t index;
|
||||
range(index, {{}, N + 1});
|
||||
if (index)
|
||||
v = expectedValues[index-1];
|
||||
else
|
||||
fnc(v);
|
||||
return *this;
|
||||
};
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Deserializer & array(std::array<T,N> &arr) {
|
||||
procContainer<VSIZE>(arr);
|
||||
return *this;
|
||||
}
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Deserializer& substitution(T& v, const std::array<T,N>& expectedValues) {
|
||||
size_t index;
|
||||
range(index, {{}, N + 1});
|
||||
if (index)
|
||||
v = expectedValues[index-1];
|
||||
else
|
||||
ProcessAnyType<VSIZE>::serialize(*this, v);
|
||||
return *this;
|
||||
};
|
||||
|
||||
template<typename T, size_t N>
|
||||
Deserializer & array(std::array<T,N> &arr) {
|
||||
procContainer<ARITHMETIC_OR_ENUM_SIZE<T>>(arr);
|
||||
return *this;
|
||||
}
|
||||
template<typename T, size_t N>
|
||||
Deserializer& substitution(T& v, const std::array<T,N>& expectedValues) {
|
||||
size_t index;
|
||||
range(index, {{}, N + 1});
|
||||
if (index)
|
||||
v = expectedValues[index-1];
|
||||
else
|
||||
ProcessAnyType<ARITHMETIC_OR_ENUM_SIZE<T>>::serialize(*this, v);
|
||||
return *this;
|
||||
};
|
||||
|
||||
//c-style array overloads
|
||||
/*
|
||||
* text overloads
|
||||
*/
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Deserializer& array(T (&arr)[N], Fnc&& fnc) {
|
||||
T* tmp = arr;
|
||||
for (auto i = 0u; i < N; ++i, ++tmp)
|
||||
fnc(*tmp);
|
||||
return *this;
|
||||
}
|
||||
template <size_t VSIZE = 1, typename T>
|
||||
Deserializer& text(std::basic_string<T>& str, size_t maxSize) {
|
||||
size_t size;
|
||||
readLength(size);
|
||||
std::vector<T> buf(size);
|
||||
_reader.template readBuffer<VSIZE>(buf.data(), size);
|
||||
str.assign(buf.data(), size);
|
||||
// str.resize(size);
|
||||
// if (size)
|
||||
// _reader.template readBuffer<VSIZE>(str.data(), size);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Deserializer& array(T (&arr)[N]) {
|
||||
procCArray<VSIZE>(arr);
|
||||
return *this;
|
||||
}
|
||||
template<size_t VSIZE=1, typename T, size_t N>
|
||||
Deserializer& text(T (&str)[N]) {
|
||||
size_t size;
|
||||
readLength(size);
|
||||
_reader.template readBuffer<VSIZE>(str, size);
|
||||
str[size] = {};
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, size_t N>
|
||||
Deserializer& array(T (&arr)[N]) {
|
||||
procCArray<ARITHMETIC_OR_ENUM_SIZE<T>>(arr);
|
||||
return *this;
|
||||
}
|
||||
/*
|
||||
* container overloads
|
||||
*/
|
||||
|
||||
template <typename T, typename Fnc>
|
||||
Deserializer& container(T&& obj, Fnc&& fnc, size_t maxSize) {
|
||||
decltype(obj.size()) size{};
|
||||
readLength(size);
|
||||
obj.resize(size);
|
||||
for (auto& v:obj)
|
||||
fnc(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template <size_t VSIZE, typename T>
|
||||
Deserializer& container(T& obj, size_t maxSize) {
|
||||
decltype(obj.size()) size{};
|
||||
readLength(size);
|
||||
obj.resize(size);
|
||||
procContainer<VSIZE>(obj);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Deserializer& container(T& obj, size_t maxSize) {
|
||||
decltype(obj.size()) size{};
|
||||
readLength(size);
|
||||
obj.resize(size);
|
||||
procContainer<ARITHMETIC_OR_ENUM_SIZE<typename T::value_type>>(obj);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* array overloads (fixed size array (std::array, and c-style array))
|
||||
*/
|
||||
|
||||
//std::array overloads
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Deserializer& array(std::array<T,N> &arr, Fnc && fnc) {
|
||||
for (auto& v: arr)
|
||||
fnc(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Deserializer& array(std::array<T,N> &arr) {
|
||||
procContainer<VSIZE>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, size_t N>
|
||||
Deserializer& array(std::array<T,N> &arr) {
|
||||
procContainer<ARITHMETIC_OR_ENUM_SIZE<T>>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
//c-style array overloads
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Deserializer& array(T (&arr)[N], Fnc&& fnc) {
|
||||
T* tmp = arr;
|
||||
for (auto i = 0u; i < N; ++i, ++tmp)
|
||||
fnc(*tmp);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Deserializer& array(T (&arr)[N]) {
|
||||
procCArray<VSIZE>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, size_t N>
|
||||
Deserializer& array(T (&arr)[N]) {
|
||||
procCArray<ARITHMETIC_OR_ENUM_SIZE<T>>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
private:
|
||||
Reader& _reader;
|
||||
void readLength(size_t& size) {
|
||||
size = {};
|
||||
_reader.readBits(size, 32);
|
||||
}
|
||||
template <size_t VSIZE, typename T>
|
||||
void procContainer(T&& obj) {
|
||||
//todo could be improved for arithmetic types in contiguous containers (std::vector, std::array) (keep in mind std::vector<bool> specialization)
|
||||
for (auto& v: obj)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, v);
|
||||
};
|
||||
|
||||
template <size_t VSIZE, typename T, size_t N>
|
||||
void procCArray(T (&arr)[N]) {
|
||||
//todo could be improved for arithmetic types
|
||||
T* end = arr + N;
|
||||
for (T* it = arr; it != end; ++it)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, *it);
|
||||
};
|
||||
|
||||
private:
|
||||
Reader& _reader;
|
||||
void readLength(size_t& size) {
|
||||
size = {};
|
||||
_reader.readBits(size, 32);
|
||||
}
|
||||
template <size_t VSIZE, typename T>
|
||||
void procContainer(T&& obj) {
|
||||
//todo could be improved for arithmetic types in contiguous containers (std::vector, std::array) (keep in mind std::vector<bool> specialization)
|
||||
for (auto& v: obj)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, v);
|
||||
};
|
||||
|
||||
template <size_t VSIZE, typename T, size_t N>
|
||||
void procCArray(T (&arr)[N]) {
|
||||
//todo could be improved for arithmetic types
|
||||
T* end = arr + N;
|
||||
for (T* it = arr; it != end; ++it)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, *it);
|
||||
};
|
||||
|
||||
};
|
||||
|
||||
/*
|
||||
* functions for range
|
||||
*/
|
||||
template<typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
|
||||
void setRangeValue(T& v, const RangeSpec<T>& r) {
|
||||
v += r.min;
|
||||
};
|
||||
|
||||
template<typename T, typename std::enable_if<std::is_enum<T>::value>::type* = nullptr>
|
||||
void setRangeValue(T& v, const RangeSpec<T>& r) {
|
||||
using VT = std::underlying_type_t<T>;
|
||||
reinterpret_cast<VT&>(v) += static_cast<VT>(r.min);
|
||||
};
|
||||
|
||||
template<typename T, typename std::enable_if<std::is_floating_point<T>::value>::type* = nullptr>
|
||||
void setRangeValue(T& v, const RangeSpec<T>& r) {
|
||||
using UIT = SAME_SIZE_UNSIGNED<T>;
|
||||
const auto intRep = reinterpret_cast<UIT&>(v);
|
||||
const UIT maxUint = (static_cast<UIT>(1) << r.bitsRequired) - 1;
|
||||
v = r.min + (static_cast<T>(intRep) / maxUint) * (r.max - r.min);
|
||||
};
|
||||
|
||||
|
||||
}
|
||||
|
||||
#endif //TMP_DESERIALIZER_H
|
||||
|
||||
@@ -8,234 +8,263 @@
|
||||
#include "Common.h"
|
||||
#include <array>
|
||||
|
||||
template<typename Writter>
|
||||
class Serializer {
|
||||
public:
|
||||
Serializer(Writter& w):_writter{w} {};
|
||||
|
||||
template <typename T>
|
||||
Serializer& object(const T& obj) {
|
||||
return serialize(*this, obj);
|
||||
}
|
||||
|
||||
/*
|
||||
* value overloads
|
||||
*/
|
||||
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_floating_point<T>::value>::type* = nullptr>
|
||||
Serializer& value(const T& v) {
|
||||
static_assert(std::numeric_limits<float>::is_iec559, "");
|
||||
static_assert(std::numeric_limits<double>::is_iec559, "");
|
||||
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_writter.template writeBytes<ValueSize>(reinterpret_cast<const SAME_SIZE_UNSIGNED<T>&>(v));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_enum<T>::value>::type* = nullptr>
|
||||
Serializer& value(const T& v) {
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_writter.template writeBytes<ValueSize>(reinterpret_cast<const std::underlying_type_t<T>&>(v));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
|
||||
Serializer& value(const T& v) {
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_writter.template writeBytes<ValueSize>(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* range
|
||||
*/
|
||||
|
||||
template <typename T>
|
||||
Serializer& range(const T& v, const RangeSpec<T>& range) {
|
||||
assert(isRangeValid(v, range));
|
||||
_writter.template writeBits(getRangeValue(v,range), range.bitsRequired);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* default overloads
|
||||
*/
|
||||
template<size_t VSIZE = 0, typename T, size_t N>
|
||||
Serializer& defaultV(const T& v, const std::array<T,N>& defValues) {
|
||||
auto index = findDefault(v, defValues);
|
||||
_writter.template writeBits(index, calcRequiredBits<size_t>({}, N + 1));
|
||||
if (!index)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, v);
|
||||
};
|
||||
|
||||
/*
|
||||
* text overloads
|
||||
*/
|
||||
|
||||
template <size_t VSIZE = 1, typename T>
|
||||
Serializer& text(const std::basic_string<T>& str) {
|
||||
procText<VSIZE>(str.data(), str.size());
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE=1, typename T, size_t N>
|
||||
Serializer& text(const T (&str)[N]) {
|
||||
procText<VSIZE>(str, std::min(std::char_traits<T>::length(str), N-1));
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* container overloads
|
||||
*/
|
||||
|
||||
template <typename T, typename Fnc>
|
||||
Serializer& container(const T& obj, Fnc&& fnc) {
|
||||
writeLength(obj.size());
|
||||
for (auto& v: obj)
|
||||
fnc(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template <size_t VSIZE, typename T>
|
||||
Serializer& container(const T& obj) {
|
||||
writeLength(obj.size());
|
||||
procContainer<VSIZE>(obj);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
Serializer& container(const T& obj) {
|
||||
writeLength(obj.size());
|
||||
procContainer<ARITHMETIC_OR_ENUM_SIZE<typename T::value_type>>(obj);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* array overloads (fixed size array (std::array, and c-style array))
|
||||
*/
|
||||
|
||||
//std::array overloads
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Serializer & array(const std::array<T,N> &arr, Fnc&& fnc) {
|
||||
for (auto& v: arr)
|
||||
fnc(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Serializer & array(const std::array<T,N> &arr) {
|
||||
procContainer<VSIZE>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, size_t N>
|
||||
Serializer & array(const std::array<T,N> &arr) {
|
||||
procContainer<ARITHMETIC_OR_ENUM_SIZE<T>>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
//c-style array overloads
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Serializer& array(const T (&arr)[N], Fnc&& fnc) {
|
||||
const T* end = arr + N;
|
||||
for (const T* tmp = arr; tmp != end; ++tmp)
|
||||
fnc(*tmp);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Serializer& array(const T (&arr)[N]) {
|
||||
procCArray<VSIZE>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, size_t N>
|
||||
Serializer& array(const T (&arr)[N]) {
|
||||
procCArray<ARITHMETIC_OR_ENUM_SIZE<T>>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
|
||||
private:
|
||||
Writter& _writter;
|
||||
void writeLength(const size_t size) {
|
||||
_writter.writeBits(size, 32);
|
||||
}
|
||||
|
||||
template <size_t VSIZE, typename T>
|
||||
void procContainer(T&& obj) {
|
||||
//todo could be improved for arithmetic types in contiguous containers (std::vector, std::array) (keep in mind std::vector<bool> specialization)
|
||||
for (auto& v: obj)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, v);
|
||||
};
|
||||
|
||||
template <size_t VSIZE, typename T, size_t N>
|
||||
void procCArray(T (&arr)[N]) {
|
||||
//todo could be improved for arithmetic types
|
||||
const T* end = arr + N;
|
||||
for (const T* it = arr; it != end; ++it)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, *it);
|
||||
};
|
||||
|
||||
template <size_t VSIZE, typename T>
|
||||
void procText(const T* str, size_t size) {
|
||||
writeLength(size);
|
||||
if (size)
|
||||
_writter.template writeBuffer<VSIZE>(str, size);
|
||||
}
|
||||
};
|
||||
namespace bitsery {
|
||||
|
||||
/*
|
||||
* functions for range
|
||||
*/
|
||||
|
||||
template<typename T, typename std::enable_if<std::is_arithmetic<T>::value>::type* = nullptr>
|
||||
bool isRangeValid(const T& v, const RangeSpec<T>& r) {
|
||||
return !(r.min > v || v > r.max);
|
||||
}
|
||||
template<typename T, typename std::enable_if<std::is_arithmetic<T>::value>::type * = nullptr>
|
||||
bool isRangeValid(const T &v, const RangeSpec<T> &r) {
|
||||
return !(r.min > v || v > r.max);
|
||||
}
|
||||
|
||||
template<typename T, typename std::enable_if<std::is_enum<T>::value>::type* = nullptr>
|
||||
bool isRangeValid(const T& v, const RangeSpec<T>& r) {
|
||||
using VT = std::underlying_type_t<T>;
|
||||
return !(static_cast<VT>(r.min) > static_cast<VT>(v)
|
||||
|| static_cast<VT>(v) > static_cast<VT>(r.max));
|
||||
}
|
||||
template<typename T, typename std::enable_if<std::is_enum<T>::value>::type * = nullptr>
|
||||
bool isRangeValid(const T &v, const RangeSpec<T> &r) {
|
||||
using VT = std::underlying_type_t<T>;
|
||||
return !(static_cast<VT>(r.min) > static_cast<VT>(v)
|
||||
|| static_cast<VT>(v) > static_cast<VT>(r.max));
|
||||
}
|
||||
|
||||
|
||||
template<typename T, typename std::enable_if<std::is_integral<T>::value>::type* = nullptr>
|
||||
auto getRangeValue(const T& v, const RangeSpec<T>& r) {
|
||||
return static_cast<SAME_SIZE_UNSIGNED<T>>(v - r.min);
|
||||
};
|
||||
template<typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
|
||||
auto getRangeValue(const T &v, const RangeSpec<T> &r) {
|
||||
return static_cast<SAME_SIZE_UNSIGNED<T>>(v - r.min);
|
||||
};
|
||||
|
||||
template<typename T, typename std::enable_if<std::is_enum<T>::value>::type* = nullptr>
|
||||
auto getRangeValue(const T& v, const RangeSpec<T>& r) {
|
||||
return static_cast<SAME_SIZE_UNSIGNED<T>>(v) - static_cast<SAME_SIZE_UNSIGNED<T>>(r.min);
|
||||
};
|
||||
template<typename T, typename std::enable_if<std::is_enum<T>::value>::type * = nullptr>
|
||||
auto getRangeValue(const T &v, const RangeSpec<T> &r) {
|
||||
return static_cast<SAME_SIZE_UNSIGNED<T>>(v) - static_cast<SAME_SIZE_UNSIGNED<T>>(r.min);
|
||||
};
|
||||
|
||||
template<typename T, typename std::enable_if<std::is_floating_point<T>::value>::type* = nullptr>
|
||||
auto getRangeValue(const T& v, const RangeSpec<T>& r) {
|
||||
using VT = SAME_SIZE_UNSIGNED<T>;
|
||||
const VT maxUint = (static_cast<VT>(1) << r.bitsRequired) - 1;
|
||||
const auto ratio = (v - r.min) / (r.max - r.min);
|
||||
return static_cast<VT>(ratio * maxUint);
|
||||
};
|
||||
template<typename T, typename std::enable_if<std::is_floating_point<T>::value>::type * = nullptr>
|
||||
auto getRangeValue(const T &v, const RangeSpec<T> &r) {
|
||||
using VT = SAME_SIZE_UNSIGNED<T>;
|
||||
const VT maxUint = (static_cast<VT>(1) << r.bitsRequired) - 1;
|
||||
const auto ratio = (v - r.min) / (r.max - r.min);
|
||||
return static_cast<VT>(ratio * maxUint);
|
||||
};
|
||||
|
||||
/*
|
||||
* functions for default
|
||||
* functions for substitution
|
||||
*/
|
||||
|
||||
template <typename T, size_t N>
|
||||
size_t findDefault(const T& v, const std::array<T,N>& defValues) {
|
||||
auto index{1u};
|
||||
for (auto& d:defValues) {
|
||||
if (d == v)
|
||||
return index;
|
||||
++index;
|
||||
}
|
||||
return 0u;
|
||||
};
|
||||
template<typename T, size_t N>
|
||||
size_t findSubstitutionIndex(const T &v, const std::array<T, N> &defValues) {
|
||||
auto index{1u};
|
||||
for (auto &d:defValues) {
|
||||
if (d == v)
|
||||
return index;
|
||||
++index;
|
||||
}
|
||||
return 0u;
|
||||
};
|
||||
|
||||
|
||||
|
||||
|
||||
template<typename Writter>
|
||||
class Serializer {
|
||||
public:
|
||||
Serializer(Writter &w) : _writter{w} {};
|
||||
|
||||
template<typename T>
|
||||
Serializer& object(const T &obj) {
|
||||
return serialize(*this, obj);
|
||||
}
|
||||
|
||||
/*
|
||||
* value overloads
|
||||
*/
|
||||
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_floating_point<T>::value>::type * = nullptr>
|
||||
Serializer& value(const T &v) {
|
||||
static_assert(std::numeric_limits<float>::is_iec559, "");
|
||||
static_assert(std::numeric_limits<double>::is_iec559, "");
|
||||
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_writter.template writeBytes<ValueSize>(reinterpret_cast<const SAME_SIZE_UNSIGNED<T> &>(v));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_enum<T>::value>::type * = nullptr>
|
||||
Serializer& value(const T &v) {
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_writter.template writeBytes<ValueSize>(reinterpret_cast<const std::underlying_type_t<T> &>(v));
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE = 0, typename T, typename std::enable_if<std::is_integral<T>::value>::type * = nullptr>
|
||||
Serializer& value(const T &v) {
|
||||
constexpr size_t ValueSize = VSIZE == 0 ? sizeof(T) : VSIZE;
|
||||
_writter.template writeBytes<ValueSize>(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* range
|
||||
*/
|
||||
|
||||
template<typename T>
|
||||
Serializer& range(const T &v, const RangeSpec<T> &range) {
|
||||
assert(isRangeValid(v, range));
|
||||
_writter.template writeBits(getRangeValue(v, range), range.bitsRequired);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* substitution overloads
|
||||
*/
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Serializer& substitution(const T &v, const std::array<T, N> &expectedValues, Fnc &&fnc) {
|
||||
auto index = findSubstitutionIndex(v, expectedValues);
|
||||
range(index, {{}, N +1});
|
||||
if (!index)
|
||||
fnc(v);
|
||||
return *this;
|
||||
};
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Serializer& substitution(const T &v, const std::array<T, N> &expectedValues) {
|
||||
auto index = findSubstitutionIndex(v, expectedValues);
|
||||
range(index, {{}, N +1});
|
||||
if (!index)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, v);
|
||||
return *this;
|
||||
};
|
||||
|
||||
template<typename T, size_t N>
|
||||
Serializer& substitution(const T &v, const std::array<T, N> &expectedValues) {
|
||||
auto index = findSubstitutionIndex(v, expectedValues);
|
||||
range(index, {{}, N +1});
|
||||
if (!index)
|
||||
ProcessAnyType<ARITHMETIC_OR_ENUM_SIZE<T>>::serialize(*this, v);
|
||||
return *this;
|
||||
};
|
||||
|
||||
/*
|
||||
* text overloads
|
||||
*/
|
||||
|
||||
template<size_t VSIZE = 1, typename T>
|
||||
Serializer& text(const std::basic_string<T> &str, size_t maxSize) {
|
||||
assert(str.size() <= maxSize);
|
||||
procText<VSIZE>(str.data(), str.size());
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE = 1, typename T, size_t N>
|
||||
Serializer& text(const T (&str)[N]) {
|
||||
procText<VSIZE>(str, std::min(std::char_traits<T>::length(str), N - 1));
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* container overloads
|
||||
*/
|
||||
|
||||
template<typename T, typename Fnc>
|
||||
Serializer& container(const T &obj, Fnc &&fnc, size_t maxSize) {
|
||||
assert(obj.size() <= maxSize);
|
||||
writeLength(obj.size());
|
||||
for (auto &v: obj)
|
||||
fnc(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE, typename T>
|
||||
Serializer& container(const T &obj, size_t maxSize) {
|
||||
assert(obj.size() <= maxSize);
|
||||
writeLength(obj.size());
|
||||
procContainer<VSIZE>(obj);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T>
|
||||
Serializer& container(const T &obj, size_t maxSize) {
|
||||
assert(obj.size() <= maxSize);
|
||||
writeLength(obj.size());
|
||||
procContainer<ARITHMETIC_OR_ENUM_SIZE<typename T::value_type>>(obj);
|
||||
return *this;
|
||||
}
|
||||
|
||||
/*
|
||||
* array overloads (fixed size array (std::array, and c-style array))
|
||||
*/
|
||||
|
||||
//std::array overloads
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Serializer& array(const std::array<T, N> &arr, Fnc &&fnc) {
|
||||
for (auto &v: arr)
|
||||
fnc(v);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Serializer& array(const std::array<T, N> &arr) {
|
||||
procContainer<VSIZE>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, size_t N>
|
||||
Serializer& array(const std::array<T, N> &arr) {
|
||||
procContainer<ARITHMETIC_OR_ENUM_SIZE<T>>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
//c-style array overloads
|
||||
|
||||
template<typename T, size_t N, typename Fnc>
|
||||
Serializer& array(const T (&arr)[N], Fnc &&fnc) {
|
||||
const T *end = arr + N;
|
||||
for (const T *tmp = arr; tmp != end; ++tmp)
|
||||
fnc(*tmp);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
Serializer& array(const T (&arr)[N]) {
|
||||
procCArray<VSIZE>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
template<typename T, size_t N>
|
||||
Serializer& array(const T (&arr)[N]) {
|
||||
procCArray<ARITHMETIC_OR_ENUM_SIZE<T>>(arr);
|
||||
return *this;
|
||||
}
|
||||
|
||||
|
||||
private:
|
||||
Writter &_writter;
|
||||
|
||||
void writeLength(const size_t size) {
|
||||
_writter.writeBits(size, 32);
|
||||
}
|
||||
|
||||
template<size_t VSIZE, typename T>
|
||||
void procContainer(T &&obj) {
|
||||
//todo could be improved for arithmetic types in contiguous containers (std::vector, std::array) (keep in mind std::vector<bool> specialization)
|
||||
for (auto &v: obj)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, v);
|
||||
};
|
||||
|
||||
template<size_t VSIZE, typename T, size_t N>
|
||||
void procCArray(T (&arr)[N]) {
|
||||
//todo could be improved for arithmetic types
|
||||
const T *end = arr + N;
|
||||
for (const T *it = arr; it != end; ++it)
|
||||
ProcessAnyType<VSIZE>::serialize(*this, *it);
|
||||
};
|
||||
|
||||
template<size_t VSIZE, typename T>
|
||||
void procText(const T *str, size_t size) {
|
||||
writeLength(size);
|
||||
if (size)
|
||||
_writter.template writeBuffer<VSIZE>(str, size);
|
||||
}
|
||||
};
|
||||
|
||||
}
|
||||
#endif //TMP_SERIALIZER_H
|
||||
|
||||
Reference in New Issue
Block a user