// 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 . #ifndef PDFUTILS_H #define PDFUTILS_H #include "pdfglobal.h" #include #include #include #include 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 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 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; } /// 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; }; /// Bit-reader, which can read n-bit unsigned integers from the stream. /// Number of bits can be set in the constructor and is constant. class PDFBitReader { public: using Value = uint64_t; explicit PDFBitReader(const QByteArray* stream, Value bitsPerComponent); /// 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. 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); /// Seeks the desired position in the data stream. If position can't be seeked, /// then exception is thrown. void seek(qint64 position); /// Seeks data to the byte boundary (number of processed bits is divisible by 8) void alignToBytes(); /// Returns true, if we are at the end of the data stream (no more data can be read) bool isAtEnd() const; private: const QByteArray* m_stream; int m_position; const Value m_bitsPerComponent; const Value m_maximalValue; Value m_buffer; Value m_bitsInBuffer; }; /// 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 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; }; /// Implements range for range based for cycles template class PDFIntegerRange { public: explicit inline constexpr PDFIntegerRange(T begin, T end) : m_begin(begin), m_end(end) { } struct Iterator : public std::iterator { 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; }; template bool contains(T value, std::initializer_list list) { return (std::find(list.begin(), list.end(), value) != list.end()); } /// 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); } inline std::vector convertByteArrayToVector(const QByteArray& data) { return std::vector(reinterpret_cast(data.constData()), reinterpret_cast(data.constData()) + data.size()); } inline const unsigned char* convertByteArrayToUcharPtr(const QByteArray& data) { return reinterpret_cast(data.constData()); } inline unsigned char* convertByteArrayToUcharPtr(QByteArray& data) { return reinterpret_cast(data.data()); } } // namespace pdf #endif // PDFUTILS_H