/// Inverses the specified a.
@@ -130,6 +186,8 @@ namespace ZXing.Common.ReedSolomon
/// multiplicative inverse of a
internal int inverse(int a)
{
+ checkInit();
+
if (a == 0)
{
throw new ArithmeticException();
@@ -145,6 +203,8 @@ namespace ZXing.Common.ReedSolomon
/// product of a and b in GF(size)
internal int multiply(int a, int b)
{
+ checkInit();
+
if (a == 0 || b == 0)
{
return 0;
@@ -152,6 +212,14 @@ namespace ZXing.Common.ReedSolomon
return expTable[(logTable[a] + logTable[b]) % (size - 1)];
}
+ ///
+ /// Gets the size.
+ ///
+ public int Size
+ {
+ get { return size; }
+ }
+
///
/// Gets the generator base.
///
@@ -159,5 +227,16 @@ namespace ZXing.Common.ReedSolomon
{
get { return generatorBase; }
}
+
+ ///
+ /// Returns a that represents this instance.
+ ///
+ ///
+ /// A that represents this instance.
+ ///
+ override public String ToString()
+ {
+ return "GF(0x" + primitive.ToString("X") + ',' + size + ')';
+ }
}
}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/GenericGFPoly.cs b/shadowsocks-csharp/3rd/zxing/common/reedsolomon/GenericGFPoly.cs
similarity index 69%
rename from shadowsocks-csharp/3rd/zxing/GenericGFPoly.cs
rename to shadowsocks-csharp/3rd/zxing/common/reedsolomon/GenericGFPoly.cs
index eb966579..427fe11d 100755
--- a/shadowsocks-csharp/3rd/zxing/GenericGFPoly.cs
+++ b/shadowsocks-csharp/3rd/zxing/common/reedsolomon/GenericGFPoly.cs
@@ -59,7 +59,7 @@ namespace ZXing.Common.ReedSolomon
}
if (firstNonZero == coefficientsLength)
{
- this.coefficients = new int[]{0};
+ this.coefficients = field.Zero.coefficients;
}
else
{
@@ -112,6 +112,36 @@ namespace ZXing.Common.ReedSolomon
return coefficients[coefficients.Length - 1 - degree];
}
+ ///
+ /// evaluation of this polynomial at a given point
+ ///
+ /// A.
+ /// evaluation of this polynomial at a given point
+ internal int evaluateAt(int a)
+ {
+ int result = 0;
+ if (a == 0)
+ {
+ // Just return the x^0 coefficient
+ return getCoefficient(0);
+ }
+ int size = coefficients.Length;
+ if (a == 1)
+ {
+ // Just the sum of the coefficients
+ foreach (var coefficient in coefficients)
+ {
+ result = GenericGF.addOrSubtract(result, coefficient);
+ }
+ return result;
+ }
+ result = coefficients[0];
+ for (int i = 1; i < size; i++)
+ {
+ result = GenericGF.addOrSubtract(field.multiply(a, result), coefficients[i]);
+ }
+ return result;
+ }
internal GenericGFPoly addOrSubtract(GenericGFPoly other)
{
@@ -176,6 +206,24 @@ namespace ZXing.Common.ReedSolomon
return new GenericGFPoly(field, product);
}
+ internal GenericGFPoly multiply(int scalar)
+ {
+ if (scalar == 0)
+ {
+ return field.Zero;
+ }
+ if (scalar == 1)
+ {
+ return this;
+ }
+ int size = coefficients.Length;
+ int[] product = new int[size];
+ for (int i = 0; i < size; i++)
+ {
+ product[i] = field.multiply(coefficients[i], scalar);
+ }
+ return new GenericGFPoly(field, product);
+ }
internal GenericGFPoly multiplyByMonomial(int degree, int coefficient)
{
@@ -226,5 +274,58 @@ namespace ZXing.Common.ReedSolomon
return new GenericGFPoly[] { quotient, remainder };
}
+ public override String ToString()
+ {
+ StringBuilder result = new StringBuilder(8 * Degree);
+ for (int degree = Degree; degree >= 0; degree--)
+ {
+ int coefficient = getCoefficient(degree);
+ if (coefficient != 0)
+ {
+ if (coefficient < 0)
+ {
+ result.Append(" - ");
+ coefficient = -coefficient;
+ }
+ else
+ {
+ if (result.Length > 0)
+ {
+ result.Append(" + ");
+ }
+ }
+ if (degree == 0 || coefficient != 1)
+ {
+ int alphaPower = field.log(coefficient);
+ if (alphaPower == 0)
+ {
+ result.Append('1');
+ }
+ else if (alphaPower == 1)
+ {
+ result.Append('a');
+ }
+ else
+ {
+ result.Append("a^");
+ result.Append(alphaPower);
+ }
+ }
+ if (degree != 0)
+ {
+ if (degree == 1)
+ {
+ result.Append('x');
+ }
+ else
+ {
+ result.Append("x^");
+ result.Append(degree);
+ }
+ }
+ }
+ }
+ return result.ToString();
+ }
}
}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/common/reedsolomon/ReedSolomonDecoder.cs b/shadowsocks-csharp/3rd/zxing/common/reedsolomon/ReedSolomonDecoder.cs
new file mode 100755
index 00000000..1030a56d
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/common/reedsolomon/ReedSolomonDecoder.cs
@@ -0,0 +1,227 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+namespace ZXing.Common.ReedSolomon
+{
+ /// Implements Reed-Solomon decoding, as the name implies.
+ ///
+ /// The algorithm will not be explained here, but the following references were helpful
+ /// in creating this implementation:
+ ///
+ ///
+ ///
+ /// Much credit is due to William Rucklidge since portions of this code are an indirect
+ /// port of his C++ Reed-Solomon implementation.
+ ///
+ ///
+ /// Sean Owen
+ /// William Rucklidge
+ /// sanfordsquires
+ public sealed class ReedSolomonDecoder
+ {
+ private readonly GenericGF field;
+
+ public ReedSolomonDecoder(GenericGF field)
+ {
+ this.field = field;
+ }
+
+ ///
+ /// Decodes given set of received codewords, which include both data and error-correction
+ /// codewords. Really, this means it uses Reed-Solomon to detect and correct errors, in-place,
+ /// in the input.
+ ///
+ /// data and error-correction codewords
+ /// number of error-correction codewords available
+ /// false: decoding fails
+ public bool decode(int[] received, int twoS)
+ {
+ var poly = new GenericGFPoly(field, received);
+ var syndromeCoefficients = new int[twoS];
+ var noError = true;
+ for (var i = 0; i < twoS; i++)
+ {
+ var eval = poly.evaluateAt(field.exp(i + field.GeneratorBase));
+ syndromeCoefficients[syndromeCoefficients.Length - 1 - i] = eval;
+ if (eval != 0)
+ {
+ noError = false;
+ }
+ }
+ if (noError)
+ {
+ return true;
+ }
+ var syndrome = new GenericGFPoly(field, syndromeCoefficients);
+
+ var sigmaOmega = runEuclideanAlgorithm(field.buildMonomial(twoS, 1), syndrome, twoS);
+ if (sigmaOmega == null)
+ return false;
+
+ var sigma = sigmaOmega[0];
+ var errorLocations = findErrorLocations(sigma);
+ if (errorLocations == null)
+ return false;
+
+ var omega = sigmaOmega[1];
+ var errorMagnitudes = findErrorMagnitudes(omega, errorLocations);
+ for (var i = 0; i < errorLocations.Length; i++)
+ {
+ var position = received.Length - 1 - field.log(errorLocations[i]);
+ if (position < 0)
+ {
+ // throw new ReedSolomonException("Bad error location");
+ return false;
+ }
+ received[position] = GenericGF.addOrSubtract(received[position], errorMagnitudes[i]);
+ }
+
+ return true;
+ }
+
+ internal GenericGFPoly[] runEuclideanAlgorithm(GenericGFPoly a, GenericGFPoly b, int R)
+ {
+ // Assume a's degree is >= b's
+ if (a.Degree < b.Degree)
+ {
+ GenericGFPoly temp = a;
+ a = b;
+ b = temp;
+ }
+
+ GenericGFPoly rLast = a;
+ GenericGFPoly r = b;
+ GenericGFPoly tLast = field.Zero;
+ GenericGFPoly t = field.One;
+
+ // Run Euclidean algorithm until r's degree is less than R/2
+ while (r.Degree >= R / 2)
+ {
+ GenericGFPoly rLastLast = rLast;
+ GenericGFPoly tLastLast = tLast;
+ rLast = r;
+ tLast = t;
+
+ // Divide rLastLast by rLast, with quotient in q and remainder in r
+ if (rLast.isZero)
+ {
+ // Oops, Euclidean algorithm already terminated?
+ // throw new ReedSolomonException("r_{i-1} was zero");
+ return null;
+ }
+ r = rLastLast;
+ GenericGFPoly q = field.Zero;
+ int denominatorLeadingTerm = rLast.getCoefficient(rLast.Degree);
+ int dltInverse = field.inverse(denominatorLeadingTerm);
+ while (r.Degree >= rLast.Degree && !r.isZero)
+ {
+ int degreeDiff = r.Degree - rLast.Degree;
+ int scale = field.multiply(r.getCoefficient(r.Degree), dltInverse);
+ q = q.addOrSubtract(field.buildMonomial(degreeDiff, scale));
+ r = r.addOrSubtract(rLast.multiplyByMonomial(degreeDiff, scale));
+ }
+
+ t = q.multiply(tLast).addOrSubtract(tLastLast);
+
+ if (r.Degree >= rLast.Degree)
+ {
+ // throw new IllegalStateException("Division algorithm failed to reduce polynomial?");
+ return null;
+ }
+ }
+
+ int sigmaTildeAtZero = t.getCoefficient(0);
+ if (sigmaTildeAtZero == 0)
+ {
+ // throw new ReedSolomonException("sigmaTilde(0) was zero");
+ return null;
+ }
+
+ int inverse = field.inverse(sigmaTildeAtZero);
+ GenericGFPoly sigma = t.multiply(inverse);
+ GenericGFPoly omega = r.multiply(inverse);
+ return new GenericGFPoly[] { sigma, omega };
+ }
+
+ private int[] findErrorLocations(GenericGFPoly errorLocator)
+ {
+ // This is a direct application of Chien's search
+ int numErrors = errorLocator.Degree;
+ if (numErrors == 1)
+ {
+ // shortcut
+ return new int[] { errorLocator.getCoefficient(1) };
+ }
+ int[] result = new int[numErrors];
+ int e = 0;
+ for (int i = 1; i < field.Size && e < numErrors; i++)
+ {
+ if (errorLocator.evaluateAt(i) == 0)
+ {
+ result[e] = field.inverse(i);
+ e++;
+ }
+ }
+ if (e != numErrors)
+ {
+ // throw new ReedSolomonException("Error locator degree does not match number of roots");
+ return null;
+ }
+ return result;
+ }
+
+ private int[] findErrorMagnitudes(GenericGFPoly errorEvaluator, int[] errorLocations)
+ {
+ // This is directly applying Forney's Formula
+ int s = errorLocations.Length;
+ int[] result = new int[s];
+ for (int i = 0; i < s; i++)
+ {
+ int xiInverse = field.inverse(errorLocations[i]);
+ int denominator = 1;
+ for (int j = 0; j < s; j++)
+ {
+ if (i != j)
+ {
+ //denominator = field.multiply(denominator,
+ // GenericGF.addOrSubtract(1, field.multiply(errorLocations[j], xiInverse)));
+ // Above should work but fails on some Apple and Linux JDKs due to a Hotspot bug.
+ // Below is a funny-looking workaround from Steven Parkes
+ int term = field.multiply(errorLocations[j], xiInverse);
+ int termPlus1 = (term & 0x1) == 0 ? term | 1 : term & ~1;
+ denominator = field.multiply(denominator, termPlus1);
+
+ // removed in java version, not sure if this is right
+ // denominator = field.multiply(denominator, GenericGF.addOrSubtract(1, field.multiply(errorLocations[j], xiInverse)));
+ }
+ }
+ result[i] = field.multiply(errorEvaluator.evaluateAt(xiInverse), field.inverse(denominator));
+ if (field.GeneratorBase != 0)
+ {
+ result[i] = field.multiply(result[i], xiInverse);
+ }
+ }
+ return result;
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/ReedSolomonEncoder.cs b/shadowsocks-csharp/3rd/zxing/common/reedsolomon/ReedSolomonEncoder.cs
similarity index 100%
rename from shadowsocks-csharp/3rd/zxing/ReedSolomonEncoder.cs
rename to shadowsocks-csharp/3rd/zxing/common/reedsolomon/ReedSolomonEncoder.cs
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/decoder/BitMatrixParser.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/BitMatrixParser.cs
new file mode 100755
index 00000000..6a328faa
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/BitMatrixParser.cs
@@ -0,0 +1,281 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using ZXing.Common;
+
+namespace ZXing.QrCode.Internal
+{
+ /// Sean Owen
+ sealed class BitMatrixParser
+ {
+ private readonly BitMatrix bitMatrix;
+ private Version parsedVersion;
+ private FormatInformation parsedFormatInfo;
+ private bool mirrored;
+
+ /// {@link BitMatrix} to parse
+ /// ReaderException if dimension is not >= 21 and 1 mod 4
+ internal static BitMatrixParser createBitMatrixParser(BitMatrix bitMatrix)
+ {
+ int dimension = bitMatrix.Height;
+ if (dimension < 21 || (dimension & 0x03) != 1)
+ {
+ return null;
+ }
+ return new BitMatrixParser(bitMatrix);
+ }
+
+ private BitMatrixParser(BitMatrix bitMatrix)
+ {
+ // Should only be called from createBitMatrixParser with the important checks before
+ this.bitMatrix = bitMatrix;
+ }
+
+ /// Reads format information from one of its two locations within the QR Code.
+ ///
+ ///
+ /// {@link FormatInformation} encapsulating the QR Code's format info
+ ///
+ /// ReaderException if both format information locations cannot be parsed as
+ /// the valid encoding of format information
+ ///
+ internal FormatInformation readFormatInformation()
+ {
+ if (parsedFormatInfo != null)
+ {
+ return parsedFormatInfo;
+ }
+
+ // Read top-left format info bits
+ int formatInfoBits1 = 0;
+ for (int i = 0; i < 6; i++)
+ {
+ formatInfoBits1 = copyBit(i, 8, formatInfoBits1);
+ }
+ // .. and skip a bit in the timing pattern ...
+ formatInfoBits1 = copyBit(7, 8, formatInfoBits1);
+ formatInfoBits1 = copyBit(8, 8, formatInfoBits1);
+ formatInfoBits1 = copyBit(8, 7, formatInfoBits1);
+ // .. and skip a bit in the timing pattern ...
+ for (int j = 5; j >= 0; j--)
+ {
+ formatInfoBits1 = copyBit(8, j, formatInfoBits1);
+ }
+ // Read the top-right/bottom-left pattern too
+ int dimension = bitMatrix.Height;
+ int formatInfoBits2 = 0;
+ int jMin = dimension - 7;
+ for (int j = dimension - 1; j >= jMin; j--)
+ {
+ formatInfoBits2 = copyBit(8, j, formatInfoBits2);
+ }
+ for (int i = dimension - 8; i < dimension; i++)
+ {
+ formatInfoBits2 = copyBit(i, 8, formatInfoBits2);
+ }
+
+ parsedFormatInfo = FormatInformation.decodeFormatInformation(formatInfoBits1, formatInfoBits2);
+ if (parsedFormatInfo != null)
+ {
+ return parsedFormatInfo;
+ }
+ return null;
+ }
+
+ /// Reads version information from one of its two locations within the QR Code.
+ ///
+ ///
+ /// {@link Version} encapsulating the QR Code's version
+ ///
+ /// ReaderException if both version information locations cannot be parsed as
+ /// the valid encoding of version information
+ ///
+ internal Version readVersion()
+ {
+ if (parsedVersion != null)
+ {
+ return parsedVersion;
+ }
+
+ int dimension = bitMatrix.Height;
+
+ int provisionalVersion = (dimension - 17) >> 2;
+ if (provisionalVersion <= 6)
+ {
+ return Version.getVersionForNumber(provisionalVersion);
+ }
+
+ // Read top-right version info: 3 wide by 6 tall
+ int versionBits = 0;
+ int ijMin = dimension - 11;
+ for (int j = 5; j >= 0; j--)
+ {
+ for (int i = dimension - 9; i >= ijMin; i--)
+ {
+ versionBits = copyBit(i, j, versionBits);
+ }
+ }
+
+ parsedVersion = Version.decodeVersionInformation(versionBits);
+ if (parsedVersion != null && parsedVersion.DimensionForVersion == dimension)
+ {
+ return parsedVersion;
+ }
+
+ // Hmm, failed. Try bottom left: 6 wide by 3 tall
+ versionBits = 0;
+ for (int i = 5; i >= 0; i--)
+ {
+ for (int j = dimension - 9; j >= ijMin; j--)
+ {
+ versionBits = copyBit(i, j, versionBits);
+ }
+ }
+
+ parsedVersion = Version.decodeVersionInformation(versionBits);
+ if (parsedVersion != null && parsedVersion.DimensionForVersion == dimension)
+ {
+ return parsedVersion;
+ }
+ return null;
+ }
+
+ private int copyBit(int i, int j, int versionBits)
+ {
+ bool bit = mirrored ? bitMatrix[j, i] : bitMatrix[i, j];
+ return bit ? (versionBits << 1) | 0x1 : versionBits << 1;
+ }
+
+ /// Reads the bits in the {@link BitMatrix} representing the finder pattern in the
+ /// correct order in order to reconstruct the codewords bytes contained within the
+ /// QR Code.
+ ///
+ ///
+ /// bytes encoded within the QR Code
+ ///
+ /// ReaderException if the exact number of bytes expected is not read
+ internal byte[] readCodewords()
+ {
+ FormatInformation formatInfo = readFormatInformation();
+ if (formatInfo == null)
+ return null;
+ Version version = readVersion();
+ if (version == null)
+ return null;
+
+ // Get the data mask for the format used in this QR Code. This will exclude
+ // some bits from reading as we wind through the bit matrix.
+ DataMask dataMask = DataMask.forReference(formatInfo.DataMask);
+ int dimension = bitMatrix.Height;
+ dataMask.unmaskBitMatrix(bitMatrix, dimension);
+
+ BitMatrix functionPattern = version.buildFunctionPattern();
+
+ bool readingUp = true;
+ byte[] result = new byte[version.TotalCodewords];
+ int resultOffset = 0;
+ int currentByte = 0;
+ int bitsRead = 0;
+ // Read columns in pairs, from right to left
+ for (int j = dimension - 1; j > 0; j -= 2)
+ {
+ if (j == 6)
+ {
+ // Skip whole column with vertical alignment pattern;
+ // saves time and makes the other code proceed more cleanly
+ j--;
+ }
+ // Read alternatingly from bottom to top then top to bottom
+ for (int count = 0; count < dimension; count++)
+ {
+ int i = readingUp ? dimension - 1 - count : count;
+ for (int col = 0; col < 2; col++)
+ {
+ // Ignore bits covered by the function pattern
+ if (!functionPattern[j - col, i])
+ {
+ // Read a bit
+ bitsRead++;
+ currentByte <<= 1;
+ if (bitMatrix[j - col, i])
+ {
+ currentByte |= 1;
+ }
+ // If we've made a whole byte, save it off
+ if (bitsRead == 8)
+ {
+ result[resultOffset++] = (byte)currentByte;
+ bitsRead = 0;
+ currentByte = 0;
+ }
+ }
+ }
+ }
+ readingUp ^= true; // readingUp = !readingUp; // switch directions
+ }
+ if (resultOffset != version.TotalCodewords)
+ {
+ return null;
+ }
+ return result;
+ }
+
+ /**
+ * Revert the mask removal done while reading the code words. The bit matrix should revert to its original state.
+ */
+ internal void remask()
+ {
+ if (parsedFormatInfo == null)
+ {
+ return; // We have no format information, and have no data mask
+ }
+ DataMask dataMask = DataMask.forReference(parsedFormatInfo.DataMask);
+ int dimension = bitMatrix.Height;
+ dataMask.unmaskBitMatrix(bitMatrix, dimension);
+ }
+
+ /**
+ * Prepare the parser for a mirrored operation.
+ * This flag has effect only on the {@link #readFormatInformation()} and the
+ * {@link #readVersion()}. Before proceeding with {@link #readCodewords()} the
+ * {@link #mirror()} method should be called.
+ *
+ * @param mirror Whether to read version and format information mirrored.
+ */
+ internal void setMirror(bool mirror)
+ {
+ parsedVersion = null;
+ parsedFormatInfo = null;
+ mirrored = mirror;
+ }
+
+ /** Mirror the bit matrix in order to attempt a second reading. */
+ internal void mirror()
+ {
+ for (int x = 0; x < bitMatrix.Width; x++)
+ {
+ for (int y = x + 1; y < bitMatrix.Height; y++)
+ {
+ if (bitMatrix[x, y] != bitMatrix[y, x])
+ {
+ bitMatrix.flip(y, x);
+ bitMatrix.flip(x, y);
+ }
+ }
+ }
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/decoder/DataBlock.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/DataBlock.cs
new file mode 100755
index 00000000..5860fe6a
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/DataBlock.cs
@@ -0,0 +1,146 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+namespace ZXing.QrCode.Internal
+{
+ /// Encapsulates a block of data within a QR Code. QR Codes may split their data into
+ /// multiple blocks, each of which is a unit of data and error-correction codewords. Each
+ /// is represented by an instance of this class.
+ ///
+ ///
+ /// Sean Owen
+ ///
+ /// www.Redivivus.in (suraj.supekar@redivivus.in) - Ported from ZXING Java Source
+ ///
+ internal sealed class DataBlock
+ {
+ private readonly int numDataCodewords;
+ private readonly byte[] codewords;
+
+ private DataBlock(int numDataCodewords, byte[] codewords)
+ {
+ this.numDataCodewords = numDataCodewords;
+ this.codewords = codewords;
+ }
+
+ /// When QR Codes use multiple data blocks, they are actually interleaved.
+ /// That is, the first byte of data block 1 to n is written, then the second bytes, and so on. This
+ /// method will separate the data into original blocks.
+ ///
+ ///
+ /// bytes as read directly from the QR Code
+ ///
+ /// version of the QR Code
+ ///
+ /// error-correction level of the QR Code
+ ///
+ /// {@link DataBlock}s containing original bytes, "de-interleaved" from representation in the
+ /// QR Code
+ ///
+ internal static DataBlock[] getDataBlocks(byte[] rawCodewords, Version version, ErrorCorrectionLevel ecLevel)
+ {
+
+ if (rawCodewords.Length != version.TotalCodewords)
+ {
+ throw new System.ArgumentException();
+ }
+
+ // Figure out the number and size of data blocks used by this version and
+ // error correction level
+ Version.ECBlocks ecBlocks = version.getECBlocksForLevel(ecLevel);
+
+ // First count the total number of data blocks
+ int totalBlocks = 0;
+ Version.ECB[] ecBlockArray = ecBlocks.getECBlocks();
+ foreach (var ecBlock in ecBlockArray)
+ {
+ totalBlocks += ecBlock.Count;
+ }
+
+ // Now establish DataBlocks of the appropriate size and number of data codewords
+ DataBlock[] result = new DataBlock[totalBlocks];
+ int numResultBlocks = 0;
+ foreach (var ecBlock in ecBlockArray)
+ {
+ for (int i = 0; i < ecBlock.Count; i++)
+ {
+ int numDataCodewords = ecBlock.DataCodewords;
+ int numBlockCodewords = ecBlocks.ECCodewordsPerBlock + numDataCodewords;
+ result[numResultBlocks++] = new DataBlock(numDataCodewords, new byte[numBlockCodewords]);
+ }
+ }
+
+ // All blocks have the same amount of data, except that the last n
+ // (where n may be 0) have 1 more byte. Figure out where these start.
+ int shorterBlocksTotalCodewords = result[0].codewords.Length;
+ int longerBlocksStartAt = result.Length - 1;
+ while (longerBlocksStartAt >= 0)
+ {
+ int numCodewords = result[longerBlocksStartAt].codewords.Length;
+ if (numCodewords == shorterBlocksTotalCodewords)
+ {
+ break;
+ }
+ longerBlocksStartAt--;
+ }
+ longerBlocksStartAt++;
+
+ int shorterBlocksNumDataCodewords = shorterBlocksTotalCodewords - ecBlocks.ECCodewordsPerBlock;
+ // The last elements of result may be 1 element longer;
+ // first fill out as many elements as all of them have
+ int rawCodewordsOffset = 0;
+ for (int i = 0; i < shorterBlocksNumDataCodewords; i++)
+ {
+ for (int j = 0; j < numResultBlocks; j++)
+ {
+ result[j].codewords[i] = rawCodewords[rawCodewordsOffset++];
+ }
+ }
+ // Fill out the last data block in the longer ones
+ for (int j = longerBlocksStartAt; j < numResultBlocks; j++)
+ {
+ result[j].codewords[shorterBlocksNumDataCodewords] = rawCodewords[rawCodewordsOffset++];
+ }
+ // Now add in error correction blocks
+ int max = result[0].codewords.Length;
+ for (int i = shorterBlocksNumDataCodewords; i < max; i++)
+ {
+ for (int j = 0; j < numResultBlocks; j++)
+ {
+ int iOffset = j < longerBlocksStartAt ? i : i + 1;
+ result[j].codewords[iOffset] = rawCodewords[rawCodewordsOffset++];
+ }
+ }
+ return result;
+ }
+
+ internal int NumDataCodewords
+ {
+ get
+ {
+ return numDataCodewords;
+ }
+ }
+
+ internal byte[] Codewords
+ {
+ get
+ {
+ return codewords;
+ }
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/decoder/DataMask.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/DataMask.cs
new file mode 100755
index 00000000..a6ac93e6
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/DataMask.cs
@@ -0,0 +1,165 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using ZXing.Common;
+
+namespace ZXing.QrCode.Internal
+{
+ /// Encapsulates data masks for the data bits in a QR code, per ISO 18004:2006 6.8. Implementations
+ /// of this class can un-mask a raw BitMatrix. For simplicity, they will unmask the entire BitMatrix,
+ /// including areas used for finder patterns, timing patterns, etc. These areas should be unused
+ /// after the point they are unmasked anyway.
+ ///
+ /// Note that the diagram in section 6.8.1 is misleading since it indicates that i is column position
+ /// and j is row position. In fact, as the text says, i is row position and j is column position.
+ ///
+ ///
+ /// Sean Owen
+ ///
+ /// www.Redivivus.in (suraj.supekar@redivivus.in) - Ported from ZXING Java Source
+ ///
+ abstract class DataMask
+ {
+ /// See ISO 18004:2006 6.8.1
+ private static readonly DataMask[] DATA_MASKS = new DataMask[]
+ {
+ new DataMask000(),
+ new DataMask001(),
+ new DataMask010(),
+ new DataMask011(),
+ new DataMask100(),
+ new DataMask101(),
+ new DataMask110(),
+ new DataMask111()
+ };
+
+ private DataMask()
+ {
+ }
+
+ /// Implementations of this method reverse the data masking process applied to a QR Code and
+ /// make its bits ready to read.
+ ///
+ ///
+ /// representation of QR Code bits
+ ///
+ /// dimension of QR Code, represented by bits, being unmasked
+ ///
+ internal void unmaskBitMatrix(BitMatrix bits, int dimension)
+ {
+ for (int i = 0; i < dimension; i++)
+ {
+ for (int j = 0; j < dimension; j++)
+ {
+ if (isMasked(i, j))
+ {
+ bits.flip(j, i);
+ }
+ }
+ }
+ }
+
+ internal abstract bool isMasked(int i, int j);
+
+ /// a value between 0 and 7 indicating one of the eight possible
+ /// data mask patterns a QR Code may use
+ ///
+ /// {@link DataMask} encapsulating the data mask pattern
+ ///
+ internal static DataMask forReference(int reference)
+ {
+ if (reference < 0 || reference > 7)
+ {
+ throw new System.ArgumentException();
+ }
+ return DATA_MASKS[reference];
+ }
+
+ /// 000: mask bits for which (x + y) mod 2 == 0
+ private sealed class DataMask000 : DataMask
+ {
+ internal override bool isMasked(int i, int j)
+ {
+ return ((i + j) & 0x01) == 0;
+ }
+ }
+
+ /// 001: mask bits for which x mod 2 == 0
+ private sealed class DataMask001 : DataMask
+ {
+ internal override bool isMasked(int i, int j)
+ {
+ return (i & 0x01) == 0;
+ }
+ }
+
+ /// 010: mask bits for which y mod 3 == 0
+ private sealed class DataMask010 : DataMask
+ {
+ internal override bool isMasked(int i, int j)
+ {
+ return j % 3 == 0;
+ }
+ }
+
+ /// 011: mask bits for which (x + y) mod 3 == 0
+ private sealed class DataMask011 : DataMask
+ {
+ internal override bool isMasked(int i, int j)
+ {
+ return (i + j) % 3 == 0;
+ }
+ }
+
+ /// 100: mask bits for which (x/2 + y/3) mod 2 == 0
+ private sealed class DataMask100 : DataMask
+ {
+ internal override bool isMasked(int i, int j)
+ {
+ return ((((int)((uint)i >> 1)) + (j / 3)) & 0x01) == 0;
+ }
+ }
+
+ /// 101: mask bits for which xy mod 2 + xy mod 3 == 0
+ private sealed class DataMask101 : DataMask
+ {
+ internal override bool isMasked(int i, int j)
+ {
+ int temp = i * j;
+ return (temp & 0x01) + (temp % 3) == 0;
+ }
+ }
+
+ /// 110: mask bits for which (xy mod 2 + xy mod 3) mod 2 == 0
+ private sealed class DataMask110 : DataMask
+ {
+ internal override bool isMasked(int i, int j)
+ {
+ int temp = i * j;
+ return (((temp & 0x01) + (temp % 3)) & 0x01) == 0;
+ }
+ }
+
+ /// 111: mask bits for which ((x+y)mod 2 + xy mod 3) mod 2 == 0
+ private sealed class DataMask111 : DataMask
+ {
+ internal override bool isMasked(int i, int j)
+ {
+ return ((((i + j) & 0x01) + ((i * j) % 3)) & 0x01) == 0;
+ }
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/decoder/DecodedBitStreamParser.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/DecodedBitStreamParser.cs
new file mode 100755
index 00000000..cb59141b
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/DecodedBitStreamParser.cs
@@ -0,0 +1,293 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using System;
+using System.Collections.Generic;
+using System.Text;
+
+using ZXing.Common;
+
+namespace ZXing.QrCode.Internal
+{
+ /// QR Codes can encode text as bits in one of several modes, and can use multiple modes
+ /// in one QR Code. This class decodes the bits back into text.
+ ///
+ /// See ISO 18004:2006, 6.4.3 - 6.4.7
+ /// Sean Owen
+ ///
+ internal static class DecodedBitStreamParser
+ {
+ ///
+ /// See ISO 18004:2006, 6.4.4 Table 5
+ ///
+ private static readonly char[] ALPHANUMERIC_CHARS = {
+ '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B',
+ 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N',
+ 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z',
+ ' ', '$', '%', '*', '+', '-', '.', '/', ':'
+ };
+ private const int GB2312_SUBSET = 1;
+
+ internal static DecoderResult decode(byte[] bytes,
+ Version version,
+ ErrorCorrectionLevel ecLevel,
+ IDictionary hints)
+ {
+ var bits = new BitSource(bytes);
+ var result = new StringBuilder(50);
+ var byteSegments = new List(1);
+ var symbolSequence = -1;
+ var parityData = -1;
+
+ try
+ {
+ //CharacterSetECI currentCharacterSetECI = null;
+ bool fc1InEffect = false;
+ Mode mode;
+ do
+ {
+ // While still another segment to read...
+ if (bits.available() < 4)
+ {
+ // OK, assume we're done. Really, a TERMINATOR mode should have been recorded here
+ mode = Mode.TERMINATOR;
+ }
+ else
+ {
+ try
+ {
+ mode = Mode.forBits(bits.readBits(4)); // mode is encoded by 4 bits
+ }
+ catch (ArgumentException)
+ {
+ return null;
+ }
+ }
+ if (mode != Mode.TERMINATOR)
+ {
+ if (mode == Mode.FNC1_FIRST_POSITION || mode == Mode.FNC1_SECOND_POSITION)
+ {
+ // We do little with FNC1 except alter the parsed result a bit according to the spec
+ fc1InEffect = true;
+ }
+ else if (mode == Mode.STRUCTURED_APPEND)
+ {
+ if (bits.available() < 16)
+ {
+ return null;
+ }
+ // not really supported; but sequence number and parity is added later to the result metadata
+ // Read next 8 bits (symbol sequence #) and 8 bits (parity data), then continue
+ symbolSequence = bits.readBits(8);
+ parityData = bits.readBits(8);
+ }
+ else
+ {
+ // First handle Hanzi mode which does not start with character count
+ if (mode == Mode.HANZI)
+ {
+ //chinese mode contains a sub set indicator right after mode indicator
+ //int subset = bits.readBits(4);
+ //int countHanzi = bits.readBits(mode.getCharacterCountBits(version));
+ }
+ else
+ {
+ // "Normal" QR code modes:
+ // How many characters will follow, encoded in this mode?
+ int count = bits.readBits(mode.getCharacterCountBits(version));
+ if (mode == Mode.NUMERIC)
+ {
+ if (!decodeNumericSegment(bits, result, count))
+ return null;
+ }
+ else if (mode == Mode.ALPHANUMERIC)
+ {
+ if (!decodeAlphanumericSegment(bits, result, count, fc1InEffect))
+ return null;
+ }
+ else
+ {
+ return null;
+ }
+ }
+ }
+ }
+ } while (mode != Mode.TERMINATOR);
+ }
+ catch (ArgumentException)
+ {
+ // from readBits() calls
+ return null;
+ }
+
+#if WindowsCE
+ var resultString = result.ToString().Replace("\n", "\r\n");
+#else
+ var resultString = result.ToString().Replace("\r\n", "\n").Replace("\n", Environment.NewLine);
+#endif
+ return new DecoderResult(bytes,
+ resultString,
+ byteSegments.Count == 0 ? null : byteSegments,
+ ecLevel == null ? null : ecLevel.ToString(),
+ symbolSequence, parityData);
+ }
+
+
+
+
+ private static char toAlphaNumericChar(int value)
+ {
+ if (value >= ALPHANUMERIC_CHARS.Length)
+ {
+ //throw FormatException.Instance;
+ }
+ return ALPHANUMERIC_CHARS[value];
+ }
+
+ private static bool decodeAlphanumericSegment(BitSource bits,
+ StringBuilder result,
+ int count,
+ bool fc1InEffect)
+ {
+ // Read two characters at a time
+ int start = result.Length;
+ while (count > 1)
+ {
+ if (bits.available() < 11)
+ {
+ return false;
+ }
+ int nextTwoCharsBits = bits.readBits(11);
+ result.Append(toAlphaNumericChar(nextTwoCharsBits / 45));
+ result.Append(toAlphaNumericChar(nextTwoCharsBits % 45));
+ count -= 2;
+ }
+ if (count == 1)
+ {
+ // special case: one character left
+ if (bits.available() < 6)
+ {
+ return false;
+ }
+ result.Append(toAlphaNumericChar(bits.readBits(6)));
+ }
+
+ // See section 6.4.8.1, 6.4.8.2
+ if (fc1InEffect)
+ {
+ // We need to massage the result a bit if in an FNC1 mode:
+ for (int i = start; i < result.Length; i++)
+ {
+ if (result[i] == '%')
+ {
+ if (i < result.Length - 1 && result[i + 1] == '%')
+ {
+ // %% is rendered as %
+ result.Remove(i + 1, 1);
+ }
+ else
+ {
+ // In alpha mode, % should be converted to FNC1 separator 0x1D
+ result.Remove(i, 1);
+ result.Insert(i, new[] { (char)0x1D });
+ }
+ }
+ }
+ }
+
+ return true;
+ }
+
+ private static bool decodeNumericSegment(BitSource bits,
+ StringBuilder result,
+ int count)
+ {
+ // Read three digits at a time
+ while (count >= 3)
+ {
+ // Each 10 bits encodes three digits
+ if (bits.available() < 10)
+ {
+ return false;
+ }
+ int threeDigitsBits = bits.readBits(10);
+ if (threeDigitsBits >= 1000)
+ {
+ return false;
+ }
+ result.Append(toAlphaNumericChar(threeDigitsBits / 100));
+ result.Append(toAlphaNumericChar((threeDigitsBits / 10) % 10));
+ result.Append(toAlphaNumericChar(threeDigitsBits % 10));
+
+ count -= 3;
+ }
+ if (count == 2)
+ {
+ // Two digits left over to read, encoded in 7 bits
+ if (bits.available() < 7)
+ {
+ return false;
+ }
+ int twoDigitsBits = bits.readBits(7);
+ if (twoDigitsBits >= 100)
+ {
+ return false;
+ }
+ result.Append(toAlphaNumericChar(twoDigitsBits / 10));
+ result.Append(toAlphaNumericChar(twoDigitsBits % 10));
+ }
+ else if (count == 1)
+ {
+ // One digit left over to read
+ if (bits.available() < 4)
+ {
+ return false;
+ }
+ int digitBits = bits.readBits(4);
+ if (digitBits >= 10)
+ {
+ return false;
+ }
+ result.Append(toAlphaNumericChar(digitBits));
+ }
+
+ return true;
+ }
+
+ private static int parseECIValue(BitSource bits)
+ {
+ int firstByte = bits.readBits(8);
+ if ((firstByte & 0x80) == 0)
+ {
+ // just one byte
+ return firstByte & 0x7F;
+ }
+ if ((firstByte & 0xC0) == 0x80)
+ {
+ // two bytes
+ int secondByte = bits.readBits(8);
+ return ((firstByte & 0x3F) << 8) | secondByte;
+ }
+ if ((firstByte & 0xE0) == 0xC0)
+ {
+ // three bytes
+ int secondThirdBytes = bits.readBits(16);
+ return ((firstByte & 0x1F) << 16) | secondThirdBytes;
+ }
+ throw new ArgumentException("Bad ECI bits starting with byte " + firstByte);
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/decoder/Decoder.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/Decoder.cs
new file mode 100755
index 00000000..a5ec8645
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/Decoder.cs
@@ -0,0 +1,195 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using System.Collections.Generic;
+
+using ZXing.Common;
+using ZXing.Common.ReedSolomon;
+
+namespace ZXing.QrCode.Internal
+{
+ ///
+ /// The main class which implements QR Code decoding -- as opposed to locating and extracting
+ /// the QR Code from an image.
+ ///
+ ///
+ /// Sean Owen
+ ///
+ public sealed class Decoder
+ {
+ private readonly ReedSolomonDecoder rsDecoder;
+
+ ///
+ /// Initializes a new instance of the class.
+ ///
+ public Decoder()
+ {
+ rsDecoder = new ReedSolomonDecoder(GenericGF.QR_CODE_FIELD_256);
+ }
+
+ ///
+ /// Convenience method that can decode a QR Code represented as a 2D array of booleans.
+ /// "true" is taken to mean a black module.
+ ///
+ /// booleans representing white/black QR Code modules
+ /// The hints.
+ ///
+ /// text and bytes encoded within the QR Code
+ ///
+ public DecoderResult decode(bool[][] image, IDictionary hints)
+ {
+ var dimension = image.Length;
+ var bits = new BitMatrix(dimension);
+ for (int i = 0; i < dimension; i++)
+ {
+ for (int j = 0; j < dimension; j++)
+ {
+ bits[j, i] = image[i][j];
+ }
+ }
+ return decode(bits, hints);
+ }
+
+ ///
+ /// Decodes a QR Code represented as a {@link BitMatrix}. A 1 or "true" is taken to mean a black module.
+ ///
+ /// booleans representing white/black QR Code modules
+ /// The hints.
+ ///
+ /// text and bytes encoded within the QR Code
+ ///
+ public DecoderResult decode(BitMatrix bits, IDictionary hints)
+ {
+ // Construct a parser and read version, error-correction level
+ var parser = BitMatrixParser.createBitMatrixParser(bits);
+ if (parser == null)
+ return null;
+
+ var result = decode(parser, hints);
+ if (result == null)
+ {
+ // Revert the bit matrix
+ parser.remask();
+
+ // Will be attempting a mirrored reading of the version and format info.
+ parser.setMirror(true);
+
+ // Preemptively read the version.
+ var version = parser.readVersion();
+ if (version == null)
+ return null;
+
+ // Preemptively read the format information.
+ var formatinfo = parser.readFormatInformation();
+ if (formatinfo == null)
+ return null;
+
+ /*
+ * Since we're here, this means we have successfully detected some kind
+ * of version and format information when mirrored. This is a good sign,
+ * that the QR code may be mirrored, and we should try once more with a
+ * mirrored content.
+ */
+ // Prepare for a mirrored reading.
+ parser.mirror();
+
+ result = decode(parser, hints);
+
+ if (result != null)
+ {
+ // Success! Notify the caller that the code was mirrored.
+ result.Other = new QRCodeDecoderMetaData(true);
+ }
+ }
+
+ return result;
+ }
+
+ private DecoderResult decode(BitMatrixParser parser, IDictionary hints)
+ {
+ Version version = parser.readVersion();
+ if (version == null)
+ return null;
+ var formatinfo = parser.readFormatInformation();
+ if (formatinfo == null)
+ return null;
+ ErrorCorrectionLevel ecLevel = formatinfo.ErrorCorrectionLevel;
+
+ // Read codewords
+ byte[] codewords = parser.readCodewords();
+ if (codewords == null)
+ return null;
+ // Separate into data blocks
+ DataBlock[] dataBlocks = DataBlock.getDataBlocks(codewords, version, ecLevel);
+
+ // Count total number of data bytes
+ int totalBytes = 0;
+ foreach (var dataBlock in dataBlocks)
+ {
+ totalBytes += dataBlock.NumDataCodewords;
+ }
+ byte[] resultBytes = new byte[totalBytes];
+ int resultOffset = 0;
+
+ // Error-correct and copy data blocks together into a stream of bytes
+ foreach (var dataBlock in dataBlocks)
+ {
+ byte[] codewordBytes = dataBlock.Codewords;
+ int numDataCodewords = dataBlock.NumDataCodewords;
+ if (!correctErrors(codewordBytes, numDataCodewords))
+ return null;
+ for (int i = 0; i < numDataCodewords; i++)
+ {
+ resultBytes[resultOffset++] = codewordBytes[i];
+ }
+ }
+
+ // Decode the contents of that stream of bytes
+ return DecodedBitStreamParser.decode(resultBytes, version, ecLevel, hints);
+ }
+
+ ///
+ /// Given data and error-correction codewords received, possibly corrupted by errors, attempts to
+ /// correct the errors in-place using Reed-Solomon error correction.
+ ///
+ /// data and error correction codewords
+ /// number of codewords that are data bytes
+ ///
+ private bool correctErrors(byte[] codewordBytes, int numDataCodewords)
+ {
+ int numCodewords = codewordBytes.Length;
+ // First read into an array of ints
+ int[] codewordsInts = new int[numCodewords];
+ for (int i = 0; i < numCodewords; i++)
+ {
+ codewordsInts[i] = codewordBytes[i] & 0xFF;
+ }
+ int numECCodewords = codewordBytes.Length - numDataCodewords;
+
+ if (!rsDecoder.decode(codewordsInts, numECCodewords))
+ return false;
+
+ // Copy back into array of bytes -- only need to worry about the bytes that were data
+ // We don't care about errors in the error-correction codewords
+ for (int i = 0; i < numDataCodewords; i++)
+ {
+ codewordBytes[i] = (byte)codewordsInts[i];
+ }
+
+ return true;
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/ErrorCorrectionLevel.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/ErrorCorrectionLevel.cs
similarity index 100%
rename from shadowsocks-csharp/3rd/zxing/ErrorCorrectionLevel.cs
rename to shadowsocks-csharp/3rd/zxing/qrcode/decoder/ErrorCorrectionLevel.cs
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/decoder/FormatInformation.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/FormatInformation.cs
new file mode 100755
index 00000000..88b5045e
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/FormatInformation.cs
@@ -0,0 +1,197 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using System;
+
+namespace ZXing.QrCode.Internal
+{
+
+ /// Encapsulates a QR Code's format information, including the data mask used and
+ /// error correction level.
+ ///
+ ///
+ /// Sean Owen
+ ///
+ /// www.Redivivus.in (suraj.supekar@redivivus.in) - Ported from ZXING Java Source
+ ///
+ ///
+ ///
+ ///
+ ///
+ sealed class FormatInformation
+ {
+ private const int FORMAT_INFO_MASK_QR = 0x5412;
+
+ /// See ISO 18004:2006, Annex C, Table C.1
+ private static readonly int[][] FORMAT_INFO_DECODE_LOOKUP = new int[][]
+ {
+ new [] { 0x5412, 0x00 },
+ new [] { 0x5125, 0x01 },
+ new [] { 0x5E7C, 0x02 },
+ new [] { 0x5B4B, 0x03 },
+ new [] { 0x45F9, 0x04 },
+ new [] { 0x40CE, 0x05 },
+ new [] { 0x4F97, 0x06 },
+ new [] { 0x4AA0, 0x07 },
+ new [] { 0x77C4, 0x08 },
+ new [] { 0x72F3, 0x09 },
+ new [] { 0x7DAA, 0x0A },
+ new [] { 0x789D, 0x0B },
+ new [] { 0x662F, 0x0C },
+ new [] { 0x6318, 0x0D },
+ new [] { 0x6C41, 0x0E },
+ new [] { 0x6976, 0x0F },
+ new [] { 0x1689, 0x10 },
+ new [] { 0x13BE, 0x11 },
+ new [] { 0x1CE7, 0x12 },
+ new [] { 0x19D0, 0x13 },
+ new [] { 0x0762, 0x14 },
+ new [] { 0x0255, 0x15 },
+ new [] { 0x0D0C, 0x16 },
+ new [] { 0x083B, 0x17 },
+ new [] { 0x355F, 0x18 },
+ new [] { 0x3068, 0x19 },
+ new [] { 0x3F31, 0x1A },
+ new [] { 0x3A06, 0x1B },
+ new [] { 0x24B4, 0x1C },
+ new [] { 0x2183, 0x1D },
+ new [] { 0x2EDA, 0x1E },
+ new [] { 0x2BED, 0x1F }
+ };
+
+ /// Offset i holds the number of 1 bits in the binary representation of i
+ private static readonly int[] BITS_SET_IN_HALF_BYTE = new []
+ { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 };
+
+ private readonly ErrorCorrectionLevel errorCorrectionLevel;
+ private readonly byte dataMask;
+
+ private FormatInformation(int formatInfo)
+ {
+ // Bits 3,4
+ errorCorrectionLevel = ErrorCorrectionLevel.forBits((formatInfo >> 3) & 0x03);
+ // Bottom 3 bits
+ dataMask = (byte)(formatInfo & 0x07);
+ }
+
+ internal static int numBitsDiffering(int a, int b)
+ {
+ a ^= b; // a now has a 1 bit exactly where its bit differs with b's
+ // Count bits set quickly with a series of lookups:
+ return BITS_SET_IN_HALF_BYTE[a & 0x0F] +
+ BITS_SET_IN_HALF_BYTE[(((int)((uint)a >> 4)) & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(((int)((uint)a >> 8)) & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(((int)((uint)a >> 12)) & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(((int)((uint)a >> 16)) & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(((int)((uint)a >> 20)) & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(((int)((uint)a >> 24)) & 0x0F)] +
+ BITS_SET_IN_HALF_BYTE[(((int)((uint)a >> 28)) & 0x0F)];
+ }
+
+ ///
+ /// Decodes the format information.
+ ///
+ /// format info indicator, with mask still applied
+ /// The masked format info2.
+ ///
+ /// information about the format it specifies, or null
+ /// if doesn't seem to match any known pattern
+ ///
+ internal static FormatInformation decodeFormatInformation(int maskedFormatInfo1, int maskedFormatInfo2)
+ {
+ FormatInformation formatInfo = doDecodeFormatInformation(maskedFormatInfo1, maskedFormatInfo2);
+ if (formatInfo != null)
+ {
+ return formatInfo;
+ }
+ // Should return null, but, some QR codes apparently
+ // do not mask this info. Try again by actually masking the pattern
+ // first
+ return doDecodeFormatInformation(maskedFormatInfo1 ^ FORMAT_INFO_MASK_QR,
+ maskedFormatInfo2 ^ FORMAT_INFO_MASK_QR);
+ }
+
+ private static FormatInformation doDecodeFormatInformation(int maskedFormatInfo1, int maskedFormatInfo2)
+ {
+ // Find the int in FORMAT_INFO_DECODE_LOOKUP with fewest bits differing
+ int bestDifference = Int32.MaxValue;
+ int bestFormatInfo = 0;
+ foreach (var decodeInfo in FORMAT_INFO_DECODE_LOOKUP)
+ {
+ int targetInfo = decodeInfo[0];
+ if (targetInfo == maskedFormatInfo1 || targetInfo == maskedFormatInfo2)
+ {
+ // Found an exact match
+ return new FormatInformation(decodeInfo[1]);
+ }
+ int bitsDifference = numBitsDiffering(maskedFormatInfo1, targetInfo);
+ if (bitsDifference < bestDifference)
+ {
+ bestFormatInfo = decodeInfo[1];
+ bestDifference = bitsDifference;
+ }
+ if (maskedFormatInfo1 != maskedFormatInfo2)
+ {
+ // also try the other option
+ bitsDifference = numBitsDiffering(maskedFormatInfo2, targetInfo);
+ if (bitsDifference < bestDifference)
+ {
+ bestFormatInfo = decodeInfo[1];
+ bestDifference = bitsDifference;
+ }
+ }
+ }
+ // Hamming distance of the 32 masked codes is 7, by construction, so <= 3 bits
+ // differing means we found a match
+ if (bestDifference <= 3)
+ {
+ return new FormatInformation(bestFormatInfo);
+ }
+ return null;
+ }
+
+ internal ErrorCorrectionLevel ErrorCorrectionLevel
+ {
+ get
+ {
+ return errorCorrectionLevel;
+ }
+ }
+
+ internal byte DataMask
+ {
+ get
+ {
+ return dataMask;
+ }
+ }
+
+ public override int GetHashCode()
+ {
+ return (errorCorrectionLevel.ordinal() << 3) | dataMask;
+ }
+
+ public override bool Equals(Object o)
+ {
+ if (!(o is FormatInformation))
+ {
+ return false;
+ }
+ var other = (FormatInformation)o;
+ return errorCorrectionLevel == other.errorCorrectionLevel && dataMask == other.dataMask;
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/Mode.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/Mode.cs
similarity index 55%
rename from shadowsocks-csharp/3rd/zxing/Mode.cs
rename to shadowsocks-csharp/3rd/zxing/qrcode/decoder/Mode.cs
index df1a5ebb..548ea6d7 100755
--- a/shadowsocks-csharp/3rd/zxing/Mode.cs
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/Mode.cs
@@ -38,10 +38,44 @@ namespace ZXing.QrCode.Internal
// No, we can't use an enum here. J2ME doesn't support it.
+ ///
+ ///
+ ///
+ public static readonly Mode TERMINATOR = new Mode(new int[] { 0, 0, 0 }, 0x00, "TERMINATOR"); // Not really a mode...
+ ///
+ ///
+ ///
+ public static readonly Mode NUMERIC = new Mode(new int[] { 10, 12, 14 }, 0x01, "NUMERIC");
+ ///
+ ///
+ ///
+ public static readonly Mode ALPHANUMERIC = new Mode(new int[] { 9, 11, 13 }, 0x02, "ALPHANUMERIC");
+ ///
+ ///
+ ///
+ public static readonly Mode STRUCTURED_APPEND = new Mode(new int[] { 0, 0, 0 }, 0x03, "STRUCTURED_APPEND"); // Not supported
///
///
///
public static readonly Mode BYTE = new Mode(new int[] { 8, 16, 16 }, 0x04, "BYTE");
+ ///
+ ///
+ ///
+ public static readonly Mode ECI = new Mode(null, 0x07, "ECI"); // character counts don't apply
+ ///
+ ///
+ ///
+ public static readonly Mode KANJI = new Mode(new int[] { 8, 10, 12 }, 0x08, "KANJI");
+ ///
+ ///
+ ///
+ public static readonly Mode FNC1_FIRST_POSITION = new Mode(null, 0x05, "FNC1_FIRST_POSITION");
+ ///
+ ///
+ ///
+ public static readonly Mode FNC1_SECOND_POSITION = new Mode(null, 0x09, "FNC1_SECOND_POSITION");
+ /// See GBT 18284-2000; "Hanzi" is a transliteration of this mode name.
+ public static readonly Mode HANZI = new Mode(new int[] { 8, 10, 12 }, 0x0D, "HANZI");
private readonly int[] characterCountBitsForVersions;
private readonly int bits;
@@ -66,8 +100,27 @@ namespace ZXing.QrCode.Internal
{
switch (bits)
{
+ case 0x0:
+ return TERMINATOR;
+ case 0x1:
+ return NUMERIC;
+ case 0x2:
+ return ALPHANUMERIC;
+ case 0x3:
+ return STRUCTURED_APPEND;
case 0x4:
return BYTE;
+ case 0x5:
+ return FNC1_FIRST_POSITION;
+ case 0x7:
+ return ECI;
+ case 0x8:
+ return KANJI;
+ case 0x9:
+ return FNC1_SECOND_POSITION;
+ case 0xD:
+ // 0xD is defined in GBT 18284-2000, may not be supported in foreign country
+ return HANZI;
default:
throw new ArgumentException();
}
@@ -111,5 +164,16 @@ namespace ZXing.QrCode.Internal
return bits;
}
}
+
+ ///
+ /// Returns a that represents this instance.
+ ///
+ ///
+ /// A that represents this instance.
+ ///
+ public override String ToString()
+ {
+ return name;
+ }
}
}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/decoder/QRCodeDecoderMetaData.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/QRCodeDecoderMetaData.cs
new file mode 100755
index 00000000..cc059aa9
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/QRCodeDecoderMetaData.cs
@@ -0,0 +1,60 @@
+/*
+ * Copyright 2013 ZXing authors
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+namespace ZXing.QrCode.Internal
+{
+ ///
+ /// Meta-data container for QR Code decoding. Instances of this class may be used to convey information back to the
+ /// decoding caller. Callers are expected to process this.
+ ///
+ public sealed class QRCodeDecoderMetaData
+ {
+ private readonly bool mirrored;
+
+ ///
+ /// Initializes a new instance of the class.
+ ///
+ /// if set to true [mirrored].
+ public QRCodeDecoderMetaData(bool mirrored)
+ {
+ this.mirrored = mirrored;
+ }
+
+ ///
+ /// true if the QR Code was mirrored.
+ ///
+ public bool IsMirrored
+ {
+ get { return mirrored; }
+ }
+
+ ///
+ /// Apply the result points' order correction due to mirroring.
+ ///
+ /// Array of points to apply mirror correction to.
+ public void applyMirroredCorrection(ResultPoint[] points)
+ {
+ if (!mirrored || points == null || points.Length < 3)
+ {
+ return;
+ }
+ ResultPoint bottomLeft = points[0];
+ points[0] = points[2];
+ points[2] = bottomLeft;
+ // No need to 'fix' top-left and alignment pattern.
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/decoder/Version.cs b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/Version.cs
new file mode 100755
index 00000000..e619933d
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/decoder/Version.cs
@@ -0,0 +1,424 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using System;
+
+using ZXing.Common;
+
+namespace ZXing.QrCode.Internal
+{
+ ///
+ /// See ISO 18004:2006 Annex D
+ ///
+ /// Sean Owen
+ public sealed class Version
+ {
+ /// See ISO 18004:2006 Annex D.
+ /// Element i represents the raw version bits that specify version i + 7
+ ///
+ private static readonly int[] VERSION_DECODE_INFO = new[]
+ {
+ 0x07C94, 0x085BC, 0x09A99, 0x0A4D3, 0x0BBF6,
+ 0x0C762, 0x0D847, 0x0E60D, 0x0F928, 0x10B78,
+ 0x1145D, 0x12A17, 0x13532, 0x149A6, 0x15683,
+ 0x168C9, 0x177EC, 0x18EC4, 0x191E1, 0x1AFAB,
+ 0x1B08E, 0x1CC1A, 0x1D33F, 0x1ED75, 0x1F250,
+ 0x209D5, 0x216F0, 0x228BA, 0x2379F, 0x24B0B,
+ 0x2542E, 0x26A64, 0x27541, 0x28C69
+ };
+
+ private static readonly Version[] VERSIONS = buildVersions();
+
+ private readonly int versionNumber;
+ private readonly int[] alignmentPatternCenters;
+ private readonly ECBlocks[] ecBlocks;
+ private readonly int totalCodewords;
+
+ private Version(int versionNumber, int[] alignmentPatternCenters, params ECBlocks[] ecBlocks)
+ {
+ this.versionNumber = versionNumber;
+ this.alignmentPatternCenters = alignmentPatternCenters;
+ this.ecBlocks = ecBlocks;
+ int total = 0;
+ int ecCodewords = ecBlocks[0].ECCodewordsPerBlock;
+ ECB[] ecbArray = ecBlocks[0].getECBlocks();
+ foreach (var ecBlock in ecbArray)
+ {
+ total += ecBlock.Count * (ecBlock.DataCodewords + ecCodewords);
+ }
+ this.totalCodewords = total;
+ }
+
+ ///
+ /// Gets the version number.
+ ///
+ public int VersionNumber
+ {
+ get
+ {
+ return versionNumber;
+ }
+
+ }
+
+ ///
+ /// Gets the alignment pattern centers.
+ ///
+ public int[] AlignmentPatternCenters
+ {
+ get
+ {
+ return alignmentPatternCenters;
+ }
+
+ }
+
+ ///
+ /// Gets the total codewords.
+ ///
+ public int TotalCodewords
+ {
+ get
+ {
+ return totalCodewords;
+ }
+
+ }
+
+ ///
+ /// Gets the dimension for version.
+ ///
+ public int DimensionForVersion
+ {
+ get
+ {
+ return 17 + 4 * versionNumber;
+ }
+
+ }
+
+ ///
+ /// Gets the EC blocks for level.
+ ///
+ /// The ec level.
+ ///
+ public ECBlocks getECBlocksForLevel(ErrorCorrectionLevel ecLevel)
+ {
+ return ecBlocks[ecLevel.ordinal()];
+ }
+
+ /// Deduces version information purely from QR Code dimensions.
+ ///
+ ///
+ /// dimension in modules
+ ///
+ /// for a QR Code of that dimension or null
+ public static Version getProvisionalVersionForDimension(int dimension)
+ {
+ if (dimension % 4 != 1)
+ {
+ return null;
+ }
+ try
+ {
+ return getVersionForNumber((dimension - 17) >> 2);
+ }
+ catch (ArgumentException)
+ {
+ return null;
+ }
+ }
+
+ ///
+ /// Gets the version for number.
+ ///
+ /// The version number.
+ ///
+ public static Version getVersionForNumber(int versionNumber)
+ {
+ if (versionNumber < 1 || versionNumber > 40)
+ {
+ throw new ArgumentException();
+ }
+ return VERSIONS[versionNumber - 1];
+ }
+
+ internal static Version decodeVersionInformation(int versionBits)
+ {
+ int bestDifference = Int32.MaxValue;
+ int bestVersion = 0;
+ for (int i = 0; i < VERSION_DECODE_INFO.Length; i++)
+ {
+ int targetVersion = VERSION_DECODE_INFO[i];
+ // Do the version info bits match exactly? done.
+ if (targetVersion == versionBits)
+ {
+ return getVersionForNumber(i + 7);
+ }
+ // Otherwise see if this is the closest to a real version info bit string
+ // we have seen so far
+ int bitsDifference = FormatInformation.numBitsDiffering(versionBits, targetVersion);
+ if (bitsDifference < bestDifference)
+ {
+ bestVersion = i + 7;
+ bestDifference = bitsDifference;
+ }
+ }
+ // We can tolerate up to 3 bits of error since no two version info codewords will
+ // differ in less than 8 bits.
+ if (bestDifference <= 3)
+ {
+ return getVersionForNumber(bestVersion);
+ }
+ // If we didn't find a close enough match, fail
+ return null;
+ }
+
+ /// See ISO 18004:2006 Annex E
+ internal BitMatrix buildFunctionPattern()
+ {
+ int dimension = DimensionForVersion;
+ BitMatrix bitMatrix = new BitMatrix(dimension);
+
+ // Top left finder pattern + separator + format
+ bitMatrix.setRegion(0, 0, 9, 9);
+ // Top right finder pattern + separator + format
+ bitMatrix.setRegion(dimension - 8, 0, 8, 9);
+ // Bottom left finder pattern + separator + format
+ bitMatrix.setRegion(0, dimension - 8, 9, 8);
+
+ // Alignment patterns
+ int max = alignmentPatternCenters.Length;
+ for (int x = 0; x < max; x++)
+ {
+ int i = alignmentPatternCenters[x] - 2;
+ for (int y = 0; y < max; y++)
+ {
+ if ((x == 0 && (y == 0 || y == max - 1)) || (x == max - 1 && y == 0))
+ {
+ // No alignment patterns near the three finder paterns
+ continue;
+ }
+ bitMatrix.setRegion(alignmentPatternCenters[y] - 2, i, 5, 5);
+ }
+ }
+
+ // Vertical timing pattern
+ bitMatrix.setRegion(6, 9, 1, dimension - 17);
+ // Horizontal timing pattern
+ bitMatrix.setRegion(9, 6, dimension - 17, 1);
+
+ if (versionNumber > 6)
+ {
+ // Version info, top right
+ bitMatrix.setRegion(dimension - 11, 0, 3, 6);
+ // Version info, bottom left
+ bitMatrix.setRegion(0, dimension - 11, 6, 3);
+ }
+
+ return bitMatrix;
+ }
+
+ /// Encapsulates a set of error-correction blocks in one symbol version. Most versions will
+ /// use blocks of differing sizes within one version, so, this encapsulates the parameters for
+ /// each set of blocks. It also holds the number of error-correction codewords per block since it
+ /// will be the same across all blocks within one version.
+ ///
+ public sealed class ECBlocks
+ {
+ private readonly int ecCodewordsPerBlock;
+ private readonly ECB[] ecBlocks;
+
+ internal ECBlocks(int ecCodewordsPerBlock, params ECB[] ecBlocks)
+ {
+ this.ecCodewordsPerBlock = ecCodewordsPerBlock;
+ this.ecBlocks = ecBlocks;
+ }
+
+ ///
+ /// Gets the EC codewords per block.
+ ///
+ public int ECCodewordsPerBlock
+ {
+ get
+ {
+ return ecCodewordsPerBlock;
+ }
+ }
+
+ ///
+ /// Gets the num blocks.
+ ///
+ public int NumBlocks
+ {
+ get
+ {
+ int total = 0;
+ foreach (var ecBlock in ecBlocks)
+ {
+ total += ecBlock.Count;
+ }
+ return total;
+ }
+ }
+
+ ///
+ /// Gets the total EC codewords.
+ ///
+ public int TotalECCodewords
+ {
+ get
+ {
+ return ecCodewordsPerBlock * NumBlocks;
+ }
+ }
+
+ ///
+ /// Gets the EC blocks.
+ ///
+ ///
+ public ECB[] getECBlocks()
+ {
+ return ecBlocks;
+ }
+ }
+
+ /// Encapsualtes the parameters for one error-correction block in one symbol version.
+ /// This includes the number of data codewords, and the number of times a block with these
+ /// parameters is used consecutively in the QR code version's format.
+ ///
+ public sealed class ECB
+ {
+ private readonly int count;
+ private readonly int dataCodewords;
+
+ internal ECB(int count, int dataCodewords)
+ {
+ this.count = count;
+ this.dataCodewords = dataCodewords;
+ }
+
+ ///
+ /// Gets the count.
+ ///
+ public int Count
+ {
+ get
+ {
+ return count;
+ }
+
+ }
+ ///
+ /// Gets the data codewords.
+ ///
+ public int DataCodewords
+ {
+ get
+ {
+ return dataCodewords;
+ }
+
+ }
+ }
+
+ ///
+ /// Returns a that represents this instance.
+ ///
+ ///
+ /// A that represents this instance.
+ ///
+ public override String ToString()
+ {
+ return Convert.ToString(versionNumber);
+ }
+
+ /// See ISO 18004:2006 6.5.1 Table 9
+ private static Version[] buildVersions()
+ {
+ return new Version[]{
+ new Version(1, new int[]{},
+ new ECBlocks(7, new ECB(1, 19)),
+ new ECBlocks(10, new ECB(1, 16)),
+ new ECBlocks(13, new ECB(1, 13)),
+ new ECBlocks(17, new ECB(1, 9))),
+ new Version(2, new int[]{6, 18},
+ new ECBlocks(10, new ECB(1, 34)),
+ new ECBlocks(16, new ECB(1, 28)),
+ new ECBlocks(22, new ECB(1, 22)),
+ new ECBlocks(28, new ECB(1, 16))),
+ new Version(3, new int[]{6, 22},
+ new ECBlocks(15, new ECB(1, 55)),
+ new ECBlocks(26, new ECB(1, 44)),
+ new ECBlocks(18, new ECB(2, 17)),
+ new ECBlocks(22, new ECB(2, 13))),
+ new Version(4, new int[]{6, 26},
+ new ECBlocks(20, new ECB(1, 80)),
+ new ECBlocks(18, new ECB(2, 32)),
+ new ECBlocks(26, new ECB(2, 24)),
+ new ECBlocks(16, new ECB(4, 9))),
+ new Version(5, new int[]{6, 30},
+ new ECBlocks(26, new ECB(1, 108)),
+ new ECBlocks(24, new ECB(2, 43)),
+ new ECBlocks(18, new ECB(2, 15),
+ new ECB(2, 16)),
+ new ECBlocks(22, new ECB(2, 11),
+ new ECB(2, 12))),
+ new Version(6, new int[]{6, 34},
+ new ECBlocks(18, new ECB(2, 68)),
+ new ECBlocks(16, new ECB(4, 27)),
+ new ECBlocks(24, new ECB(4, 19)),
+ new ECBlocks(28, new ECB(4, 15))),
+ new Version(7, new int[]{6, 22, 38},
+ new ECBlocks(20, new ECB(2, 78)),
+ new ECBlocks(18, new ECB(4, 31)),
+ new ECBlocks(18, new ECB(2, 14),
+ new ECB(4, 15)),
+ new ECBlocks(26, new ECB(4, 13),
+ new ECB(1, 14))),
+ new Version(8, new int[]{6, 24, 42},
+ new ECBlocks(24, new ECB(2, 97)),
+ new ECBlocks(22, new ECB(2, 38),
+ new ECB(2, 39)),
+ new ECBlocks(22, new ECB(4, 18),
+ new ECB(2, 19)),
+ new ECBlocks(26, new ECB(4, 14),
+ new ECB(2, 15))),
+ new Version(9, new int[]{6, 26, 46},
+ new ECBlocks(30, new ECB(2, 116)),
+ new ECBlocks(22, new ECB(3, 36),
+ new ECB(2, 37)),
+ new ECBlocks(20, new ECB(4, 16),
+ new ECB(4, 17)),
+ new ECBlocks(24, new ECB(4, 12),
+ new ECB(4, 13))),
+ new Version(10, new int[]{6, 28, 50},
+ new ECBlocks(18, new ECB(2, 68),
+ new ECB(2, 69)),
+ new ECBlocks(26, new ECB(4, 43),
+ new ECB(1, 44)),
+ new ECBlocks(24, new ECB(6, 19),
+ new ECB(2, 20)),
+ new ECBlocks(28, new ECB(6, 15),
+ new ECB(2, 16))),
+ new Version(11, new int[]{6, 30, 54}, new ECBlocks(20, new ECB(4, 81)),
+ new ECBlocks(30, new ECB(1, 50), new ECB(4, 51)), new ECBlocks(28, new ECB(4, 22), new ECB(4, 23)), new ECBlocks(24, new ECB(3, 12), new ECB(8, 13))), new Version(12, new int[]{6, 32, 58}, new ECBlocks(24, new ECB(2, 92), new ECB(2, 93)), new ECBlocks(22, new ECB(6, 36), new ECB(2, 37)), new ECBlocks(26, new ECB(4, 20), new ECB(6, 21)), new ECBlocks(28, new ECB(7, 14), new ECB(4, 15))), new Version(13, new int[]{6, 34, 62}, new ECBlocks(26, new ECB(4, 107)), new ECBlocks(22, new ECB(8, 37), new ECB(1, 38)), new ECBlocks(24, new ECB(8, 20), new ECB(4, 21)), new ECBlocks(22, new ECB(12, 11), new ECB(4, 12))), new Version(14, new int[]{6, 26, 46, 66}, new ECBlocks(30, new ECB(3, 115), new ECB(1, 116)), new ECBlocks(24, new ECB(4, 40), new ECB(5, 41)), new ECBlocks(20, new ECB(11, 16), new ECB(5, 17)), new ECBlocks(24, new ECB(11, 12), new ECB(5, 13))), new Version(15, new int[]{6, 26, 48, 70}, new ECBlocks(22, new ECB(5, 87), new ECB(1, 88)), new ECBlocks(24, new ECB(5, 41), new ECB(5, 42)), new ECBlocks(30, new ECB(5, 24), new ECB(7, 25)), new ECBlocks(24, new ECB(11, 12), new ECB(7, 13))), new Version(16, new int[]{6, 26, 50, 74}, new ECBlocks(24, new ECB(5, 98), new ECB(1, 99)), new ECBlocks(28, new ECB(7, 45), new ECB(3, 46)), new ECBlocks(24, new ECB(15, 19), new ECB(2, 20)), new ECBlocks(30, new ECB(3, 15), new ECB(13, 16))), new Version(17, new int[]{6, 30, 54, 78}, new ECBlocks(28, new ECB(1, 107), new ECB(5, 108)), new ECBlocks(28, new ECB(10, 46), new ECB(1, 47)), new ECBlocks(28, new ECB(1, 22), new ECB(15, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(17, 15))), new Version(18, new int[]{6, 30, 56, 82}, new ECBlocks(30, new ECB(5, 120), new ECB(1, 121)), new ECBlocks(26, new ECB(9, 43), new ECB(4, 44)), new ECBlocks(28, new ECB(17, 22), new ECB(1, 23)), new ECBlocks(28, new ECB(2, 14), new ECB(19, 15))), new Version(19, new int[]{6, 30, 58, 86}, new ECBlocks(28, new ECB(3, 113), new ECB(4, 114)), new ECBlocks(26, new ECB(3, 44), new ECB(11, 45)), new ECBlocks(26, new ECB(17, 21),
+ new ECB(4, 22)), new ECBlocks(26, new ECB(9, 13), new ECB(16, 14))), new Version(20, new int[]{6, 34, 62, 90}, new ECBlocks(28, new ECB(3, 107), new ECB(5, 108)), new ECBlocks(26, new ECB(3, 41), new ECB(13, 42)), new ECBlocks(30, new ECB(15, 24), new ECB(5, 25)), new ECBlocks(28, new ECB(15, 15), new ECB(10, 16))), new Version(21, new int[]{6, 28, 50, 72, 94}, new ECBlocks(28, new ECB(4, 116), new ECB(4, 117)), new ECBlocks(26, new ECB(17, 42)), new ECBlocks(28, new ECB(17, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(19, 16), new ECB(6, 17))), new Version(22, new int[]{6, 26, 50, 74, 98}, new ECBlocks(28, new ECB(2, 111), new ECB(7, 112)), new ECBlocks(28, new ECB(17, 46)), new ECBlocks(30, new ECB(7, 24), new ECB(16, 25)), new ECBlocks(24, new ECB(34, 13))), new Version(23, new int[]{6, 30, 54, 74, 102}, new ECBlocks(30, new ECB(4, 121), new ECB(5, 122)), new ECBlocks(28, new ECB(4, 47), new ECB(14, 48)), new ECBlocks(30, new ECB(11, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(16, 15), new ECB(14, 16))), new Version(24, new int[]{6, 28, 54, 80, 106}, new ECBlocks(30, new ECB(6, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(6, 45), new ECB(14, 46)), new ECBlocks(30, new ECB(11, 24), new ECB(16, 25)), new ECBlocks(30, new ECB(30, 16), new ECB(2, 17))), new Version(25, new int[]{6, 32, 58, 84, 110}, new ECBlocks(26, new ECB(8, 106), new ECB(4, 107)), new ECBlocks(28, new ECB(8, 47), new ECB(13, 48)), new ECBlocks(30, new ECB(7, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(13, 16))), new Version(26, new int[]{6, 30, 58, 86, 114}, new ECBlocks(28, new ECB(10, 114), new ECB(2, 115)), new ECBlocks(28, new ECB(19, 46), new ECB(4, 47)), new ECBlocks(28, new ECB(28, 22), new ECB(6, 23)), new ECBlocks(30, new ECB(33, 16), new ECB(4, 17))), new Version(27, new int[]{6, 34, 62, 90, 118}, new ECBlocks(30, new ECB(8, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(22, 45), new ECB(3, 46)), new ECBlocks(30, new ECB(8, 23), new ECB(26, 24)), new ECBlocks(30, new ECB(12, 15),
+ new ECB(28, 16))), new Version(28, new int[]{6, 26, 50, 74, 98, 122}, new ECBlocks(30, new ECB(3, 117), new ECB(10, 118)), new ECBlocks(28, new ECB(3, 45), new ECB(23, 46)), new ECBlocks(30, new ECB(4, 24), new ECB(31, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(31, 16))), new Version(29, new int[]{6, 30, 54, 78, 102, 126}, new ECBlocks(30, new ECB(7, 116), new ECB(7, 117)), new ECBlocks(28, new ECB(21, 45), new ECB(7, 46)), new ECBlocks(30, new ECB(1, 23), new ECB(37, 24)), new ECBlocks(30, new ECB(19, 15), new ECB(26, 16))), new Version(30, new int[]{6, 26, 52, 78, 104, 130}, new ECBlocks(30, new ECB(5, 115), new ECB(10, 116)), new ECBlocks(28, new ECB(19, 47), new ECB(10, 48)), new ECBlocks(30, new ECB(15, 24), new ECB(25, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(25, 16))), new Version(31, new int[]{6, 30, 56, 82, 108, 134}, new ECBlocks(30, new ECB(13, 115), new ECB(3, 116)), new ECBlocks(28, new ECB(2, 46), new ECB(29, 47)), new ECBlocks(30, new ECB(42, 24), new ECB(1, 25)), new ECBlocks(30, new ECB(23, 15), new ECB(28, 16))), new Version(32, new int[]{6, 34, 60, 86, 112, 138}, new ECBlocks(30, new ECB(17, 115)), new ECBlocks(28, new ECB(10, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(10, 24), new ECB(35, 25)), new ECBlocks(30, new ECB(19, 15), new ECB(35, 16))), new Version(33, new int[]{6, 30, 58, 86, 114, 142}, new ECBlocks(30, new ECB(17, 115), new ECB(1, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(21, 47)), new ECBlocks(30, new ECB(29, 24), new ECB(19, 25)), new ECBlocks(30, new ECB(11, 15), new ECB(46, 16))), new Version(34, new int[]{6, 34, 62, 90, 118, 146}, new ECBlocks(30, new ECB(13, 115), new ECB(6, 116)), new ECBlocks(28, new ECB(14, 46), new ECB(23, 47)), new ECBlocks(30, new ECB(44, 24), new ECB(7, 25)), new ECBlocks(30, new ECB(59, 16), new ECB(1, 17))), new Version(35, new int[]{6, 30, 54, 78, 102, 126, 150}, new ECBlocks(30, new ECB(12, 121), new ECB(7, 122)), new ECBlocks(28, new ECB(12, 47), new ECB(26, 48)), new ECBlocks(30, new ECB(39, 24), new
+ ECB(14, 25)), new ECBlocks(30, new ECB(22, 15), new ECB(41, 16))), new Version(36, new int[]{6, 24, 50, 76, 102, 128, 154}, new ECBlocks(30, new ECB(6, 121), new ECB(14, 122)), new ECBlocks(28, new ECB(6, 47), new ECB(34, 48)), new ECBlocks(30, new ECB(46, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(2, 15), new ECB(64, 16))), new Version(37, new int[]{6, 28, 54, 80, 106, 132, 158}, new ECBlocks(30, new ECB(17, 122), new ECB(4, 123)), new ECBlocks(28, new ECB(29, 46), new ECB(14, 47)), new ECBlocks(30, new ECB(49, 24), new ECB(10, 25)), new ECBlocks(30, new ECB(24, 15), new ECB(46, 16))), new Version(38, new int[]{6, 32, 58, 84, 110, 136, 162}, new ECBlocks(30, new ECB(4, 122), new ECB(18, 123)), new ECBlocks(28, new ECB(13, 46), new ECB(32, 47)), new ECBlocks(30, new ECB(48, 24), new ECB(14, 25)), new ECBlocks(30, new ECB(42, 15), new ECB(32, 16))), new Version(39, new int[]{6, 26, 54, 82, 110, 138, 166}, new ECBlocks(30, new ECB(20, 117), new ECB(4, 118)), new ECBlocks(28, new ECB(40, 47), new ECB(7, 48)), new ECBlocks(30, new ECB(43, 24), new ECB(22, 25)), new ECBlocks(30, new ECB(10, 15), new ECB(67, 16))), new Version(40, new int[]{6, 30, 58, 86, 114, 142, 170}, new ECBlocks(30, new ECB(19, 118), new ECB(6, 119)), new ECBlocks(28, new ECB(18, 47), new ECB(31, 48)), new ECBlocks(30, new ECB(34, 24), new ECB(34, 25)), new ECBlocks(30, new ECB(20, 15), new ECB(61, 16)))};
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/detector/AlignmentPattern.cs b/shadowsocks-csharp/3rd/zxing/qrcode/detector/AlignmentPattern.cs
new file mode 100755
index 00000000..e7dd9460
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/detector/AlignmentPattern.cs
@@ -0,0 +1,68 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using System;
+
+namespace ZXing.QrCode.Internal
+{
+ /// Encapsulates an alignment pattern, which are the smaller square patterns found in
+ /// all but the simplest QR Codes.
+ ///
+ ///
+ /// Sean Owen
+ ///
+ /// www.Redivivus.in (suraj.supekar@redivivus.in) - Ported from ZXING Java Source
+ ///
+ public sealed class AlignmentPattern : ResultPoint
+ {
+ private float estimatedModuleSize;
+
+ internal AlignmentPattern(float posX, float posY, float estimatedModuleSize)
+ : base(posX, posY)
+ {
+ this.estimatedModuleSize = estimatedModuleSize;
+ }
+
+ /// Determines if this alignment pattern "about equals" an alignment pattern at the stated
+ /// position and size -- meaning, it is at nearly the same center with nearly the same size.
+ ///
+ internal bool aboutEquals(float moduleSize, float i, float j)
+ {
+ if (Math.Abs(i - Y) <= moduleSize && Math.Abs(j - X) <= moduleSize)
+ {
+ float moduleSizeDiff = Math.Abs(moduleSize - estimatedModuleSize);
+ return moduleSizeDiff <= 1.0f || moduleSizeDiff <= estimatedModuleSize;
+ }
+ return false;
+ }
+
+ ///
+ /// Combines this object's current estimate of a finder pattern position and module size
+ /// with a new estimate. It returns a new {@code FinderPattern} containing an average of the two.
+ ///
+ /// The i.
+ /// The j.
+ /// New size of the module.
+ ///
+ internal AlignmentPattern combineEstimate(float i, float j, float newModuleSize)
+ {
+ float combinedX = (X + j) / 2.0f;
+ float combinedY = (Y + i) / 2.0f;
+ float combinedModuleSize = (estimatedModuleSize + newModuleSize) / 2.0f;
+ return new AlignmentPattern(combinedX, combinedY, combinedModuleSize);
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/detector/AlignmentPatternFinder.cs b/shadowsocks-csharp/3rd/zxing/qrcode/detector/AlignmentPatternFinder.cs
new file mode 100755
index 00000000..b8cdec5b
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/detector/AlignmentPatternFinder.cs
@@ -0,0 +1,324 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using System;
+using System.Collections.Generic;
+
+using ZXing.Common;
+
+namespace ZXing.QrCode.Internal
+{
+ /// This class attempts to find alignment patterns in a QR Code. Alignment patterns look like finder
+ /// patterns but are smaller and appear at regular intervals throughout the image.
+ ///
+ /// At the moment this only looks for the bottom-right alignment pattern.
+ ///
+ /// This is mostly a simplified copy of {@link FinderPatternFinder}. It is copied,
+ /// pasted and stripped down here for maximum performance but does unfortunately duplicate
+ /// some code.
+ ///
+ /// This class is thread-safe but not reentrant. Each thread must allocate its own object.
+ ///
+ ///
+ /// Sean Owen
+ ///
+ /// www.Redivivus.in (suraj.supekar@redivivus.in) - Ported from ZXING Java Source
+ ///
+ sealed class AlignmentPatternFinder
+ {
+ private readonly BitMatrix image;
+ private readonly IList possibleCenters;
+ private readonly int startX;
+ private readonly int startY;
+ private readonly int width;
+ private readonly int height;
+ private readonly float moduleSize;
+ private readonly int[] crossCheckStateCount;
+ private readonly ResultPointCallback resultPointCallback;
+
+ /// Creates a finder that will look in a portion of the whole image.
+ ///
+ ///
+ /// image to search
+ ///
+ /// left column from which to start searching
+ ///
+ /// top row from which to start searching
+ ///
+ /// width of region to search
+ ///
+ /// height of region to search
+ ///
+ /// estimated module size so far
+ ///
+ internal AlignmentPatternFinder(BitMatrix image, int startX, int startY, int width, int height, float moduleSize, ResultPointCallback resultPointCallback)
+ {
+ this.image = image;
+ this.possibleCenters = new List(5);
+ this.startX = startX;
+ this.startY = startY;
+ this.width = width;
+ this.height = height;
+ this.moduleSize = moduleSize;
+ this.crossCheckStateCount = new int[3];
+ this.resultPointCallback = resultPointCallback;
+ }
+
+ /// This method attempts to find the bottom-right alignment pattern in the image. It is a bit messy since
+ /// it's pretty performance-critical and so is written to be fast foremost.
+ ///
+ ///
+ /// {@link AlignmentPattern} if found
+ ///
+ internal AlignmentPattern find()
+ {
+ int startX = this.startX;
+ int height = this.height;
+ int maxJ = startX + width;
+ int middleI = startY + (height >> 1);
+ // We are looking for black/white/black modules in 1:1:1 ratio;
+ // this tracks the number of black/white/black modules seen so far
+ int[] stateCount = new int[3];
+ for (int iGen = 0; iGen < height; iGen++)
+ {
+ // Search from middle outwards
+ int i = middleI + ((iGen & 0x01) == 0 ? ((iGen + 1) >> 1) : -((iGen + 1) >> 1));
+ stateCount[0] = 0;
+ stateCount[1] = 0;
+ stateCount[2] = 0;
+ int j = startX;
+ // Burn off leading white pixels before anything else; if we start in the middle of
+ // a white run, it doesn't make sense to count its length, since we don't know if the
+ // white run continued to the left of the start point
+ while (j < maxJ && !image[j, i])
+ {
+ j++;
+ }
+ int currentState = 0;
+ while (j < maxJ)
+ {
+ if (image[j, i])
+ {
+ // Black pixel
+ if (currentState == 1)
+ {
+ // Counting black pixels
+ stateCount[currentState]++;
+ }
+ else
+ {
+ // Counting white pixels
+ if (currentState == 2)
+ {
+ // A winner?
+ if (foundPatternCross(stateCount))
+ {
+ // Yes
+ AlignmentPattern confirmed = handlePossibleCenter(stateCount, i, j);
+ if (confirmed != null)
+ {
+ return confirmed;
+ }
+ }
+ stateCount[0] = stateCount[2];
+ stateCount[1] = 1;
+ stateCount[2] = 0;
+ currentState = 1;
+ }
+ else
+ {
+ stateCount[++currentState]++;
+ }
+ }
+ }
+ else
+ {
+ // White pixel
+ if (currentState == 1)
+ {
+ // Counting black pixels
+ currentState++;
+ }
+ stateCount[currentState]++;
+ }
+ j++;
+ }
+ if (foundPatternCross(stateCount))
+ {
+ AlignmentPattern confirmed = handlePossibleCenter(stateCount, i, maxJ);
+ if (confirmed != null)
+ {
+ return confirmed;
+ }
+ }
+ }
+
+ // Hmm, nothing we saw was observed and confirmed twice. If we had
+ // any guess at all, return it.
+ if (possibleCenters.Count != 0)
+ {
+ return possibleCenters[0];
+ }
+
+ return null;
+ }
+
+ /// Given a count of black/white/black pixels just seen and an end position,
+ /// figures the location of the center of this black/white/black run.
+ ///
+ private static float? centerFromEnd(int[] stateCount, int end)
+ {
+ var result = (end - stateCount[2]) - stateCount[1] / 2.0f;
+ if (Single.IsNaN(result))
+ return null;
+ return result;
+ }
+
+ /// count of black/white/black pixels just read
+ ///
+ /// true iff the proportions of the counts is close enough to the 1/1/1 ratios
+ /// used by alignment patterns to be considered a match
+ ///
+ private bool foundPatternCross(int[] stateCount)
+ {
+ float maxVariance = moduleSize / 2.0f;
+ for (int i = 0; i < 3; i++)
+ {
+ if (Math.Abs(moduleSize - stateCount[i]) >= maxVariance)
+ {
+ return false;
+ }
+ }
+ return true;
+ }
+
+ ///
+ /// After a horizontal scan finds a potential alignment pattern, this method
+ /// "cross-checks" by scanning down vertically through the center of the possible
+ /// alignment pattern to see if the same proportion is detected.
+ ///
+ /// row where an alignment pattern was detected
+ /// center of the section that appears to cross an alignment pattern
+ /// maximum reasonable number of modules that should be
+ /// observed in any reading state, based on the results of the horizontal scan
+ /// The original state count total.
+ ///
+ /// vertical center of alignment pattern, or null if not found
+ ///
+ private float? crossCheckVertical(int startI, int centerJ, int maxCount, int originalStateCountTotal)
+ {
+ int maxI = image.Height;
+ int[] stateCount = crossCheckStateCount;
+ stateCount[0] = 0;
+ stateCount[1] = 0;
+ stateCount[2] = 0;
+
+ // Start counting up from center
+ int i = startI;
+ while (i >= 0 && image[centerJ, i] && stateCount[1] <= maxCount)
+ {
+ stateCount[1]++;
+ i--;
+ }
+ // If already too many modules in this state or ran off the edge:
+ if (i < 0 || stateCount[1] > maxCount)
+ {
+ return null;
+ }
+ while (i >= 0 && !image[centerJ, i] && stateCount[0] <= maxCount)
+ {
+ stateCount[0]++;
+ i--;
+ }
+ if (stateCount[0] > maxCount)
+ {
+ return null;
+ }
+
+ // Now also count down from center
+ i = startI + 1;
+ while (i < maxI && image[centerJ, i] && stateCount[1] <= maxCount)
+ {
+ stateCount[1]++;
+ i++;
+ }
+ if (i == maxI || stateCount[1] > maxCount)
+ {
+ return null;
+ }
+ while (i < maxI && !image[centerJ, i] && stateCount[2] <= maxCount)
+ {
+ stateCount[2]++;
+ i++;
+ }
+ if (stateCount[2] > maxCount)
+ {
+ return null;
+ }
+
+ int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+ if (5 * Math.Abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal)
+ {
+ return null;
+ }
+
+ return foundPatternCross(stateCount) ? centerFromEnd(stateCount, i) : null;
+ }
+
+ /// This is called when a horizontal scan finds a possible alignment pattern. It will
+ /// cross check with a vertical scan, and if successful, will see if this pattern had been
+ /// found on a previous horizontal scan. If so, we consider it confirmed and conclude we have
+ /// found the alignment pattern.
+ ///
+ ///
+ /// reading state module counts from horizontal scan
+ ///
+ /// row where alignment pattern may be found
+ ///
+ /// end of possible alignment pattern in row
+ ///
+ /// {@link AlignmentPattern} if we have found the same pattern twice, or null if not
+ ///
+ private AlignmentPattern handlePossibleCenter(int[] stateCount, int i, int j)
+ {
+ int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+ float? centerJ = centerFromEnd(stateCount, j);
+ if (centerJ == null)
+ return null;
+ float? centerI = crossCheckVertical(i, (int)centerJ, 2 * stateCount[1], stateCountTotal);
+ if (centerI != null)
+ {
+ float estimatedModuleSize = (stateCount[0] + stateCount[1] + stateCount[2]) / 3.0f;
+ foreach (var center in possibleCenters)
+ {
+ // Look for about the same center and module size:
+ if (center.aboutEquals(estimatedModuleSize, centerI.Value, centerJ.Value))
+ {
+ return center.combineEstimate(centerI.Value, centerJ.Value, estimatedModuleSize);
+ }
+ }
+ // Hadn't found this before; save it
+ var point = new AlignmentPattern(centerJ.Value, centerI.Value, estimatedModuleSize);
+ possibleCenters.Add(point);
+ if (resultPointCallback != null)
+ {
+ resultPointCallback(point);
+ }
+ }
+ return null;
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/detector/Detector.cs b/shadowsocks-csharp/3rd/zxing/qrcode/detector/Detector.cs
new file mode 100755
index 00000000..7ae8e3db
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/detector/Detector.cs
@@ -0,0 +1,429 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using System;
+using System.Collections.Generic;
+
+using ZXing.Common;
+using ZXing.Common.Detector;
+
+namespace ZXing.QrCode.Internal
+{
+ ///
+ /// Encapsulates logic that can detect a QR Code in an image, even if the QR Code
+ /// is rotated or skewed, or partially obscured.
+ ///
+ /// Sean Owen
+ public class Detector
+ {
+ private readonly BitMatrix image;
+ private ResultPointCallback resultPointCallback;
+
+ ///
+ /// Initializes a new instance of the class.
+ ///
+ /// The image.
+ public Detector(BitMatrix image)
+ {
+ this.image = image;
+ }
+
+ ///
+ /// Gets the image.
+ ///
+ virtual protected internal BitMatrix Image
+ {
+ get
+ {
+ return image;
+ }
+ }
+
+ ///
+ /// Gets the result point callback.
+ ///
+ virtual protected internal ResultPointCallback ResultPointCallback
+ {
+ get
+ {
+ return resultPointCallback;
+ }
+ }
+
+ ///
+ /// Detects a QR Code in an image, simply.
+ ///
+ ///
+ /// encapsulating results of detecting a QR Code
+ ///
+ public virtual DetectorResult detect()
+ {
+ return detect(null);
+ }
+
+ ///
+ /// Detects a QR Code in an image, simply.
+ ///
+ /// optional hints to detector
+ ///
+ /// encapsulating results of detecting a QR Code
+ ///
+ public virtual DetectorResult detect(IDictionary hints)
+ {
+ resultPointCallback = hints == null || !hints.ContainsKey(DecodeHintType.NEED_RESULT_POINT_CALLBACK) ? null : (ResultPointCallback)hints[DecodeHintType.NEED_RESULT_POINT_CALLBACK];
+
+ FinderPatternFinder finder = new FinderPatternFinder(image, resultPointCallback);
+ FinderPatternInfo info = finder.find(hints);
+ if (info == null)
+ return null;
+
+ return processFinderPatternInfo(info);
+ }
+
+ ///
+ /// Processes the finder pattern info.
+ ///
+ /// The info.
+ ///
+ protected internal virtual DetectorResult processFinderPatternInfo(FinderPatternInfo info)
+ {
+ FinderPattern topLeft = info.TopLeft;
+ FinderPattern topRight = info.TopRight;
+ FinderPattern bottomLeft = info.BottomLeft;
+
+ float moduleSize = calculateModuleSize(topLeft, topRight, bottomLeft);
+ if (moduleSize < 1.0f)
+ {
+ return null;
+ }
+ int dimension;
+ if (!computeDimension(topLeft, topRight, bottomLeft, moduleSize, out dimension))
+ return null;
+ Internal.Version provisionalVersion = Internal.Version.getProvisionalVersionForDimension(dimension);
+ if (provisionalVersion == null)
+ return null;
+ int modulesBetweenFPCenters = provisionalVersion.DimensionForVersion - 7;
+
+ AlignmentPattern alignmentPattern = null;
+ // Anything above version 1 has an alignment pattern
+ if (provisionalVersion.AlignmentPatternCenters.Length > 0)
+ {
+
+ // Guess where a "bottom right" finder pattern would have been
+ float bottomRightX = topRight.X - topLeft.X + bottomLeft.X;
+ float bottomRightY = topRight.Y - topLeft.Y + bottomLeft.Y;
+
+ // Estimate that alignment pattern is closer by 3 modules
+ // from "bottom right" to known top left location
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ float correctionToTopLeft = 1.0f - 3.0f / (float)modulesBetweenFPCenters;
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ int estAlignmentX = (int)(topLeft.X + correctionToTopLeft * (bottomRightX - topLeft.X));
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ int estAlignmentY = (int)(topLeft.Y + correctionToTopLeft * (bottomRightY - topLeft.Y));
+
+ // Kind of arbitrary -- expand search radius before giving up
+ for (int i = 4; i <= 16; i <<= 1)
+ {
+ alignmentPattern = findAlignmentInRegion(moduleSize, estAlignmentX, estAlignmentY, (float)i);
+ if (alignmentPattern == null)
+ continue;
+ break;
+ }
+ // If we didn't find alignment pattern... well try anyway without it
+ }
+
+ PerspectiveTransform transform = createTransform(topLeft, topRight, bottomLeft, alignmentPattern, dimension);
+
+ BitMatrix bits = sampleGrid(image, transform, dimension);
+ if (bits == null)
+ return null;
+
+ ResultPoint[] points;
+ if (alignmentPattern == null)
+ {
+ points = new ResultPoint[] { bottomLeft, topLeft, topRight };
+ }
+ else
+ {
+ points = new ResultPoint[] { bottomLeft, topLeft, topRight, alignmentPattern };
+ }
+ return new DetectorResult(bits, points);
+ }
+
+ private static PerspectiveTransform createTransform(ResultPoint topLeft, ResultPoint topRight, ResultPoint bottomLeft, ResultPoint alignmentPattern, int dimension)
+ {
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ float dimMinusThree = (float)dimension - 3.5f;
+ float bottomRightX;
+ float bottomRightY;
+ float sourceBottomRightX;
+ float sourceBottomRightY;
+ if (alignmentPattern != null)
+ {
+ bottomRightX = alignmentPattern.X;
+ bottomRightY = alignmentPattern.Y;
+ sourceBottomRightX = sourceBottomRightY = dimMinusThree - 3.0f;
+ }
+ else
+ {
+ // Don't have an alignment pattern, just make up the bottom-right point
+ bottomRightX = (topRight.X - topLeft.X) + bottomLeft.X;
+ bottomRightY = (topRight.Y - topLeft.Y) + bottomLeft.Y;
+ sourceBottomRightX = sourceBottomRightY = dimMinusThree;
+ }
+
+ return PerspectiveTransform.quadrilateralToQuadrilateral(
+ 3.5f,
+ 3.5f,
+ dimMinusThree,
+ 3.5f,
+ sourceBottomRightX,
+ sourceBottomRightY,
+ 3.5f,
+ dimMinusThree,
+ topLeft.X,
+ topLeft.Y,
+ topRight.X,
+ topRight.Y,
+ bottomRightX,
+ bottomRightY,
+ bottomLeft.X,
+ bottomLeft.Y);
+ }
+
+ private static BitMatrix sampleGrid(BitMatrix image, PerspectiveTransform transform, int dimension)
+ {
+ GridSampler sampler = GridSampler.Instance;
+ return sampler.sampleGrid(image, dimension, dimension, transform);
+ }
+
+ /// Computes the dimension (number of modules on a size) of the QR Code based on the position
+ /// of the finder patterns and estimated module size.
+ ///
+ private static bool computeDimension(ResultPoint topLeft, ResultPoint topRight, ResultPoint bottomLeft, float moduleSize, out int dimension)
+ {
+ int tltrCentersDimension = MathUtils.round(ResultPoint.distance(topLeft, topRight) / moduleSize);
+ int tlblCentersDimension = MathUtils.round(ResultPoint.distance(topLeft, bottomLeft) / moduleSize);
+ dimension = ((tltrCentersDimension + tlblCentersDimension) >> 1) + 7;
+ switch (dimension & 0x03)
+ {
+ // mod 4
+ case 0:
+ dimension++;
+ break;
+ // 1? do nothing
+ case 2:
+ dimension--;
+ break;
+ case 3:
+ return true;
+ }
+ return true;
+ }
+
+ /// Computes an average estimated module size based on estimated derived from the positions
+ /// of the three finder patterns.
+ ///
+ protected internal virtual float calculateModuleSize(ResultPoint topLeft, ResultPoint topRight, ResultPoint bottomLeft)
+ {
+ // Take the average
+ return (calculateModuleSizeOneWay(topLeft, topRight) + calculateModuleSizeOneWay(topLeft, bottomLeft)) / 2.0f;
+ }
+
+ /// Estimates module size based on two finder patterns -- it uses
+ /// {@link #sizeOfBlackWhiteBlackRunBothWays(int, int, int, int)} to figure the
+ /// width of each, measuring along the axis between their centers.
+ ///
+ private float calculateModuleSizeOneWay(ResultPoint pattern, ResultPoint otherPattern)
+ {
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ float moduleSizeEst1 = sizeOfBlackWhiteBlackRunBothWays((int)pattern.X, (int)pattern.Y, (int)otherPattern.X, (int)otherPattern.Y);
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ float moduleSizeEst2 = sizeOfBlackWhiteBlackRunBothWays((int)otherPattern.X, (int)otherPattern.Y, (int)pattern.X, (int)pattern.Y);
+ if (Single.IsNaN(moduleSizeEst1))
+ {
+ return moduleSizeEst2 / 7.0f;
+ }
+ if (Single.IsNaN(moduleSizeEst2))
+ {
+ return moduleSizeEst1 / 7.0f;
+ }
+ // Average them, and divide by 7 since we've counted the width of 3 black modules,
+ // and 1 white and 1 black module on either side. Ergo, divide sum by 14.
+ return (moduleSizeEst1 + moduleSizeEst2) / 14.0f;
+ }
+
+ /// See {@link #sizeOfBlackWhiteBlackRun(int, int, int, int)}; computes the total width of
+ /// a finder pattern by looking for a black-white-black run from the center in the direction
+ /// of another point (another finder pattern center), and in the opposite direction too.
+ ///
+ private float sizeOfBlackWhiteBlackRunBothWays(int fromX, int fromY, int toX, int toY)
+ {
+
+ float result = sizeOfBlackWhiteBlackRun(fromX, fromY, toX, toY);
+
+ // Now count other way -- don't run off image though of course
+ float scale = 1.0f;
+ int otherToX = fromX - (toX - fromX);
+ if (otherToX < 0)
+ {
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ scale = (float)fromX / (float)(fromX - otherToX);
+ otherToX = 0;
+ }
+ else if (otherToX >= image.Width)
+ {
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ scale = (float)(image.Width - 1 - fromX) / (float)(otherToX - fromX);
+ otherToX = image.Width - 1;
+ }
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ int otherToY = (int)(fromY - (toY - fromY) * scale);
+
+ scale = 1.0f;
+ if (otherToY < 0)
+ {
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ scale = (float)fromY / (float)(fromY - otherToY);
+ otherToY = 0;
+ }
+ else if (otherToY >= image.Height)
+ {
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ scale = (float)(image.Height - 1 - fromY) / (float)(otherToY - fromY);
+ otherToY = image.Height - 1;
+ }
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ otherToX = (int)(fromX + (otherToX - fromX) * scale);
+
+ result += sizeOfBlackWhiteBlackRun(fromX, fromY, otherToX, otherToY);
+ return result - 1.0f; // -1 because we counted the middle pixel twice
+ }
+
+ /// This method traces a line from a point in the image, in the direction towards another point.
+ /// It begins in a black region, and keeps going until it finds white, then black, then white again.
+ /// It reports the distance from the start to this point.
+ ///
+ /// This is used when figuring out how wide a finder pattern is, when the finder pattern
+ /// may be skewed or rotated.
+ ///
+ private float sizeOfBlackWhiteBlackRun(int fromX, int fromY, int toX, int toY)
+ {
+ // Mild variant of Bresenham's algorithm;
+ // see http://en.wikipedia.org/wiki/Bresenham's_line_algorithm
+ bool steep = Math.Abs(toY - fromY) > Math.Abs(toX - fromX);
+ if (steep)
+ {
+ int temp = fromX;
+ fromX = fromY;
+ fromY = temp;
+ temp = toX;
+ toX = toY;
+ toY = temp;
+ }
+
+ int dx = Math.Abs(toX - fromX);
+ int dy = Math.Abs(toY - fromY);
+ int error = -dx >> 1;
+ int xstep = fromX < toX ? 1 : -1;
+ int ystep = fromY < toY ? 1 : -1;
+
+ // In black pixels, looking for white, first or second time.
+ int state = 0;
+ // Loop up until x == toX, but not beyond
+ int xLimit = toX + xstep;
+ for (int x = fromX, y = fromY; x != xLimit; x += xstep)
+ {
+ int realX = steep ? y : x;
+ int realY = steep ? x : y;
+
+ // Does current pixel mean we have moved white to black or vice versa?
+ // Scanning black in state 0,2 and white in state 1, so if we find the wrong
+ // color, advance to next state or end if we are in state 2 already
+ if ((state == 1) == image[realX, realY])
+ {
+ if (state == 2)
+ {
+ return MathUtils.distance(x, y, fromX, fromY);
+ }
+ state++;
+ }
+ error += dy;
+ if (error > 0)
+ {
+ if (y == toY)
+ {
+
+
+ break;
+ }
+ y += ystep;
+ error -= dx;
+ }
+ }
+ // Found black-white-black; give the benefit of the doubt that the next pixel outside the image
+ // is "white" so this last point at (toX+xStep,toY) is the right ending. This is really a
+ // small approximation; (toX+xStep,toY+yStep) might be really correct. Ignore this.
+ if (state == 2)
+ {
+ return MathUtils.distance(toX + xstep, toY, fromX, fromY);
+ }
+ // else we didn't find even black-white-black; no estimate is really possible
+ return Single.NaN;
+
+ }
+
+ ///
+ /// Attempts to locate an alignment pattern in a limited region of the image, which is
+ /// guessed to contain it. This method uses {@link AlignmentPattern}.
+ ///
+ /// estimated module size so far
+ /// x coordinate of center of area probably containing alignment pattern
+ /// y coordinate of above
+ /// number of pixels in all directions to search from the center
+ ///
+ /// if found, or null otherwise
+ ///
+ protected AlignmentPattern findAlignmentInRegion(float overallEstModuleSize, int estAlignmentX, int estAlignmentY, float allowanceFactor)
+ {
+ // Look for an alignment pattern (3 modules in size) around where it
+ // should be
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ int allowance = (int)(allowanceFactor * overallEstModuleSize);
+ int alignmentAreaLeftX = Math.Max(0, estAlignmentX - allowance);
+ int alignmentAreaRightX = Math.Min(image.Width - 1, estAlignmentX + allowance);
+ if (alignmentAreaRightX - alignmentAreaLeftX < overallEstModuleSize * 3)
+ {
+ return null;
+ }
+
+ int alignmentAreaTopY = Math.Max(0, estAlignmentY - allowance);
+ int alignmentAreaBottomY = Math.Min(image.Height - 1, estAlignmentY + allowance);
+
+ var alignmentFinder = new AlignmentPatternFinder(
+ image,
+ alignmentAreaLeftX,
+ alignmentAreaTopY,
+ alignmentAreaRightX - alignmentAreaLeftX,
+ alignmentAreaBottomY - alignmentAreaTopY,
+ overallEstModuleSize,
+ resultPointCallback);
+
+ return alignmentFinder.find();
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/detector/FinderPattern.cs b/shadowsocks-csharp/3rd/zxing/qrcode/detector/FinderPattern.cs
new file mode 100755
index 00000000..80469bf7
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/detector/FinderPattern.cs
@@ -0,0 +1,107 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using System;
+
+namespace ZXing.QrCode.Internal
+{
+ ///
+ /// Encapsulates a finder pattern, which are the three square patterns found in
+ /// the corners of QR Codes. It also encapsulates a count of similar finder patterns,
+ /// as a convenience to the finder's bookkeeping.
+ ///
+ /// Sean Owen
+ public sealed class FinderPattern : ResultPoint
+ {
+ private readonly float estimatedModuleSize;
+ private int count;
+
+ internal FinderPattern(float posX, float posY, float estimatedModuleSize)
+ : this(posX, posY, estimatedModuleSize, 1)
+ {
+ this.estimatedModuleSize = estimatedModuleSize;
+ this.count = 1;
+ }
+
+ internal FinderPattern(float posX, float posY, float estimatedModuleSize, int count)
+ : base(posX, posY)
+ {
+ this.estimatedModuleSize = estimatedModuleSize;
+ this.count = count;
+ }
+
+ ///
+ /// Gets the size of the estimated module.
+ ///
+ ///
+ /// The size of the estimated module.
+ ///
+ public float EstimatedModuleSize
+ {
+ get
+ {
+ return estimatedModuleSize;
+ }
+ }
+
+ internal int Count
+ {
+ get
+ {
+ return count;
+ }
+ }
+
+ /*
+ internal void incrementCount()
+ {
+ this.count++;
+ }
+ */
+
+ /// Determines if this finder pattern "about equals" a finder pattern at the stated
+ /// position and size -- meaning, it is at nearly the same center with nearly the same size.
+ ///
+ internal bool aboutEquals(float moduleSize, float i, float j)
+ {
+ if (Math.Abs(i - Y) <= moduleSize && Math.Abs(j - X) <= moduleSize)
+ {
+ float moduleSizeDiff = Math.Abs(moduleSize - estimatedModuleSize);
+ return moduleSizeDiff <= 1.0f || moduleSizeDiff <= estimatedModuleSize;
+
+ }
+ return false;
+ }
+
+ ///
+ /// Combines this object's current estimate of a finder pattern position and module size
+ /// with a new estimate. It returns a new {@code FinderPattern} containing a weighted average
+ /// based on count.
+ ///
+ /// The i.
+ /// The j.
+ /// New size of the module.
+ ///
+ internal FinderPattern combineEstimate(float i, float j, float newModuleSize)
+ {
+ int combinedCount = count + 1;
+ float combinedX = (count * X + j) / combinedCount;
+ float combinedY = (count * Y + i) / combinedCount;
+ float combinedModuleSize = (count * estimatedModuleSize + newModuleSize) / combinedCount;
+ return new FinderPattern(combinedX, combinedY, combinedModuleSize, combinedCount);
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/detector/FinderPatternFinder.cs b/shadowsocks-csharp/3rd/zxing/qrcode/detector/FinderPatternFinder.cs
new file mode 100755
index 00000000..7b4c5113
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/detector/FinderPatternFinder.cs
@@ -0,0 +1,808 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+using System;
+using System.Collections.Generic;
+
+using ZXing.Common;
+
+namespace ZXing.QrCode.Internal
+{
+ ///
+ /// This class attempts to find finder patterns in a QR Code. Finder patterns are the square
+ /// markers at three corners of a QR Code.
+ ///
+ /// This class is thread-safe but not reentrant. Each thread must allocate its own object.
+ ///
+ /// Sean Owen
+ public class FinderPatternFinder
+ {
+ private const int CENTER_QUORUM = 2;
+ ///
+ /// 1 pixel/module times 3 modules/center
+ ///
+ protected internal const int MIN_SKIP = 3;
+ ///
+ /// support up to version 10 for mobile clients
+ ///
+ protected internal const int MAX_MODULES = 57;
+ private const int INTEGER_MATH_SHIFT = 8;
+
+ private readonly BitMatrix image;
+ private List possibleCenters;
+ private bool hasSkipped;
+ private readonly int[] crossCheckStateCount;
+ private readonly ResultPointCallback resultPointCallback;
+
+ ///
+ /// Creates a finder that will search the image for three finder patterns.
+ ///
+ /// image to search
+ public FinderPatternFinder(BitMatrix image)
+ : this(image, null)
+ {
+ }
+
+ ///
+ /// Initializes a new instance of the class.
+ ///
+ /// The image.
+ /// The result point callback.
+ public FinderPatternFinder(BitMatrix image, ResultPointCallback resultPointCallback)
+ {
+ this.image = image;
+ this.possibleCenters = new List();
+ this.crossCheckStateCount = new int[5];
+ this.resultPointCallback = resultPointCallback;
+ }
+
+ ///
+ /// Gets the image.
+ ///
+ virtual protected internal BitMatrix Image
+ {
+ get
+ {
+ return image;
+ }
+ }
+
+ ///
+ /// Gets the possible centers.
+ ///
+ virtual protected internal List PossibleCenters
+ {
+ get
+ {
+ return possibleCenters;
+ }
+ }
+
+ internal virtual FinderPatternInfo find(IDictionary hints)
+ {
+ bool tryHarder = hints != null && hints.ContainsKey(DecodeHintType.TRY_HARDER);
+ bool pureBarcode = hints != null && hints.ContainsKey(DecodeHintType.PURE_BARCODE);
+ int maxI = image.Height;
+ int maxJ = image.Width;
+ // We are looking for black/white/black/white/black modules in
+ // 1:1:3:1:1 ratio; this tracks the number of such modules seen so far
+
+ // Let's assume that the maximum version QR Code we support takes up 1/4 the height of the
+ // image, and then account for the center being 3 modules in size. This gives the smallest
+ // number of pixels the center could be, so skip this often. When trying harder, look for all
+ // QR versions regardless of how dense they are.
+ int iSkip = (3 * maxI) / (4 * MAX_MODULES);
+ if (iSkip < MIN_SKIP || tryHarder)
+ {
+ iSkip = MIN_SKIP;
+ }
+
+ bool done = false;
+ int[] stateCount = new int[5];
+ for (int i = iSkip - 1; i < maxI && !done; i += iSkip)
+ {
+ // Get a row of black/white values
+ stateCount[0] = 0;
+ stateCount[1] = 0;
+ stateCount[2] = 0;
+ stateCount[3] = 0;
+ stateCount[4] = 0;
+ int currentState = 0;
+ for (int j = 0; j < maxJ; j++)
+ {
+ if (image[j, i])
+ {
+ // Black pixel
+ if ((currentState & 1) == 1)
+ {
+ // Counting white pixels
+ currentState++;
+ }
+ stateCount[currentState]++;
+ }
+ else
+ {
+ // White pixel
+ if ((currentState & 1) == 0)
+ {
+ // Counting black pixels
+ if (currentState == 4)
+ {
+ // A winner?
+ if (foundPatternCross(stateCount))
+ {
+ // Yes
+ bool confirmed = handlePossibleCenter(stateCount, i, j, pureBarcode);
+ if (confirmed)
+ {
+ // Start examining every other line. Checking each line turned out to be too
+ // expensive and didn't improve performance.
+ iSkip = 2;
+ if (hasSkipped)
+ {
+ done = haveMultiplyConfirmedCenters();
+ }
+ else
+ {
+ int rowSkip = findRowSkip();
+ if (rowSkip > stateCount[2])
+ {
+ // Skip rows between row of lower confirmed center
+ // and top of presumed third confirmed center
+ // but back up a bit to get a full chance of detecting
+ // it, entire width of center of finder pattern
+
+ // Skip by rowSkip, but back off by stateCount[2] (size of last center
+ // of pattern we saw) to be conservative, and also back off by iSkip which
+ // is about to be re-added
+ i += rowSkip - stateCount[2] - iSkip;
+ j = maxJ - 1;
+ }
+ }
+ }
+ else
+ {
+ stateCount[0] = stateCount[2];
+ stateCount[1] = stateCount[3];
+ stateCount[2] = stateCount[4];
+ stateCount[3] = 1;
+ stateCount[4] = 0;
+ currentState = 3;
+ continue;
+ }
+ // Clear state to start looking again
+ currentState = 0;
+ stateCount[0] = 0;
+ stateCount[1] = 0;
+ stateCount[2] = 0;
+ stateCount[3] = 0;
+ stateCount[4] = 0;
+ }
+ else
+ {
+ // No, shift counts back by two
+ stateCount[0] = stateCount[2];
+ stateCount[1] = stateCount[3];
+ stateCount[2] = stateCount[4];
+ stateCount[3] = 1;
+ stateCount[4] = 0;
+ currentState = 3;
+ }
+ }
+ else
+ {
+ stateCount[++currentState]++;
+ }
+ }
+ else
+ {
+ // Counting white pixels
+ stateCount[currentState]++;
+ }
+ }
+ }
+ if (foundPatternCross(stateCount))
+ {
+ bool confirmed = handlePossibleCenter(stateCount, i, maxJ, pureBarcode);
+ if (confirmed)
+ {
+ iSkip = stateCount[0];
+ if (hasSkipped)
+ {
+ // Found a third one
+ done = haveMultiplyConfirmedCenters();
+ }
+ }
+ }
+ }
+
+ FinderPattern[] patternInfo = selectBestPatterns();
+ if (patternInfo == null)
+ return null;
+
+ ResultPoint.orderBestPatterns(patternInfo);
+
+ return new FinderPatternInfo(patternInfo);
+ }
+
+ /// Given a count of black/white/black/white/black pixels just seen and an end position,
+ /// figures the location of the center of this run.
+ ///
+ private static float? centerFromEnd(int[] stateCount, int end)
+ {
+ var result = (end - stateCount[4] - stateCount[3]) - stateCount[2] / 2.0f;
+ if (Single.IsNaN(result))
+ return null;
+ return result;
+ }
+
+ /// count of black/white/black/white/black pixels just read
+ ///
+ /// true iff the proportions of the counts is close enough to the 1/1/3/1/1 ratios
+ /// used by finder patterns to be considered a match
+ ///
+ protected internal static bool foundPatternCross(int[] stateCount)
+ {
+ int totalModuleSize = 0;
+ for (int i = 0; i < 5; i++)
+ {
+ int count = stateCount[i];
+ if (count == 0)
+ {
+ return false;
+ }
+ totalModuleSize += count;
+ }
+ if (totalModuleSize < 7)
+ {
+ return false;
+ }
+ int moduleSize = (totalModuleSize << INTEGER_MATH_SHIFT) / 7;
+ int maxVariance = moduleSize / 2;
+ // Allow less than 50% variance from 1-1-3-1-1 proportions
+ return Math.Abs(moduleSize - (stateCount[0] << INTEGER_MATH_SHIFT)) < maxVariance &&
+ Math.Abs(moduleSize - (stateCount[1] << INTEGER_MATH_SHIFT)) < maxVariance &&
+ Math.Abs(3 * moduleSize - (stateCount[2] << INTEGER_MATH_SHIFT)) < 3 * maxVariance &&
+ Math.Abs(moduleSize - (stateCount[3] << INTEGER_MATH_SHIFT)) < maxVariance &&
+ Math.Abs(moduleSize - (stateCount[4] << INTEGER_MATH_SHIFT)) < maxVariance;
+ }
+
+ private int[] CrossCheckStateCount
+ {
+ get
+ {
+ crossCheckStateCount[0] = 0;
+ crossCheckStateCount[1] = 0;
+ crossCheckStateCount[2] = 0;
+ crossCheckStateCount[3] = 0;
+ crossCheckStateCount[4] = 0;
+ return crossCheckStateCount;
+ }
+ }
+
+ ///
+ /// After a vertical and horizontal scan finds a potential finder pattern, this method
+ /// "cross-cross-cross-checks" by scanning down diagonally through the center of the possible
+ /// finder pattern to see if the same proportion is detected.
+ ///
+ /// row where a finder pattern was detected
+ /// center of the section that appears to cross a finder pattern
+ /// maximum reasonable number of modules that should be observed in any reading state, based on the results of the horizontal scan
+ /// The original state count total.
+ /// true if proportions are withing expected limits
+ private bool crossCheckDiagonal(int startI, int centerJ, int maxCount, int originalStateCountTotal)
+ {
+ int maxI = image.Height;
+ int maxJ = image.Width;
+ int[] stateCount = CrossCheckStateCount;
+
+ // Start counting up, left from center finding black center mass
+ int i = 0;
+ while (startI - i >= 0 && image[centerJ - i, startI - i])
+ {
+ stateCount[2]++;
+ i++;
+ }
+
+ if ((startI - i < 0) || (centerJ - i < 0))
+ {
+ return false;
+ }
+
+ // Continue up, left finding white space
+ while ((startI - i >= 0) && (centerJ - i >= 0) && !image[centerJ - i, startI - i] && stateCount[1] <= maxCount)
+ {
+ stateCount[1]++;
+ i++;
+ }
+
+ // If already too many modules in this state or ran off the edge:
+ if ((startI - i < 0) || (centerJ - i < 0) || stateCount[1] > maxCount)
+ {
+ return false;
+ }
+
+ // Continue up, left finding black border
+ while ((startI - i >= 0) && (centerJ - i >= 0) && image[centerJ - i, startI - i] && stateCount[0] <= maxCount)
+ {
+ stateCount[0]++;
+ i++;
+ }
+ if (stateCount[0] > maxCount)
+ {
+ return false;
+ }
+
+ // Now also count down, right from center
+ i = 1;
+ while ((startI + i < maxI) && (centerJ + i < maxJ) && image[centerJ + i, startI + i])
+ {
+ stateCount[2]++;
+ i++;
+ }
+
+ // Ran off the edge?
+ if ((startI + i >= maxI) || (centerJ + i >= maxJ))
+ {
+ return false;
+ }
+
+ while ((startI + i < maxI) && (centerJ + i < maxJ) && !image[centerJ + i, startI + i] && stateCount[3] < maxCount)
+ {
+ stateCount[3]++;
+ i++;
+ }
+
+ if ((startI + i >= maxI) || (centerJ + i >= maxJ) || stateCount[3] >= maxCount)
+ {
+ return false;
+ }
+
+ while ((startI + i < maxI) && (centerJ + i < maxJ) && image[centerJ + i, startI + i] && stateCount[4] < maxCount)
+ {
+ stateCount[4]++;
+ i++;
+ }
+
+ if (stateCount[4] >= maxCount)
+ {
+ return false;
+ }
+
+ // If we found a finder-pattern-like section, but its size is more than 100% different than
+ // the original, assume it's a false positive
+ int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
+ return Math.Abs(stateCountTotal - originalStateCountTotal) < 2*originalStateCountTotal &&
+ foundPatternCross(stateCount);
+ }
+
+ ///
+ /// After a horizontal scan finds a potential finder pattern, this method
+ /// "cross-checks" by scanning down vertically through the center of the possible
+ /// finder pattern to see if the same proportion is detected.
+ ///
+ /// row where a finder pattern was detected
+ /// center of the section that appears to cross a finder pattern
+ /// maximum reasonable number of modules that should be
+ /// observed in any reading state, based on the results of the horizontal scan
+ /// The original state count total.
+ ///
+ /// vertical center of finder pattern, or null if not found
+ ///
+ private float? crossCheckVertical(int startI, int centerJ, int maxCount, int originalStateCountTotal)
+ {
+ int maxI = image.Height;
+ int[] stateCount = CrossCheckStateCount;
+
+ // Start counting up from center
+ int i = startI;
+ while (i >= 0 && image[centerJ, i])
+ {
+ stateCount[2]++;
+ i--;
+ }
+ if (i < 0)
+ {
+ return null;
+ }
+ while (i >= 0 && !image[centerJ, i] && stateCount[1] <= maxCount)
+ {
+ stateCount[1]++;
+ i--;
+ }
+ // If already too many modules in this state or ran off the edge:
+ if (i < 0 || stateCount[1] > maxCount)
+ {
+ return null;
+ }
+ while (i >= 0 && image[centerJ, i] && stateCount[0] <= maxCount)
+ {
+ stateCount[0]++;
+ i--;
+ }
+ if (stateCount[0] > maxCount)
+ {
+ return null;
+ }
+
+ // Now also count down from center
+ i = startI + 1;
+ while (i < maxI && image[centerJ, i])
+ {
+ stateCount[2]++;
+ i++;
+ }
+ if (i == maxI)
+ {
+ return null;
+ }
+ while (i < maxI && !image[centerJ, i] && stateCount[3] < maxCount)
+ {
+ stateCount[3]++;
+ i++;
+ }
+ if (i == maxI || stateCount[3] >= maxCount)
+ {
+ return null;
+ }
+ while (i < maxI && image[centerJ, i] && stateCount[4] < maxCount)
+ {
+ stateCount[4]++;
+ i++;
+ }
+ if (stateCount[4] >= maxCount)
+ {
+ return null;
+ }
+
+ // If we found a finder-pattern-like section, but its size is more than 40% different than
+ // the original, assume it's a false positive
+ int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
+ if (5 * Math.Abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal)
+ {
+ return null;
+ }
+
+ return foundPatternCross(stateCount) ? centerFromEnd(stateCount, i) : null;
+ }
+
+ /// Like {@link #crossCheckVertical(int, int, int, int)}, and in fact is basically identical,
+ /// except it reads horizontally instead of vertically. This is used to cross-cross
+ /// check a vertical cross check and locate the real center of the alignment pattern.
+ ///
+ private float? crossCheckHorizontal(int startJ, int centerI, int maxCount, int originalStateCountTotal)
+ {
+ int maxJ = image.Width;
+ int[] stateCount = CrossCheckStateCount;
+
+ int j = startJ;
+ while (j >= 0 && image[j, centerI])
+ {
+ stateCount[2]++;
+ j--;
+ }
+ if (j < 0)
+ {
+ return null;
+ }
+ while (j >= 0 && !image[j, centerI] && stateCount[1] <= maxCount)
+ {
+ stateCount[1]++;
+ j--;
+ }
+ if (j < 0 || stateCount[1] > maxCount)
+ {
+ return null;
+ }
+ while (j >= 0 && image[j, centerI] && stateCount[0] <= maxCount)
+ {
+ stateCount[0]++;
+ j--;
+ }
+ if (stateCount[0] > maxCount)
+ {
+ return null;
+ }
+
+ j = startJ + 1;
+ while (j < maxJ && image[j, centerI])
+ {
+ stateCount[2]++;
+ j++;
+ }
+ if (j == maxJ)
+ {
+ return null;
+ }
+ while (j < maxJ && !image[j, centerI] && stateCount[3] < maxCount)
+ {
+ stateCount[3]++;
+ j++;
+ }
+ if (j == maxJ || stateCount[3] >= maxCount)
+ {
+ return null;
+ }
+ while (j < maxJ && image[j, centerI] && stateCount[4] < maxCount)
+ {
+ stateCount[4]++;
+ j++;
+ }
+ if (stateCount[4] >= maxCount)
+ {
+ return null;
+ }
+
+ // If we found a finder-pattern-like section, but its size is significantly different than
+ // the original, assume it's a false positive
+ int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
+ if (5 * Math.Abs(stateCountTotal - originalStateCountTotal) >= originalStateCountTotal)
+ {
+ return null;
+ }
+
+ return foundPatternCross(stateCount) ? centerFromEnd(stateCount, j) : null;
+ }
+
+ ///
+ /// This is called when a horizontal scan finds a possible alignment pattern. It will
+ /// cross check with a vertical scan, and if successful, will, ah, cross-cross-check
+ /// with another horizontal scan. This is needed primarily to locate the real horizontal
+ /// center of the pattern in cases of extreme skew.
+ /// And then we cross-cross-cross check with another diagonal scan.
+ /// If that succeeds the finder pattern location is added to a list that tracks
+ /// the number of times each location has been nearly-matched as a finder pattern.
+ /// Each additional find is more evidence that the location is in fact a finder
+ /// pattern center
+ ///
+ /// reading state module counts from horizontal scan
+ /// row where finder pattern may be found
+ /// end of possible finder pattern in row
+ /// if set to true [pure barcode].
+ ///
+ /// true if a finder pattern candidate was found this time
+ ///
+ protected bool handlePossibleCenter(int[] stateCount, int i, int j, bool pureBarcode)
+ {
+ int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] +
+ stateCount[4];
+ float? centerJ = centerFromEnd(stateCount, j);
+ if (centerJ == null)
+ return false;
+ float? centerI = crossCheckVertical(i, (int)centerJ.Value, stateCount[2], stateCountTotal);
+ if (centerI != null)
+ {
+ // Re-cross check
+ centerJ = crossCheckHorizontal((int)centerJ.Value, (int)centerI.Value, stateCount[2], stateCountTotal);
+ if (centerJ != null &&
+ (!pureBarcode || crossCheckDiagonal((int) centerI, (int) centerJ, stateCount[2], stateCountTotal)))
+ {
+ float estimatedModuleSize = stateCountTotal / 7.0f;
+ bool found = false;
+ for (int index = 0; index < possibleCenters.Count; index++)
+ {
+ var center = possibleCenters[index];
+ // Look for about the same center and module size:
+ if (center.aboutEquals(estimatedModuleSize, centerI.Value, centerJ.Value))
+ {
+ possibleCenters.RemoveAt(index);
+ possibleCenters.Insert(index, center.combineEstimate(centerI.Value, centerJ.Value, estimatedModuleSize));
+
+ found = true;
+ break;
+ }
+ }
+ if (!found)
+ {
+ var point = new FinderPattern(centerJ.Value, centerI.Value, estimatedModuleSize);
+
+ possibleCenters.Add(point);
+ if (resultPointCallback != null)
+ {
+
+ resultPointCallback(point);
+ }
+ }
+ return true;
+ }
+ }
+ return false;
+ }
+
+ /// number of rows we could safely skip during scanning, based on the first
+ /// two finder patterns that have been located. In some cases their position will
+ /// allow us to infer that the third pattern must lie below a certain point farther
+ /// down in the image.
+ ///
+ private int findRowSkip()
+ {
+ int max = possibleCenters.Count;
+ if (max <= 1)
+ {
+ return 0;
+ }
+ ResultPoint firstConfirmedCenter = null;
+ foreach (var center in possibleCenters)
+ {
+ if (center.Count >= CENTER_QUORUM)
+ {
+ if (firstConfirmedCenter == null)
+ {
+ firstConfirmedCenter = center;
+ }
+ else
+ {
+ // We have two confirmed centers
+ // How far down can we skip before resuming looking for the next
+ // pattern? In the worst case, only the difference between the
+ // difference in the x / y coordinates of the two centers.
+ // This is the case where you find top left last.
+ hasSkipped = true;
+ //UPGRADE_WARNING: Data types in Visual C# might be different. Verify the accuracy of narrowing conversions. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1042'"
+ return (int)(Math.Abs(firstConfirmedCenter.X - center.X) - Math.Abs(firstConfirmedCenter.Y - center.Y)) / 2;
+ }
+ }
+ }
+ return 0;
+ }
+
+ /// true iff we have found at least 3 finder patterns that have been detected
+ /// at least {@link #CENTER_QUORUM} times each, and, the estimated module size of the
+ /// candidates is "pretty similar"
+ ///
+ private bool haveMultiplyConfirmedCenters()
+ {
+ int confirmedCount = 0;
+ float totalModuleSize = 0.0f;
+ int max = possibleCenters.Count;
+ foreach (var pattern in possibleCenters)
+ {
+ if (pattern.Count >= CENTER_QUORUM)
+ {
+ confirmedCount++;
+ totalModuleSize += pattern.EstimatedModuleSize;
+ }
+ }
+ if (confirmedCount < 3)
+ {
+ return false;
+ }
+ // OK, we have at least 3 confirmed centers, but, it's possible that one is a "false positive"
+ // and that we need to keep looking. We detect this by asking if the estimated module sizes
+ // vary too much. We arbitrarily say that when the total deviation from average exceeds
+ // 5% of the total module size estimates, it's too much.
+ float average = totalModuleSize / max;
+ float totalDeviation = 0.0f;
+ for (int i = 0; i < max; i++)
+ {
+ var pattern = possibleCenters[i];
+ totalDeviation += Math.Abs(pattern.EstimatedModuleSize - average);
+ }
+ return totalDeviation <= 0.05f * totalModuleSize;
+ }
+
+ /// the 3 best {@link FinderPattern}s from our list of candidates. The "best" are
+ /// those that have been detected at least {@link #CENTER_QUORUM} times, and whose module
+ /// size differs from the average among those patterns the least
+ ///
+ private FinderPattern[] selectBestPatterns()
+ {
+ int startSize = possibleCenters.Count;
+ if (startSize < 3)
+ {
+ // Couldn't find enough finder patterns
+ return null;
+ }
+
+ // Filter outlier possibilities whose module size is too different
+ if (startSize > 3)
+ {
+ // But we can only afford to do so if we have at least 4 possibilities to choose from
+ float totalModuleSize = 0.0f;
+ float square = 0.0f;
+ foreach (var center in possibleCenters)
+ {
+ float size = center.EstimatedModuleSize;
+ totalModuleSize += size;
+ square += size * size;
+ }
+ float average = totalModuleSize / startSize;
+ float stdDev = (float)Math.Sqrt(square / startSize - average * average);
+
+ possibleCenters.Sort(new FurthestFromAverageComparator(average));
+
+ float limit = Math.Max(0.2f * average, stdDev);
+
+ for (int i = 0; i < possibleCenters.Count && possibleCenters.Count > 3; i++)
+ {
+ FinderPattern pattern = possibleCenters[i];
+ if (Math.Abs(pattern.EstimatedModuleSize - average) > limit)
+ {
+ possibleCenters.RemoveAt(i);
+ i--;
+ }
+ }
+ }
+
+ if (possibleCenters.Count > 3)
+ {
+ // Throw away all but those first size candidate points we found.
+
+ float totalModuleSize = 0.0f;
+ foreach (var possibleCenter in possibleCenters)
+ {
+ totalModuleSize += possibleCenter.EstimatedModuleSize;
+ }
+
+ float average = totalModuleSize / possibleCenters.Count;
+
+ possibleCenters.Sort(new CenterComparator(average));
+
+ //possibleCenters.subList(3, possibleCenters.Count).clear();
+ possibleCenters = possibleCenters.GetRange(0, 3);
+ }
+
+ return new[]
+ {
+ possibleCenters[0],
+ possibleCenters[1],
+ possibleCenters[2]
+ };
+ }
+
+ ///
+ /// Orders by furthest from average
+ ///
+ private sealed class FurthestFromAverageComparator : IComparer
+ {
+ private readonly float average;
+
+ public FurthestFromAverageComparator(float f)
+ {
+ average = f;
+ }
+
+ public int Compare(FinderPattern x, FinderPattern y)
+ {
+ float dA = Math.Abs(y.EstimatedModuleSize - average);
+ float dB = Math.Abs(x.EstimatedModuleSize - average);
+ return dA < dB ? -1 : dA == dB ? 0 : 1;
+ }
+ }
+
+ /// Orders by {@link FinderPattern#getCount()}, descending.
+ private sealed class CenterComparator : IComparer
+ {
+ private readonly float average;
+
+ public CenterComparator(float f)
+ {
+ average = f;
+ }
+
+ public int Compare(FinderPattern x, FinderPattern y)
+ {
+ if (y.Count == x.Count)
+ {
+ float dA = Math.Abs(y.EstimatedModuleSize - average);
+ float dB = Math.Abs(x.EstimatedModuleSize - average);
+ return dA < dB ? 1 : dA == dB ? 0 : -1;
+ }
+ return y.Count - x.Count;
+ }
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/qrcode/detector/FinderPatternInfo.cs b/shadowsocks-csharp/3rd/zxing/qrcode/detector/FinderPatternInfo.cs
new file mode 100755
index 00000000..982b755a
--- /dev/null
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/detector/FinderPatternInfo.cs
@@ -0,0 +1,74 @@
+/*
+* Copyright 2007 ZXing authors
+*
+* Licensed under the Apache License, Version 2.0 (the "License");
+* you may not use this file except in compliance with the License.
+* You may obtain a copy of the License at
+*
+* http://www.apache.org/licenses/LICENSE-2.0
+*
+* Unless required by applicable law or agreed to in writing, software
+* distributed under the License is distributed on an "AS IS" BASIS,
+* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+* See the License for the specific language governing permissions and
+* limitations under the License.
+*/
+
+namespace ZXing.QrCode.Internal
+{
+ ///
+ /// Encapsulates information about finder patterns in an image, including the location of
+ /// the three finder patterns, and their estimated module size.
+ ///
+ /// Sean Owen
+ public sealed class FinderPatternInfo
+ {
+ private readonly FinderPattern bottomLeft;
+ private readonly FinderPattern topLeft;
+ private readonly FinderPattern topRight;
+
+ ///
+ /// Initializes a new instance of the class.
+ ///
+ /// The pattern centers.
+ public FinderPatternInfo(FinderPattern[] patternCenters)
+ {
+ this.bottomLeft = patternCenters[0];
+ this.topLeft = patternCenters[1];
+ this.topRight = patternCenters[2];
+ }
+
+ ///
+ /// Gets the bottom left.
+ ///
+ public FinderPattern BottomLeft
+ {
+ get
+ {
+ return bottomLeft;
+ }
+ }
+
+ ///
+ /// Gets the top left.
+ ///
+ public FinderPattern TopLeft
+ {
+ get
+ {
+ return topLeft;
+ }
+ }
+
+ ///
+ /// Gets the top right.
+ ///
+ public FinderPattern TopRight
+ {
+ get
+ {
+ return topRight;
+ }
+ }
+ }
+}
\ No newline at end of file
diff --git a/shadowsocks-csharp/3rd/zxing/BlockPair.cs b/shadowsocks-csharp/3rd/zxing/qrcode/encoder/BlockPair.cs
similarity index 100%
rename from shadowsocks-csharp/3rd/zxing/BlockPair.cs
rename to shadowsocks-csharp/3rd/zxing/qrcode/encoder/BlockPair.cs
diff --git a/shadowsocks-csharp/3rd/zxing/ByteMatrix.cs b/shadowsocks-csharp/3rd/zxing/qrcode/encoder/ByteMatrix.cs
similarity index 100%
rename from shadowsocks-csharp/3rd/zxing/ByteMatrix.cs
rename to shadowsocks-csharp/3rd/zxing/qrcode/encoder/ByteMatrix.cs
diff --git a/shadowsocks-csharp/3rd/zxing/Encoder.cs b/shadowsocks-csharp/3rd/zxing/qrcode/encoder/Encoder.cs
similarity index 67%
rename from shadowsocks-csharp/3rd/zxing/Encoder.cs
rename to shadowsocks-csharp/3rd/zxing/qrcode/encoder/Encoder.cs
index ae9996e9..32826a00 100755
--- a/shadowsocks-csharp/3rd/zxing/Encoder.cs
+++ b/shadowsocks-csharp/3rd/zxing/qrcode/encoder/Encoder.cs
@@ -30,6 +30,15 @@ namespace ZXing.QrCode.Internal
public static class Encoder
{
+ // The original table is defined in the table 5 of JISX0510:2004 (p.19).
+ private static readonly 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
+ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 44, -1, -1, -1, -1, -1, // 0x30-0x3f
+ -1, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, // 0x40-0x4f
+ 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, -1, -1, -1, -1, -1, // 0x50-0x5f
+ };
internal static String DEFAULT_BYTE_MODE_ENCODING = "ISO-8859-1";
@@ -52,15 +61,32 @@ namespace ZXing.QrCode.Internal
/// 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.
///
- ///