qrscanner 0.1

data/ext/qrscanner/zxing/core/src/zxing/qrcode/decoder/DecodedBitStreamParser.h

@@ -0,0 +1,59 @@
+#ifndef __DECODED_BIT_STREAM_PARSER_H__
+#define __DECODED_BIT_STREAM_PARSER_H__
+
+/*
+ *  DecodedBitStreamParser.h
+ *  zxing
+ *
+ *  Copyright 2010 ZXing authors All rights reserved.
+ *
+ * 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.
+ */
+
+#include <string>
+#include <sstream>
+#include <zxing/qrcode/decoder/Mode.h>
+#include <zxing/common/BitSource.h>
+#include <zxing/common/Counted.h>
+#include <zxing/common/Array.h>
+
+
+
+namespace zxing {
+namespace qrcode {
+
+class DecodedBitStreamParser {
+private:
+  static const char ALPHANUMERIC_CHARS[];
+
+  static const char *ASCII;
+  static const char *ISO88591;
+  static const char *UTF8;
+  static const char *SHIFT_JIS;
+  static const char *EUC_JP;
+
+  static void decodeKanjiSegment(Ref<BitSource> bits, std::string &result, int count);
+  static void decodeByteSegment(Ref<BitSource> bits, std::string &result, int count);
+  static void decodeAlphanumericSegment(Ref<BitSource> bits, std::string &result, int count);
+  static void decodeNumericSegment(Ref<BitSource> bits, std::string &result, int count);
+  static const char *guessEncoding(unsigned char *bytes, int length);
+  static void append(std::string &ost, const unsigned char *bufIn, size_t nIn, const char *src);
+
+public:
+  static std::string decode(ArrayRef<unsigned char> bytes, Version *version);
+};
+
+}
+}
+
+#endif // __DECODED_BIT_STREAM_PARSER_H__

data/ext/qrscanner/zxing/core/src/zxing/qrcode/decoder/Decoder.cpp

@@ -0,0 +1,103 @@
+/*
+ *  Decoder.cpp
+ *  zxing
+ *
+ *  Created by Christian Brunschen on 20/05/2008.
+ *  Copyright 2008 ZXing authors All rights reserved.
+ *
+ * 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.
+ */
+
+#include <zxing/qrcode/decoder/Decoder.h>
+#include <zxing/qrcode/decoder/BitMatrixParser.h>
+#include <zxing/qrcode/ErrorCorrectionLevel.h>
+#include <zxing/qrcode/Version.h>
+#include <zxing/qrcode/decoder/DataBlock.h>
+#include <zxing/qrcode/decoder/DecodedBitStreamParser.h>
+#include <zxing/ReaderException.h>
+#include <zxing/common/reedsolomon/ReedSolomonException.h>
+
+namespace zxing {
+namespace qrcode {
+
+using namespace std;
+
+Decoder::Decoder() :
+    rsDecoder_(GF256::QR_CODE_FIELD) {
+}
+
+void Decoder::correctErrors(ArrayRef<unsigned char> codewordBytes, int numDataCodewords) {
+  int numCodewords = codewordBytes->size();
+  ArrayRef<int> codewordInts(numCodewords);
+  for (int i = 0; i < numCodewords; i++) {
+    codewordInts[i] = codewordBytes[i] & 0xff;
+  }
+  int numECCodewords = numCodewords - numDataCodewords;
+
+  try {
+    rsDecoder_.decode(codewordInts, numECCodewords);
+  } catch (ReedSolomonException ex) {
+    ReaderException rex(ex.what());
+    throw rex;
+  }
+
+  for (int i = 0; i < numDataCodewords; i++) {
+    codewordBytes[i] = (unsigned char)codewordInts[i];
+  }
+}
+
+Ref<DecoderResult> Decoder::decode(Ref<BitMatrix> bits) {
+  // Construct a parser and read version, error-correction level
+  BitMatrixParser parser(bits);
+
+  Version *version = parser.readVersion();
+  ErrorCorrectionLevel &ecLevel = parser.readFormatInformation()->getErrorCorrectionLevel();
+
+
+  // Read codewords
+  ArrayRef<unsigned char> codewords(parser.readCodewords());
+
+
+  // Separate into data blocks
+  std::vector<Ref<DataBlock> > dataBlocks(DataBlock::getDataBlocks(codewords, version, ecLevel));
+
+
+  // Count total number of data bytes
+  int totalBytes = 0;
+  for (size_t i = 0; i < dataBlocks.size(); i++) {
+    totalBytes += dataBlocks[i]->getNumDataCodewords();
+  }
+  ArrayRef<unsigned char> resultBytes(totalBytes);
+  int resultOffset = 0;
+
+
+  // Error-correct and copy data blocks together into a stream of bytes
+  for (size_t j = 0; j < dataBlocks.size(); j++) {
+    Ref<DataBlock> dataBlock(dataBlocks[j]);
+    ArrayRef<unsigned char> codewordBytes = dataBlock->getCodewords();
+    int numDataCodewords = dataBlock->getNumDataCodewords();
+    correctErrors(codewordBytes, numDataCodewords);
+    for (int i = 0; i < numDataCodewords; i++) {
+      resultBytes[resultOffset++] = codewordBytes[i];
+    }
+  }
+
+  // Decode the contents of that stream of bytes
+  Ref<String> text(new String(DecodedBitStreamParser::decode(resultBytes, version)));
+
+  Ref<DecoderResult> result(new DecoderResult(resultBytes, text));
+  return result;
+}
+
+}
+}

