package com.google.zxing.oned;

import com.google.zxing.BarcodeFormat;
import com.google.zxing.ChecksumException;
import com.google.zxing.DecodeHintType;
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.Arrays;
import java.util.Map;

public final class Code93Reader extends OneDReader
{
  private static final char[] ALPHABET = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. $/+%abcd*".toCharArray();
  static final String ALPHABET_STRING = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. $/+%abcd*";
  private static final int ASTERISK_ENCODING = CHARACTER_ENCODINGS[47];
  static final int[] CHARACTER_ENCODINGS = { 276, 328, 324, 322, 296, 292, 290, 336, 274, 266, 424, 420, 418, 404, 402, 394, 360, 356, 354, 308, 282, 344, 332, 326, 300, 278, 436, 434, 428, 422, 406, 410, 364, 358, 310, 314, 302, 468, 466, 458, 366, 374, 430, 294, 474, 470, 306, 350 };
  private final int[] counters = new int[6];
  private final StringBuilder decodeRowResult = new StringBuilder(20);

  private static void checkChecksums(CharSequence paramCharSequence)
    throws ChecksumException
  {
    int i = paramCharSequence.length();
    checkOneChecksum(paramCharSequence, i - 2, 20);
    checkOneChecksum(paramCharSequence, i - 1, 15);
  }

  private static void checkOneChecksum(CharSequence paramCharSequence, int paramInt1, int paramInt2)
    throws ChecksumException
  {
    int i = 1;
    int j = 0;
    for (int k = paramInt1 - 1; ; k--)
    {
      if (k < 0)
      {
        if (paramCharSequence.charAt(paramInt1) == ALPHABET[(j % 47)])
          break;
        throw ChecksumException.getChecksumInstance();
      }
      j += i * "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ-. $/+%abcd*".indexOf(paramCharSequence.charAt(k));
      i++;
      if (i > paramInt2)
        i = 1;
    }
  }

  private static String decodeExtended(CharSequence paramCharSequence)
    throws FormatException
  {
    int i = paramCharSequence.length();
    StringBuilder localStringBuilder = new StringBuilder(i);
    int j = 0;
    if (j >= i)
      return localStringBuilder.toString();
    char c1 = paramCharSequence.charAt(j);
    int k;
    char c2;
    if ((c1 >= 'a') && (c1 <= 'd'))
    {
      if (j >= i - 1)
        throw FormatException.getFormatInstance();
      k = paramCharSequence.charAt(j + 1);
      c2 = '\000';
      switch (c1)
      {
      default:
        label108: localStringBuilder.append(c2);
        j++;
      case 'd':
      case 'a':
      case 'b':
      case 'c':
      }
    }
    while (true)
    {
      j++;
      break;
      if ((k >= 65) && (k <= 90))
      {
        c2 = (char)(k + 32);
        break label108;
      }
      throw FormatException.getFormatInstance();
      if ((k >= 65) && (k <= 90))
      {
        c2 = (char)(k - 64);
        break label108;
      }
      throw FormatException.getFormatInstance();
      if ((k >= 65) && (k <= 69))
      {
        c2 = (char)(k - 38);
        break label108;
      }
      if ((k >= 70) && (k <= 74))
      {
        c2 = (char)(k - 11);
        break label108;
      }
      if ((k >= 75) && (k <= 79))
      {
        c2 = (char)(k + 16);
        break label108;
      }
      if ((k >= 80) && (k <= 83))
      {
        c2 = (char)(k + 43);
        break label108;
      }
      if ((k >= 84) && (k <= 90))
      {
        c2 = '';
        break label108;
      }
      throw FormatException.getFormatInstance();
      if ((k >= 65) && (k <= 79))
      {
        c2 = (char)(k - 32);
        break label108;
      }
      if (k == 90)
      {
        c2 = ':';
        break label108;
      }
      throw FormatException.getFormatInstance();
      localStringBuilder.append(c1);
    }
  }

  private int[] findAsteriskPattern(BitArray paramBitArray)
    throws NotFoundException
  {
    int i = paramBitArray.getSize();
    int j = paramBitArray.getNextSet(0);
    Arrays.fill(this.counters, 0);
    int[] arrayOfInt = this.counters;
    int k = j;
    int m = 0;
    int n = arrayOfInt.length;
    int i1 = 0;
    for (int i2 = j; ; i2++)
    {
      if (i2 >= i)
        throw NotFoundException.getNotFoundInstance();
      if ((m ^ paramBitArray.get(i2)) == 0)
        break;
      arrayOfInt[i1] = (1 + arrayOfInt[i1]);
    }
    if (i1 == n - 1)
    {
      if (toPattern(arrayOfInt) == ASTERISK_ENCODING)
        return new int[] { k, i2 };
      k += arrayOfInt[0] + arrayOfInt[1];
      System.arraycopy(arrayOfInt, 2, arrayOfInt, 0, n - 2);
      arrayOfInt[(n - 2)] = 0;
      arrayOfInt[(n - 1)] = 0;
      i1--;
      label162: arrayOfInt[i1] = 1;
      if (m == 0)
        break label185;
    }
    label185: for (m = 0; ; m = 1)
    {
      break;
      i1++;
      break label162;
    }
  }

