rhodes 2.4.1 → 3.0.0.beta.1

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

@@ -0,0 +1,73 @@
+/*
+ * Copyright 2010 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.WriterException;
+import com.google.zxing.common.BitMatrix;
+
+/**
+ * This object renders a CODE128 code as a {@link BitMatrix}.
+ * 
+ * @author erik.barbara@gmail.com (Erik Barbara)
+ */
+public final class Code128Writer extends UPCEANWriter {
+
+    public BitMatrix encode(String contents,
+                            BarcodeFormat format,
+                            int width,
+                            int height,
+                            Hashtable hints) throws WriterException {
+      if (format != BarcodeFormat.CODE_128) {
+        throw new IllegalArgumentException("Can only encode CODE_128, but got " + format);
+      }
+      return super.encode(contents, format, width, height, hints);
+    }
+
+    public byte[] encode(String contents) {
+      int length = contents.length();
+      if (length > 80) {
+        throw new IllegalArgumentException(
+            "Requested contents should be less than 80 digits long, but got " + length);
+      }
+
+      int codeWidth = 11 + 11 + 13; //start plus check plus stop character
+      //get total code width for this barcode
+      for (int i = 0; i < length; i++) {
+        int[] patterns = Code128Reader.CODE_PATTERNS[contents.charAt(i) - ' '];
+        for (int j = 0; j < patterns.length; j++)  {
+          codeWidth += patterns[j];
+        }
+      }
+      byte[] result = new byte[codeWidth];
+      int pos = appendPattern(result, 0, Code128Reader.CODE_PATTERNS[104], 1);
+      int check = 104;
+      //append next character to bytematrix
+      for(int i = 0; i < length; i++) {
+        check += (contents.charAt(i) - ' ') * (i + 1);
+        pos += appendPattern(result, pos, Code128Reader.CODE_PATTERNS[contents.charAt(i) - ' '],1);
+      }
+      //compute checksum and append it along with end character and quiet space
+      check %= 103;
+      pos += appendPattern(result,pos,Code128Reader.CODE_PATTERNS[check],1);
+      pos += appendPattern(result,pos,Code128Reader.CODE_PATTERNS[106],1);
+
+      return result;
+    }
+
+}

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

@@ -0,0 +1,333 @@
+/*
+ * 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 39 barcodes. This does not support "Full ASCII Code 39" yet.</p>
+ *
+ * @author Sean Owen
+ * @see Code93Reader
+ */
+public final class Code39Reader extends OneDReader {
+
+  static final String ALPHABET_STRING = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. *$/+%";
+  private static final char[] ALPHABET = ALPHABET_STRING.toCharArray();
+
+  /**
+   * 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.
+   */
+  static final int[] CHARACTER_ENCODINGS = {
+      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 // $-%
+  };
+
+  private static final int ASTERISK_ENCODING = CHARACTER_ENCODINGS[39];
+
+  private final boolean usingCheckDigit;
+  private final boolean extendedMode;
+
+  /**
+   * 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.
+   */
+  public Code39Reader() {
+    usingCheckDigit = false;
+    extendedMode = false;
+  }
+
+  /**
+   * 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.
+   */
+  public Code39Reader(boolean usingCheckDigit) {
+    this.usingCheckDigit = usingCheckDigit;
+    this.extendedMode = false;
+  }
+
+  /**
+   * Creates a reader that can be configured to check the last character as a check digit,
+   * or optionally attempt to decode "extended Code 39" sequences that are used to encode
+   * the full ASCII character set.
+   *
+   * @param usingCheckDigit if true, treat the last data character as a check digit, not
+   * data, and verify that the checksum passes.
+   * @param extendedMode if true, will attempt to decode extended Code 39 sequences in the
+   * text.
+   */
+  public Code39Reader(boolean usingCheckDigit, boolean extendedMode) {
+    this.usingCheckDigit = usingCheckDigit;
+    this.extendedMode = extendedMode;
+  }
+
+  public Result decodeRow(int rowNumber, BitArray row, Hashtable hints)
+      throws NotFoundException, ChecksumException, FormatException {
+
+    int[] start = findAsteriskPattern(row);
+    int nextStart = start[1];
+    int end = row.getSize();
+
+    // Read off white space
+    while (nextStart < end && !row.get(nextStart)) {
+      nextStart++;
+    }
+
+    StringBuffer result = new StringBuffer(20);
+    int[] counters = new int[9];
+    char decodedChar;
+    int lastStart;
+    do {
+      recordPattern(row, nextStart, counters);
+      int pattern = toNarrowWidePattern(counters);
+      if (pattern < 0) {
+        throw NotFoundException.getNotFoundInstance();
+      }
+      decodedChar = patternToChar(pattern);
+      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 (decodedChar != '*');
+    result.deleteCharAt(result.length() - 1); // remove asterisk
+
+    // 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();
+    }
+
+    if (usingCheckDigit) {
+      int max = result.length() - 1;
+      int total = 0;
+      for (int i = 0; i < max; i++) {
+        total += ALPHABET_STRING.indexOf(result.charAt(i));
+      }
+      if (result.charAt(max) != ALPHABET[total % 43]) {
+        throw ChecksumException.getChecksumInstance();
+      }
+      result.deleteCharAt(max);
+    }
+
+    if (result.length() == 0) {
+      // Almost surely a false positive
+      throw NotFoundException.getNotFoundInstance();
+    }
+
+    String resultString;
+    if (extendedMode) {
+      resultString = decodeExtended(result);
+    } else {
+      resultString = result.toString();
+    }
+
+    float left = (float) (start[1] + start[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_39);
+
+  }
+
+  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[9];
+    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) {
+          if (toNarrowWidePattern(counters) == ASTERISK_ENCODING) {
+            // 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};
+            }
+          }
+          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();
+  }
+
+  // For efficiency, returns -1 on failure. Not throwing here saved as many as 700 exceptions
+  // per image when using some of our blackbox images.
+  private static int toNarrowWidePattern(int[] counters) {
+    int numCounters = counters.length;
+    int maxNarrowCounter = 0;
+    int wideCounters;
+    do {
+      int minCounter = Integer.MAX_VALUE;
+      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;
+  }
+
+  private static char patternToChar(int pattern) throws NotFoundException {
+    for (int i = 0; i < CHARACTER_ENCODINGS.length; i++) {
+      if (CHARACTER_ENCODINGS[i] == pattern) {
+        return ALPHABET[i];
+      }
+    }
+    throw NotFoundException.getNotFoundInstance();
+  }
+
+  private static String decodeExtended(StringBuffer encoded) throws FormatException {
+    int length = encoded.length();
+    StringBuffer decoded = new StringBuffer(length);
+    for (int i = 0; i < length; i++) {
+      char c = encoded.charAt(i);
+      if (c == '+' || c == '$' || c == '%' || c == '/') {
+        char next = encoded.charAt(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 FormatException.getFormatInstance();
+            }
+            break;
+          case '$':
+            // $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 '%':
+            // %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 '/':
+            // /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(decodedChar);
+        // bump up i again since we read two characters
+        i++;
+      } else {
+        decoded.append(c);
+      }
+    }
+    return decoded.toString();
+  }
+
+}

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

