package com.google.zxing.qrcode.encoder;
-// class GF_Poly;
-// #include "util/array/array2d-inl.h"
-// #include "strings/stringpiece.h"
-// #include "util/reedsolomon/galois_field.h"
-// #include "util/reedsolomon/galois_poly.h"
+import com.google.zxing.WriterException;
+import com.google.zxing.common.ByteArray;
+import com.google.zxing.common.ByteMatrix;
+import com.google.zxing.common.reedsolomon.GF256;
+import com.google.zxing.common.reedsolomon.ReedSolomonEncoder;
+import com.google.zxing.qrcode.decoder.ErrorCorrectionLevel;
+import com.google.zxing.qrcode.decoder.Mode;
+import com.google.zxing.qrcode.decoder.Version;
+
+import java.util.Vector;
+import java.io.UnsupportedEncodingException;
/**
* @author satorux@google.com (Satoru Takabayashi) - creator
public final class Encoder {
// The original table is defined in the table 5 of JISX0510:2004 (p.19).
- static final int kAlphanumericTable[] = {
+ private static final int[] ALPHANUMERIC_TABLE = {
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x00-0x0f
-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, // 0x10-0x1f
36, -1, -1, -1, 37, 38, -1, -1, -1, -1, 39, 40, -1, 41, 42, 43, // 0x20-0x2f
25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, -1, // 0x50-0x5f
};
- class RSBlockInfo {
- int num_bytes;
- class {
- int num_ec_bytes;
- int num_rs_blocks;
- } block_info[4];
- };
+ private Encoder() {
+ }
- static final RSBlockInfo kRSBlockTable[] = {
- // The table is from table 12 of JISX0510:2004 (p. 30)
- // The "block_info" parts are ordered by L, M, Q, H.
- // The table was doublechecked by komatsu.
- { 26, { { 7, 1}, { 10, 1}, { 13, 1}, { 17, 1}}}, // Version 1
- { 44, { { 10, 1}, { 16, 1}, { 22, 1}, { 28, 1}}}, // Version 2
- { 70, { { 15, 1}, { 26, 1}, { 36, 2}, { 44, 2}}}, // Version 3
- { 100, { { 20, 1}, { 36, 2}, { 52, 2}, { 64, 4}}}, // Version 4
- { 134, { { 26, 1}, { 48, 2}, { 72, 4}, { 88, 4}}}, // Version 5
- { 172, { { 36, 2}, { 64, 4}, { 96, 4}, { 112, 4}}}, // Version 6
- { 196, { { 40, 2}, { 72, 4}, { 108, 6}, { 130, 5}}}, // Version 7
- { 242, { { 48, 2}, { 88, 4}, { 132, 6}, { 156, 6}}}, // Version 8
- { 292, { { 60, 2}, { 110, 5}, { 160, 8}, { 192, 8}}}, // Version 9
- { 346, { { 72, 4}, { 130, 5}, { 192, 8}, { 224, 8}}}, // Version 10
- { 404, { { 80, 4}, { 150, 5}, { 224, 8}, { 264, 11}}}, // Version 11
- { 466, { { 96, 4}, { 176, 8}, { 260, 10}, { 308, 11}}}, // Version 12
- { 532, { {104, 4}, { 198, 9}, { 288, 12}, { 352, 16}}}, // Version 13
- { 581, { {120, 4}, { 216, 9}, { 320, 16}, { 384, 16}}}, // Version 14
- { 655, { {132, 6}, { 240, 10}, { 360, 12}, { 432, 18}}}, // Version 15
- { 733, { {144, 6}, { 280, 10}, { 408, 17}, { 480, 16}}}, // Version 16
- { 815, { {168, 6}, { 308, 11}, { 448, 16}, { 532, 19}}}, // Version 17
- { 901, { {180, 6}, { 338, 13}, { 504, 18}, { 588, 21}}}, // Version 18
- { 991, { {196, 7}, { 364, 14}, { 546, 21}, { 650, 25}}}, // Version 19
- {1085, { {224, 8}, { 416, 16}, { 600, 20}, { 700, 25}}}, // Version 20
- {1156, { {224, 8}, { 442, 17}, { 644, 23}, { 750, 25}}}, // Version 21
- {1258, { {252, 9}, { 476, 17}, { 690, 23}, { 816, 34}}}, // Version 22
- {1364, { {270, 9}, { 504, 18}, { 750, 25}, { 900, 30}}}, // Version 23
- {1474, { {300, 10}, { 560, 20}, { 810, 27}, { 960, 32}}}, // Version 24
- {1588, { {312, 12}, { 588, 21}, { 870, 29}, {1050, 35}}}, // Version 25
- {1706, { {336, 12}, { 644, 23}, { 952, 34}, {1110, 37}}}, // Version 26
- {1828, { {360, 12}, { 700, 25}, {1020, 34}, {1200, 40}}}, // Version 27
- {1921, { {390, 13}, { 728, 26}, {1050, 35}, {1260, 42}}}, // Version 28
- {2051, { {420, 14}, { 784, 28}, {1140, 38}, {1350, 45}}}, // Version 29
- {2185, { {450, 15}, { 812, 29}, {1200, 40}, {1440, 48}}}, // Version 30
- {2323, { {480, 16}, { 868, 31}, {1290, 43}, {1530, 51}}}, // Version 31
- {2465, { {510, 17}, { 924, 33}, {1350, 45}, {1620, 54}}}, // Version 32
- {2611, { {540, 18}, { 980, 35}, {1440, 48}, {1710, 57}}}, // Version 33
- {2761, { {570, 19}, {1036, 37}, {1530, 51}, {1800, 60}}}, // Version 34
- {2876, { {570, 19}, {1064, 38}, {1590, 53}, {1890, 63}}}, // Version 35
- {3034, { {600, 20}, {1120, 40}, {1680, 56}, {1980, 66}}}, // Version 36
- {3196, { {630, 21}, {1204, 43}, {1770, 59}, {2100, 70}}}, // Version 37
- {3362, { {660, 22}, {1260, 45}, {1860, 62}, {2220, 74}}}, // Version 38
- {3532, { {720, 24}, {1316, 47}, {1950, 65}, {2310, 77}}}, // Version 39
- {3706, { {750, 25}, {1372, 49}, {2040, 68}, {2430, 81}}}, // Version 40
- };
+ // 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) {
+ int penalty = 0;
+ penalty += MaskUtil.applyMaskPenaltyRule1(matrix);
+ penalty += MaskUtil.applyMaskPenaltyRule2(matrix);
+ penalty += MaskUtil.applyMaskPenaltyRule3(matrix);
+ penalty += MaskUtil.applyMaskPenaltyRule4(matrix);
+ return penalty;
+ }
- static final int kMaxNumECBytes = 68; // See the table in Appendix A.
- class ECPolyInfo {
- int ec_length;
- int coeffs[kMaxNumECBytes + 1];
- };
+ private static final class BlockPair {
-// The numbers were generated using the logic found in
-// http://www.d-project.com/qrcode/. We use generated numbers instead
-// of the logic itself (don't want to copy it). The numbers are
-// supposed to be identical to the ones in the table is from the table
-// in Appendix A of JISX0510:2004 (p. 30). However, there are some
- // cases the spec seems to be wrong.
- static final ECPolyInfo kECPolynomials[] = {
- { 7,
- { 0, 87, 229, 146, 149, 238, 102, 21 }},
- // The spec lacks the coefficient for x^5 (a^46 x^5).
- // Tested a QR code of Version 1-M (uses 10 error correction bytes)
- // with a cell phone and it worked.
- { 10,
- { 0, 251, 67, 46, 61, 118, 70, 64, 94, 32, 45 }},
- { 13,
- { 0, 74, 152, 176, 100, 86, 100, 106, 104, 130, 218, 206,
- 140, 78 }},
- { 15,
- { 0, 8, 183, 61, 91, 202, 37, 51, 58, 58, 237, 140,
- 124, 5, 99, 105 }},
- { 16,
- { 0, 120, 104, 107, 109, 102, 161, 76, 3, 91, 191, 147,
- 169, 182, 194, 225, 120 }},
- { 17,
- { 0, 43, 139, 206, 78, 43, 239, 123, 206, 214, 147, 24,
- 99, 150, 39, 243, 163, 136 }},
- { 18,
- { 0, 215, 234, 158, 94, 184, 97, 118, 170, 79, 187, 152,
- 148, 252, 179, 5, 98, 96, 153 }},
- { 20,
- { 0, 17, 60, 79, 50, 61, 163, 26, 187, 202, 180, 221,
- 225, 83, 239, 156, 164, 212, 212, 188, 190 }},
- { 22,
- { 0, 210, 171, 247, 242, 93, 230, 14, 109, 221, 53, 200,
- 74, 8, 172, 98, 80, 219, 134, 160, 105, 165, 231 }},
- { 24,
- { 0, 229, 121, 135, 48, 211, 117, 251, 126, 159, 180, 169,
- 152, 192, 226, 228, 218, 111, 0, 117, 232, 87, 96, 227,
- 21 }},
- { 26,
- { 0, 173, 125, 158, 2, 103, 182, 118, 17, 145, 201, 111,
- 28, 165, 53, 161, 21, 245, 142, 13, 102, 48, 227, 153,
- 145, 218, 70 }},
- { 28,
- { 0, 168, 223, 200, 104, 224, 234, 108, 180, 110, 190, 195,
- 147, 205, 27, 232, 201, 21, 43, 245, 87, 42, 195, 212,
- 119, 242, 37, 9, 123 }},
- { 30,
- { 0, 41, 173, 145, 152, 216, 31, 179, 182, 50, 48, 110,
- 86, 239, 96, 222, 125, 42, 173, 226, 193, 224, 130, 156,
- 37, 251, 216, 238, 40, 192, 180 }},
- // In the spec, the coefficient for x^10 is a^60 but we use the
- // generated number a^69 instead (probably it's typo in the spec).
- //
- // Anyway, there seems to be no way that error correction bytes
- // bigger than 30 can be used in RS blocks, according to the table
- // 12. It's weird why the spec has numbers for error correction
- // bytes of 32 and bigger in this table here.
- { 32,
- { 0, 10, 6, 106, 190, 249, 167, 4, 67, 209, 138, 138,
- 32, 242, 123, 89, 27, 120, 185, 80, 156, 38, 69, 171,
- 60, 28, 222, 80, 52, 254, 185, 220, 241 }},
- { 34,
- { 0, 111, 77, 146, 94, 26, 21, 108, 19, 105, 94, 113,
- 193, 86, 140, 163, 125, 58, 158, 229, 239, 218, 103, 56,
- 70, 114, 61, 183, 129, 167, 13, 98, 62, 129, 51 }},
- { 36,
- { 0, 200, 183, 98, 16, 172, 31, 246, 234, 60, 152, 115,
- 0, 167, 152, 113, 248, 238, 107, 18, 63, 218, 37, 87,
- 210, 105, 177, 120, 74, 121, 196, 117, 251, 113, 233, 30,
- 120 }},
- // The spec doesn't have a row for 38 but just in case.
- { 38,
- { 0, 159, 34, 38, 228, 230, 59, 243, 95, 49, 218, 176,
- 164, 20, 65, 45, 111, 39, 81, 49, 118, 113, 222, 193,
- 250, 242, 168, 217, 41, 164, 247, 177, 30, 238, 18, 120,
- 153, 60, 193 }},
- { 40,
- { 0, 59, 116, 79, 161, 252, 98, 128, 205, 128, 161, 247,
- 57, 163, 56, 235, 106, 53, 26, 187, 174, 226, 104, 170,
- 7, 175, 35, 181, 114, 88, 41, 47, 163, 125, 134, 72,
- 20, 232, 53, 35, 15 }},
- { 42,
- { 0, 250, 103, 221, 230, 25, 18, 137, 231, 0, 3, 58,
- 242, 221, 191, 110, 84, 230, 8, 188, 106, 96, 147, 15,
- 131, 139, 34, 101, 223, 39, 101, 213, 199, 237, 254, 201,
- 123, 171, 162, 194, 117, 50, 96 }},
- { 44,
- { 0, 190, 7, 61, 121, 71, 246, 69, 55, 168, 188, 89,
- 243, 191, 25, 72, 123, 9, 145, 14, 247, 1, 238, 44,
- 78, 143, 62, 224, 126, 118, 114, 68, 163, 52, 194, 217,
- 147, 204, 169, 37, 130, 113, 102, 73, 181 }},
- { 46,
- { 0, 112, 94, 88, 112, 253, 224, 202, 115, 187, 99, 89,
- 5, 54, 113, 129, 44, 58, 16, 135, 216, 169, 211, 36,
- 1, 4, 96, 60, 241, 73, 104, 234, 8, 249, 245, 119,
- 174, 52, 25, 157, 224, 43, 202, 223, 19, 82, 15 }},
- { 48,
- { 0, 228, 25, 196, 130, 211, 146, 60, 24, 251, 90, 39,
- 102, 240, 61, 178, 63, 46, 123, 115, 18, 221, 111, 135,
- 160, 182, 205, 107, 206, 95, 150, 120, 184, 91, 21, 247,
- 156, 140, 238, 191, 11, 94, 227, 84, 50, 163, 39, 34,
- 108 }},
- { 50,
- { 0, 232, 125, 157, 161, 164, 9, 118, 46, 209, 99, 203,
- 193, 35, 3, 209, 111, 195, 242, 203, 225, 46, 13, 32,
- 160, 126, 209, 130, 160, 242, 215, 242, 75, 77, 42, 189,
- 32, 113, 65, 124, 69, 228, 114, 235, 175, 124, 170, 215,
- 232, 133, 205 }},
- { 52,
- { 0, 116, 50, 86, 186, 50, 220, 251, 89, 192, 46, 86,
- 127, 124, 19, 184, 233, 151, 215, 22, 14, 59, 145, 37,
- 242, 203, 134, 254, 89, 190, 94, 59, 65, 124, 113, 100,
- 233, 235, 121, 22, 76, 86, 97, 39, 242, 200, 220, 101,
- 33, 239, 254, 116, 51 }},
- { 54,
- { 0, 183, 26, 201, 87, 210, 221, 113, 21, 46, 65, 45,
- 50, 238, 184, 249, 225, 102, 58, 209, 218, 109, 165, 26,
- 95, 184, 192, 52, 245, 35, 254, 238, 175, 172, 79, 123,
- 25, 122, 43, 120, 108, 215, 80, 128, 201, 235, 8, 153,
- 59, 101, 31, 198, 76, 31, 156 }},
- { 56,
- { 0, 106, 120, 107, 157, 164, 216, 112, 116, 2, 91, 248,
- 163, 36, 201, 202, 229, 6, 144, 254, 155, 135, 208, 170,
- 209, 12, 139, 127, 142, 182, 249, 177, 174, 190, 28, 10,
- 85, 239, 184, 101, 124, 152, 206, 96, 23, 163, 61, 27,
- 196, 247, 151, 154, 202, 207, 20, 61, 10 }},
- { 58,
- { 0, 82, 116, 26, 247, 66, 27, 62, 107, 252, 182, 200,
- 185, 235, 55, 251, 242, 210, 144, 154, 237, 176, 141, 192,
- 248, 152, 249, 206, 85, 253, 142, 65, 165, 125, 23, 24,
- 30, 122, 240, 214, 6, 129, 218, 29, 145, 127, 134, 206,
- 245, 117, 29, 41, 63, 159, 142, 233, 125, 148, 123 }},
- { 60,
- { 0, 107, 140, 26, 12, 9, 141, 243, 197, 226, 197, 219,
- 45, 211, 101, 219, 120, 28, 181, 127, 6, 100, 247, 2,
- 205, 198, 57, 115, 219, 101, 109, 160, 82, 37, 38, 238,
- 49, 160, 209, 121, 86, 11, 124, 30, 181, 84, 25, 194,
- 87, 65, 102, 190, 220, 70, 27, 209, 16, 89, 7, 33,
- 240 }},
- // The spec lacks the coefficient for x^5 (a^127 x^5).
- // Anyway the number will not be used. See the comment for 32.
- { 62,
- { 0, 65, 202, 113, 98, 71, 223, 248, 118, 214, 94, 0,
- 122, 37, 23, 2, 228, 58, 121, 7, 105, 135, 78, 243,
- 118, 70, 76, 223, 89, 72, 50, 70, 111, 194, 17, 212,
- 126, 181, 35, 221, 117, 235, 11, 229, 149, 147, 123, 213,
- 40, 115, 6, 200, 100, 26, 246, 182, 218, 127, 215, 36,
- 186, 110, 106 }},
- { 64,
- { 0, 45, 51, 175, 9, 7, 158, 159, 49, 68, 119, 92,
- 123, 177, 204, 187, 254, 200, 78, 141, 149, 119, 26, 127,
- 53, 160, 93, 199, 212, 29, 24, 145, 156, 208, 150, 218,
- 209, 4, 216, 91, 47, 184, 146, 47, 140, 195, 195, 125,
- 242, 238, 63, 99, 108, 140, 230, 242, 31, 204, 11, 178,
- 243, 217, 156, 213, 231 }},
- { 66,
- { 0, 5, 118, 222, 180, 136, 136, 162, 51, 46, 117, 13,
- 215, 81, 17, 139, 247, 197, 171, 95, 173, 65, 137, 178,
- 68, 111, 95, 101, 41, 72, 214, 169, 197, 95, 7, 44,
- 154, 77, 111, 236, 40, 121, 143, 63, 87, 80, 253, 240,
- 126, 217, 77, 34, 232, 106, 50, 168, 82, 76, 146, 67,
- 106, 171, 25, 132, 93, 45, 105 }},
- { 68,
- { 0, 247, 159, 223, 33, 224, 93, 77, 70, 90, 160, 32,
- 254, 43, 150, 84, 101, 190, 205, 133, 52, 60, 202, 165,
- 220, 203, 151, 93, 84, 15, 84, 253, 173, 160, 89, 227,
- 52, 199, 97, 95, 231, 52, 177, 41, 125, 137, 241, 166,
- 225, 118, 2, 54, 32, 82, 215, 175, 198, 43, 238, 235,
- 27, 101, 184, 127, 3, 5, 8, 163, 238 }},
- };
+ private final ByteArray dataBytes;
+ private final ByteArray errorCorrectionBytes;
+
+ BlockPair(ByteArray data, ByteArray errorCorrection) {
+ dataBytes = data;
+ errorCorrectionBytes = errorCorrection;
+ }
+
+ public ByteArray getDataBytes() {
+ return dataBytes;
+ }
- private static final int kFieldSize = 8;
- private static GF_Poly *g_ec_polynomials[kMaxNumECBytes + 1];
-
- public:
- // Encode "bytes" with the error correction level "ec_level". The
- // encoding mode will be chosen internally by ChooseMode().
- // On success, store the result in "qr_code" and return true. On
- // error, return false. We recommend you to use QRCode.EC_LEVEL_L
- // (the lowest level) for "ec_level" since our primary use is to
- // show QR code on desktop screens. We don't need very strong error
- // correction for this purpose.
+ public ByteArray getErrorCorrectionBytes() {
+ return errorCorrectionBytes;
+ }
+
+ }
+
+ // Encode "bytes" with the error correction level "getECLevel". The encoding mode will be chosen
+ // internally by chooseMode(). On success, store the result in "qrCode" and return true.
+ // We recommend you to use QRCode.EC_LEVEL_L (the lowest level) for
+ // "getECLevel" since our primary use is to show QR code on desktop screens. We don't need very
+ // strong error correction for this purpose.
//
- // Note that there is no way to encode bytes in MODE_KANJI. We might
- // want to add EncodeWithMode() with which clients can specify the
- // encoding mode. For now, we don't need the functionality.
- static boolean Encode(final StringPiece& bytes, QRCode.ECLevel ec_level,
- QRCode *qr_code) {
+ // Note that there is no way to encode bytes in MODE_KANJI. We might want to add EncodeWithMode()
+ // with which clients can specify the encoding mode. For now, we don't need the functionality.
+ public static void encode(String content, ErrorCorrectionLevel ecLevel, QRCode qrCode)
+ throws WriterException {
// Step 1: Choose the mode (encoding).
- final QRCode.Mode mode = ChooseMode(bytes);
+ Mode mode = chooseMode(content);
- // Step 2: Append "bytes" into "data_bits" in appropriate encoding.
- BitVector data_bits;
- if (!AppendBytes(bytes, mode, &data_bits)) {
- return false;
- }
- // Step 3: Initialize QR code that can contain "data_bits".
- final int num_input_bytes = data_bits.num_bytes();
- if (!InitQRCode(num_input_bytes, ec_level, mode, qr_code)) {
- return false;
- }
+ // Step 2: Append "bytes" into "dataBits" in appropriate encoding.
+ BitVector dataBits = new BitVector();
+ appendBytes(content, mode, dataBits);
+ // 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 header_and_data_bits;
- if (!AppendModeInfo(qr_code.mode(), &header_and_data_bits)) {
- return false;
- }
- if (!AppendLengthInfo(bytes.size(), qr_code.version(), qr_code.mode(),
- &header_and_data_bits)) {
- return false;
- }
- header_and_data_bits.AppendBitVector(data_bits);
+ BitVector headerAndDataBits = new BitVector();
+ appendModeInfo(qrCode.getMode(), headerAndDataBits);
+ appendLengthInfo(content.length(), qrCode.getVersion(), qrCode.getMode(), headerAndDataBits);
+ headerAndDataBits.appendBitVector(dataBits);
// Step 5: Terminate the bits properly.
- if (!TerminateBits(qr_code.num_data_bytes(), &header_and_data_bits)) {
- return false;
- }
+ terminateBits(qrCode.getNumDataBytes(), headerAndDataBits);
// Step 6: Interleave data bits with error correction code.
- BitVector final_bits;
- InterleaveWithECBytes(header_and_data_bits,
- qr_code.num_total_bytes(),
- qr_code.num_data_bytes(),
- qr_code.num_rs_blocks(),
- &final_bits);
-
- // Step 7: Choose the mask pattern and set to "qr_code".
- QRCodeMatrix* matrix = new QRCodeMatrix(qr_code.matrix_width(),
- qr_code.matrix_width());
- qr_code.set_mask_pattern(ChooseMaskPattern(final_bits,
- qr_code.ec_level(),
- qr_code.version(),
+ 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));
- if (qr_code.mask_pattern() == -1) {
- // There was an error.
- delete matrix;
- return false;
- }
-
- // Step 8. Build the matrix and set it to "qr_code".
- MatrixUtil.BuildMatrix(final_bits,
- qr_code.ec_level(),
- qr_code.version(),
- qr_code.mask_pattern(), matrix);
- qr_code.set_matrix(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 (!qr_code.IsValid()) {
- Debug.LOG_ERROR("Invalid QR code: " + qr_code.DebugString());
- return false;
+ if (!qrCode.isValid()) {
+ throw new WriterException("Invalid QR code: " + qrCode.toString());
}
- return true;
}
- // The functions below are public but not intended to be used
- // outside the library. We make them public for ease of unit
- // testing with gUnit.
-
- // Return the code point of the table used in alphanumeric mode.
- // Return -1 if there is no corresponding code in the table.
- static int GetAlphanumericCode(int code) {
- if (code < arraysize(kAlphanumericTable)) {
- return kAlphanumericTable[code];
+ // Return the code point of the table used in alphanumeric mode. Return -1 if there is no
+ // corresponding code in the table.
+ static int getAlphanumericCode(int code) {
+ if (code < ALPHANUMERIC_TABLE.length) {
+ return ALPHANUMERIC_TABLE[code];
}
return -1;
}
- // Choose the best mode from the content of "bytes".
- // The function is guaranteed to return valid mode.
+ // Choose the best mode by examining the content.
//
- // Note that the function does not return MODE_KANJI, as we cannot
- // distinguish Shift_JIS from other encodings such as ISO-8859-1, from
- // data bytes alone. For example "\xE0\xE0" can be interpreted as one
- // character in Shift_JIS, but also two characters in ISO-8859-1.
- static QRCode.Mode ChooseMode(final StringPiece &bytes) {
- boolean has_numeric = false;
- boolean has_alphanumeric = false;
- boolean has_other = false;
- for (int i = 0; i < bytes.size(); ++i) {
- final int byte = bytes[i];
- if (byte >= '0' && byte <= '9') {
- has_numeric = true;
- } else if (GetAlphanumericCode(byte) != -1) {
- has_alphanumeric = true;
- } else {
- has_other = true;
- }
- }
- if (has_other) {
- return QRCode.MODE_8BIT_BYTE;
- } else if (has_alphanumeric) {
- return QRCode.MODE_ALPHANUMERIC;
- } else if (has_numeric) {
- return QRCode.MODE_NUMERIC;
+ // Note that this function does not return MODE_KANJI, as we cannot distinguish Shift_JIS from
+ // other encodings such as ISO-8859-1, from data bytes alone. For example "\xE0\xE0" can be
+ // interpreted as one character in Shift_JIS, but also two characters in ISO-8859-1.
+ //
+ // JAVAPORT: This MODE_KANJI limitation sounds like a problem for us.
+ public static Mode chooseMode(String content) {
+ boolean hasNumeric = false;
+ boolean hasAlphanumeric = false;
+ for (int i = 0; i < content.length(); ++i) {
+ char c = content.charAt(i);
+ if (c >= '0' && c <= '9') {
+ hasNumeric = true;
+ } else if (getAlphanumericCode(c) != -1) {
+ hasAlphanumeric = true;
+ } else {
+ return Mode.BYTE;
+ }
+ }
+ if (hasAlphanumeric) {
+ return Mode.ALPHANUMERIC;
+ } else if (hasNumeric) {
+ return Mode.NUMERIC;
+ }
+ return Mode.BYTE;
}
- // "bytes" must be empty to reach here.
- Debug.DCHECK(bytes.empty());
- return QRCode.MODE_8BIT_BYTE;
-}
- private static int ChooseMaskPattern(final BitVector &bits,
- QRCode.ECLevel ec_level,
- int version,
- QRCodeMatrix *matrix) {
- if (!QRCode.IsValidMatrixWidth(matrix.width())) {
- Debug.LOG_ERROR("Invalid matrix width: " + matrix.width());
- return -1;
- }
+ private static int chooseMaskPattern(BitVector bits, ErrorCorrectionLevel ecLevel, int version,
+ ByteMatrix matrix) throws WriterException {
- int min_penalty = INT_MAX; // Lower penalty is better.
- int best_mask_pattern = -1;
+ int minPenalty = Integer.MAX_VALUE; // Lower penalty is better.
+ int bestMaskPattern = -1;
// We try all mask patterns to choose the best one.
- for (int i = 0; i < kNumMaskPatterns; ++i) {
- final int mask_pattern = i;
- if (!MatrixUtil.BuildMatrix(bits, ec_level, version,
- mask_pattern, matrix)) {
- return -1;
- }
- final int penalty = MaskUtil.CalculateMaskPenalty(*matrix);
- Debug.LOG_INFO("mask_pattern: " + mask_pattern + ", " + "penalty: " + penalty);
- if (penalty < min_penalty) {
- min_penalty = penalty;
- best_mask_pattern = mask_pattern;
+ 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 best_mask_pattern;
+ return bestMaskPattern;
}
- // Initialize "qr_code" according to "num_input_bytes", "ec_level",
- // and "mode". On success, modify "qr_code" and return true. On
- // error, return false.
- static boolean InitQRCode(int num_input_bytes, QRCode.ECLevel ec_level,
- QRCode.Mode mode, QRCode *qr_code) {
- qr_code.set_ec_level(ec_level);
- qr_code.set_mode(mode);
-
- if (!QRCode.IsValidECLevel(ec_level)) {
- Debug.LOG_ERROR("Invalid EC level: " + ec_level);
- return false;
- }
+ // Initialize "qrCode" according to "numInputBytes", "ecLevel", and "mode". On success, modify
+ // "qrCode".
+ private static void initQRCode(int numInputBytes, ErrorCorrectionLevel ecLevel, Mode mode, QRCode qrCode)
+ throws WriterException {
+ qrCode.setECLevel(ecLevel);
+ qrCode.setMode(mode);
// In the following comments, we use numbers of Version 7-H.
- for (int i = 0; i < arraysize(kRSBlockTable); ++i) {
- final RSBlockInfo &row = kRSBlockTable[i];
- // num_bytes = 196
- final int num_bytes = row.num_bytes;
- // num_ec_bytes = 130
- final int num_ec_bytes = row.block_info[ec_level].num_ec_bytes;
- // num_rs_blocks = 5
- final int num_rs_blocks = row.block_info[ec_level].num_rs_blocks;
- // num_data_bytes = 196 - 130 = 66
- final int num_data_bytes = num_bytes - num_ec_bytes;
- // We want to choose the smallest version which can contain data
- // of "num_input_bytes" + some extra bits for the header (mode
- // info and length info). The header can be three bytes
- // (precisely 4 + 16 bits) at most. Hence we do +3 here.
- if (num_data_bytes >= num_input_bytes + 3) {
+ for (int versionNum = 1; versionNum <= 40; versionNum++) {
+ Version version = Version.getVersionForNumber(versionNum);
+ // numBytes = 196
+ int numBytes = version.getTotalCodewords();
+ // getNumECBytes = 130
+ Version.ECBlocks ecBlocks = version.getECBlocksForLevel(ecLevel);
+ int numEcBytes = ecBlocks.getTotalECCodewords();
+ // getNumRSBlocks = 5
+ int numRSBlocks = ecBlocks.getNumBlocks();
+ // getNumDataBytes = 196 - 130 = 66
+ int numDataBytes = numBytes - numEcBytes;
+ // We want to choose the smallest version which can contain data of "numInputBytes" + some
+ // extra bits for the header (mode info and length info). The header can be three bytes
+ // (precisely 4 + 16 bits) at most. Hence we do +3 here.
+ if (numDataBytes >= numInputBytes + 3) {
// Yay, we found the proper rs block info!
- qr_code.set_version(i + 1);
- qr_code.set_num_total_bytes(num_bytes);
- qr_code.set_num_data_bytes(num_data_bytes);
- qr_code.set_num_rs_blocks(num_rs_blocks);
- // num_ec_bytes = 196 - 66 = 130
- qr_code.set_num_ec_bytes(num_bytes - num_data_bytes);
- // num_matrix_width = 21 + 6 * 4 = 45
- qr_code.set_matrix_width(21 + i * 4);
- return true;
+ qrCode.setVersion(versionNum);
+ qrCode.setNumTotalBytes(numBytes);
+ qrCode.setNumDataBytes(numDataBytes);
+ qrCode.setNumRSBlocks(numRSBlocks);
+ // getNumECBytes = 196 - 66 = 130
+ qrCode.setNumECBytes(numEcBytes);
+ // matrix width = 21 + 6 * 4 = 45
+ qrCode.setMatrixWidth(version.getDimensionForVersion());
+ return;
}
}
- Debug.LOG_ERROR("Cannot find proper rs block info (input data too big?)");
- return false;
+ throw new WriterException("Cannot find proper rs block info (input data too big?)");
}
- // Terminate bits as described in 8.4.8 and 8.4.9 of JISX0510:2004
- // (p.24).
- static boolean TerminateBits(int num_data_bytes, BitVector *bits) {
- final int capacity = num_data_bytes * 8;
+ // Terminate bits as described in 8.4.8 and 8.4.9 of JISX0510:2004 (p.24).
+ static void terminateBits(int numDataBytes, BitVector bits) throws WriterException {
+ int capacity = numDataBytes << 3;
if (bits.size() > capacity) {
- Debug.LOG_ERROR("data bits cannot fit in the QR Code" + bits.size() + " > " + capacity);
- return false;
+ 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.
+ // Append termination bits. See 8.4.8 of JISX0510:2004 (p.24) for details.
for (int i = 0; i < 4 && bits.size() < capacity; ++i) {
- bits.AppendBit(0);
+ bits.appendBit(0);
}
- final int num_bits_in_last_byte = bits.size() % 8;
+ int numBitsInLastByte = bits.size() % 8;
// If the last byte isn't 8-bit aligned, we'll add padding bits.
- if (num_bits_in_last_byte > 0) {
- final int num_padding_bits = 8 - num_bits_in_last_byte;
- for (int i = 0; i < num_padding_bits; ++i) {
- bits.AppendBit(0);
+ if (numBitsInLastByte > 0) {
+ int numPaddingBits = 8 - numBitsInLastByte;
+ for (int i = 0; i < numPaddingBits; ++i) {
+ bits.appendBit(0);
}
}
// Should be 8-bit aligned here.
- Debug.DCHECK_EQ(0, bits.size() % 8);
- // If we have more space, we'll fill the space with padding patterns
- // defined in 8.4.9 (p.24).
- final int num_padding_bytes = num_data_bytes - bits.num_bytes();
- for (int i = 0; i < num_padding_bytes; ++i) {
+ 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);
+ bits.appendBits(0xec, 8);
} else {
- bits.AppendBits(0x11, 8);
+ bits.appendBits(0x11, 8);
}
}
- Debug.DCHECK_EQ(bits.size(), capacity); // Should be same.
- return bits.size() == capacity;
+ if (bits.size() != capacity) {
+ throw new WriterException("Bits size does not equal capacity");
+ }
}
- // Get number of data bytes and number of error correction bytes for
- // block id "block_id". Store the result in
- // "num_data_bytes_in_block", and "num_ec_bytes_in_block".
- // See table 12 in 8.5.1 of JISX0510:2004 (p.30)
- static void GetNumDataBytesAndNumECBytesForBlockID(
- int num_total_bytes,
- int num_data_bytes,
- int num_rs_blocks,
- int block_id,
- int *num_data_bytes_in_block,
- int *num_ec_bytes_in_block) {
- Debug.DCHECK_LT(block_id, num_rs_blocks);
- // num_rs_blocks_in_group2 = 196 % 5 = 1
- final int num_rs_blocks_in_group2 = num_total_bytes % num_rs_blocks;
- // num_rs_blocks_in_group1 = 5 - 1 = 4
- final int num_rs_blocks_in_group1 = num_rs_blocks - num_rs_blocks_in_group2;
- // num_total_bytes_in_group1 = 196 / 5 = 39
- final int num_total_bytes_in_group1 = num_total_bytes / num_rs_blocks;
- // num_total_bytes_in_group2 = 39 + 1 = 40
- final int num_total_bytes_in_group2 = num_total_bytes_in_group1 + 1;
- // num_data_bytes_in_group1 = 66 / 5 = 13
- final int num_data_bytes_in_group1 = num_data_bytes / num_rs_blocks;
- // num_data_bytes_in_group2 = 13 + 1 = 14
- final int num_data_bytes_in_group2 = num_data_bytes_in_group1 + 1;
- // num_ec_bytes_in_group1 = 39 - 13 = 26
- final int num_ec_bytes_in_group1 = num_total_bytes_in_group1 -
- num_data_bytes_in_group1;
- // num_ec_bytes_in_group2 = 40 - 14 = 26
- final int num_ec_bytes_in_group2 = num_total_bytes_in_group2 -
- num_data_bytes_in_group2;
+ // Get number of data bytes and number of error correction bytes for block id "blockID". Store
+ // the result in "numDataBytesInBlock", and "numECBytesInBlock". See table 12 in 8.5.1 of
+ // JISX0510:2004 (p.30)
+ static void getNumDataBytesAndNumECBytesForBlockID(int numTotalBytes, int numDataBytes,
+ int numRSBlocks, int blockID, int[] numDataBytesInBlock,
+ int[] numECBytesInBlock) throws WriterException {
+ if (blockID >= numRSBlocks) {
+ throw new WriterException("Block ID too large");
+ }
+ // numRsBlocksInGroup2 = 196 % 5 = 1
+ int numRsBlocksInGroup2 = numTotalBytes % numRSBlocks;
+ // numRsBlocksInGroup1 = 5 - 1 = 4
+ int numRsBlocksInGroup1 = numRSBlocks - numRsBlocksInGroup2;
+ // numTotalBytesInGroup1 = 196 / 5 = 39
+ int numTotalBytesInGroup1 = numTotalBytes / numRSBlocks;
+ // numTotalBytesInGroup2 = 39 + 1 = 40
+ int numTotalBytesInGroup2 = numTotalBytesInGroup1 + 1;
+ // numDataBytesInGroup1 = 66 / 5 = 13
+ int numDataBytesInGroup1 = numDataBytes / numRSBlocks;
+ // numDataBytesInGroup2 = 13 + 1 = 14
+ int numDataBytesInGroup2 = numDataBytesInGroup1 + 1;
+ // numEcBytesInGroup1 = 39 - 13 = 26
+ int numEcBytesInGroup1 = numTotalBytesInGroup1 - numDataBytesInGroup1;
+ // numEcBytesInGroup2 = 40 - 14 = 26
+ int numEcBytesInGroup2 = numTotalBytesInGroup2 - numDataBytesInGroup2;
// Sanity checks.
// 26 = 26
- Debug.DCHECK_EQ(num_ec_bytes_in_group1, num_ec_bytes_in_group2);
+ if (numEcBytesInGroup1 != numEcBytesInGroup2) {
+ throw new WriterException("EC bytes mismatch");
+ }
// 5 = 4 + 1.
- Debug.DCHECK_EQ(num_rs_blocks, num_rs_blocks_in_group1 + num_rs_blocks_in_group2);
+ if (numRSBlocks != numRsBlocksInGroup1 + numRsBlocksInGroup2) {
+ throw new WriterException("RS blocks mismatch");
+ }
// 196 = (13 + 26) * 4 + (14 + 26) * 1
- Debug.DCHECK_EQ(num_total_bytes,
- ((num_data_bytes_in_group1 + num_ec_bytes_in_group1) *
- num_rs_blocks_in_group1) +
- ((num_data_bytes_in_group2 + num_ec_bytes_in_group2) *
- num_rs_blocks_in_group2));
-
- if (block_id < num_rs_blocks_in_group1) {
- *num_data_bytes_in_block = num_data_bytes_in_group1;
- *num_ec_bytes_in_block = num_ec_bytes_in_group1;
+ if (numTotalBytes !=
+ ((numDataBytesInGroup1 + numEcBytesInGroup1) *
+ numRsBlocksInGroup1) +
+ ((numDataBytesInGroup2 + numEcBytesInGroup2) *
+ numRsBlocksInGroup2)) {
+ throw new WriterException("Total bytes mismatch");
+ }
+
+ if (blockID < numRsBlocksInGroup1) {
+ numDataBytesInBlock[0] = numDataBytesInGroup1;
+ numECBytesInBlock[0] = numEcBytesInGroup1;
} else {
- *num_data_bytes_in_block = num_data_bytes_in_group2;
- *num_ec_bytes_in_block = num_ec_bytes_in_group2;
+ numDataBytesInBlock[0] = numDataBytesInGroup2;
+ numECBytesInBlock[0] = numEcBytesInGroup2;
}
}
- // Interleave "bits" with corresponding error correction bytes. On
- // success, store the result in "result" and return true. On error,
- // return false.
- // The interleave rule is complicated. See 8.6 of JISX0510:2004
- // (p.37) for details.
- static boolean InterleaveWithECBytes(final BitVector &bits,
- int num_total_bytes,
- int num_data_bytes,
- int num_rc_blocks,
- BitVector *result) {
- // "bits" must have "num_data_bytes" bytes of data.
- Debug.DCHECK(bits.num_bytes() == num_data_bytes);
-
- // 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".
- typedef pair<StringPiece, String> BlockPair;
- int data_bytes_offset = 0;
- final String &encoded_bytes = bits.ToString();
- int max_num_data_bytes = 0; // StringPiece's size is "int".
- size_t max_num_ec_bytes = 0; // STL String's size is "size_t".
- vector<BlockPair> blocks;
- // Since, we know the number of reedsolmon blocks, we can initialize
- // the vector with the number.
- blocks.resize(num_rs_blocks);
-
- for (int i = 0; i < num_rs_blocks; ++i) {
- int num_data_bytes_in_block, num_ec_bytes_in_block;
- GetNumDataBytesAndNumECBytesForBlockID(
- num_total_bytes, num_data_bytes, num_rs_blocks, i,
- &num_data_bytes_in_block, &num_ec_bytes_in_block);
- // We modify the objects in the vector instead of copying new
- // objects to the vector. In particular, we want to avoid String
- // copies.
- StringPiece *data_bytes = &(blocks[i].first);
- String *ec_bytes = &(blocks[i].second);
-
- data_bytes.set(encoded_bytes.data() + data_bytes_offset,
- num_data_bytes_in_block);
- GenerateECBytes(*data_bytes, num_ec_bytes_in_block, ec_bytes);
-
- max_num_data_bytes = max(max_num_data_bytes, data_bytes.size());
- max_num_ec_bytes = max(max_num_ec_bytes, ec_bytes.size());
- data_bytes_offset += num_data_bytes_in_block;
- }
- Debug.DCHECK_EQ(num_data_bytes, data_bytes_offset);
+ // Interleave "bits" with corresponding error correction bytes. On success, store the result in
+ // "result" and return true. 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) throws WriterException {
+
+ // "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.
+ Vector blocks = new Vector(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.addElement(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 < max_num_data_bytes; ++i) {
+ for (int i = 0; i < maxNumDataBytes; ++i) {
for (int j = 0; j < blocks.size(); ++j) {
- final StringPiece &data_bytes = blocks[j].first;
- if (i < data_bytes.size()) {
- result.AppendBits(data_bytes[i], 8);
+ ByteArray dataBytes = ((BlockPair) blocks.elementAt(j)).getDataBytes();
+ if (i < dataBytes.size()) {
+ result.appendBits(dataBytes.at(i), 8);
}
}
}
// Then, place error correction blocks.
- for (int i = 0; i < max_num_ec_bytes; ++i) {
+ for (int i = 0; i < maxNumEcBytes; ++i) {
for (int j = 0; j < blocks.size(); ++j) {
- final String &ec_bytes = blocks[j].second;
- if (i < ec_bytes.size()) {
- result.AppendBits(ec_bytes[i], 8);
+ ByteArray ecBytes = ((BlockPair) blocks.elementAt(j)).getErrorCorrectionBytes();
+ if (i < ecBytes.size()) {
+ result.appendBits(ecBytes.at(i), 8);
}
}
}
- if (num_total_bytes == result.num_bytes()) { // Should be same.
- return true;
+ if (numTotalBytes != result.sizeInBytes()) { // Should be same.
+ throw new WriterException("Interleaving error: " + numTotalBytes + " and " + result.sizeInBytes() +
+ " differ.");
}
- Debug.LOG_ERROR("Interleaving error: " + num_total_bytes + " and " + result.num_bytes() +
- "differ.");
- return false;
}
- // Append mode info. On success, store the result in "bits" and
- // return true. On error, return false.
- static boolean AppendModeInfo(QRCode.Mode mode, BitVector *bits) {
- final int code = QRCode.GetModeCode(mode);
- if (code == -1) {
- Debug.LOG_ERROR("Invalid mode: " + mode);
- return false;
+ static ByteArray generateECBytes(ByteArray dataBytes, int numEcBytesInBlock) {
+ int numDataBytes = dataBytes.size();
+ int[] toEncode = new int[numDataBytes + numEcBytesInBlock];
+ for (int i = 0; i < numDataBytes; i++) {
+ toEncode[i] = dataBytes.at(i);
}
- bits.AppendBits(code, 4);
- return true;
- }
+ new ReedSolomonEncoder(GF256.QR_CODE_FIELD).encode(toEncode, numEcBytesInBlock);
+ ByteArray ecBytes = new ByteArray(numEcBytesInBlock);
+ for (int i = 0; i < numEcBytesInBlock; i++) {
+ ecBytes.set(i, toEncode[numDataBytes + i]);
+ }
+ return ecBytes;
+ }
- // Append length info. On success, store the result in "bits" and
- // return true. On error, return false.
- static boolean AppendLengthInfo(int num_bytes,
- int version,
- QRCode.Mode mode,
- BitVector *bits) {
- int num_letters = num_bytes;
- // In Kanji mode, a letter is represented in two bytes.
- if (mode == QRCode.MODE_KANJI) {
- Debug.DCHECK_EQ(0, num_letters % 2);
- num_letters /= 2;
+ // Append mode info. On success, store the result in "bits" and return true. On error, return
+ // false.
+ static void appendModeInfo(Mode mode, BitVector bits) {
+ bits.appendBits(mode.getBits(), 4);
}
- final int num_bits = QRCode.GetNumBitsForLength(version, mode);
- if (num_bits == -1) {
- Debug.LOG_ERROR("num_bits unset");
- return false;
- }
- if (num_letters > ((1 << num_bits) - 1)) {
- Debug.LOG_ERROR(num_letters + "is bigger than" + ((1 << num_bits) - 1));
- return false;
+
+ // Append length info. On success, store the result in "bits" and return true. On error, return
+ // false.
+ static void appendLengthInfo(int numLetters, int version, Mode mode, BitVector bits) throws WriterException {
+ int numBits = mode.getCharacterCountBits(Version.getVersionForNumber(version));
+ if (numLetters > ((1 << numBits) - 1)) {
+ throw new WriterException(numLetters + "is bigger than" + ((1 << numBits) - 1));
}
- bits.AppendBits(num_letters, num_bits);
- return true;
+ bits.appendBits(numLetters, numBits);
}
- // Append "bytes" in "mode" mode (encoding) into "bits". On
- // success, store the result in "bits" and return true. On error,
- // return false.
- static boolean AppendBytes(final StringPiece &bytes,
- QRCode.Mode mode, BitVector *bits) {
- switch (mode) {
- case QRCode.MODE_NUMERIC:
- return AppendNumericBytes(bytes, bits);
- case QRCode.MODE_ALPHANUMERIC:
- return AppendAlphanumericBytes(bytes, bits);
- case QRCode.MODE_8BIT_BYTE:
- return Append8BitBytes(bytes, bits);
- case QRCode.MODE_KANJI:
- return AppendKanjiBytes(bytes, bits);
- default:
- break;
- }
- Debug.LOG_ERROR("Invalid mode: " + mode);
- return false;
+ // Append "bytes" in "mode" mode (encoding) into "bits". On success, store the result in "bits"
+ // and return true.
+ static void appendBytes(String content, Mode mode, BitVector bits) throws WriterException {
+ 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);
+ } else if (mode.equals(Mode.KANJI)) {
+ appendKanjiBytes(content, bits);
+ } else {
+ throw new WriterException("Invalid mode: " + mode);
+ }
}
- // Append "bytes" to "bits" using QRCode.MODE_NUMERIC mode.
- // On success, store the result in "bits" and return true. On error,
- // return false.
- static boolean AppendNumericBytes(final StringPiece &bytes, BitVector *bits) {
- // Validate all the bytes first.
- for (int i = 0; i < bytes.size(); ++i) {
- if (!isdigit(bytes[i])) {
- return false;
- }
- }
- for (int i = 0; i < bytes.size();) {
- final int num1 = bytes[i] - '0';
- if (i + 2 < bytes.size()) {
+ static void appendNumericBytes(String content, BitVector bits) {
+ int length = content.length();
+ int i = 0;
+ while (i < length) {
+ int num1 = content.charAt(i) - '0';
+ if (i + 2 < length) {
// Encode three numeric letters in ten bits.
- final int num2 = bytes[i + 1] - '0';
- final int num3 = bytes[i + 2] - '0';
- bits.AppendBits(num1 * 100 + num2 * 10 + num3, 10);
+ int num2 = content.charAt(i + 1) - '0';
+ int num3 = content.charAt(i + 2) - '0';
+ bits.appendBits(num1 * 100 + num2 * 10 + num3, 10);
i += 3;
- } else if (i + 1 < bytes.size()) {
+ } else if (i + 1 < length) {
// Encode two numeric letters in seven bits.
- final int num2 = bytes[i + 1] - '0';
- bits.AppendBits(num1 * 10 + num2, 7);
+ int num2 = content.charAt(i + 1) - '0';
+ bits.appendBits(num1 * 10 + num2, 7);
i += 2;
} else {
// Encode one numeric letter in four bits.
- bits.AppendBits(num1, 4);
- ++i;
+ bits.appendBits(num1, 4);
+ i++;
}
}
- return true;
}
- // Append "bytes" to "bits" using QRCode.MODE_ALPHANUMERIC mode.
- // On success, store the result in "bits" and return true. On error,
- // return false.
- static boolean AppendAlphanumericBytes(final StringPiece &bytes,
- BitVector *bits) {
- for (int i = 0; i < bytes.size();) {
- final int code1 = GetAlphanumericCode(bytes[i]);
+ static void appendAlphanumericBytes(String content, BitVector bits) throws WriterException {
+ int length = content.length();
+ int i = 0;
+ while (i < length) {
+ int code1 = getAlphanumericCode(content.charAt(i));
if (code1 == -1) {
- return false;
+ throw new WriterException();
}
- if (i + 1 < bytes.size()) {
- final int code2 = GetAlphanumericCode(bytes[i + 1]);
+ if (i + 1 < length) {
+ int code2 = getAlphanumericCode(content.charAt(i + 1));
if (code2 == -1) {
- return false;
+ throw new WriterException();
}
// Encode two alphanumeric letters in 11 bits.
- bits.AppendBits(code1 * 45 + code2, 11);
+ bits.appendBits(code1 * 45 + code2, 11);
i += 2;
} else {
// Encode one alphanumeric letter in six bits.
- bits.AppendBits(code1, 6);
- ++i;
+ bits.appendBits(code1, 6);
+ i++;
}
}
- return true;
}
- // Append "bytes" to "bits" using QRCode.MODE_8BIT_BYTE mode.
- // On success, store the result in "bits" and return true. On error,
- // return false.
- static boolean Append8BitBytes(final StringPiece &bytes, BitVector *bits) {
- for (int i = 0; i < bytes.size(); ++i) {
- bits.AppendBits(bytes[i], 8);
+ static void append8BitBytes(String content, BitVector bits) throws WriterException {
+ byte[] bytes;
+ try {
+ bytes = content.getBytes("ISO-8859-1"); // TODO support specifying encoding?
+ } catch (UnsupportedEncodingException uee) {
+ throw new WriterException(uee.toString());
+ }
+ for (int i = 0; i < bytes.length; ++i) {
+ bits.appendBits(bytes[i], 8);
}
- return true;
}
- // Append "bytes" to "bits" using QRCode.MODE_KANJI mode.
- // On success, store the result in "bits" and return true. On error,
- // return false.
- // See 8.4.5 of JISX0510:2004 (p.21) for how to encode Kanji bytes.
- static boolean AppendKanjiBytes(final StringPiece &bytes, BitVector *bits) {
- if (bytes.size() % 2 != 0) {
- Debug.LOG_ERROR("Invalid byte sequence: " + bytes);
- return false;
- }
- for (int i = 0; i < bytes.size(); i += 2) {
- Debug.DCHECK(IsValidKanji(bytes[i], bytes[i + 1]));
- final int code = (static_cast<int>(bytes[i]) << 8 | bytes[i + 1]);
+ static void appendKanjiBytes(String content, BitVector bits) throws WriterException {
+ byte[] bytes;
+ try {
+ bytes = content.getBytes("Shift_JIS");
+ } catch (UnsupportedEncodingException uee) {
+ throw new WriterException(uee.toString());
+ }
+ 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;
subtracted = code - 0xc140;
}
if (subtracted == -1) {
- Debug.LOG_ERROR("Invalid byte sequence: " + bytes);
- return false;
- }
- final int encoded = ((subtracted >> 8) * 0xc0) + (subtracted & 0xff);
- bits.AppendBits(encoded, 13);
- }
- return true;
- }
-
- // Only call once
- static {
- InitECPolynomials();
- }
-
- // Initialize "g_ec_polynomials" with numbers in kECPolynomials.
- private static void InitECPolynomials() {
- final GaloisField &field = GaloisField.GetField(kFieldSize);
- for (int i = 0; i < arraysize(kECPolynomials); ++i) {
- final ECPolyInfo& ec_poly_info = kECPolynomials[i];
- final int ec_length = ec_poly_info.ec_length;
- vector<GF_Element> *coeffs = new vector<GF_Element>;
- // The number of coefficients is one more than "ec_length".
- // That's why the termination condition is <= instead of <.
- for (int j = 0; j <= ec_length; ++j) {
- // We need exp'ed numbers for later use.
- final int coeff = field.Exp(ec_poly_info.coeffs[j]);
- coeffs.push_back(coeff);
- }
- // Reverse the coefficients since the numbers in kECPolynomials
- // are ordered in reverse order to the order GF_Poly expects.
- reverse(coeffs.begin(), coeffs.end());
-
- GF_Poly *ec_poly = new GF_Poly(coeffs, GaloisField.GetField(kFieldSize));
- g_ec_polynomials[ec_length] = ec_poly;
- }
- }
-
- // Get error correction polynomials. The polynomials are
- // defined in Appendix A of JISX0510 2004 (p. 59). In the appendix,
- // they use exponential notations for the polynomials. We need to
- // apply GaloisField.Log() to all coefficients generated by the
- // function to compare numbers with the ones in the appendix.
- //
- // Example:
- // - Input: 17
- // - Output (in reverse order)
- // {119,66,83,120,119,22,197,83,249,41,143,134,85,53,125,99,79}
- // - Log()'ed output (in reverse order)
- // {0,43,139,206,78,43,239,123,206,214,147,24,99,150,39,243,163,136}
- static final GF_Poly &GetECPoly(int ec_length) {
- Debug.DCHECK_GE(kMaxNumECBytes, ec_length);
- final GF_Poly *ec_poly = g_ec_polynomials[ec_length];
- Debug.DCHECK(ec_poly);
- return *ec_poly;
- }
-
- // Generate error correction bytes of "ec_length".
- //
- // Example:
- // - Input: {32,65,205,69,41,220,46,128,236}, ec_length = 17
- // - Output: {42,159,74,221,244,169,239,150,138,70,237,85,224,96,74,219,61}
- static void GenerateECBytes(final StringPiece &data_bytes,
- int ec_length,
- String *ec_bytes) {
- // First, fill the vector with "ec_length" copies of 0.
- // They are low-order zero coefficients.
- vector<GF_Element> *coeffs = new vector<GF_Element>(ec_length, 0);
- // Then copy data_bytes backward.
- copy(data_bytes.rbegin(), data_bytes.rend(), back_inserter(*coeffs));
- // Now we have data polynomial.
- GF_Poly data_poly(coeffs, GaloisField.GetField(kFieldSize));
-
- // Get error correction polynomial.
- final GF_Poly &ec_poly = GetECPoly(ec_length);
- pair<GF_Poly*, GF_Poly*> divrem = GF_Poly.DivRem(data_poly, ec_poly);
-
- // Basically, the coefficients in the remainder polynomial are the
- // error correction bytes.
- GF_Poly *remainder = divrem.second;
- ec_bytes.reserve(ec_length);
- // However, high-order zero cofficients in the remainder polynomial
- // are ommited. We should add zero by ourselvs.
- final int num_pruned_zero_coeffs = ec_length - (remainder.degree() + 1);
- for (int i = 0; i < num_pruned_zero_coeffs; ++i) {
- ec_bytes.push_back(0);
- }
- // Copy the remainder numbers to "ec_bytes".
- for (int i = remainder.degree(); i >= 0; --i) {
- ec_bytes.push_back(remainder.coeff(i));
- }
- Debug.DCHECK_EQ(ec_length, ec_bytes.size());
-
- // Deallocate quotient and reminder.
- delete divrem.first;
- delete divrem.second;
- }
-
- // Check if "byte1" and "byte2" can compose a valid Kanji letter
- // (2-byte Shift_JIS letter).
- // The numbers are from http://ja.wikipedia.org/wiki/Shift_JIS.
- static boolean IsValidKanji(final char byte1, final char byte2) {
- return (byte2 != 0x7f &&
- ((byte1 >= 0x81 && byte1 <= 0x9f &&
- byte2 >= 0x40 && byte2 <= 0xfc) ||
- ((byte1 >= 0xe0 && byte1 <= 0xfc &&
- byte2 >= 0x40 && byte2 <= 0xfc))));
- }
-
- // Check if "bytes" is a valid Kanji sequence.
- static boolean IsValidKanjiSequence(final StringPiece &bytes) {
- if (bytes.size() % 2 != 0) {
- return false;
- }
- int i = 0;
- for (; i < bytes.size(); i += 2) {
- if (!IsValidKanji(bytes[i], bytes[i + 1])) {
- break;
+ throw new WriterException("Invalid byte sequence");
}
+ int encoded = ((subtracted >> 8) * 0xc0) + (subtracted & 0xff);
+ bits.appendBits(encoded, 13);
}
- return i == bytes.size(); // Consumed all bytes?
}
}
projects / zxing.git / blobdiff