| public AppendBits ( int value, int numBits ) : void | ||
| value | int | |
| numBits | int | |
| Résultat | void | |
private static void AppendNumericBytes(string content, BitVector bits)
{
var length = content.Length;
var i = 0;
while (i < length)
{
var num1 = content[i] - '0';
if (i + 2 < length)
{
// Encode three numeric letters in ten bits.
var num2 = content[i + 1] - '0';
var 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.
var 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++;
}
}
}
private static void AppendAlphanumericBytes(string content, BitVector bits)
{
var length = content.Length;
var i = 0;
while (i < length)
{
var code1 = GetAlphanumericCode(content[i]);
if (code1 == -1)
{
throw new WriterException();
}
if (i + 1 < length)
{
var 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++;
}
}
}
// 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());
}
}
/**
* Terminate bits as described in 8.4.8 and 8.4.9 of JISX0510:2004 (p.24).
*/
private static void TerminateBits(int numDataBytes, BitVector bits)
{
var 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 (var i = 0; i < 4 && bits.Size() < capacity; ++i)
{
bits.AppendBit(0);
}
var numBitsInLastByte = bits.Size() % 8;
// If the last byte isn't 8-bit aligned, we'll add padding bits.
if (numBitsInLastByte > 0)
{
var numPaddingBits = 8 - numBitsInLastByte;
for (var 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).
var numPaddingBytes = numDataBytes - bits.SizeInBytes();
for (var 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 void AppendKanjiBytes(string content, BitVector bits)
{
byte[] bytes;
try
{
bytes = Encoding.GetEncoding("Shift_JIS").GetBytes(content);
}
catch (Exception uee)
{
throw new WriterException(uee.Message);
}
var length = bytes.Length;
for (var i = 0; i < length; i += 2)
{
var byte1 = bytes[i] & 0xFF;
var byte2 = bytes[i + 1] & 0xFF;
var code = (byte1 << 8) | byte2;
var 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");
}
var encoded = ((subtracted >> 8) * 0xc0) + (subtracted & 0xff);
bits.AppendBits(encoded, 13);
}
}
/**
* Append length info. On success, store the result in "bits".
*/
private static void AppendLengthInfo(int numLetters, int version, Mode mode, BitVector bits)
{
var 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);
}
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);
}
}
// 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());
}
}
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 mode info. On success, store the result in "bits".
*/
private static void AppendModeInfo(Mode mode, BitVector bits)
{
bits.AppendBits(mode.GetBits(), 4);
}
/**
* 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.
*/
private 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".
var dataBytesOffset = 0;
var maxNumDataBytes = 0;
var maxNumEcBytes = 0;
// Since, we know the number of reedsolmon blocks, we can initialize the vector with the number.
var blocks = new List <BlockPair>(numRSBlocks);
for (var i = 0; i < numRSBlocks; ++i)
{
var numDataBytesInBlock = new int[1];
var numEcBytesInBlock = new int[1];
GetNumDataBytesAndNumECBytesForBlockID(
numTotalBytes, numDataBytes, numRSBlocks, i,
numDataBytesInBlock, numEcBytesInBlock);
var dataBytes = new ByteArray();
dataBytes.Set(bits.GetArray(), dataBytesOffset, numDataBytesInBlock[0]);
var 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 (var i = 0; i < maxNumDataBytes; ++i)
{
for (var j = 0; j < blocks.Count; ++j)
{
var dataBytes = blocks[j].GetDataBytes();
if (i < dataBytes.Size())
{
result.AppendBits(dataBytes.At(i), 8);
}
}
}
// Then, place error correction blocks.
for (var i = 0; i < maxNumEcBytes; ++i)
{
for (var j = 0; j < blocks.Count; ++j)
{
var 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.");
}
}
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 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);
}
}
// 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());
}
}
/**
* 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");
}
}
/**
* 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);
}
/**
* Append mode info. On success, store the result in "bits".
*/
static void AppendModeInfo(Mode mode, BitVector bits) {
bits.AppendBits(mode.GetBits(), 4);
}
/**
* 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.");
}
}
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++;
}
}
}
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);
}
}
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);
}
// 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());
}
}
