rhodes 5.5.15 → 5.5.17

data/lib/commonAPI/barcode/ext/platform/qt/src/qzxing/zxing/zxing/oned/Code128Reader.h

@@ -0,0 +1,48 @@
+// -*- mode:c++; tab-width:2; indent-tabs-mode:nil; c-basic-offset:2 -*-
+#ifndef __CODE_128_READER_H__
+#define __CODE_128_READER_H__
+/*
+ *  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/oned/OneDReader.h>
+#include <zxing/common/BitArray.h>
+#include <zxing/Result.h>
+
+namespace zxing {
+namespace oned {
+
+class Code128Reader : public OneDReader {
+private:
+  static const int MAX_AVG_VARIANCE;
+  static const int MAX_INDIVIDUAL_VARIANCE;
+
+  static std::vector<int> findStartPattern(Ref<BitArray> row);
+  static int decodeCode(Ref<BitArray> row,
+                        std::vector<int>& counters,
+                        int rowOffset);
+			
+public:
+  Ref<Result> decodeRow(int rowNumber, Ref<BitArray> row);
+  Code128Reader();
+  ~Code128Reader();
+
+  BarcodeFormat getBarcodeFormat();
+};
+
+}
+}
+
+#endif

data/lib/commonAPI/barcode/ext/platform/qt/src/qzxing/zxing/zxing/oned/Code39Reader.cpp

@@ -0,0 +1,329 @@
+// -*- mode:c++; tab-width:2; indent-tabs-mode:nil; c-basic-offset:2 -*-
+/*
+ *  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 "Code39Reader.h"
+#include <zxing/oned/OneDResultPoint.h>
+#include <zxing/common/Array.h>
+#include <zxing/ReaderException.h>
+#include <zxing/NotFoundException.h>
+#include <zxing/ChecksumException.h>
+#include <math.h>
+#include <limits.h>
+#include <algorithm>
+
+using std::vector;
+using zxing::Ref;
+using zxing::Result;
+using zxing::String;
+using zxing::NotFoundException;
+using zxing::ChecksumException;
+using zxing::oned::Code39Reader;
+
+// VC++
+using zxing::BitArray;
+
+namespace {
+  const char* ALPHABET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. *$/+%";
+
+  /**
+   * These represent the encodings of characters, as patterns of wide and narrow
+   * bars.
+   * The 9 least-significant bits of each int correspond to the pattern of wide
+   * and narrow, with 1s representing "wide" and 0s representing narrow.
+   */
+  const int CHARACTER_ENCODINGS_LEN = 44;
+  int CHARACTER_ENCODINGS[CHARACTER_ENCODINGS_LEN] = {
+    0x034, 0x121, 0x061, 0x160, 0x031, 0x130, 0x070, 0x025, 0x124, 0x064, // 0-9
+    0x109, 0x049, 0x148, 0x019, 0x118, 0x058, 0x00D, 0x10C, 0x04C, 0x01C, // A-J
+    0x103, 0x043, 0x142, 0x013, 0x112, 0x052, 0x007, 0x106, 0x046, 0x016, // K-T
+    0x181, 0x0C1, 0x1C0, 0x091, 0x190, 0x0D0, 0x085, 0x184, 0x0C4, 0x094, // U-*
+    0x0A8, 0x0A2, 0x08A, 0x02A // $-%
+  };
+
+  int ASTERISK_ENCODING = 0x094;
+  const char* ALPHABET_STRING =
+    "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. *$/+%";
+
+  std::string alphabet_string (ALPHABET_STRING);
+}
+
+void Code39Reader::init(bool usingCheckDigit_, bool extendedMode_) {
+  usingCheckDigit = usingCheckDigit_;
+  extendedMode = extendedMode_;
+  decodeRowResult.reserve(20);
+  counters.resize(9);
+}
+
+/**
+ * Creates a reader that assumes all encoded data is data, and does not treat
+ * the final character as a check digit. It will not decoded "extended
+ * Code 39" sequences.
+ */
+Code39Reader::Code39Reader() {
+  init();
+}
+
+/**
+ * Creates a reader that can be configured to check the last character as a
+ * check digit. It will not decoded "extended Code 39" sequences.
+ *
+ * @param usingCheckDigit if true, treat the last data character as a check
+ * digit, not data, and verify that the checksum passes.
+ */
+Code39Reader::Code39Reader(bool usingCheckDigit_) {
+  init(usingCheckDigit_);
+}
+
+Code39Reader::Code39Reader(bool usingCheckDigit_, bool extendedMode_) {
+  init(usingCheckDigit_, extendedMode_);
+}
+
+Ref<Result> Code39Reader::decodeRow(int rowNumber, Ref<BitArray> row) {
+  std::vector<int>& theCounters (counters);
+  { // Arrays.fill(counters, 0);
+    int size = theCounters.size();
+    theCounters.resize(0);
+    theCounters.resize(size); }
+  std::string& result (decodeRowResult);
+  result.clear();
+
+  vector<int> start (findAsteriskPattern(row, theCounters));
+  // Read off white space
+  int nextStart = row->getNextSet(start[1]);
+  int end = row->getSize();
+
+  char decodedChar;
+  int lastStart;
+  do {
+    recordPattern(row, nextStart, theCounters);
+    int pattern = toNarrowWidePattern(theCounters);
+    if (pattern < 0) {
+      throw NotFoundException();;
+    }
+    decodedChar = patternToChar(pattern);
+    result.append(1, decodedChar);
+    lastStart = nextStart;
+    for (int i = 0, end=theCounters.size(); i < end; i++) {
+      nextStart += theCounters[i];
+    }
+    // Read off white space
+    nextStart = row->getNextSet(nextStart);
+  } while (decodedChar != '*');
+  result.resize(decodeRowResult.length()-1);// remove asterisk
+
+    // Look for whitespace after pattern:
+  int lastPatternSize = 0;
+  for (int i = 0, e = theCounters.size(); i < e; i++) {
+    lastPatternSize += theCounters[i];
+  }
+  int whiteSpaceAfterEnd = nextStart - lastStart - lastPatternSize;
+  // If 50% of last pattern size, following last pattern, is not whitespace,
+  // fail (but if it's whitespace to the very end of the image, that's OK)
+  if (nextStart != end && (whiteSpaceAfterEnd >> 1) < lastPatternSize) {
+    throw NotFoundException();
+  }
+
+  if (usingCheckDigit) {
+    int max = result.length() - 1;
+    int total = 0;
+    for (int i = 0; i < max; i++) {
+      total += alphabet_string.find_first_of(decodeRowResult[i], 0);
+    }
+    if (result[max] != ALPHABET[total % 43]) {
+      throw ChecksumException();
+    }
+    result.resize(max);
+  }
+  
+  if (result.length() == 0) {
+    // Almost false positive
+    throw NotFoundException();
+  }
+  
+  Ref<String> resultString;
+  if (extendedMode) {
+    resultString = decodeExtended(result);
+  } else {
+    resultString = Ref<String>(new String(result));
+  }
+
+  float left = (float) (start[1] + start[0]) / 2.0f;
+  float right = lastStart + lastPatternSize / 2.0f;
+
+  ArrayRef< Ref<ResultPoint> > resultPoints (2);
+  resultPoints[0] = 
+    Ref<OneDResultPoint>(new OneDResultPoint(left, (float) rowNumber));
+  resultPoints[1] =
+    Ref<OneDResultPoint>(new OneDResultPoint(right, (float) rowNumber));
+  
+  return Ref<Result>(
+    new Result(resultString, ArrayRef<char>(), resultPoints, BarcodeFormat::CODE_39)
+    );
+}
+
+vector<int> Code39Reader::findAsteriskPattern(Ref<BitArray> row, vector<int>& counters){
+  int width = row->getSize();
+  int rowOffset = row->getNextSet(0);
+
+  int counterPosition = 0;
+  int patternStart = rowOffset;
+  bool isWhite = false;
+  int patternLength = counters.size();
+
+  for (int i = rowOffset; i < width; i++) {
+    if (row->get(i) ^ isWhite) {
+      counters[counterPosition]++;
+    } else {
+      if (counterPosition == patternLength - 1) {
+        // Look for whitespace before start pattern, >= 50% of width of
+        // start pattern.
+        if (toNarrowWidePattern(counters) == ASTERISK_ENCODING &&
+            row->isRange(std::max(0, patternStart - ((i - patternStart) >> 1)), patternStart, false)) {
+          vector<int> resultValue (2, 0);
+          resultValue[0] = patternStart;
+          resultValue[1] = i;
+          return resultValue;
+        }
+        patternStart += counters[0] + counters[1];
+        for (int y = 2; y < patternLength; y++) {
+          counters[y - 2] = counters[y];
+        }
+        counters[patternLength - 2] = 0;
+        counters[patternLength - 1] = 0;
+        counterPosition--;
+      } else {
+        counterPosition++;
+      }
+      counters[counterPosition] = 1;
+      isWhite = !isWhite;
+    }
+  }
+  throw NotFoundException();
+}
+
+// For efficiency, returns -1 on failure. Not throwing here saved as many as
+// 700 exceptions per image when using some of our blackbox images.
+int Code39Reader::toNarrowWidePattern(vector<int>& counters){
+  int numCounters = counters.size();
+  int maxNarrowCounter = 0;
+  int wideCounters;
+  do {
+    int minCounter = INT_MAX;
+    for (int i = 0; i < numCounters; i++) {
+      int counter = counters[i];
+      if (counter < minCounter && counter > maxNarrowCounter) {
+        minCounter = counter;
+      }
+    }
+    maxNarrowCounter = minCounter;
+    wideCounters = 0;
+    int totalWideCountersWidth = 0;
+    int pattern = 0;
+    for (int i = 0; i < numCounters; i++) {
+      int counter = counters[i];
+      if (counters[i] > maxNarrowCounter) {
+        pattern |= 1 << (numCounters - 1 - i);
+        wideCounters++;
+        totalWideCountersWidth += counter;
+      }
+    }
+    if (wideCounters == 3) {
+      // Found 3 wide counters, but are they close enough in width?
+      // We can perform a cheap, conservative check to see if any individual
+      // counter is more than 1.5 times the average:
+      for (int i = 0; i < numCounters && wideCounters > 0; i++) {
+        int counter = counters[i];
+        if (counters[i] > maxNarrowCounter) {
+          wideCounters--;
+          // totalWideCountersWidth = 3 * average, so this checks if
+          // counter >= 3/2 * average.
+          if ((counter << 1) >= totalWideCountersWidth) {
+            return -1;
+          }
+        }
+      }
+      return pattern;
+    }
+  } while (wideCounters > 3);
+  return -1;
+}
+
+char Code39Reader::patternToChar(int pattern){
+  for (int i = 0; i < CHARACTER_ENCODINGS_LEN; i++) {
+    if (CHARACTER_ENCODINGS[i] == pattern) {
+      return ALPHABET[i];
+    }
+  }
+  throw ReaderException("");
+}
+
+Ref<String> Code39Reader::decodeExtended(std::string encoded){
+  int length = encoded.length();
+  std::string tmpDecoded;
+  for (int i = 0; i < length; i++) {
+    char c = encoded[i];
+    if (c == '+' || c == '$' || c == '%' || c == '/') {
+      char next = encoded[i + 1];
+      char decodedChar = '\0';
+      switch (c) {
+      case '+':
+        // +A to +Z map to a to z
+        if (next >= 'A' && next <= 'Z') {
+          decodedChar = (char) (next + 32);
+        } else {
+          throw ReaderException("");
+        }
+        break;
+      case '$':
+        // $A to $Z map to control codes SH to SB
+        if (next >= 'A' && next <= 'Z') {
+          decodedChar = (char) (next - 64);
+        } else {
+          throw ReaderException("");
+        }
+        break;
+      case '%':
+        // %A to %E map to control codes ESC to US
+        if (next >= 'A' && next <= 'E') {
+          decodedChar = (char) (next - 38);
+        } else if (next >= 'F' && next <= 'W') {
+          decodedChar = (char) (next - 11);
+        } else {
+          throw ReaderException("");
+        }
+        break;
+      case '/':
+        // /A to /O map to ! to , and /Z maps to :
+        if (next >= 'A' && next <= 'O') {
+          decodedChar = (char) (next - 32);
+        } else if (next == 'Z') {
+          decodedChar = ':';
+        } else {
+          throw ReaderException("");
+        }
+        break;
+      }
+      tmpDecoded.append(1, decodedChar);
+      // bump up i again since we read two characters
+      i++;
+    } else {
+      tmpDecoded.append(1, c);
+    }
+  }
+  Ref<String> decoded(new String(tmpDecoded));
+  return decoded;
+}