@@ -0,0 +1,82 @@
+/*
+ * Copyright 2010 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.WriterException;
+import com.google.zxing.common.BitMatrix;
+
+/**
+ * This object renders a CODE39 code as a {@link BitMatrix}.
+ * 
+ * @author erik.barbara@gmail.com (Erik Barbara)
+ */
+public final class Code39Writer extends UPCEANWriter {
+
+  public BitMatrix encode(String contents,
+                          BarcodeFormat format,
+                          int width,
+                          int height,
+                          Hashtable hints) throws WriterException {
+    if (format != BarcodeFormat.CODE_39) {
+      throw new IllegalArgumentException("Can only encode CODE_39, but got " + format);
+    }
+    return super.encode(contents, format, width, height, hints);
+  }
+
+  public byte[] encode(String contents) {
+    int length = contents.length();
+    if (length > 80) {
+      throw new IllegalArgumentException(
+          "Requested contents should be less than 80 digits long, but got " + length);
+    }
+
+    int[] widths = new int[9];
+    int codeWidth = 24 + 1 + length;
+    for (int i = 0; i < length; i++) {
+      int indexInString = Code39Reader.ALPHABET_STRING.indexOf(contents.charAt(i));
+      toIntArray(Code39Reader.CHARACTER_ENCODINGS[indexInString], widths);
+      for(int j = 0; j < widths.length; j++) {
+        codeWidth += widths[j];
+      }
+    }
+    byte[] result = new byte[codeWidth];
+    toIntArray(Code39Reader.CHARACTER_ENCODINGS[39], widths);
+    int pos = appendPattern(result, 0, widths, 1);
+    int[] narrowWhite = {1};
+    pos += appendPattern(result, pos, narrowWhite, 0);
+    //append next character to bytematrix
+    for(int i = length-1; i >= 0; i--) {
+      int indexInString = Code39Reader.ALPHABET_STRING.indexOf(contents.charAt(i));
+      toIntArray(Code39Reader.CHARACTER_ENCODINGS[indexInString], widths);
+      pos += appendPattern(result, pos, widths, 1);
+      pos += appendPattern(result, pos, narrowWhite, 0);
+    }
+    toIntArray(Code39Reader.CHARACTER_ENCODINGS[39], widths);
+    pos += appendPattern(result, pos, widths, 1);
+    return result;
+  }
+
+  private static void toIntArray(int a, int[] toReturn) {
+    for (int i = 0; i < 9; i++) {
+      int temp = a & (1 << i);
+      toReturn[i] = (temp == 0) ? 1 : 2;
+    }
+  }
+
+}