C++ 编写二维码（有源码）
首先来展示一下成果：
二维码图片好像违规了，直接给链接吧网址链接
如果你扫了这个二维码就会得到一个网址，该网址是我写代码的参考，该网站讲述了如何编写一个二维码，很详细，我没有实现汉字的编码，实现了三种模式的编码，这个网址给的很详细，我也就不写了，如果再写就跟抄人家的没区别了。
下面给出生成的代码，其中有一些我自己写的工具，我会做出说明，如果不想看人家网站的话，代码中也有注释。
1.Matrix这个模板类是我做的一个二维数组的套壳，里面用的是动态申请空间，析构时自动释放
2.每个静态的值都是按照顺序来的，一般我都给了对应关系和索引如何计算
3.此类计算出来的二维码，在版本特别高时，我用微信没识别出来，没特别仔细的测试，300个2能识别（用直接跳转12306公众号了，不知道为啥），3000个2二维码已经密到有点看不清了（这个用微信扫没反应）
4.图像是使用我写的另外一个类来生成位图的，没用JPEG是因为转换没写
5.宽字节编码没写实现
6.没有解析二维码的实现
7.源代码在此这个啥都有
环境&工具
Windows11 gcc 8.1.0 vscode cmake
QrEncode.h
#pragma once
#include QrEncode.cpp
#include "QrEncode.h"
#include "Image.h"
#include "Matrix.h"
#include "Util.h"
#include
#include
// print(code);
Matrix<int> source = MatrixCode(code);
imgData->setValByArray(source, vector<RGB>{RGB_BLACK}, 0, 0);
return imgData==nullptr?Matrix<RGB>():*imgData;
}
Matrix<RGB> QREncode::encoding(const wstring& encodeWData){
this->encodeWData=encodeWData;
if(!init()) return Matrix<RGB>();
imgData=new Matrix<RGB>(getSideLen(),getSideLen(),RGB_WHITE);
return imgData==nullptr?Matrix<RGB>():*imgData;
}
//默认找最小的版本
bool QREncode::init(){
int NumMode=0,AlpNumMode=0,ByteMode=0;
for_each(encodeData.begin(), encodeData.end(), [&](char ch){
if(ch<='9'&&ch>='0') NumMode++;
else if((ch<='z'&&ch>='a')) ByteMode++;
else if(ch<='Z'&&ch>='A') AlpNumMode++;
});
if(ByteMode!=0) type=DataType::ByteMode;
else if(AlpNumMode!=0) type=DataType::AlpNumMode;
else if(NumMode!=0) type=DataType::NumMode;
else type=DataType::KanjiMode;
int len=encodeData.size();
if (len > 7089 && type == DataType::NumMode ||
len > 4296 && type == DataType::AlpNumMode ||
len > 2953 && type == DataType::ByteMode ||
len > 1817 && type == DataType::KanjiMode)
return false;
for(int i=0;i<VERSION_COUNT;i++){
for(int j=3;j>=0;j--){
if(CharCapTable[i][j][(int)type]>len){
version=i+1;
level=(ErrorCorrectionLevel)j;
if(version>=1&&version<=9)
charCount=CharCountIndicator[0][(int)type];
else if(version>=10&&version<=26)
charCount=CharCountIndicator[1][(int)type];
else if(version>=27&&version<=40)
charCount=CharCountIndicator[2][(int)type];
return true;
}
}
}
return false;
}
string QREncode::NumModeEncoding(){
string res="";
//分为3个一组，最后会出现2个一组或者一个一组的
//都转为10进制，然后3位的转为10位二进制，两位转为7位，一位转为4位
for (int i = 0; i < encodeData.size(); i += 3) {
int t=0, bitCount=4;
if (i < encodeData.size()) t += encodeData[i] - '0';
if (i + 1 < encodeData.size()){
t = t * 10 + encodeData[i + 1] - '0';
bitCount=7;
}
if (i + 2 < encodeData.size()){
t = t * 10 + encodeData[i + 2] - '0';
bitCount=10;
}
if(bitCount==4) res.append(bitset<4>(t).to_string());
else if(bitCount==7) res.append(bitset<7>(t).to_string());
else if(bitCount==10) res.append(bitset<10>(t).to_string());
}
return res;
}
string QREncode::AlpNumModeEncoding(){
string res="";
//两位转11位二进制 一位转6位二进制
for(int i=0;i<encodeData.size();i+=2){
int t=0, bitCount=6;
if(i<encodeData.size())
t = AlpValMappingTable[encodeData[i]];
if(i+1<encodeData.size()){
t = t*45 + AlpValMappingTable[encodeData[i+1]];
bitCount=11;
}
if(bitCount==6) res.append(bitset<6>(t).to_string());
else if(bitCount==11) res.append(bitset<11>(t).to_string());
}
return res;
}
string QREncode::ByteModeEncoding(){
// 1.Convert to ISO 8859-1 or UTF-8
// 2.Split the String into 8-bit Bytes
// 3.Convert Each Byte into Binary
// 4.Next: Finish the Data Encoding Step
string res="";
for(int i=0;i<encodeData.size();i++){
res.append(bitset<8>(encodeData[i]).to_string());
}
return res;
}
string QREncode::KanjiModeEncoding(){
// 1.Only for Double-Byte Shift JIS Characters
// 2.Convert to Bytes
// 3.Encode the Bytes with Kanji Mode
// For characters whose bytes are in the range 0x8140 to 0x9FFC
// for example: 0x89D7
// 1. 0x89D7 - 0x8140 = 0x0897
// 2. (0x08 * 0xC0) + 0x97 = (0x600) + 0x97 = 0x697
// 3. 0x697 -> binary(13bit)
// For characters whose bytes are in the range 0xE040 to 0xEBBF
// for example: 0xE4AA
// 1. 0xE4AA - 0xC140 = 0x236A
// 2. (0x23 * 0xC0) + 0x6A = (0x1A40) + 0x6A = 0x1AAA
// 3. 0x1AAA -> binary(13bit)
// 4.Put the 13-bit Binary Numbers Together
// 5.Next: Finish the Data Encoding Step
string res="";
for(int i=0;i<encodeWData.size();i++){
}
return res;
}
void QREncode::fillEncodeData(string& code){
// 1. Determine the Required Number of Bits for this QR Code
// 2. Add a Terminator of 0s if Necessary
// 3. Add More 0s to Make the Length a Multiple of 8
// 4. Add Pad Bytes if the String is Still too Short
// 11101100 00010001//两字节循环填入
// code string bit length
int maxLen=ErrorCurrentTable[(version-1)*4+(int)level][0]*8;
int diff=maxLen-code.size();
if(diff<0) return;
// Add a Terminator
if(diff>4) code.append("0000");
else if(diff<=4) code.append(string(diff,'0'));
// Add More 0s to Make the Length a Multiple of 8
int eightDiff = 8-code.size()%8;
code.append(string(eightDiff,'0'));
// Add Pad Bytes
if(maxLen-code.size()<8) return;
int n=(maxLen-code.size())/8;
for(int i=0;i<n;i++){
if(i%2==0) code.append("11101100");
else code.append("00010001");
}
}
void QREncode::errorCurrentEncoding(string& code){
// Step 1: Break Data Codewords into Blocks if Necessary
// Step 2: Understand Polynomial Long Division
// Step 3: Understand The Galois Field
// Step 4: Understand Galois Field Arithmetic
// Step 5: Generate Powers of 2 using Byte-Wise Modulo 100011101
// Step 6: Understand Multiplication with Logs and Antilogs
// Step 7: Understanding The Generator Polynomial
// Step 8: Generating Error Correction Codewords
// Step 9: Divide the Message Polynomial by the Generator Polynomial
int row=(version-1)*4+(int)level,codePos=0;
int groupCount = ErrorCurrentTable[row][4]==0?1:2;
int*** group=new int**[groupCount];
vector<vector<int>> currentWords;
int maxCodeWordsLen=0,maxCurrentCodeWordsLen=0;
for(int i=0;i<groupCount;i++){
int blockCol=2,codeWordsCol=3;
if(i==1){
blockCol=4;
codeWordsCol=5;
}
group[i]=new int*[ErrorCurrentTable[row][blockCol]];
for(int blockOfGroup=0;blockOfGroup<ErrorCurrentTable[row][blockCol];blockOfGroup++){
group[i][blockOfGroup]=new int[ErrorCurrentTable[row][codeWordsCol]];
maxCodeWordsLen=max(maxCodeWordsLen,ErrorCurrentTable[row][codeWordsCol]);
for(int blocks=0;blocks<ErrorCurrentTable[row][codeWordsCol]&&codePos<=code.size();blocks++){
int t=0;
for(int k=0;k<8;k++){
t<<=1;
t+=code[codePos+k]-'0';
}
group[i][blockOfGroup][blocks]=t;
codePos+=8;
// cout<
}
// cout<
vector<int> CurrentCodeWords = getErrorCurrentWords(group[i][blockOfGroup], ErrorCurrentTable[row][codeWordsCol],row);
currentWords.push_back(CurrentCodeWords);
maxCurrentCodeWordsLen=max(maxCurrentCodeWordsLen,(int)CurrentCodeWords.size());
}
}
// cout<
// for(auto items : currentWords){
// for(int item : items){
// cout<
// }
// cout<
// }
// cout<
//Structure Final Message
code = "";
//Interleave the Blocks
for(int i=0;i<maxCodeWordsLen;i++){
for(int j=0;j<groupCount;j++){
int blockCol=2,codeWordsCol=3;
if(j==1){
blockCol=4;
codeWordsCol=5;
}
for(int k=0;k<ErrorCurrentTable[row][blockCol];k++){
int dataLen=ErrorCurrentTable[row][codeWordsCol];
if(i>=dataLen) continue;
code.append(bitset<8>(group[j][k][i]).to_string());
// cout<
}
}
}
// cout<
//Interleave the Error Correction Codewords
for(int i=0;i<maxCurrentCodeWordsLen;i++){
for(int j=0;j<currentWords.size();j++){
if(i>=currentWords[j].size()) continue;
// cout<<"("<
code.append(bitset<8>(currentWords[j][i]).to_string());
// cout<
}
}
// cout<
//Add Remainder Bits
code.append(string(RemainderBits[version-1],'0'));
}
vector<vector<int>> FinderPatterns={
{1,1,1,1,1,1,1},
{1,2,2,2,2,2,1},
{1,2,1,1,1,2,1},
{1,2,1,1,1,2,1},
{1,2,1,1,1,2,1},
{1,2,2,2,2,2,1},
{1,1,1,1,1,1,1}
};
vector<vector<int>> AlignmentPatterns={
{1,1,1,1,1},
{1,2,2,2,1},
{1,2,1,2,1},
{1,2,2,2,1},
{1,1,1,1,1}
};
Matrix<int> QREncode::MatrixCode(const string& code){
Matrix<int> res(getSideLen(),getSideLen(),-1);
Matrix<int> finder(7,7,FinderPatterns),
alignment(5,5,AlignmentPatterns);
vector<int> val{1,0};//默认是白色，1为黑色
int ReserveArea=1;
// Step 1: Add the Finder Patterns
res.setValByArray(finder, val, 0, 0);
res.setValByArray(finder, val, 0, getSideLen()-7);
res.setValByArray(finder, val, getSideLen()-7, 0);
// Step 2: Add the Separators
for(int i=0;i<8;i++){
//左上
res.setValue(7, i, 0);
res.setValue(i, 7, 0);
//左下
res.setValue(getSideLen()-1-i, 7, 0);
res.setValue(getSideLen()-8, i, 0);
//右上
res.setValue(7, getSideLen()-1-i, 0);
res.setValue(i, getSideLen()-8, 0);
}
// Step 3: Add the Alignment Patterns
for(int i=0;i<7&&version!=1;i++){
for(int j=0;j<7;j++){
if(AlignmentPatternLocal[version][i]==0||
AlignmentPatternLocal[version][j]==0) continue;
int row=AlignmentPatternLocal[version][i],
col=AlignmentPatternLocal[version][j];
//判断是否与finder重合
if((row-2<8&&col-2<8)||
(row-2<8&&col+2>getSideLen()-9)||
(row+2>getSideLen()-9&&col-2<8)) continue;
res.setValByArray(alignment, val, row-2, col-2);
// cout<
}
}
// Step 4: Add the Timing Patterns
for(int i=8;i<getSideLen()-8;i+=2){
if(res.getValue(i, 6)==-1) res.setValue(i, 6, 1);
if(res.getValue(6, i)==-1) res.setValue(6, i, 1);
if(res.getValue(i+1, 6)==-1) res.setValue(i+1, 6, 0);
if(res.getValue(6, i+1)==-1) res.setValue(6, i+1, 0);
}
// Step 5: Add the Dark Module and Reserved Areas
// Dark Module
res.setValue(4*version+9, 8, 1);
// Reserve the Format Information Area set value 2
for(int i=0;i<9;i++){
//左上
if(res.getValue(8, i)==-1) res.setValue(8, i, 2);
if(res.getValue(i, 8)==-1) res.setValue(i, 8, 2);
//左下
if(res.getValue(getSideLen()-1-i, 8)==-1&&i<7) res.setValue(getSideLen()-1-i, 8, 2);
//右上
if(res.getValue(8, getSideLen()-1-i)==-1&&i<8) res.setValue(8, getSideLen()-1-i, 2);
}
// QR codes versions 7 and larger must contain two areas where version information bits are placed. Each of area 6×3. set value 3
for(int i=0;i<3&&version>=7;i++){
for(int j=0;j<6;j++){
res.setValue(getSideLen()-9-i, j, 3);
res.setValue(j, getSideLen()-9-i, 3);
}
}
// Step 6: Place the Data Bits
int r=getSideLen()-1,c=getSideLen()-1,codePos=0;
bool upWard=true,right=true;
while(r>=0&&r<getSideLen()&&c>=0&&c<getSideLen()&&codePos<code.size()){
// cout<<"("<
if(res.getValue(r, c)==-1){
res.setValue(r, c, code[codePos++]-'0'+5);//此处赋值将数据值赋值为5和6，目的是使后面mask方便
// else
// res.setValue(r, c, 5);
}
if(upWard){
if(right) {right=!right; c-=1;}
else {
right=!right;
if (r-1<0) {c-=1;r=0;right=true; upWard=!upWard;}
else{ c+=1; r-=1;}
}
}
else{
if(c==6) {c=5; right=true;}
if(right) {right=!right; c-=1;}
else {
right=!right;
if(r+1>=getSideLen()){c-=1;r=getSideLen()-1;right=true; upWard=!upWard;}
else {c+=1; r+=1; }
}
}
}
int a=code.size();
// mask evaluate
auto dataMatrix=getMaskList(res);
int minScore=INT_MAX, minScorePos=0;
for(int i=0;i<dataMatrix.size();i++){
//设置保留位
FormatAndVersionInfo(dataMatrix[i],i);
#ifdef DEBUG
Matrix<RGB> rgb(getSideLen()+8,getSideLen()+8,BACKGROUND_COLOR);
rgb.setValByArray(dataMatrix[i], vector<RGB>{RGB_BLACK}, 4, 4);
BMPData bmp(AmplifyMatrix<RGB>(rgb,AMPLIFY_LEVEL),rgb.col*AMPLIFY_LEVEL,rgb.row*AMPLIFY_LEVEL,true);
bmp.GrayEncoder();
bmp.saveBMP("qr"+string(1,'1'+i)+".bmp");
#endif
// cout<
int t=Evaluate(dataMatrix[i]);
if(t<minScore){
minScore=t;
minScorePos=i;
}
// cout<
}
// cout<
res=dataMatrix[minScorePos];
return res;
}
void QREncode::FormatAndVersionInfo(Matrix<int>& matrix, int maskIndex){
// Format String
// int *CurrentCode=getErrorCurrentVersion(level, maskIndex);
string CurrentCode=FormatInfoList[((int)level)*8+maskIndex];
for(int i=0;i<7;i++){
int t=0;
if(i>=6) t=1;
matrix.setValue(8, i+t, CurrentCode[i]-'0');
// left down
matrix.setValue(getSideLen()-1-i, 8, CurrentCode[i]-'0');
}
for(int i=0;i<8;i++){
// right up
matrix.setValue(8, getSideLen()-1-i, CurrentCode[14-i]-'0');
int t=0;
if(i>=6) t=1;
matrix.setValue(i+t, 8, CurrentCode[14-i]-'0');
}
// Version Information
if(version>=7){
string CurrentInfo=VersionInfoList[version-7];
int pos=0;
for(int i=0;i<3;i++){
for(int j=0;j<6;j++){
matrix.setValue(getSideLen()-11+i, j, CurrentInfo[pos]-'0');
matrix.setValue(j, getSideLen()-11+i, CurrentInfo[pos++]-'0');
}
}
}
}
NAME_SPACE_END()
QrCode_test.cpp
#include "Image.h"
#include "QrEncode.h"
#include
#include rgb=qr.encoding("01234567890123456789012345678901234567890");
// Matrix rgb=qr.encoding("AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA");
BMPData bmp(AmplifyMatrix<RGB>(rgb,AMPLIFY_LEVEL),rgb.col*AMPLIFY_LEVEL,rgb.row*AMPLIFY_LEVEL,true);
bmp.GrayEncoder();
bmp.saveBMP(string(argv[2])+".bmp");
return 0;
}