data/lib/commonAPI/barcode/ext/platform/qt/src/qzxing/zxing/zxing/oned/Code39Reader.h

@@ -0,0 +1,63 @@
+// -*- mode:c++; tab-width:2; indent-tabs-mode:nil; c-basic-offset:2 -*-
+#ifndef __CODE_39_READER_H__
+#define __CODE_39_READER_H__
+/*
+ *  Code39Reader.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/oned/OneDReader.h>
+#include <zxing/common/BitArray.h>
+#include <zxing/Result.h>
+
+namespace zxing {
+namespace oned {
+
+/**
+ * <p>Decodes Code 39 barcodes. This does not support "Full ASCII Code 39" yet.</p>
+ * Ported form Java (author Sean Owen)
+ * @author Lukasz Warchol
+ */
+class Code39Reader : public OneDReader {
+private:
+  bool usingCheckDigit;
+  bool extendedMode;
+  std::string decodeRowResult;
+  std::vector<int> counters;
+			
+  void init(bool usingCheckDigit = false, bool extendedMode = false);
+
+  static std::vector<int> findAsteriskPattern(Ref<BitArray> row,
+                                              std::vector<int>& counters);
+  static int toNarrowWidePattern(std::vector<int>& counters);
+  static char patternToChar(int pattern);
+  static Ref<String> decodeExtended(std::string encoded);
+			
+  void append(char* s, char c);
+
+public:
+  Code39Reader();
+  Code39Reader(bool usingCheckDigit_);
+  Code39Reader(bool usingCheckDigit_, bool extendedMode_);
+			
+  Ref<Result> decodeRow(int rowNumber, Ref<BitArray> row);
+};
+
+}
+}
+
+#endif

