public static void Encode(String content, ErrorCorrectionLevel ecLevel, IDictionary<EncodeHintType, Object> hints,
QRCode qrCode) {
String encoding = null;
if (hints != null && hints.ContainsKey(EncodeHintType.CHARACTER_SET))
encoding = (string)hints[EncodeHintType.CHARACTER_SET];
if (encoding == null) {
encoding = DEFAULT_BYTE_MODE_ENCODING;
}
// Step 1: Choose the mode (encoding).
Mode mode = ChooseMode(content, encoding);
// Step 2: Append "bytes" into "dataBits" in appropriate encoding.
BitVector dataBits = new BitVector();
AppendBytes(content, mode, dataBits, encoding);
// Step 3: Initialize QR code that can contain "dataBits".
int numInputBytes = dataBits.SizeInBytes();
InitQRCode(numInputBytes, ecLevel, mode, qrCode);
// Step 4: Build another bit vector that contains header and data.
BitVector headerAndDataBits = new BitVector();
// Step 4.5: Append ECI message if applicable
if (mode == Mode.BYTE && !DEFAULT_BYTE_MODE_ENCODING.Equals(encoding)) {
CharacterSetECI eci = CharacterSetECI.GetCharacterSetECIByName(encoding);
if (eci != null) {
AppendECI(eci, headerAndDataBits);
}
}
AppendModeInfo(mode, headerAndDataBits);
int numLetters = mode.Equals(Mode.BYTE) ? dataBits.SizeInBytes() : content.Length;
AppendLengthInfo(numLetters, qrCode.GetVersion(), mode, headerAndDataBits);
headerAndDataBits.AppendBitVector(dataBits);
// Step 5: Terminate the bits properly.
TerminateBits(qrCode.GetNumDataBytes(), headerAndDataBits);
// Step 6: Interleave data bits with error correction code.
BitVector finalBits = new BitVector();
InterleaveWithECBytes(headerAndDataBits, qrCode.GetNumTotalBytes(), qrCode.GetNumDataBytes(),
qrCode.GetNumRSBlocks(), finalBits);
// Step 7: Choose the mask pattern and set to "qrCode".
ByteMatrix matrix = new ByteMatrix(qrCode.GetMatrixWidth(), qrCode.GetMatrixWidth());
qrCode.SetMaskPattern(ChooseMaskPattern(finalBits, qrCode.GetECLevel(), qrCode.GetVersion(),
matrix));
// Step 8. Build the matrix and set it to "qrCode".
MatrixUtil.BuildMatrix(finalBits, qrCode.GetECLevel(), qrCode.GetVersion(),
qrCode.GetMaskPattern(), matrix);
qrCode.SetMatrix(matrix);
// Step 9. Make sure we have a valid QR Code.
if (!qrCode.IsValid()) {
throw new WriterException("Invalid QR code: " + qrCode.ToString());
}
}
/**
* Terminate bits as described in 8.4.8 and 8.4.9 of JISX0510:2004 (p.24).
*/
static void TerminateBits(int numDataBytes, BitVector bits) {
int capacity = numDataBytes << 3;
if (bits.Size() > capacity) {
throw new WriterException("data bits cannot fit in the QR Code" + bits.Size() + " > " +
capacity);
}
// Append termination bits. See 8.4.8 of JISX0510:2004 (p.24) for details.
// TODO: srowen says we can remove this for loop, since the 4 terminator bits are optional if
// the last byte has less than 4 bits left. So it amounts to padding the last byte with zeroes
// either way.
for (int i = 0; i < 4 && bits.Size() < capacity; ++i) {
bits.AppendBit(0);
}
int numBitsInLastByte = bits.Size() % 8;
// If the last byte isn't 8-bit aligned, we'll add padding bits.
if (numBitsInLastByte > 0) {
int numPaddingBits = 8 - numBitsInLastByte;
for (int i = 0; i < numPaddingBits; ++i) {
bits.AppendBit(0);
}
}
// Should be 8-bit aligned here.
if (bits.Size() % 8 != 0) {
throw new WriterException("Number of bits is not a multiple of 8");
}
// If we have more space, we'll fill the space with padding patterns defined in 8.4.9 (p.24).
int numPaddingBytes = numDataBytes - bits.SizeInBytes();
for (int i = 0; i < numPaddingBytes; ++i) {
if (i % 2 == 0) {
bits.AppendBits(0xec, 8);
}
else {
bits.AppendBits(0x11, 8);
}
}
if (bits.Size() != capacity) {
throw new WriterException("Bits size does not equal capacity");
}
}
private static int ChooseMaskPattern(BitVector bits, ErrorCorrectionLevel ecLevel, int version,
ByteMatrix matrix) {
int minPenalty = int.MaxValue; // Lower penalty is better.
int bestMaskPattern = -1;
// We try all mask patterns to choose the best one.
for (int maskPattern = 0; maskPattern < QRCode.NUM_MASK_PATTERNS; maskPattern++) {
MatrixUtil.BuildMatrix(bits, ecLevel, version, maskPattern, matrix);
int penalty = CalculateMaskPenalty(matrix);
if (penalty < minPenalty) {
minPenalty = penalty;
bestMaskPattern = maskPattern;
}
}
return bestMaskPattern;
}
// Build 2D matrix of QR Code from "dataBits" with "ecLevel", "version" and "getMaskPattern". On
// success, store the result in "matrix" and return true.
public static void BuildMatrix(BitVector dataBits, ErrorCorrectionLevel ecLevel, int version,
int maskPattern, ByteMatrix matrix)
{
ClearMatrix(matrix);
EmbedBasicPatterns(version, matrix);
// Type information appear with any version.
EmbedTypeInfo(ecLevel, maskPattern, matrix);
// Version info appear if version >= 7.
MaybeEmbedVersionInfo(version, matrix);
// Data should be embedded at end.
EmbedDataBits(dataBits, maskPattern, matrix);
}
private static void AppendECI(CharacterSetECI eci, BitVector bits) {
bits.AppendBits(Mode.ECI.GetBits(), 4);
// This is correct for values up to 127, which is all we need now.
bits.AppendBits(eci.GetValue(), 8);
}
static void Append8BitBytes(String content, BitVector bits, String encoding) {
byte[] bytes;
try {
bytes = Encoding.GetEncoding(encoding).GetBytes(content);
}
catch (Exception uee) {
throw new WriterException(uee.Message);
}
for (int i = 0; i < bytes.Length; ++i) {
bits.AppendBits(bytes[i], 8);
}
}
static void AppendNumericBytes(String content, BitVector bits) {
int length = content.Length;
int i = 0;
while (i < length) {
int num1 = content[i] - '0';
if (i + 2 < length) {
// Encode three numeric letters in ten bits.
int num2 = content[i + 1] - '0';
int num3 = content[i + 2] - '0';
bits.AppendBits(num1 * 100 + num2 * 10 + num3, 10);
i += 3;
}
else if (i + 1 < length) {
// Encode two numeric letters in seven bits.
int num2 = content[i + 1] - '0';
bits.AppendBits(num1 * 10 + num2, 7);
i += 2;
}
else {
// Encode one numeric letter in four bits.
bits.AppendBits(num1, 4);
i++;
}
}
}
/**
* Append length info. On success, store the result in "bits".
*/
static void AppendLengthInfo(int numLetters, int version, Mode mode, BitVector bits) {
int numBits = mode.GetCharacterCountBits(Version.GetVersionForNumber(version));
if (numLetters > ((1 << numBits) - 1)) {
throw new WriterException(numLetters + "is bigger than" + ((1 << numBits) - 1));
}
bits.AppendBits(numLetters, numBits);
}
/**
* Interleave "bits" with corresponding error correction bytes. On success, store the result in
* "result". The interleave rule is complicated. See 8.6 of JISX0510:2004 (p.37) for details.
*/
static void InterleaveWithECBytes(BitVector bits, int numTotalBytes,
int numDataBytes, int numRSBlocks, BitVector result)
{
// "bits" must have "getNumDataBytes" bytes of data.
if (bits.SizeInBytes() != numDataBytes)
{
throw new WriterException("Number of bits and data bytes does not match");
}
// Step 1. Divide data bytes into blocks and generate error correction bytes for them. We'll
// store the divided data bytes blocks and error correction bytes blocks into "blocks".
int dataBytesOffset = 0;
int maxNumDataBytes = 0;
int maxNumEcBytes = 0;
// Since, we know the number of reedsolmon blocks, we can initialize the vector with the number.
List <BlockPair> blocks = new List <BlockPair>(numRSBlocks);
for (int i = 0; i < numRSBlocks; ++i)
{
int[] numDataBytesInBlock = new int[1];
int[] numEcBytesInBlock = new int[1];
GetNumDataBytesAndNumECBytesForBlockID(
numTotalBytes, numDataBytes, numRSBlocks, i,
numDataBytesInBlock, numEcBytesInBlock);
ByteArray dataBytes = new ByteArray();
dataBytes.Set(bits.GetArray(), dataBytesOffset, numDataBytesInBlock[0]);
ByteArray ecBytes = GenerateECBytes(dataBytes, numEcBytesInBlock[0]);
blocks.Add(new BlockPair(dataBytes, ecBytes));
maxNumDataBytes = Math.Max(maxNumDataBytes, dataBytes.Size());
maxNumEcBytes = Math.Max(maxNumEcBytes, ecBytes.Size());
dataBytesOffset += numDataBytesInBlock[0];
}
if (numDataBytes != dataBytesOffset)
{
throw new WriterException("Data bytes does not match offset");
}
// First, place data blocks.
for (int i = 0; i < maxNumDataBytes; ++i)
{
for (int j = 0; j < blocks.Count; ++j)
{
ByteArray dataBytes = blocks[j].GetDataBytes();
if (i < dataBytes.Size())
{
result.AppendBits(dataBytes.At(i), 8);
}
}
}
// Then, place error correction blocks.
for (int i = 0; i < maxNumEcBytes; ++i)
{
for (int j = 0; j < blocks.Count; ++j)
{
ByteArray ecBytes = blocks[j].GetErrorCorrectionBytes();
if (i < ecBytes.Size())
{
result.AppendBits(ecBytes.At(i), 8);
}
}
}
if (numTotalBytes != result.SizeInBytes()) // Should be same.
{
throw new WriterException("Interleaving error: " + numTotalBytes + " and " +
result.SizeInBytes() + " differ.");
}
}
// Embed version information if need be. On success, modify the matrix and return true.
// See 8.10 of JISX0510:2004 (p.47) for how to embed version information.
public static void MaybeEmbedVersionInfo(int version, ByteMatrix matrix)
{
if (version < 7) { // Version info is necessary if version >= 7.
return; // Don't need version info.
}
BitVector versionInfoBits = new BitVector();
MakeVersionInfoBits(version, versionInfoBits);
int bitIndex = 6 * 3 - 1; // It will decrease from 17 to 0.
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);
}
}
}
// Make bit vector of version information. On success, store the result in "bits" and return true.
// See 8.10 of JISX0510:2004 (p.45) for details.
public static void MakeVersionInfoBits(int version, BitVector bits)
{
bits.AppendBits(version, 6);
int bchCode = CalculateBCHCode(version, VERSION_INFO_POLY);
bits.AppendBits(bchCode, 12);
if (bits.Size() != 18) { // Just in case.
throw new WriterException("should not happen but we got: " + bits.Size());
}
}
// Make bit vector of type information. On success, store the result in "bits" and return true.
// Encode error correction level and mask pattern. See 8.9 of
// JISX0510:2004 (p.45) for details.
public static void MakeTypeInfoBits(ErrorCorrectionLevel ecLevel, int maskPattern, BitVector bits)
{
if (!QRCode.IsValidMaskPattern(maskPattern)) {
throw new WriterException("Invalid mask pattern");
}
int typeInfo = (ecLevel.GetBits() << 3) | maskPattern;
bits.AppendBits(typeInfo, 5);
int bchCode = CalculateBCHCode(typeInfo, TYPE_INFO_POLY);
bits.AppendBits(bchCode, 10);
BitVector maskBits = new BitVector();
maskBits.AppendBits(TYPE_INFO_MASK_PATTERN, 15);
bits.Xor(maskBits);
if (bits.Size() != 15) { // Just in case.
throw new WriterException("should not happen but we got: " + bits.Size());
}
}
// Embed type information. On success, modify the matrix.
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);
}
}
}
// 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());
}
}
/**
* Interleave "bits" with corresponding error correction bytes. On success, store the result in
* "result". The interleave rule is complicated. See 8.6 of JISX0510:2004 (p.37) for details.
*/
static void InterleaveWithECBytes(BitVector bits, int numTotalBytes,
int numDataBytes, int numRSBlocks, BitVector result) {
// "bits" must have "getNumDataBytes" bytes of data.
if (bits.SizeInBytes() != numDataBytes) {
throw new WriterException("Number of bits and data bytes does not match");
}
// Step 1. Divide data bytes into blocks and generate error correction bytes for them. We'll
// store the divided data bytes blocks and error correction bytes blocks into "blocks".
int dataBytesOffset = 0;
int maxNumDataBytes = 0;
int maxNumEcBytes = 0;
// Since, we know the number of reedsolmon blocks, we can initialize the vector with the number.
List<BlockPair> blocks = new List<BlockPair>(numRSBlocks);
for (int i = 0; i < numRSBlocks; ++i) {
int[] numDataBytesInBlock = new int[1];
int[] numEcBytesInBlock = new int[1];
GetNumDataBytesAndNumECBytesForBlockID(
numTotalBytes, numDataBytes, numRSBlocks, i,
numDataBytesInBlock, numEcBytesInBlock);
ByteArray dataBytes = new ByteArray();
dataBytes.Set(bits.GetArray(), dataBytesOffset, numDataBytesInBlock[0]);
ByteArray ecBytes = GenerateECBytes(dataBytes, numEcBytesInBlock[0]);
blocks.Add(new BlockPair(dataBytes, ecBytes));
maxNumDataBytes = Math.Max(maxNumDataBytes, dataBytes.Size());
maxNumEcBytes = Math.Max(maxNumEcBytes, ecBytes.Size());
dataBytesOffset += numDataBytesInBlock[0];
}
if (numDataBytes != dataBytesOffset) {
throw new WriterException("Data bytes does not match offset");
}
// First, place data blocks.
for (int i = 0; i < maxNumDataBytes; ++i) {
for (int j = 0; j < blocks.Count; ++j) {
ByteArray dataBytes = blocks[j].GetDataBytes();
if (i < dataBytes.Size()) {
result.AppendBits(dataBytes.At(i), 8);
}
}
}
// Then, place error correction blocks.
for (int i = 0; i < maxNumEcBytes; ++i) {
for (int j = 0; j < blocks.Count; ++j) {
ByteArray ecBytes = blocks[j].GetErrorCorrectionBytes();
if (i < ecBytes.Size()) {
result.AppendBits(ecBytes.At(i), 8);
}
}
}
if (numTotalBytes != result.SizeInBytes()) { // Should be same.
throw new WriterException("Interleaving error: " + numTotalBytes + " and " +
result.SizeInBytes() + " differ.");
}
}
/**
* Append mode info. On success, store the result in "bits".
*/
static void AppendModeInfo(Mode mode, BitVector bits) {
bits.AppendBits(mode.GetBits(), 4);
}
/**
* Append mode info. On success, store the result in "bits".
*/
static void AppendModeInfo(Mode mode, BitVector bits)
{
bits.AppendBits(mode.GetBits(), 4);
}
/**
* Append "bytes" in "mode" mode (encoding) into "bits". On success, store the result in "bits".
*/
static void AppendBytes(String content, Mode mode, BitVector bits, String encoding) {
if (mode.Equals(Mode.NUMERIC)) {
AppendNumericBytes(content, bits);
}
else if (mode.Equals(Mode.ALPHANUMERIC)) {
AppendAlphanumericBytes(content, bits);
}
else if (mode.Equals(Mode.BYTE)) {
Append8BitBytes(content, bits, encoding);
}
else if (mode.Equals(Mode.KANJI)) {
AppendKanjiBytes(content, bits);
}
else {
throw new WriterException("Invalid mode: " + mode);
}
}
private static void AppendECI(CharacterSetECI eci, BitVector bits)
{
bits.AppendBits(Mode.ECI.GetBits(), 4);
// This is correct for values up to 127, which is all we need now.
bits.AppendBits(eci.GetValue(), 8);
}
static void AppendAlphanumericBytes(String content, BitVector bits) {
int length = content.Length;
int i = 0;
while (i < length) {
int code1 = GetAlphanumericCode(content[i]);
if (code1 == -1) {
throw new WriterException();
}
if (i + 1 < length) {
int code2 = GetAlphanumericCode(content[i + 1]);
if (code2 == -1) {
throw new WriterException();
}
// Encode two alphanumeric letters in 11 bits.
bits.AppendBits(code1 * 45 + code2, 11);
i += 2;
}
else {
// Encode one alphanumeric letter in six bits.
bits.AppendBits(code1, 6);
i++;
}
}
}
public static void Encode(String content, ErrorCorrectionLevel ecLevel, IDictionary <EncodeHintType, Object> hints,
QRCode qrCode)
{
String encoding = null;
if (hints != null && hints.ContainsKey(EncodeHintType.CHARACTER_SET))
{
encoding = (string)hints[EncodeHintType.CHARACTER_SET];
}
if (encoding == null)
{
encoding = DEFAULT_BYTE_MODE_ENCODING;
}
// Step 1: Choose the mode (encoding).
Mode mode = ChooseMode(content, encoding);
// Step 2: Append "bytes" into "dataBits" in appropriate encoding.
BitVector dataBits = new BitVector();
AppendBytes(content, mode, dataBits, encoding);
// Step 3: Initialize QR code that can contain "dataBits".
int numInputBytes = dataBits.SizeInBytes();
InitQRCode(numInputBytes, ecLevel, mode, qrCode);
// Step 4: Build another bit vector that contains header and data.
BitVector headerAndDataBits = new BitVector();
// Step 4.5: Append ECI message if applicable
if (mode == Mode.BYTE && !DEFAULT_BYTE_MODE_ENCODING.Equals(encoding))
{
CharacterSetECI eci = CharacterSetECI.GetCharacterSetECIByName(encoding);
if (eci != null)
{
AppendECI(eci, headerAndDataBits);
}
}
AppendModeInfo(mode, headerAndDataBits);
int numLetters = mode.Equals(Mode.BYTE) ? dataBits.SizeInBytes() : content.Length;
AppendLengthInfo(numLetters, qrCode.GetVersion(), mode, headerAndDataBits);
headerAndDataBits.AppendBitVector(dataBits);
// Step 5: Terminate the bits properly.
TerminateBits(qrCode.GetNumDataBytes(), headerAndDataBits);
// Step 6: Interleave data bits with error correction code.
BitVector finalBits = new BitVector();
InterleaveWithECBytes(headerAndDataBits, qrCode.GetNumTotalBytes(), qrCode.GetNumDataBytes(),
qrCode.GetNumRSBlocks(), finalBits);
// Step 7: Choose the mask pattern and set to "qrCode".
ByteMatrix matrix = new ByteMatrix(qrCode.GetMatrixWidth(), qrCode.GetMatrixWidth());
qrCode.SetMaskPattern(ChooseMaskPattern(finalBits, qrCode.GetECLevel(), qrCode.GetVersion(),
matrix));
// Step 8. Build the matrix and set it to "qrCode".
MatrixUtil.BuildMatrix(finalBits, qrCode.GetECLevel(), qrCode.GetVersion(),
qrCode.GetMaskPattern(), matrix);
qrCode.SetMatrix(matrix);
// Step 9. Make sure we have a valid QR Code.
if (!qrCode.IsValid())
{
throw new WriterException("Invalid QR code: " + qrCode.ToString());
}
}
static void AppendKanjiBytes(String content, BitVector bits) {
byte[] bytes;
try {
bytes = Encoding.GetEncoding("Shift_JIS").GetBytes(content);
}
catch (Exception uee) {
throw new WriterException(uee.Message);
}
int length = bytes.Length;
for (int i = 0; i < length; i += 2) {
int byte1 = bytes[i] & 0xFF;
int byte2 = bytes[i + 1] & 0xFF;
int code = (byte1 << 8) | byte2;
int subtracted = -1;
if (code >= 0x8140 && code <= 0x9ffc) {
subtracted = code - 0x8140;
}
else if (code >= 0xe040 && code <= 0xebbf) {
subtracted = code - 0xc140;
}
if (subtracted == -1) {
throw new WriterException("Invalid byte sequence");
}
int encoded = ((subtracted >> 8) * 0xc0) + (subtracted & 0xff);
bits.AppendBits(encoded, 13);
}
}
// Append "bits".
public void AppendBitVector(BitVector bits) {
int size = bits.Size();
for (int i = 0; i < size; ++i) {
AppendBit(bits.At(i));
}
}
// Modify the bit vector by XOR'ing with "other"
public void Xor(BitVector other) {
if (sizeInBits != other.Size()) {
throw new ArgumentException("BitVector sizes don't match");
}
int sizeInBytes = (sizeInBits + 7) >> 3;
for (int i = 0; i < sizeInBytes; ++i) {
// The last byte could be incomplete (i.e. not have 8 bits in
// it) but there is no problem since 0 XOR 0 == 0.
array[i] ^= other.array[i];
}
}
// Make bit vector of type information. On success, store the result in "bits" and return true.
// Encode error correction level and mask pattern. See 8.9 of
// JISX0510:2004 (p.45) for details.
public static void MakeTypeInfoBits(ErrorCorrectionLevel ecLevel, int maskPattern, BitVector bits)
{
if (!QRCode.IsValidMaskPattern(maskPattern))
{
throw new WriterException("Invalid mask pattern");
}
int typeInfo = (ecLevel.GetBits() << 3) | maskPattern;
bits.AppendBits(typeInfo, 5);
int bchCode = CalculateBCHCode(typeInfo, TYPE_INFO_POLY);
bits.AppendBits(bchCode, 10);
BitVector maskBits = new BitVector();
maskBits.AppendBits(TYPE_INFO_MASK_PATTERN, 15);
bits.Xor(maskBits);
if (bits.Size() != 15) // Just in case.
{
throw new WriterException("should not happen but we got: " + bits.Size());
}
}
