2 * Copyright 2007 ZXing authors
\r
4 * Licensed under the Apache License, Version 2.0 (the "License");
\r
5 * you may not use this file except in compliance with the License.
\r
6 * You may obtain a copy of the License at
\r
8 * http://www.apache.org/licenses/LICENSE-2.0
\r
10 * Unless required by applicable law or agreed to in writing, software
\r
11 * distributed under the License is distributed on an "AS IS" BASIS,
\r
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
\r
13 * See the License for the specific language governing permissions and
\r
14 * limitations under the License.
\r
17 namespace com.google.zxing.qrcode.decoder
\r
20 /// <summary> <p>Encapsulates a block of data within a QR Code. QR Codes may split their data into
\r
21 /// multiple blocks, each of which is a unit of data and error-correction codewords. Each
\r
22 /// is represented by an instance of this class.</p>
\r
25 /// <author> Sean Owen
\r
27 /// <author>www.Redivivus.in (suraj.supekar@redivivus.in) - Ported from ZXING Java Source
\r
29 sealed class DataBlock
\r
31 internal int NumDataCodewords
\r
35 return numDataCodewords;
\r
39 internal sbyte[] Codewords
\r
48 //UPGRADE_NOTE: Final was removed from the declaration of 'numDataCodewords '. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1003'"
\r
49 private int numDataCodewords;
\r
50 //UPGRADE_NOTE: Final was removed from the declaration of 'codewords '. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1003'"
\r
51 private sbyte[] codewords;
\r
53 private DataBlock(int numDataCodewords, sbyte[] codewords)
\r
55 this.numDataCodewords = numDataCodewords;
\r
56 this.codewords = codewords;
\r
59 /// <summary> <p>When QR Codes use multiple data blocks, they are actually interleaved.
\r
60 /// That is, the first byte of data block 1 to n is written, then the second bytes, and so on. This
\r
61 /// method will separate the data into original blocks.</p>
\r
64 /// <param name="rawCodewords">bytes as read directly from the QR Code
\r
66 /// <param name="version">version of the QR Code
\r
68 /// <param name="ecLevel">error-correction level of the QR Code
\r
70 /// <returns> {@link DataBlock}s containing original bytes, "de-interleaved" from representation in the
\r
73 internal static DataBlock[] getDataBlocks(sbyte[] rawCodewords, Version version, ErrorCorrectionLevel ecLevel)
\r
76 if (rawCodewords.Length != version.TotalCodewords)
\r
78 throw new System.ArgumentException();
\r
81 // Figure out the number and size of data blocks used by this version and
\r
82 // error correction level
\r
83 Version.ECBlocks ecBlocks = version.getECBlocksForLevel(ecLevel);
\r
85 // First count the total number of data blocks
\r
86 int totalBlocks = 0;
\r
87 Version.ECB[] ecBlockArray = ecBlocks.getECBlocks();
\r
88 for (int i = 0; i < ecBlockArray.Length; i++)
\r
90 totalBlocks += ecBlockArray[i].Count;
\r
93 // Now establish DataBlocks of the appropriate size and number of data codewords
\r
94 DataBlock[] result = new DataBlock[totalBlocks];
\r
95 int numResultBlocks = 0;
\r
96 for (int j = 0; j < ecBlockArray.Length; j++)
\r
98 Version.ECB ecBlock = ecBlockArray[j];
\r
99 for (int i = 0; i < ecBlock.Count; i++)
\r
101 int numDataCodewords = ecBlock.DataCodewords;
\r
102 int numBlockCodewords = ecBlocks.ECCodewordsPerBlock + numDataCodewords;
\r
103 result[numResultBlocks++] = new DataBlock(numDataCodewords, new sbyte[numBlockCodewords]);
\r
107 // All blocks have the same amount of data, except that the last n
\r
108 // (where n may be 0) have 1 more byte. Figure out where these start.
\r
109 int shorterBlocksTotalCodewords = result[0].codewords.Length;
\r
110 int longerBlocksStartAt = result.Length - 1;
\r
111 while (longerBlocksStartAt >= 0)
\r
113 int numCodewords = result[longerBlocksStartAt].codewords.Length;
\r
114 if (numCodewords == shorterBlocksTotalCodewords)
\r
118 longerBlocksStartAt--;
\r
120 longerBlocksStartAt++;
\r
122 int shorterBlocksNumDataCodewords = shorterBlocksTotalCodewords - ecBlocks.ECCodewordsPerBlock;
\r
123 // The last elements of result may be 1 element longer;
\r
124 // first fill out as many elements as all of them have
\r
125 int rawCodewordsOffset = 0;
\r
126 for (int i = 0; i < shorterBlocksNumDataCodewords; i++)
\r
128 for (int j = 0; j < numResultBlocks; j++)
\r
130 result[j].codewords[i] = rawCodewords[rawCodewordsOffset++];
\r
133 // Fill out the last data block in the longer ones
\r
134 for (int j = longerBlocksStartAt; j < numResultBlocks; j++)
\r
136 result[j].codewords[shorterBlocksNumDataCodewords] = rawCodewords[rawCodewordsOffset++];
\r
138 // Now add in error correction blocks
\r
139 int max = result[0].codewords.Length;
\r
140 for (int i = shorterBlocksNumDataCodewords; i < max; i++)
\r
142 for (int j = 0; j < numResultBlocks; j++)
\r
144 int iOffset = j < longerBlocksStartAt?i:i + 1;
\r
145 result[j].codewords[iOffset] = rawCodewords[rawCodewordsOffset++];
\r