data/lib/commonAPI/barcode/ext/platform/qt/src/qzxing/zxing/zxing/oned/Code93Reader.cpp

@@ -0,0 +1,293 @@
+// -*- mode:c++; tab-width:2; indent-tabs-mode:nil; c-basic-offset:2 -*-
+/*
+ *  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 "Code93Reader.h"
+#include <zxing/oned/OneDResultPoint.h>
+#include <zxing/common/Array.h>
+#include <zxing/ReaderException.h>
+#include <zxing/FormatException.h>
+#include <zxing/NotFoundException.h>
+#include <zxing/ChecksumException.h>
+#include <math.h>
+#include <limits.h>
+
+using std::vector;
+using std::string;
+using zxing::Ref;
+using zxing::Result;
+using zxing::String;
+using zxing::NotFoundException;
+using zxing::ChecksumException;
+using zxing::oned::Code93Reader;
+
+// VC++
+using zxing::BitArray;
+
+namespace {
+  char const ALPHABET[] =
+    "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. $/+%abcd*";
+  string ALPHABET_STRING (ALPHABET);
+
+  /**
+   * These represent the encodings of characters, as patterns of wide and narrow bars.
+   * The 9 least-significant bits of each int correspond to the pattern of wide and narrow.
+   */
+  int const CHARACTER_ENCODINGS[] = {
+    0x114, 0x148, 0x144, 0x142, 0x128, 0x124, 0x122, 0x150, 0x112, 0x10A, // 0-9
+    0x1A8, 0x1A4, 0x1A2, 0x194, 0x192, 0x18A, 0x168, 0x164, 0x162, 0x134, // A-J
+    0x11A, 0x158, 0x14C, 0x146, 0x12C, 0x116, 0x1B4, 0x1B2, 0x1AC, 0x1A6, // K-T
+    0x196, 0x19A, 0x16C, 0x166, 0x136, 0x13A, // U-Z
+    0x12E, 0x1D4, 0x1D2, 0x1CA, 0x16E, 0x176, 0x1AE, // - - %
+    0x126, 0x1DA, 0x1D6, 0x132, 0x15E, // Control chars? $-*
+  };
+  int const CHARACTER_ENCODINGS_LENGTH = 
+    (int)sizeof(CHARACTER_ENCODINGS)/sizeof(CHARACTER_ENCODINGS[0]);
+  const int ASTERISK_ENCODING = CHARACTER_ENCODINGS[47];
+}
+
+Code93Reader::Code93Reader() {
+  decodeRowResult.reserve(20);
+  counters.resize(6);
+}
+
+Ref<Result> Code93Reader::decodeRow(int rowNumber, Ref<BitArray> row) {
+  Range start (findAsteriskPattern(row));
+  // Read off white space    
+  int nextStart = row->getNextSet(start[1]);
+  int end = row->getSize();
+
+  vector<int>& theCounters (counters);
+  { // Arrays.fill(counters, 0);
+    int size = theCounters.size();
+    theCounters.resize(0);
+    theCounters.resize(size); }
+  string& result (decodeRowResult);
+  result.clear();
+
+  char decodedChar;
+  int lastStart;
+  do {
+    recordPattern(row, nextStart, theCounters);
+    int pattern = toPattern(theCounters);
+    if (pattern < 0) {
+      throw NotFoundException();
+    }
+    decodedChar = patternToChar(pattern);
+    result.append(1, decodedChar);
+    lastStart = nextStart;
+    for(int i=0, e=theCounters.size(); i < e; ++i) {
+      nextStart += theCounters[i];
+    }
+    // Read off white space
+    nextStart = row->getNextSet(nextStart);
+  } while (decodedChar != '*');
+  result.resize(result.length() - 1); // remove asterisk
+
+  // Look for whitespace after pattern:
+  int lastPatternSize = 0;
+  for (int i = 0, e = theCounters.size(); i < e; i++) {
+    lastPatternSize += theCounters[i];
+  }
+  
+  // Should be at least one more black module
+  if (nextStart == end || !row->get(nextStart)) {
+    throw NotFoundException();
+  }
+
+  if (result.length() < 2) {
+    // false positive -- need at least 2 checksum digits
+    throw NotFoundException();
+  }
+
+  checkChecksums(result);
+  // Remove checksum digits
+  result.resize(result.length() - 2);
+
+  Ref<String> resultString = decodeExtended(result);
+
+  float left = (float) (start[1] + start[0]) / 2.0f;
+  float right = lastStart + lastPatternSize / 2.0f;
+
+  ArrayRef< Ref<ResultPoint> > resultPoints (2);
+  resultPoints[0] = 
+    Ref<OneDResultPoint>(new OneDResultPoint(left, (float) rowNumber));
+  resultPoints[1] =
+    Ref<OneDResultPoint>(new OneDResultPoint(right, (float) rowNumber));
+  
+  return Ref<Result>(new Result(
+                       resultString,
+                       ArrayRef<char>(),
+                       resultPoints,
+                       BarcodeFormat::CODE_93));
+}
+
+Code93Reader::Range Code93Reader::findAsteriskPattern(Ref<BitArray> row)  {
+  int width = row->getSize();
+  int rowOffset = row->getNextSet(0);
+
+  { // Arrays.fill(counters, 0);
+    int size = counters.size();
+    counters.resize(0);
+    counters.resize(size); }
+  vector<int>& theCounters (counters);
+
+  int patternStart = rowOffset;
+  bool isWhite = false;
+  int patternLength = theCounters.size();
+
+  int counterPosition = 0;
+  for (int i = rowOffset; i < width; i++) {
+    if (row->get(i) ^ isWhite) {
+      theCounters[counterPosition]++;
+    } else {
+      if (counterPosition == patternLength - 1) {
+        if (toPattern(theCounters) == ASTERISK_ENCODING) {
+          return Range(patternStart, i);
+        }
+        patternStart += theCounters[0] + theCounters[1];
+        for (int y = 2; y < patternLength; y++) {
+          theCounters[y - 2] = theCounters[y];
+        }
+        theCounters[patternLength - 2] = 0;
+        theCounters[patternLength - 1] = 0;
+        counterPosition--;
+      } else {
+        counterPosition++;
+      }
+      theCounters[counterPosition] = 1;
+      isWhite = !isWhite;
+    }
+  }
+  throw NotFoundException();
+}
+
+int Code93Reader::toPattern(vector<int>& counters) {
+  int max = counters.size();
+  int sum = 0;
+  for(int i=0, e=counters.size(); i<e; ++i) {
+    sum += counters[i];
+  }
+  int pattern = 0;
+  for (int i = 0; i < max; i++) {
+    int scaledShifted = (counters[i] << INTEGER_MATH_SHIFT) * 9 / sum;
+    int scaledUnshifted = scaledShifted >> INTEGER_MATH_SHIFT;
+    if ((scaledShifted & 0xFF) > 0x7F) {
+      scaledUnshifted++;
+    }
+    if (scaledUnshifted < 1 || scaledUnshifted > 4) {
+      return -1;
+    }
+    if ((i & 0x01) == 0) {
+      for (int j = 0; j < scaledUnshifted; j++) {
+        pattern = (pattern << 1) | 0x01;
+      }
+    } else {
+      pattern <<= scaledUnshifted;
+    }
+  }
+  return pattern;
+}
+
+char Code93Reader::patternToChar(int pattern)  {
+  for (int i = 0; i < CHARACTER_ENCODINGS_LENGTH; i++) {
+    if (CHARACTER_ENCODINGS[i] == pattern) {
+      return ALPHABET[i];
+    }
+  }
+  throw NotFoundException();
+}
+
+Ref<String> Code93Reader::decodeExtended(string const& encoded)  {
+  int length = encoded.length();
+  string decoded;
+  for (int i = 0; i < length; i++) {
+    char c = encoded[i];
+    if (c >= 'a' && c <= 'd') {
+      if (i >= length - 1) {
+        throw FormatException::getFormatInstance();
+      }
+      char next = encoded[i + 1];
+      char decodedChar = '\0';
+      switch (c) {
+      case 'd':
+        // +A to +Z map to a to z
+        if (next >= 'A' && next <= 'Z') {
+          decodedChar = (char) (next + 32);
+        } else {
+          throw FormatException::getFormatInstance();
+        }
+        break;
+      case 'a':
+        // $A to $Z map to control codes SH to SB
+        if (next >= 'A' && next <= 'Z') {
+          decodedChar = (char) (next - 64);
+        } else {
+          throw FormatException::getFormatInstance();
+        }
+        break;
+      case 'b':
+        // %A to %E map to control codes ESC to US
+        if (next >= 'A' && next <= 'E') {
+          decodedChar = (char) (next - 38);
+        } else if (next >= 'F' && next <= 'W') {
+          decodedChar = (char) (next - 11);
+        } else {
+          throw FormatException::getFormatInstance();
+        }
+        break;
+      case 'c':
+        // /A to /O map to ! to , and /Z maps to :
+        if (next >= 'A' && next <= 'O') {
+          decodedChar = (char) (next - 32);
+        } else if (next == 'Z') {
+          decodedChar = ':';
+        } else {
+          throw FormatException::getFormatInstance();
+        }
+        break;
+      }
+      decoded.append(1, decodedChar);
+      // bump up i again since we read two characters
+      i++;
+    } else {
+      decoded.append(1, c);
+    }
+  }
+  return Ref<String>(new String(decoded));
+}
+
+void Code93Reader::checkChecksums(string const& result) {
+  int length = result.length();
+  checkOneChecksum(result, length - 2, 20);
+  checkOneChecksum(result, length - 1, 15);
+}
+
+void Code93Reader::checkOneChecksum(string const& result,
+                                    int checkPosition,
+                                    int weightMax) {
+  int weight = 1;
+  int total = 0;
+  for (int i = checkPosition - 1; i >= 0; i--) {
+    total += weight * ALPHABET_STRING.find_first_of(result[i]);
+    if (++weight > weightMax) {
+      weight = 1;
+    }
+  }
+  if (result[checkPosition] != ALPHABET[total % 47]) {
+    throw ChecksumException();
+  }
+}