/// /// @file /// @author Julius Pettersson /// @copyright MIT/Expat License. /// @brief LZW file compressor /// @version 6 /// @remarks This version borrows heavily from Juha Nieminen's work. /// /// This is the C++11 implementation of a Lempel-Ziv-Welch single-file command-line compressor. /// It was written with Doxygen comments. /// /// @see http://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%80%93Welch /// @see http://marknelson.us/2011/11/08/lzw-revisited/ /// @see http://www.cs.duke.edu/csed/curious/compression/lzw.html /// @see http://warp.povusers.org/EfficientLZW/index.html /// @see http://en.cppreference.com/ /// @see http://www.doxygen.org/ /// /// @remarks DF: the data file /// @remarks EF: the encoded file /// #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include /// Type used to store and retrieve codes. using CodeType = std::uint32_t; namespace globals { /// Dictionary Maximum Size (when reached, the dictionary will be reset) const CodeType dms {16 * 1024 * 1024}; } // namespace globals /// /// @brief Special codes used by the encoder to control the decoder. /// @todo Metacodes should not be hardcoded to match their index. /// enum class MetaCode: CodeType { Eof = 1u << CHAR_BIT ///< End-of-file metacode. }; /// /// @brief Encoder's custom dictionary type. /// class EncoderDictionary { /// /// @brief Binary search tree node. /// struct Node { /// /// @brief Default constructor. /// @param c byte that the Node will contain /// explicit Node(char c): first(globals::dms), c(c), left(globals::dms), right(globals::dms) { } CodeType first; ///< Code of first child string. char c; ///< Byte. CodeType left; ///< Code of child node with byte < `c`. CodeType right; ///< Code of child node with byte > `c`. }; public: /// /// @brief Default constructor. /// @details It builds the `initials` cheat sheet. /// EncoderDictionary() { const long int minc = std::numeric_limits::min(); const long int maxc = std::numeric_limits::max(); CodeType k {0}; for (long int c = minc; c <= maxc; ++c) initials[static_cast (c)] = k++; vn.reserve(globals::dms); reset(); } /// /// @brief Resets dictionary to its initial contents. /// @note Adds dummy nodes to account for the metacodes. /// void reset() { vn.clear(); const long int minc = std::numeric_limits::min(); const long int maxc = std::numeric_limits::max(); for (long int c = minc; c <= maxc; ++c) vn.push_back(Node(c)); // add dummy nodes for the metacodes vn.push_back(Node('\x00')); // MetaCode::Eof } /// /// @brief Searches for a pair (`i`, `c`) and inserts the pair if it wasn't found. /// @param i code to search for /// @param c attached byte to search for /// @return The index of the pair, if it was found. /// @retval globals::dms if the pair wasn't found /// CodeType search_and_insert(CodeType i, char c) { if (i == globals::dms) return search_initials(c); const CodeType vn_size = vn.size(); CodeType ci {vn[i].first}; // Current Index if (ci != globals::dms) { while (true) if (c < vn[ci].c) { if (vn[ci].left == globals::dms) { vn[ci].left = vn_size; break; } else ci = vn[ci].left; } else if (c > vn[ci].c) { if (vn[ci].right == globals::dms) { vn[ci].right = vn_size; break; } else ci = vn[ci].right; } else // c == vn[ci].c return ci; } else vn[i].first = vn_size; vn.push_back(Node(c)); return globals::dms; } /// /// @brief Fakes a search for byte `c` in the one-byte area of the dictionary. /// @param c byte to search for /// @return The code associated to the searched byte. /// CodeType search_initials(char c) const { return initials[static_cast (c)]; } /// /// @brief Returns the number of dictionary entries. /// std::vector::size_type size() const { return vn.size(); } private: /// Vector of nodes on top of which the binary search tree is implemented. std::vector vn; /// Cheat sheet for mapping one-byte strings to their codes. std::array initials; }; /// /// @brief Variable binary width code writer. /// class CodeWriter { public: /// /// @brief Default constructor. /// @param [out] os Output Stream to write codes to /// explicit CodeWriter(std::ostream &os): os(os), bits(CHAR_BIT + 1) { } /// /// @brief Destructor. /// @note Writes `MetaCode::Eof` and flushes the final byte to the stream by padding it with zeros. /// ~CodeWriter() { write(static_cast (MetaCode::Eof)); if (lo.second != 0) { bits = CHAR_BIT; write(0); } } /// /// @brief Getter for `CodeWriter::bits`. /// std::size_t get_bits() const { return bits; } /// /// @brief Resets internal binary width. /// @note Default value is `CHAR_BIT + 1`. /// void reset_bits() { bits = CHAR_BIT + 1; } /// /// @brief Increases internal binary width by one. /// @throws std::overflow_error internal binary width cannot be increased /// @remarks The exception should never be thrown, under normal circumstances. /// void increase_bits() { if (bits == SIZE_MAX) throw std::overflow_error("CodeWriter::increase_bits()"); ++bits; } /// /// @brief Writes the code `k` with a binary width of `CodeWriter::bits`. /// @param k code to be written /// @return Whether or not the stream can be used for output. /// @retval true the output stream can still be used /// @retval false the output stream can no longer be used /// bool write(CodeType k) { std::size_t local_bits {bits}; while (local_bits != 0) { lo.first |= k << lo.second; k >>= CHAR_BIT - lo.second; if (lo.second + local_bits >= CHAR_BIT) { local_bits -= CHAR_BIT - lo.second; os.put(static_cast (lo.first)); lo = {'\x00', 0}; } else { lo.second += local_bits; local_bits = 0; } } return os; } private: std::ostream &os; ///< Output Stream. std::size_t bits; ///< Binary width of codes. std::pair lo; ///< LeftOvers. }; /// /// @brief Variable binary width code reader. /// class CodeReader { public: /// /// @brief Default constructor. /// @param [in] is Input Stream to read codes from /// explicit CodeReader(std::istream &is): is(is), bits(CHAR_BIT + 1), feofmc(false) { } /// /// @brief Getter for `CodeReader::bits`. /// std::size_t get_bits() const { return bits; } /// /// @brief Resets internal binary width. /// @note Default value is `CHAR_BIT + 1`. /// void reset_bits() { bits = CHAR_BIT + 1; } /// /// @brief Increases internal binary width by one. /// @throws std::overflow_error if internal binary width cannot be increased /// @remarks The exception should never be thrown, under normal circumstances. /// void increase_bits() { if (bits == SIZE_MAX) throw std::overflow_error("CodeReader::increase_bits()"); ++bits; } /// /// @brief Reads the code `k` with a binary width of `CodeReader::bits`. /// @param [out] k code to be read /// @return Whether or not the stream can be used for input. /// @retval true the input stream can still be used /// @retval false the input stream can no longer be used /// bool read(CodeType &k) { k=0; std::size_t local_bits {bits}; std::size_t k_count {0}; // to prevent computing the required mask const std::array masks {{0x00, 0x01, 0x03, 0x07, 0x0F, 0x1F, 0x3F, 0x7F, 0xFF}}; while (local_bits != 0) { const std::size_t n = std::min(lo.second, local_bits); k |= static_cast (lo.first & masks[n]) << k_count; k_count += n; local_bits -= n; lo.second -= n; lo.first >>= n; if (is.get(reinterpret_cast (lo.first))) break; lo.second = CHAR_BIT; } if (k == static_cast (MetaCode::Eof)) { feofmc = true; return false; } return is; } /// /// @brief Returns if EF is considered corrupted. /// @retval true didn't find end-of-file metacode /// @retval false found end-of-file metacode /// bool corrupted() const { return !feofmc; } private: std::istream &is; ///< Input Stream. std::size_t bits; ///< Binary width of codes. bool feofmc; ///< Found End-Of-File MetaCode. std::pair lo; ///< LeftOvers. }; /// /// @brief Computes the minimum number of bits required to store the value of `n`. /// @param n number to be evaluated /// @return Number of required bits. /// std::size_t required_bits(unsigned long int n) { std::size_t r {1}; while ((n >>= 1) != 0) ++r; return r; } /// /// @brief Compresses the contents of `is` and writes the result to `os`. /// @param [in] is input stream /// @param [out] os output stream /// void compress(std::istream &is, std::ostream &os) { EncoderDictionary ed; CodeWriter cw(os); CodeType i {globals::dms}; // Index char c; while (is.get(c)) { // dictionary's maximum size was reached if (ed.size() == globals::dms) { ed.reset(); cw.reset_bits(); } const CodeType temp {i}; if ((i = ed.search_and_insert(temp, c)) == globals::dms) { cw.write(temp); i = ed.search_initials(c); // theoretically, this should be a while() loop if (required_bits(ed.size()) > cw.get_bits()) cw.increase_bits(); } } if (i != globals::dms) cw.write(i); } /// /// @brief Decompresses the contents of `is` and writes the result to `os`. /// @param [in] is input stream /// @param [out] os output stream /// void decompress(std::istream &is, std::ostream &os) { std::vector> dictionary; // "named" lambda function, used to reset the dictionary to its initial contents const auto reset_dictionary = [&dictionary] { dictionary.clear(); dictionary.reserve(globals::dms); const long int minc = std::numeric_limits::min(); const long int maxc = std::numeric_limits::max(); for (long int c = minc; c <= maxc; ++c) dictionary.push_back({globals::dms, static_cast (c)}); // add dummy elements for the metacodes dictionary.push_back({0, '\x00'}); // MetaCode::Eof }; const auto rebuild_string = [&dictionary](CodeType k) -> const std::vector * { static std::vector s; // String s.clear(); // the length of a string cannot exceed the dictionary's number of entries s.reserve(globals::dms); while (k != globals::dms) { s.push_back(dictionary[k].second); k = dictionary[k].first; } std::reverse(s.begin(), s.end()); return &s; }; reset_dictionary(); CodeReader cr(is); CodeType i {globals::dms}; // Index CodeType k; // Key while (cr.read(k)) { // dictionary's maximum size was reached if (dictionary.size() == globals::dms) { reset_dictionary(); cr.reset_bits(); } // theoretically, this should be a while() loop if (required_bits(dictionary.size()) > cr.get_bits()) cr.increase_bits(); if (k > dictionary.size()) { std::clog << k << '\n'; throw std::runtime_error("invalid compressed code"); } const std::vector *s; // String if (k == dictionary.size()) { dictionary.push_back({i, rebuild_string(i)->front()}); s = rebuild_string(k); } else { s = rebuild_string(k); if (i != globals::dms) dictionary.push_back({i, s->front()}); } os.write(&s->front(), s->size()); i = k; } if (cr.corrupted()) throw std::runtime_error("corrupted compressed file"); } /// /// @brief Prints usage information and a custom error message. /// @param s custom error message to be printed /// @param su Show Usage information /// void print_usage(const std::string &s = "", bool su = true) { if (!s.empty()) std::cerr << "\nERROR: " << s << '\n'; if (su) { std::cerr << "\nUsage:\n"; std::cerr << "\tprogram -flag input_file output_file\n\n"; std::cerr << "Where `flag' is either `c' for compressing, or `d' for decompressing, and\n"; std::cerr << "`input_file' and `output_file' are distinct files.\n\n"; std::cerr << "Examples:\n"; std::cerr << "\tlzw_v6.exe -c license.txt license.lzw\n"; std::cerr << "\tlzw_v6.exe -d license.lzw new_license.txt\n"; } std::cerr << std::endl; } /// /// @brief Actual program entry point. /// @param argc number of command line arguments /// @param [in] argv array of command line arguments /// @retval EXIT_FAILURE for failed operation /// @retval EXIT_SUCCESS for successful operation /// int main(int argc, char *argv[]) { if (argc != 4) { print_usage("Wrong number of arguments."); return EXIT_FAILURE; } enum class Mode { Compress, Decompress }; Mode m; if (std::string(argv[1]) == "-c") m = Mode::Compress; else if (std::string(argv[1]) == "-d") m = Mode::Decompress; else { print_usage(std::string("flag `") + argv[1] + "' is not recognized."); return EXIT_FAILURE; } const std::size_t buffer_size {1024 * 1024}; // these custom buffers should be larger than the default ones const std::unique_ptr input_buffer(new char[buffer_size]); const std::unique_ptr output_buffer(new char[buffer_size]); std::ifstream input_file; std::ofstream output_file; input_file.rdbuf()->pubsetbuf(input_buffer.get(), buffer_size); input_file.open(argv[2], std::ios_base::binary); if (!input_file.is_open()) { print_usage(std::string("input_file `") + argv[2] + "' could not be opened."); return EXIT_FAILURE; } output_file.rdbuf()->pubsetbuf(output_buffer.get(), buffer_size); output_file.open(argv[3], std::ios_base::binary); if (!output_file.is_open()) { print_usage(std::string("output_file `") + argv[3] + "' could not be opened."); return EXIT_FAILURE; } try { input_file.exceptions(std::ios_base::badbit); output_file.exceptions(std::ios_base::badbit | std::ios_base::failbit); if (m == Mode::Compress) compress(input_file, output_file); else if (m == Mode::Decompress) decompress(input_file, output_file); } catch (const std::ios_base::failure &f) { print_usage(std::string("File input/output failure: ") + f.what() + '.', false); return EXIT_FAILURE; } catch (const std::exception &e) { print_usage(std::string("Caught exception: ") + e.what() + '.', false); return EXIT_FAILURE; } return EXIT_SUCCESS; }