data/ext/qrscanner/zxing/core/src/zxing/qrcode/decoder/Decoder.h

@@ -0,0 +1,47 @@
+#ifndef __DECODER_H__
+#define __DECODER_H__
+
+/*
+ *  Decoder.h
+ *  zxing
+ *
+ *  Copyright 2010 ZXing authors All rights reserved.
+ *
+ * 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.
+ */
+
+#include <zxing/common/reedsolomon/ReedSolomonDecoder.h>
+#include <zxing/common/reedsolomon/GF256.h>
+#include <zxing/common/Counted.h>
+#include <zxing/common/Array.h>
+#include <zxing/common/DecoderResult.h>
+#include <zxing/common/BitMatrix.h>
+
+namespace zxing {
+namespace qrcode {
+
+class Decoder {
+private:
+  ReedSolomonDecoder rsDecoder_;
+
+  void correctErrors(ArrayRef<unsigned char> bytes, int numDataCodewords);
+
+public:
+  Decoder();
+  Ref<DecoderResult> decode(Ref<BitMatrix> bits);
+};
+
+}
+}
+
+#endif // __DECODER_H__

data/ext/qrscanner/zxing/core/src/zxing/qrcode/decoder/Mode.cpp

@@ -0,0 +1,73 @@
+/*
+ *  Mode.cpp
+ *  zxing
+ *
+ *  Created by Christian Brunschen on 19/05/2008.
+ *  Copyright 2008 ZXing authors All rights reserved.
+ *
+ * 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.
+ */
+
+#include <zxing/qrcode/decoder/Mode.h>
+#include <zxing/common/Counted.h>
+#include <zxing/ReaderException.h>
+#include <zxing/qrcode/Version.h>
+#include <sstream>
+
+namespace zxing {
+namespace qrcode {
+using namespace std;
+
+Mode Mode::TERMINATOR(0, 0, 0);
+Mode Mode::NUMERIC(10, 12, 14);
+Mode Mode::ALPHANUMERIC(9, 11, 13);
+Mode Mode::BYTE(8, 16, 16);
+Mode Mode::KANJI(8, 10, 12);
+
+Mode::Mode(int cbv0_9, int cbv10_26, int cbv27) :
+    characterCountBitsForVersions0To9_(cbv0_9), characterCountBitsForVersions10To26_(cbv10_26),
+    characterCountBitsForVersions27AndHigher_(cbv27) {
+}
+
+Mode& Mode::forBits(int bits) {
+  switch (bits) {
+  case 0x0:
+    return TERMINATOR;
+  case 0x1:
+    return NUMERIC;
+  case 0x2:
+    return ALPHANUMERIC;
+  case 0x4:
+    return BYTE;
+  case 0x8:
+    return KANJI;
+  default:
+    ostringstream s;
+    s << "Illegal mode bits: " << bits;
+    throw ReaderException(s.str().c_str());
+  }
+}
+
+int Mode::getCharacterCountBits(Version *version) {
+  int number = version->getVersionNumber();
+  if (number <= 9) {
+    return characterCountBitsForVersions0To9_;
+  } else if (number <= 26) {
+    return characterCountBitsForVersions10To26_;
+  } else {
+    return characterCountBitsForVersions27AndHigher_;
+  }
+}
+
+}
+}

data/ext/qrscanner/zxing/core/src/zxing/qrcode/decoder/Mode.h

