/// <summary>Embed type information into the matrix</summary> /// <param name="ecLevel">The error correction level (L,M,Q,H)</param> /// <param name="maskPattern">the masking pattern</param> /// <param name="matrix">Bytematrix in which the output will be stored</param> public static void EmbedTypeInfo(ErrorCorrectionLevel ecLevel, int maskPattern, ByteMatrix matrix) { BitVector typeInfoBits = new BitVector(); MakeTypeInfoBits(ecLevel, maskPattern, typeInfoBits); for (int i = 0; i < typeInfoBits.Size(); ++i) { // Place bits in LSB to MSB order. LSB (least significant bit) is the last value in // "typeInfoBits". int bit = typeInfoBits.At(typeInfoBits.Size() - 1 - i); // Type info bits at the left top corner. See 8.9 of JISX0510:2004 (p.46). int x1 = TYPE_INFO_COORDINATES[i][0]; int y1 = TYPE_INFO_COORDINATES[i][1]; matrix.Set(x1, y1, bit); if (i < 8) { // Right top corner. int x2 = matrix.GetWidth() - i - 1; int y2 = 8; matrix.Set(x2, y2, bit); } else { // Left bottom corner. int x2 = 8; int y2 = matrix.GetHeight() - 7 + (i - 8); matrix.Set(x2, y2, bit); } } }
// // /// <summary>Embed version information if need be.</summary> /// <remarks> /// Embed version information if need be. /// For version < 7, version info is not necessary /// On success, the matrix is modified /// See 8.10 of JISX0510:2004 (p.47) for how to embed version information. /// </remarks> /// <param name="version">QR code version</param> /// <param name="matrix">Byte matrix representing the QR code</param> public static void MaybeEmbedVersionInfo(int version, ByteMatrix matrix) { // Version info is necessary if version >= 7. if (version < 7) { // Don't need version info. return; } BitVector versionInfoBits = new BitVector(); MakeVersionInfoBits(version, versionInfoBits); // It will decrease from 17 to 0. int bitIndex = 6 * 3 - 1; for (int i = 0; i < 6; ++i) { for (int j = 0; j < 3; ++j) { // Place bits in LSB (least significant bit) to MSB order. int bit = versionInfoBits.At(bitIndex); bitIndex--; // Left bottom corner. matrix.Set(i, matrix.GetHeight() - 11 + j, bit); // Right bottom corner. matrix.Set(matrix.GetHeight() - 11 + j, i, bit); } } }
// Embed "dataBits" using "getMaskPattern". On success, modify the matrix and return true. // For debugging purposes, it skips masking process if "getMaskPattern" is -1. // See 8.7 of JISX0510:2004 (p.38) for how to embed data bits. public static void EmbedDataBits(BitVector dataBits, int maskPattern, ByteMatrix matrix) { var bitIndex = 0; var direction = -1; // Start from the right bottom cell. var x = matrix.GetWidth() - 1; var y = matrix.GetHeight() - 1; while (x > 0) { // Skip the vertical timing pattern. if (x == 6) { x -= 1; } while (y >= 0 && y < matrix.GetHeight()) { for (var i = 0; i < 2; ++i) { var xx = x - i; // Skip the cell if it's not empty. if (!IsEmpty(matrix.Get(xx, y))) { continue; } int bit; if (bitIndex < dataBits.Size()) { bit = dataBits.At(bitIndex); ++bitIndex; } else { // Padding bit. If there is no bit left, we'll fill the left cells with 0, as described // in 8.4.9 of JISX0510:2004 (p. 24). bit = 0; } // Skip masking if mask_pattern is -1. if (maskPattern != -1) { if (MaskUtil.GetDataMaskBit(maskPattern, xx, y)) { bit ^= 0x1; } } matrix.Set(xx, y, bit); } y += direction; } direction = -direction; // Reverse the direction. y += direction; x -= 2; // Move to the left. } // All bits should be consumed. if (bitIndex != dataBits.Size()) { throw new WriterException("Not all bits consumed: " + bitIndex + '/' + dataBits.Size()); } }