  private static char patternToChar(int paramInt)
    throws NotFoundException
  {
    for (int i = 0; ; i++)
    {
      if (i >= CHARACTER_ENCODINGS.length)
        throw NotFoundException.getNotFoundInstance();
      if (CHARACTER_ENCODINGS[i] == paramInt)
        return ALPHABET[i];
    }
  }

  private static int toPattern(int[] paramArrayOfInt)
  {
    int i = paramArrayOfInt.length;
    int j = 0;
    int k = paramArrayOfInt.length;
    int n;
    int i1;
    for (int m = 0; ; m++)
    {
      if (m >= k)
      {
        n = 0;
        i1 = 0;
        if (i1 < i)
          break;
        return n;
      }
      j += paramArrayOfInt[m];
    }
    int i2 = Math.round(9.0F * paramArrayOfInt[i1] / j);
    if ((i2 < 1) || (i2 > 4))
      return -1;
    int i3;
    if ((i1 & 0x1) == 0)
    {
      i3 = 0;
      label85: if (i3 < i2);
    }
    while (true)
    {
      i1++;
      break;
      n = 0x1 | n << 1;
      i3++;
      break label85;
      n <<= i2;
    }
  }

  public Result decodeRow(int paramInt, BitArray paramBitArray, Map<DecodeHintType, ?> paramMap)
    throws NotFoundException, ChecksumException, FormatException
  {
    int[] arrayOfInt1 = findAsteriskPattern(paramBitArray);
    int i = paramBitArray.getNextSet(arrayOfInt1[1]);
    int j = paramBitArray.getSize();
    int[] arrayOfInt2 = this.counters;
    Arrays.fill(arrayOfInt2, 0);
    StringBuilder localStringBuilder = this.decodeRowResult;
    localStringBuilder.setLength(0);
    char c;
    int m;
    int i1;
    do
    {
      recordPattern(paramBitArray, i, arrayOfInt2);
      int k = toPattern(arrayOfInt2);
      if (k < 0)
        throw NotFoundException.getNotFoundInstance();
      c = patternToChar(k);
      localStringBuilder.append(c);
      m = i;
      int n = arrayOfInt2.length;
      i1 = 0;
      if (i1 < n)
        break;
      i = paramBitArray.getNextSet(i);
    }
    while (c != '*');
    localStringBuilder.deleteCharAt(-1 + localStringBuilder.length());
    int i2 = 0;
    int i3 = arrayOfInt2.length;
    for (int i4 = 0; ; i4++)
    {
      if (i4 >= i3)
      {
        if ((i != j) && (paramBitArray.get(i)))
          break label203;
        throw NotFoundException.getNotFoundInstance();
        i += arrayOfInt2[i1];
        i1++;
        break;
      }
      i2 += arrayOfInt2[i4];
    }
    label203: if (localStringBuilder.length() < 2)
      throw NotFoundException.getNotFoundInstance();
    checkChecksums(localStringBuilder);
    localStringBuilder.setLength(-2 + localStringBuilder.length());
    String str = decodeExtended(localStringBuilder);
    float f1 = (arrayOfInt1[1] + arrayOfInt1[0]) / 2.0F;
    float f2 = m + i2 / 2.0F;
    ResultPoint[] arrayOfResultPoint = new ResultPoint[2];
    ResultPoint localResultPoint1 = new ResultPoint(f1, paramInt);
    arrayOfResultPoint[0] = localResultPoint1;
    ResultPoint localResultPoint2 = new ResultPoint(f2, paramInt);
    arrayOfResultPoint[1] = localResultPoint2;
    Result localResult = new Result(str, null, arrayOfResultPoint, BarcodeFormat.CODE_93);
    return localResult;
  }
}

/* Location:           C:\Documents and Settings\Cesar Cabello Cea\Mis documentos\Downloads\apk-downloader\com.ikea.kompis-6_dex2jar.jar
 * Qualified Name:     com.google.zxing.oned.Code93Reader
 * JD-Core Version:    0.6.2
 */