@@ -0,0 +1,50 @@
+#ifndef __MODE_H__
+#define __MODE_H__
+
+/*
+ *  Mode.h
+ *  zxing
+ *
+ *  Copyright 2010 ZXing authors All rights reserved.
+ *
+ * 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.
+ */
+
+#include <zxing/common/Counted.h>
+#include <zxing/qrcode/Version.h>
+
+namespace zxing {
+namespace qrcode {
+
+class Mode {
+private:
+  int characterCountBitsForVersions0To9_;
+  int characterCountBitsForVersions10To26_;
+  int characterCountBitsForVersions27AndHigher_;
+
+  Mode(int cbv0_9, int cbv10_26, int cbv27);
+
+public:
+  static Mode TERMINATOR;
+  static Mode NUMERIC;
+  static Mode ALPHANUMERIC;
+  static Mode BYTE;
+  static Mode KANJI;
+
+  static Mode& forBits(int bits);
+  int getCharacterCountBits(Version *version);
+};
+}
+}
+
+#endif // __MODE_H__

data/ext/qrscanner/zxing/core/src/zxing/qrcode/detector/AlignmentPattern.cpp

@@ -0,0 +1,46 @@
+/*
+ *  AlignmentPattern.cpp
+ *  zxing
+ *
+ *  Created by Christian Brunschen on 13/05/2008.
+ *  Copyright 2008 ZXing authors All rights reserved.
+ *
+ * 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.
+ */
+
+#include <zxing/qrcode/detector/AlignmentPattern.h>
+
+namespace zxing {
+namespace qrcode {
+
+using namespace std;
+
+AlignmentPattern::AlignmentPattern(float posX, float posY, float estimatedModuleSize) :
+    posX_(posX), posY_(posY), estimatedModuleSize_(estimatedModuleSize) {
+}
+
+float AlignmentPattern::getX() const {
+  return posX_;
+}
+
+float AlignmentPattern::getY() const {
+  return posY_;
+}
+
+bool AlignmentPattern::aboutEquals(float moduleSize, float i, float j) const {
+  return abs(i - posY_) <= moduleSize && abs(j - posX_) <= moduleSize && (abs(moduleSize - estimatedModuleSize_)
+         <= 1.0f || abs(moduleSize - estimatedModuleSize_) / estimatedModuleSize_ <= 0.1f);
+}
+
+}
+}

data/ext/qrscanner/zxing/core/src/zxing/qrcode/detector/AlignmentPattern.h

@@ -0,0 +1,45 @@
+#ifndef __ALIGNMENT_PATTERN_H__
+#define __ALIGNMENT_PATTERN_H__
+
+/*
+ *  AlignmentPattern.h
+ *  zxing
+ *
+ *  Copyright 2010 ZXing authors All rights reserved.
+ *
+ * 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.
+ */
+
+#include <zxing/ResultPoint.h>
+#include <cmath>
+
+namespace zxing {
+	namespace qrcode {
+		
+		class AlignmentPattern : public ResultPoint {
+		private:
+			float posX_;
+			float posY_;
+			float estimatedModuleSize_;
+			
+		public:
+			AlignmentPattern(float posX, float posY, float estimatedModuleSize);
+			float getX() const;
+			float getY() const;
+			bool aboutEquals(float moduleSize, float i, float j) const;
+		};
+		
+	}
+}
+
+#endif // __ALIGNMENT_PATTERN_H__

data/ext/qrscanner/zxing/core/src/zxing/qrcode/detector/AlignmentPatternFinder.cpp

