rhodes 2.4.1 → 3.0.0.beta.1

data/lib/extensions/barcode/ext/barcode/platform/android/src/com/google/zxing/oned/CodaBarReader.java

@@ -0,0 +1,263 @@
+/*
+ * Copyright 2008 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.
+ */
+
+package com.google.zxing.oned;
+
+import java.util.Hashtable;
+
+import com.google.zxing.BarcodeFormat;
+import com.google.zxing.NotFoundException;
+import com.google.zxing.Result;
+import com.google.zxing.ResultPoint;
+import com.google.zxing.common.BitArray;
+
+/**
+ * <p>Decodes Codabar barcodes.</p>
+ *
+ * @author Bas Vijfwinkel
+ */
+public final class CodaBarReader extends OneDReader {
+
+  private static final String ALPHABET_STRING = "0123456789-$:/.+ABCDTN";
+  private static final char[] ALPHABET = ALPHABET_STRING.toCharArray();
+
+  /**
+   * These represent the encodings of characters, as patterns of wide and narrow bars. The 7 least-significant bits of
+   * each int correspond to the pattern of wide and narrow, with 1s representing "wide" and 0s representing narrow. NOTE
+   * : c is equal to the  * pattern NOTE : d is equal to the e pattern
+   */
+  private static final int[] CHARACTER_ENCODINGS = {
+      0x003, 0x006, 0x009, 0x060, 0x012, 0x042, 0x021, 0x024, 0x030, 0x048, // 0-9
+      0x00c, 0x018, 0x025, 0x051, 0x054, 0x015, 0x01A, 0x029, 0x00B, 0x00E, // -$:/.+ABCD
+      0x01A, 0x029 //TN
+  };
+
+  // minimal number of characters that should be present (inclusing start and stop characters)
+  // this check has been added to reduce the number of false positive on other formats
+  // until the cause for this behaviour has been determined
+  // under normal circumstances this should be set to 3
+  private static final int minCharacterLength = 6; 
+  
+  // multiple start/end patterns
+  // official start and end patterns
+  private static final char[] STARTEND_ENCODING = {'E', '*', 'A', 'B', 'C', 'D', 'T', 'N'};
+  // some codabar generator allow the codabar string to be closed by every character
+  //private static final char[] STARTEND_ENCODING = { '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-', '$', ':', '/', '.', '+', 'A', 'B', 'C', 'D', 'T', 'N'};
+  
+  // some industries use a checksum standard but this is not part of the original codabar standard
+  // for more information see : http://www.mecsw.com/specs/codabar.html
+
+  public Result decodeRow(int rowNumber, BitArray row, Hashtable hints) throws NotFoundException {
+    int[] start = findAsteriskPattern(row);
+    start[1] = 0; // BAS: settings this to 0 improves the recognition rate somehow?
+    int nextStart = start[1];
+    int end = row.getSize();
+
+    // Read off white space
+    while (nextStart < end && !row.get(nextStart)) {
+      nextStart++;
+    }
+
+    StringBuffer result = new StringBuffer();
+    //int[] counters = new int[7];
+    int[] counters;
+    int lastStart;
+
+    do {
+      counters = new int[]{0, 0, 0, 0, 0, 0, 0}; // reset counters
+      recordPattern(row, nextStart, counters);
+
+      char decodedChar = toNarrowWidePattern(counters);
+      if (decodedChar == '!') {
+        throw NotFoundException.getNotFoundInstance();
+      }
+      result.append(decodedChar);
+      lastStart = nextStart;
+      for (int i = 0; i < counters.length; i++) {
+        nextStart += counters[i];
+      }
+
+      // Read off white space
+      while (nextStart < end && !row.get(nextStart)) {
+        nextStart++;
+      }
+    } while (nextStart < end); // no fixed end pattern so keep on reading while data is available
+
+    // Look for whitespace after pattern:
+    int lastPatternSize = 0;
+    for (int i = 0; i < counters.length; i++) {
+      lastPatternSize += counters[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 / 2 < lastPatternSize)) {
+      throw NotFoundException.getNotFoundInstance();
+    }
+
+	// valid result?
+	if (result.length() < 2)
+	{
+		throw NotFoundException.getNotFoundInstance();
+	}
+	
+	char startchar = result.charAt(0);
+	if (!arrayContains(STARTEND_ENCODING, startchar))
+	{
+		//invalid start character
+		throw NotFoundException.getNotFoundInstance();
+	}
+    
+	// find stop character
+    for (int k = 1;k < result.length() ;k++) 
+	{
+      if (result.charAt(k) == startchar) 
+	  {
+        // found stop character -> discard rest of the string
+		if ((k+1) != result.length())
+		{
+			result.delete(k+1,result.length()-1);
+			k = result.length();// break out of loop
+		} 
+	  }
+    }
+
+    // remove stop/start characters character and check if a string longer than 5 characters is contained
+    if (result.length() > minCharacterLength) 
+	{ 
+		result.deleteCharAt(result.length()-1); 
+		result.deleteCharAt(0); 
+	}
+	else
+	{
+		// Almost surely a false positive ( start + stop + at least 1 character)
+		throw NotFoundException.getNotFoundInstance();
+	}
+
+    float left = (float) (start[1] + start[0]) / 2.0f;
+    float right = (float) (nextStart + lastStart) / 2.0f;
+    return new Result(
+        result.toString(),
+        null,
+        new ResultPoint[]{
+            new ResultPoint(left, (float) rowNumber),
+            new ResultPoint(right, (float) rowNumber)},
+        BarcodeFormat.CODABAR);
+  }
+
+  private static int[] findAsteriskPattern(BitArray row) throws NotFoundException {
+    int width = row.getSize();
+    int rowOffset = 0;
+    while (rowOffset < width) {
+      if (row.get(rowOffset)) {
+        break;
+      }
+      rowOffset++;
+    }
+
+    int counterPosition = 0;
+    int[] counters = new int[7];
+    int patternStart = rowOffset;
+    boolean isWhite = false;
+    int patternLength = counters.length;
+
+    for (int i = rowOffset; i < width; i++) {
+      boolean pixel = row.get(i);
+      if (pixel ^ isWhite) {
+        counters[counterPosition]++;
+      } else {
+        if (counterPosition == patternLength - 1) {
+          try {
+            if (arrayContains(STARTEND_ENCODING, toNarrowWidePattern(counters))) {
+              // Look for whitespace before start pattern, >= 50% of width of start pattern
+              if (row.isRange(Math.max(0, patternStart - (i - patternStart) / 2), patternStart, false)) {
+                return new int[]{patternStart, i};
+              }
+            }
+          } catch (IllegalArgumentException re) {
+            // no match, continue
+          }
+          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 ^= true; // isWhite = !isWhite;
+      }
+    }
+    throw NotFoundException.getNotFoundInstance();
+  }
+
+  private static boolean arrayContains(char[] array, char key) {
+    if (array != null) {
+      for (int i = 0; i < array.length; i++) {
+        if (array[i] == key) {
+          return true;
+        }
+      }
+    }
+    return false;
+  }
+
+  private static char toNarrowWidePattern(int[] counters) {
+    // BAS : I have changed the following part because some codabar images would fail with the original routine
+    //        I took from the Code39Reader.java file
+    // ----------- change start
+    int numCounters = counters.length;
+    int maxNarrowCounter = 0;
+
+    int minCounter = Integer.MAX_VALUE;
+    for (int i = 0; i < numCounters; i++) {
+      if (counters[i] < minCounter) {
+        minCounter = counters[i];
+      }
+      if (counters[i] > maxNarrowCounter) {
+        maxNarrowCounter = counters[i];
+      }
+    }
+    // ---------- change end
+
+
+    do {
+      int wideCounters = 0;
+      int pattern = 0;
+      for (int i = 0; i < numCounters; i++) {
+        if (counters[i] > maxNarrowCounter) {
+          pattern |= 1 << (numCounters - 1 - i);
+          wideCounters++;
+        }
+      }
+
+      if ((wideCounters == 2) || (wideCounters == 3)) {
+        for (int i = 0; i < CHARACTER_ENCODINGS.length; i++) {
+          if (CHARACTER_ENCODINGS[i] == pattern) {
+            return ALPHABET[i];
+          }
+        }
+      }
+      maxNarrowCounter--;
+    } while (maxNarrowCounter > minCounter);
+    return '!';
+  }
+
+}

data/lib/extensions/barcode/ext/barcode/platform/android/src/com/google/zxing/oned/Code128Reader.java

@@ -0,0 +1,473 @@
+/*
+ * Copyright 2008 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.
+ */
+
+package com.google.zxing.oned;
+
+import com.google.zxing.BarcodeFormat;
+import com.google.zxing.ChecksumException;
+import com.google.zxing.FormatException;
+import com.google.zxing.NotFoundException;
+import com.google.zxing.Result;
+import com.google.zxing.ResultPoint;
+import com.google.zxing.common.BitArray;
+
+import java.util.Hashtable;
+
+/**
+ * <p>Decodes Code 128 barcodes.</p>
+ *
+ * @author Sean Owen
+ */
+public final class Code128Reader extends OneDReader {
+
+  static final int[][] CODE_PATTERNS = {
+      {2, 1, 2, 2, 2, 2}, // 0
+      {2, 2, 2, 1, 2, 2},
+      {2, 2, 2, 2, 2, 1},
+      {1, 2, 1, 2, 2, 3},
+      {1, 2, 1, 3, 2, 2},
+      {1, 3, 1, 2, 2, 2}, // 5
+      {1, 2, 2, 2, 1, 3},
+      {1, 2, 2, 3, 1, 2},
+      {1, 3, 2, 2, 1, 2},
+      {2, 2, 1, 2, 1, 3},
+      {2, 2, 1, 3, 1, 2}, // 10
+      {2, 3, 1, 2, 1, 2},
+      {1, 1, 2, 2, 3, 2},
+      {1, 2, 2, 1, 3, 2},
+      {1, 2, 2, 2, 3, 1},
+      {1, 1, 3, 2, 2, 2}, // 15
+      {1, 2, 3, 1, 2, 2},
+      {1, 2, 3, 2, 2, 1},
+      {2, 2, 3, 2, 1, 1},
+      {2, 2, 1, 1, 3, 2},
+      {2, 2, 1, 2, 3, 1}, // 20
+      {2, 1, 3, 2, 1, 2},
+      {2, 2, 3, 1, 1, 2},
+      {3, 1, 2, 1, 3, 1},
+      {3, 1, 1, 2, 2, 2},
+      {3, 2, 1, 1, 2, 2}, // 25
+      {3, 2, 1, 2, 2, 1},
+      {3, 1, 2, 2, 1, 2},
+      {3, 2, 2, 1, 1, 2},
+      {3, 2, 2, 2, 1, 1},
+      {2, 1, 2, 1, 2, 3}, // 30
+      {2, 1, 2, 3, 2, 1},
+      {2, 3, 2, 1, 2, 1},
+      {1, 1, 1, 3, 2, 3},
+      {1, 3, 1, 1, 2, 3},
+      {1, 3, 1, 3, 2, 1}, // 35
+      {1, 1, 2, 3, 1, 3},
+      {1, 3, 2, 1, 1, 3},
+      {1, 3, 2, 3, 1, 1},
+      {2, 1, 1, 3, 1, 3},
+      {2, 3, 1, 1, 1, 3}, // 40
+      {2, 3, 1, 3, 1, 1},
+      {1, 1, 2, 1, 3, 3},
+      {1, 1, 2, 3, 3, 1},
+      {1, 3, 2, 1, 3, 1},
+      {1, 1, 3, 1, 2, 3}, // 45
+      {1, 1, 3, 3, 2, 1},
+      {1, 3, 3, 1, 2, 1},
+      {3, 1, 3, 1, 2, 1},
+      {2, 1, 1, 3, 3, 1},
+      {2, 3, 1, 1, 3, 1}, // 50
+      {2, 1, 3, 1, 1, 3},
+      {2, 1, 3, 3, 1, 1},
+      {2, 1, 3, 1, 3, 1},
+      {3, 1, 1, 1, 2, 3},
+      {3, 1, 1, 3, 2, 1}, // 55
+      {3, 3, 1, 1, 2, 1},
+      {3, 1, 2, 1, 1, 3},
+      {3, 1, 2, 3, 1, 1},
+      {3, 3, 2, 1, 1, 1},
+      {3, 1, 4, 1, 1, 1}, // 60
+      {2, 2, 1, 4, 1, 1},
+      {4, 3, 1, 1, 1, 1},
+      {1, 1, 1, 2, 2, 4},
+      {1, 1, 1, 4, 2, 2},
+      {1, 2, 1, 1, 2, 4}, // 65
+      {1, 2, 1, 4, 2, 1},
+      {1, 4, 1, 1, 2, 2},
+      {1, 4, 1, 2, 2, 1},
+      {1, 1, 2, 2, 1, 4},
+      {1, 1, 2, 4, 1, 2}, // 70
+      {1, 2, 2, 1, 1, 4},
+      {1, 2, 2, 4, 1, 1},
+      {1, 4, 2, 1, 1, 2},
+      {1, 4, 2, 2, 1, 1},
+      {2, 4, 1, 2, 1, 1}, // 75
+      {2, 2, 1, 1, 1, 4},
+      {4, 1, 3, 1, 1, 1},
+      {2, 4, 1, 1, 1, 2},
+      {1, 3, 4, 1, 1, 1},
+      {1, 1, 1, 2, 4, 2}, // 80
+      {1, 2, 1, 1, 4, 2},
+      {1, 2, 1, 2, 4, 1},
+      {1, 1, 4, 2, 1, 2},
+      {1, 2, 4, 1, 1, 2},
+      {1, 2, 4, 2, 1, 1}, // 85
+      {4, 1, 1, 2, 1, 2},
+      {4, 2, 1, 1, 1, 2},
+      {4, 2, 1, 2, 1, 1},
+      {2, 1, 2, 1, 4, 1},
+      {2, 1, 4, 1, 2, 1}, // 90
+      {4, 1, 2, 1, 2, 1},
+      {1, 1, 1, 1, 4, 3},
+      {1, 1, 1, 3, 4, 1},
+      {1, 3, 1, 1, 4, 1},
+      {1, 1, 4, 1, 1, 3}, // 95
+      {1, 1, 4, 3, 1, 1},
+      {4, 1, 1, 1, 1, 3},
+      {4, 1, 1, 3, 1, 1},
+      {1, 1, 3, 1, 4, 1},
+      {1, 1, 4, 1, 3, 1}, // 100
+      {3, 1, 1, 1, 4, 1},
+      {4, 1, 1, 1, 3, 1},
+      {2, 1, 1, 4, 1, 2},
+      {2, 1, 1, 2, 1, 4},
+      {2, 1, 1, 2, 3, 2}, // 105
+      {2, 3, 3, 1, 1, 1, 2}
+  };
+
+  private static final int MAX_AVG_VARIANCE = (int) (PATTERN_MATCH_RESULT_SCALE_FACTOR * 0.25f);
+  private static final int MAX_INDIVIDUAL_VARIANCE = (int) (PATTERN_MATCH_RESULT_SCALE_FACTOR * 0.7f);
+
+  private static final int CODE_SHIFT = 98;
+
+  private static final int CODE_CODE_C = 99;
+  private static final int CODE_CODE_B = 100;
+  private static final int CODE_CODE_A = 101;
+
+  private static final int CODE_FNC_1 = 102;
+  private static final int CODE_FNC_2 = 97;
+  private static final int CODE_FNC_3 = 96;
+  private static final int CODE_FNC_4_A = 101;
+  private static final int CODE_FNC_4_B = 100;
+
+  private static final int CODE_START_A = 103;
+  private static final int CODE_START_B = 104;
+  private static final int CODE_START_C = 105;
+  private static final int CODE_STOP = 106;
+
+  private static int[] findStartPattern(BitArray row) throws NotFoundException {
+    int width = row.getSize();
+    int rowOffset = 0;
+    while (rowOffset < width) {
+      if (row.get(rowOffset)) {
+        break;
+      }
+      rowOffset++;
+    }
+
+    int counterPosition = 0;
+    int[] counters = new int[6];
+    int patternStart = rowOffset;
+    boolean isWhite = false;
+    int patternLength = counters.length;
+
+    for (int i = rowOffset; i < width; i++) {
+      boolean pixel = row.get(i);
+      if (pixel ^ isWhite) {
+        counters[counterPosition]++;
+      } else {
+        if (counterPosition == patternLength - 1) {
+          int bestVariance = MAX_AVG_VARIANCE;
+          int bestMatch = -1;
+          for (int startCode = CODE_START_A; startCode <= CODE_START_C; startCode++) {
+            int variance = patternMatchVariance(counters, CODE_PATTERNS[startCode],
+                MAX_INDIVIDUAL_VARIANCE);
+            if (variance < bestVariance) {
+              bestVariance = variance;
+              bestMatch = startCode;
+            }
+          }
+          if (bestMatch >= 0) {
+            // Look for whitespace before start pattern, >= 50% of width of start pattern
+            if (row.isRange(Math.max(0, patternStart - (i - patternStart) / 2), patternStart,
+                false)) {
+              return new int[]{patternStart, i, bestMatch};
+            }
+          }
+          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.getNotFoundInstance();
+  }
+
+  private static int decodeCode(BitArray row, int[] counters, int rowOffset) throws NotFoundException {
+    recordPattern(row, rowOffset, counters);
+    int bestVariance = MAX_AVG_VARIANCE; // worst variance we'll accept
+    int bestMatch = -1;
+    for (int d = 0; d < CODE_PATTERNS.length; d++) {
+      int[] pattern = CODE_PATTERNS[d];
+      int variance = patternMatchVariance(counters, pattern, MAX_INDIVIDUAL_VARIANCE);
+      if (variance < bestVariance) {
+        bestVariance = variance;
+        bestMatch = d;
+      }
+    }
+    // TODO We're overlooking the fact that the STOP pattern has 7 values, not 6.
+    if (bestMatch >= 0) {
+      return bestMatch;
+    } else {
+      throw NotFoundException.getNotFoundInstance();
+    }
+  }
+
+  public Result decodeRow(int rowNumber, BitArray row, Hashtable hints)
+      throws NotFoundException, FormatException, ChecksumException {
+
+    int[] startPatternInfo = findStartPattern(row);
+    int startCode = startPatternInfo[2];
+    int codeSet;
+    switch (startCode) {
+      case CODE_START_A:
+        codeSet = CODE_CODE_A;
+        break;
+      case CODE_START_B:
+        codeSet = CODE_CODE_B;
+        break;
+      case CODE_START_C:
+        codeSet = CODE_CODE_C;
+        break;
+      default:
+        throw FormatException.getFormatInstance();
+    }
+
+    boolean done = false;
+    boolean isNextShifted = false;
+
+    StringBuffer result = new StringBuffer(20);
+    int lastStart = startPatternInfo[0];
+    int nextStart = startPatternInfo[1];
+    int[] counters = new int[6];
+
+    int lastCode = 0;
+    int code = 0;
+    int checksumTotal = startCode;
+    int multiplier = 0;
+    boolean lastCharacterWasPrintable = true;
+
+    while (!done) {
+
+      boolean unshift = isNextShifted;
+      isNextShifted = false;
+
+      // Save off last code
+      lastCode = code;
+
+      // Decode another code from image
+      code = decodeCode(row, counters, nextStart);
+
+      // Remember whether the last code was printable or not (excluding CODE_STOP)
+      if (code != CODE_STOP) {
+        lastCharacterWasPrintable = true;
+      }
+
+      // Add to checksum computation (if not CODE_STOP of course)
+      if (code != CODE_STOP) {
+        multiplier++;
+        checksumTotal += multiplier * code;
+      }
+
+      // Advance to where the next code will to start
+      lastStart = nextStart;
+      for (int i = 0; i < counters.length; i++) {
+        nextStart += counters[i];
+      }
+
+      // Take care of illegal start codes
+      switch (code) {
+        case CODE_START_A:
+        case CODE_START_B:
+        case CODE_START_C:
+          throw FormatException.getFormatInstance();
+      }
+
+      switch (codeSet) {
+
+        case CODE_CODE_A:
+          if (code < 64) {
+            result.append((char) (' ' + code));
+          } else if (code < 96) {
+            result.append((char) (code - 64));
+          } else {
+            // Don't let CODE_STOP, which always appears, affect whether whether we think the last
+            // code was printable or not.
+            if (code != CODE_STOP) {
+              lastCharacterWasPrintable = false;
+            }
+            switch (code) {
+              case CODE_FNC_1:
+              case CODE_FNC_2:
+              case CODE_FNC_3:
+              case CODE_FNC_4_A:
+                // do nothing?
+                break;
+              case CODE_SHIFT:
+                isNextShifted = true;
+                codeSet = CODE_CODE_B;
+                break;
+              case CODE_CODE_B:
+                codeSet = CODE_CODE_B;
+                break;
+              case CODE_CODE_C:
+                codeSet = CODE_CODE_C;
+                break;
+              case CODE_STOP:
+                done = true;
+                break;
+            }
+          }
+          break;
+        case CODE_CODE_B:
+          if (code < 96) {
+            result.append((char) (' ' + code));
+          } else {
+            if (code != CODE_STOP) {
+              lastCharacterWasPrintable = false;
+            }
+            switch (code) {
+              case CODE_FNC_1:
+              case CODE_FNC_2:
+              case CODE_FNC_3:
+              case CODE_FNC_4_B:
+                // do nothing?
+                break;
+              case CODE_SHIFT:
+                isNextShifted = true;
+                codeSet = CODE_CODE_C;
+                break;
+              case CODE_CODE_A:
+                codeSet = CODE_CODE_A;
+                break;
+              case CODE_CODE_C:
+                codeSet = CODE_CODE_C;
+                break;
+              case CODE_STOP:
+                done = true;
+                break;
+            }
+          }
+          break;
+        case CODE_CODE_C:
+          if (code < 100) {
+            if (code < 10) {
+              result.append('0');
+            }
+            result.append(code);
+          } else {
+            if (code != CODE_STOP) {
+              lastCharacterWasPrintable = false;
+            }
+            switch (code) {
+              case CODE_FNC_1:
+                // do nothing?
+                break;
+              case CODE_CODE_A:
+                codeSet = CODE_CODE_A;
+                break;
+              case CODE_CODE_B:
+                codeSet = CODE_CODE_B;
+                break;
+              case CODE_STOP:
+                done = true;
+                break;
+            }
+          }
+          break;
+      }
+
+      // Unshift back to another code set if we were shifted
+      if (unshift) {
+        switch (codeSet) {
+          case CODE_CODE_A:
+            codeSet = CODE_CODE_C;
+            break;
+          case CODE_CODE_B:
+            codeSet = CODE_CODE_A;
+            break;
+          case CODE_CODE_C:
+            codeSet = CODE_CODE_B;
+            break;
+        }
+      }
+
+    }
+
+    // Check for ample whitespace following pattern, but, to do this we first need to remember that
+    // we fudged decoding CODE_STOP since it actually has 7 bars, not 6. There is a black bar left
+    // to read off. Would be slightly better to properly read. Here we just skip it:
+    int width = row.getSize();
+    while (nextStart < width && row.get(nextStart)) {
+      nextStart++;
+    }
+    if (!row.isRange(nextStart, Math.min(width, nextStart + (nextStart - lastStart) / 2),
+        false)) {
+      throw NotFoundException.getNotFoundInstance();
+    }
+
+    // Pull out from sum the value of the penultimate check code
+    checksumTotal -= multiplier * lastCode;
+    // lastCode is the checksum then:
+    if (checksumTotal % 103 != lastCode) {
+      throw ChecksumException.getChecksumInstance();
+    }
+
+    // Need to pull out the check digits from string
+    int resultLength = result.length();
+    // Only bother if the result had at least one character, and if the checksum digit happened to
+    // be a printable character. If it was just interpreted as a control code, nothing to remove.
+    if (resultLength > 0 && lastCharacterWasPrintable) {
+      if (codeSet == CODE_CODE_C) {
+        result.delete(resultLength - 2, resultLength);
+      } else {
+        result.delete(resultLength - 1, resultLength);
+      }
+    }
+
+    String resultString = result.toString();
+
+    if (resultString.length() == 0) {
+      // Almost surely a false positive
+      throw FormatException.getFormatInstance();
+    }
+
+    float left = (float) (startPatternInfo[1] + startPatternInfo[0]) / 2.0f;
+    float right = (float) (nextStart + lastStart) / 2.0f;
+    return new Result(
+        resultString,
+        null,
+        new ResultPoint[]{
+            new ResultPoint(left, (float) rowNumber),
+            new ResultPoint(right, (float) rowNumber)},
+        BarcodeFormat.CODE_128);
+
+  }
+
+}