PDF4QT/PdfForQtLib/sources/pdfutils.h

321 lines
9.5 KiB
C
Raw Normal View History

2019-02-24 17:48:37 +01:00
// Copyright (C) 2019 Jakub Melka
//
// This file is part of PdfForQt.
//
// PdfForQt is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// PdfForQt 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 Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with PDFForQt. If not, see <https://www.gnu.org/licenses/>.
#ifndef PDFUTILS_H
#define PDFUTILS_H
2019-05-10 19:48:52 +02:00
#include "pdfglobal.h"
#include <QByteArray>
#include <QDataStream>
2019-08-13 11:45:36 +02:00
#include <vector>
2019-09-20 18:19:21 +02:00
#include <iterator>
2019-08-13 11:45:36 +02:00
2019-02-24 17:48:37 +01:00
namespace pdf
{
/// Class for easy storing of cached item. This class is not thread safe,
/// and for this reason, access function are not constant (they can modify the
/// object).
template<typename T>
class PDFCachedItem
{
public:
explicit inline PDFCachedItem() :
m_dirty(true),
m_object()
{
}
/// Returns the cached object. If object is dirty, then cached object is refreshed.
/// \param holder Holder object, which owns the cached item
/// \param function Refresh function
template<typename H>
inline const T& get(const H* holder, T(H::* function)(void) const)
{
if (m_dirty)
{
m_object = (holder->*function)();
m_dirty = false;
}
return m_object;
}
/// Returns the cached object. If object is dirty, then cached object is refreshed.
/// \param holder Holder object, which owns the cached item
/// \param function Refresh function
template<typename H>
inline const T& get(H* holder, T(H::* function)(void))
{
if (m_dirty)
{
m_object = (holder->*function)();
m_dirty = false;
}
return m_object;
}
2019-02-24 17:48:37 +01:00
/// Invalidates the cached item, so it must be refreshed from the cache next time,
/// if it is accessed.
inline void dirty()
{
m_dirty = true;
m_object = T();
}
private:
bool m_dirty;
T m_object;
};
2019-05-10 19:48:52 +02:00
/// Bit-reader, which can read n-bit unsigned integers from the stream.
/// Number of bits can be set in the constructor and is constant.
2019-10-29 15:34:09 +01:00
class PDFFORQTLIBSHARED_EXPORT PDFBitReader
2019-05-10 19:48:52 +02:00
{
public:
using Value = uint64_t;
2019-09-15 16:50:34 +02:00
explicit PDFBitReader(const QByteArray* stream, Value bitsPerComponent);
2019-05-10 19:48:52 +02:00
2019-10-26 18:02:37 +02:00
PDFBitReader(const PDFBitReader&) = default;
PDFBitReader(PDFBitReader&&) = default;
PDFBitReader& operator=(const PDFBitReader&) = default;
PDFBitReader& operator=(PDFBitReader&&) = default;
2019-05-10 19:48:52 +02:00
/// Returns maximal value of n-bit unsigned integer.
Value max() const { return m_maximalValue; }
/// Reads single n-bit value from the stream. If stream hasn't enough data,
/// then exception is thrown.
2019-09-15 16:50:34 +02:00
Value read() { return read(m_bitsPerComponent); }
/// Reads single n-bit value from the stream. If stream hasn't enough data,
/// then exception is thrown.
Value read(Value bits);
2019-05-10 19:48:52 +02:00
2019-10-12 18:10:25 +02:00
/// Reads single n-bit value from the stream. If stream hasn't enough data,
/// then exception is thrown. State of the stream is not changed, i.e., read
/// bits are reverted back.
Value look(Value bits) const;
2019-05-10 19:48:52 +02:00
/// Seeks the desired position in the data stream. If position can't be seeked,
/// then exception is thrown.
void seek(qint64 position);
2019-10-26 18:02:37 +02:00
/// Skips desired number of bytes
void skipBytes(Value bytes);
2019-09-15 16:50:34 +02:00
/// Seeks data to the byte boundary (number of processed bits is divisible by 8)
void alignToBytes();
2019-09-22 13:18:42 +02:00
/// Returns true, if we are at the end of the data stream (no more data can be read)
bool isAtEnd() const;
2019-10-26 18:02:37 +02:00
/// Returns position in the data stream (byte position, not bit position, so
/// result of this function is sometimes inaccurate)
int getPosition() const { return m_position; }
/// Reads signed 32-bit integer from the stream
int32_t readSignedInt();
2019-10-28 17:39:22 +01:00
/// Reads signed 8-bit integer from the stream
int8_t readSignedByte();
/// Reads unsigned 32-bit integer from the stream
uint32_t readUnsignedInt() { return read(32); }
/// Reads unsigned 16-bit integer from the stream
uint16_t readUnsignedWord() { return read(16); }
/// Reads unsigned 8-bit integer from the stream
uint8_t readUnsignedByte() { return read(8); }
2019-10-28 17:39:22 +01:00
/// Return underlying byte stream
const QByteArray* getStream() const { return m_stream; }
2019-05-10 19:48:52 +02:00
private:
2019-09-15 16:50:34 +02:00
const QByteArray* m_stream;
int m_position;
2019-05-10 19:48:52 +02:00
2019-10-26 18:02:37 +02:00
Value m_bitsPerComponent;
Value m_maximalValue;
2019-05-10 19:48:52 +02:00
Value m_buffer;
Value m_bitsInBuffer;
};
2019-10-05 17:38:15 +02:00
/// Bit writer
class PDFBitWriter
{
public:
using Value = uint64_t;
explicit PDFBitWriter(Value bitsPerComponent);
/// Writes value to the output stream
void write(Value value);
/// Finish line - align to byte boundary
void finishLine() { flush(true); }
/// Returns the result byte array
QByteArray takeByteArray() { return qMove(m_outputByteArray); }
/// Reserve memory in buffer
void reserve(int size) { m_outputByteArray.reserve(size); }
private:
void flush(bool alignToByteBoundary);
QByteArray m_outputByteArray;
Value m_bitsPerComponent;
Value m_mask;
Value m_buffer;
Value m_bitsInBuffer;
};
2019-08-25 18:16:37 +02:00
/// Simple class guard, for properly saving/restoring new/old value. In the constructor,
/// new value is stored in the pointer (old one is being saved), and in the destructor,
/// old value is restored. This object assumes, that value is not a null pointer.
template<typename Value>
class PDFTemporaryValueChange
{
public:
/// Constructor
/// \param value Value pointer (must not be a null pointer)
/// \param newValue New value to be set to the pointer
explicit inline PDFTemporaryValueChange(Value* valuePointer, Value newValue) :
m_oldValue(qMove(*valuePointer)),
m_value(valuePointer)
{
*valuePointer = qMove(newValue);
}
inline ~PDFTemporaryValueChange()
{
*m_value = qMove(m_oldValue);
}
private:
Value m_oldValue;
Value* m_value;
};
2019-09-20 18:19:21 +02:00
/// Implements range for range based for cycles
template<typename T>
class PDFIntegerRange
{
public:
explicit inline constexpr PDFIntegerRange(T begin, T end) : m_begin(begin), m_end(end) { }
struct Iterator : public std::iterator<std::random_access_iterator_tag, T, ptrdiff_t, T*, T&>
{
inline Iterator() : value(T(0)) { }
inline Iterator(T value) : value(value) { }
inline bool operator==(const Iterator& other) const { return value == other.value; }
inline bool operator!=(const Iterator& other) const { return value != other.value; }
inline T operator*() const { return value; }
inline Iterator& operator+=(ptrdiff_t movement) { value += T(movement); return *this; }
inline Iterator& operator-=(ptrdiff_t movement) { value -= T(movement); return *this; }
inline Iterator operator+(ptrdiff_t movement) const { return Iterator(value + T(movement)); }
inline ptrdiff_t operator-(const Iterator& other) const { return ptrdiff_t(value - other.value); }
inline Iterator& operator++()
{
++value;
return *this;
}
inline Iterator operator++(int)
{
Iterator copy(*this);
++value;
return copy;
}
inline Iterator& operator--()
{
--value;
return *this;
}
inline Iterator operator--(int)
{
Iterator copy(*this);
--value;
return copy;
}
T value = 0;
};
Iterator begin() const { return Iterator(m_begin); }
Iterator end() const { return Iterator(m_end); }
private:
T m_begin;
T m_end;
};
2019-09-15 16:50:34 +02:00
template<typename T>
bool contains(T value, std::initializer_list<T> list)
{
return (std::find(list.begin(), list.end(), value) != list.end());
}
2019-06-15 17:40:22 +02:00
/// Performs linear mapping of value x in interval [x_min, x_max] to the interval [y_min, y_max].
/// \param x Value to be linearly remapped from interval [x_min, x_max] to the interval [y_min, y_max].
/// \param x_min Start of the input interval
/// \param x_max End of the input interval
/// \param y_min Start of the output interval
/// \param y_max End of the output interval
static inline constexpr PDFReal interpolate(PDFReal x, PDFReal x_min, PDFReal x_max, PDFReal y_min, PDFReal y_max)
{
return y_min + (x - x_min) * (y_max - y_min) / (x_max - x_min);
}
2019-08-13 11:45:36 +02:00
inline
std::vector<uint8_t> convertByteArrayToVector(const QByteArray& data)
{
return std::vector<uint8_t>(reinterpret_cast<const uint8_t*>(data.constData()), reinterpret_cast<const uint8_t*>(data.constData()) + data.size());
}
inline
const unsigned char* convertByteArrayToUcharPtr(const QByteArray& data)
{
return reinterpret_cast<const unsigned char*>(data.constData());
}
inline
unsigned char* convertByteArrayToUcharPtr(QByteArray& data)
{
return reinterpret_cast<unsigned char*>(data.data());
}
2019-02-24 17:48:37 +01:00
} // namespace pdf
#endif // PDFUTILS_H