@@ -0,0 +1,209 @@
+/*
+ *  AlignmentPatternFinder.cpp
+ *  zxing
+ *
+ *  Created by Christian Brunschen on 14/05/2008.
+ *  Copyright 2008 ZXing authors All rights reserved.
+ *
+ * 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.
+ */
+
+#include "AlignmentPatternFinder.h"
+#include <zxing/ReaderException.h>
+#include <zxing/common/BitArray.h>
+#include <vector>
+#include <cmath>
+#include <cstdlib>
+
+namespace zxing {
+namespace qrcode {
+
+using namespace std;
+
+float AlignmentPatternFinder::centerFromEnd(vector<int> &stateCount, int end) {
+  return (float)(end - stateCount[2]) - stateCount[1] / 2.0f;
+}
+
+bool AlignmentPatternFinder::foundPatternCross(vector<int> &stateCount) {
+  float maxVariance = moduleSize_ / 2.0f;
+  for (size_t i = 0; i < 3; i++) {
+    if (abs(moduleSize_ - stateCount[i]) >= maxVariance) {
+      return false;
+    }
+  }
+  return true;
+}
+
+float AlignmentPatternFinder::crossCheckVertical(size_t startI, size_t centerJ, int maxCount,
+    int originalStateCountTotal) {
+  int maxI = image_->getHeight();
+  vector<int> stateCount(3, 0);
+
+
+  // Start counting up from center
+  int i = startI;
+  while (i >= 0 && image_->get(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 NAN;
+  }
+  while (i >= 0 && !image_->get(centerJ, i) && stateCount[0] <= maxCount) {
+    stateCount[0]++;
+    i--;
+  }
+  if (stateCount[0] > maxCount) {
+    return NAN;
+  }
+
+  // Now also count down from center
+  i = startI + 1;
+  while (i < maxI && image_->get(centerJ, i) && stateCount[1] <= maxCount) {
+    stateCount[1]++;
+    i++;
+  }
+  if (i == maxI || stateCount[1] > maxCount) {
+    return NAN;
+  }
+  while (i < maxI && !image_->get(centerJ, i) && stateCount[2] <= maxCount) {
+    stateCount[2]++;
+    i++;
+  }
+  if (stateCount[2] > maxCount) {
+    return NAN;
+  }
+
+  int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+  if (5 * abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {
+    return NAN;
+  }
+
+  return foundPatternCross(stateCount) ? centerFromEnd(stateCount, i) : NAN;
+}
+
+Ref<AlignmentPattern> AlignmentPatternFinder::handlePossibleCenter(vector<int> &stateCount, size_t i, size_t j) {
+  int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
+  float centerJ = centerFromEnd(stateCount, j);
+  float centerI = crossCheckVertical(i, (int)centerJ, 2 * stateCount[1], stateCountTotal);
+  if (!isnan(centerI)) {
+    float estimatedModuleSize = (float)(stateCount[0] + stateCount[1] + stateCount[2]) / 3.0f;
+    int max = possibleCenters_->size();
+    for (int index = 0; index < max; index++) {
+      Ref<AlignmentPattern> center((*possibleCenters_)[index]);
+      // Look for about the same center and module size:
+      if (center->aboutEquals(estimatedModuleSize, centerI, centerJ)) {
+        Ref<AlignmentPattern> result(new AlignmentPattern(centerJ, centerI, estimatedModuleSize));
+        return result;
+      }
+    }
+    AlignmentPattern *tmp = new AlignmentPattern(centerJ, centerI, estimatedModuleSize);
+    // Hadn't found this before; save it
+    tmp->retain();
+    possibleCenters_->push_back(tmp);
+    if (callback_ != 0) {
+      callback_->foundPossibleResultPoint(*tmp);
+    }
+  }
+  Ref<AlignmentPattern> result;
+  return result;
+}
+
+AlignmentPatternFinder::AlignmentPatternFinder(Ref<BitMatrix> image, size_t startX, size_t startY, size_t width,
+                                               size_t height, float moduleSize, 
+                                               Ref<ResultPointCallback>const& callback) :
+    image_(image), possibleCenters_(new vector<AlignmentPattern *> ()), startX_(startX), startY_(startY),
+    width_(width), height_(height), moduleSize_(moduleSize), callback_(callback) {
+}
+
+AlignmentPatternFinder::~AlignmentPatternFinder() {
+  for (size_t i = 0; i < possibleCenters_->size(); i++) {
+    (*possibleCenters_)[i]->release();
+    (*possibleCenters_)[i] = 0;
+  }
+  delete possibleCenters_;
+}
+
+Ref<AlignmentPattern> AlignmentPatternFinder::find() {
+  size_t maxJ = startX_ + width_;
+  size_t middleI = startY_ + (height_ >> 1);
+  //      Ref<BitArray> luminanceRow(new BitArray(width_));
+  // 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
+  vector<int> stateCount(3, 0);
+  for (size_t iGen = 0; iGen < height_; iGen++) {
+    // Search from middle outwards
+    size_t i = middleI + ((iGen & 0x01) == 0 ? ((iGen + 1) >> 1) : -((iGen + 1) >> 1));
+    //        image_->getBlackRow(i, luminanceRow, startX_, width_);
+    stateCount[0] = 0;
+    stateCount[1] = 0;
+    stateCount[2] = 0;
+    size_t 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_->get(j, i)) {
+      j++;
+    }
+    int currentState = 0;
+    while (j < maxJ) {
+      if (image_->get(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
+              Ref<AlignmentPattern> confirmed(handlePossibleCenter(stateCount, i, j));
+              if (confirmed != 0) {
+                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)) {
+      Ref<AlignmentPattern> confirmed(handlePossibleCenter(stateCount, i, maxJ));
+      if (confirmed != 0) {
+        return confirmed;
+      }
+    }
+
+  }
+
+  // Hmm, nothing we saw was observed and confirmed twice. If we had
+  // any guess at all, return it.
+  if (possibleCenters_->size() > 0) {
+    Ref<AlignmentPattern> center((*possibleCenters_)[0]);
+    return center;
+  }
+
+  throw zxing::ReaderException("Could not find alignment pattern");
+}
+
+}
+}