15317bbafSopenharmony_ciQR Code generator library - C++ 25317bbafSopenharmony_ci=============================== 35317bbafSopenharmony_ci 45317bbafSopenharmony_ci 55317bbafSopenharmony_ciIntroduction 65317bbafSopenharmony_ci------------ 75317bbafSopenharmony_ci 85317bbafSopenharmony_ciThis project aims to be the best, clearest QR Code generator library. The primary goals are flexible options and absolute correctness. Secondary goals are compact implementation size and good documentation comments. 95317bbafSopenharmony_ci 105317bbafSopenharmony_ciHome page with live JavaScript demo, extensive descriptions, and competitor comparisons: https://www.nayuki.io/page/qr-code-generator-library 115317bbafSopenharmony_ci 125317bbafSopenharmony_ci 135317bbafSopenharmony_ciFeatures 145317bbafSopenharmony_ci-------- 155317bbafSopenharmony_ci 165317bbafSopenharmony_ciCore features: 175317bbafSopenharmony_ci 185317bbafSopenharmony_ci* Significantly shorter code but more documentation comments compared to competing libraries 195317bbafSopenharmony_ci* Supports encoding all 40 versions (sizes) and all 4 error correction levels, as per the QR Code Model 2 standard 205317bbafSopenharmony_ci* Output format: Raw modules/pixels of the QR symbol 215317bbafSopenharmony_ci* Detects finder-like penalty patterns more accurately than other implementations 225317bbafSopenharmony_ci* Encodes numeric and special-alphanumeric text in less space than general text 235317bbafSopenharmony_ci* Coded carefully to prevent memory corruption, integer overflow, platform-dependent inconsistencies, and undefined behavior; tested rigorously to confirm safety 245317bbafSopenharmony_ci* Open-source code under the permissive MIT License 255317bbafSopenharmony_ci 265317bbafSopenharmony_ciManual parameters: 275317bbafSopenharmony_ci 285317bbafSopenharmony_ci* User can specify minimum and maximum version numbers allowed, then library will automatically choose smallest version in the range that fits the data 295317bbafSopenharmony_ci* User can specify mask pattern manually, otherwise library will automatically evaluate all 8 masks and select the optimal one 305317bbafSopenharmony_ci* User can specify absolute error correction level, or allow the library to boost it if it doesn't increase the version number 315317bbafSopenharmony_ci* User can create a list of data segments manually and add ECI segments 325317bbafSopenharmony_ci 335317bbafSopenharmony_ciMore information about QR Code technology and this library's design can be found on the project home page. 345317bbafSopenharmony_ci 355317bbafSopenharmony_ci 365317bbafSopenharmony_ciExamples 375317bbafSopenharmony_ci-------- 385317bbafSopenharmony_ci 395317bbafSopenharmony_ci```c++ 405317bbafSopenharmony_ci#include <string> 415317bbafSopenharmony_ci#include <vector> 425317bbafSopenharmony_ci#include "QrCode.hpp" 435317bbafSopenharmony_ciusing namespace qrcodegen; 445317bbafSopenharmony_ci 455317bbafSopenharmony_ci// Simple operation 465317bbafSopenharmony_ciQrCode qr0 = QrCode::encodeText("Hello, world!", QrCode::Ecc::MEDIUM); 475317bbafSopenharmony_cistd::string svg = toSvgString(qr0, 4); // See QrCodeGeneratorDemo 485317bbafSopenharmony_ci 495317bbafSopenharmony_ci// Manual operation 505317bbafSopenharmony_cistd::vector<QrSegment> segs = 515317bbafSopenharmony_ci QrSegment::makeSegments("3141592653589793238462643383"); 525317bbafSopenharmony_ciQrCode qr1 = QrCode::encodeSegments( 535317bbafSopenharmony_ci segs, QrCode::Ecc::HIGH, 5, 5, 2, false); 545317bbafSopenharmony_cifor (int y = 0; y < qr1.getSize(); y++) { 555317bbafSopenharmony_ci for (int x = 0; x < qr1.getSize(); x++) { 565317bbafSopenharmony_ci (... paint qr1.getModule(x, y) ...) 575317bbafSopenharmony_ci } 585317bbafSopenharmony_ci} 595317bbafSopenharmony_ci``` 605317bbafSopenharmony_ci 615317bbafSopenharmony_ciMore complete set of examples: https://github.com/nayuki/QR-Code-generator/blob/master/cpp/QrCodeGeneratorDemo.cpp . 62