// 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) { int bitIndex = 0; int direction = -1; // Start from the right bottom cell. int x = matrix.GetWidth() - 1; int y = matrix.GetHeight() - 1; while (x > 0) { // Skip the vertical timing pattern. if (x == 6) { x -= 1; } while (y >= 0 && y < matrix.GetHeight()) { for (int i = 0; i < 2; ++i) { int 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()); } }
// The mask penalty calculation is complicated. See Table 21 of JISX0510:2004 (p.45) for details. // Basically it applies four rules and summate all penalties. private static int CalculateMaskPenalty(ByteMatrix matrix) { var penalty = 0; penalty += MaskUtil.ApplyMaskPenaltyRule1(matrix); penalty += MaskUtil.ApplyMaskPenaltyRule2(matrix); penalty += MaskUtil.ApplyMaskPenaltyRule3(matrix); penalty += MaskUtil.ApplyMaskPenaltyRule4(matrix); return(penalty); }