rhodes 5.5.15 → 5.5.17

data/lib/commonAPI/barcode/ext/platform/qt/src/qzxing/zxing/zxing/aztec/detector/Detector.h

@@ -0,0 +1,92 @@
+// -*- mode:c++; tab-width:2; indent-tabs-mode:nil; c-basic-offset:2 -*-
+/*
+ *  Detector.h
+ *  zxing
+ *
+ *  Created by Lukas Stabe on 08/02/2012.
+ *  Copyright 2012 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.
+ */
+
+#ifndef __ZXING_AZTEC_DETECTOR_DETECTOR_H__
+#define __ZXING_AZTEC_DETECTOR_DETECTOR_H__
+
+#include <vector>
+
+#include <zxing/common/BitArray.h>
+#include <zxing/ResultPoint.h>
+#include <zxing/common/BitMatrix.h>
+#include <zxing/DecodeHints.h>
+#include <zxing/aztec/AztecDetectorResult.h>
+
+namespace zxing {
+namespace aztec {
+
+class Point : public Counted {
+ private:
+  const int x;
+  const int y;
+            
+ public:
+  Ref<ResultPoint> toResultPoint() { 
+    return Ref<ResultPoint>(new ResultPoint(float(x), float(y)));
+  }
+            
+  Point(int ax, int ay) : x(ax), y(ay) {}
+
+  int getX() const { return x; }
+  int getY() const { return y; }
+};
+        
+class Detector : public Counted {
+            
+ private:
+  Ref<BitMatrix> image_;
+            
+  bool compact_;
+  int nbLayers_;
+  int nbDataBlocks_;
+  int nbCenterLayers_;
+  int shift_;
+            
+  void extractParameters(std::vector<Ref<Point> > bullEyeCornerPoints);
+  ArrayRef< Ref<ResultPoint> > getMatrixCornerPoints(std::vector<Ref<Point> > bullEyeCornerPoints);
+  static void correctParameterData(Ref<BitArray> parameterData, bool compact);
+  std::vector<Ref<Point> > getBullEyeCornerPoints(Ref<Point> pCenter);
+  Ref<Point> getMatrixCenter();
+  Ref<BitMatrix> sampleGrid(Ref<BitMatrix> image,
+                            Ref<ResultPoint> topLeft,
+                            Ref<ResultPoint> bottomLeft,
+                            Ref<ResultPoint> bottomRight,
+                            Ref<ResultPoint> topRight);
+  void getParameters(Ref<BitArray> parameterData);
+  Ref<BitArray> sampleLine(Ref<Point> p1, Ref<Point> p2, int size);
+  bool isWhiteOrBlackRectangle(Ref<Point> p1,
+                               Ref<Point> p2,
+                               Ref<Point> p3,
+                               Ref<Point> p4);
+  int getColor(Ref<Point> p1, Ref<Point> p2);
+  Ref<Point> getFirstDifferent(Ref<Point> init, bool color, int dx, int dy);
+  bool isValid(int x, int y);
+  static float distance(Ref<Point> a, Ref<Point> b);
+            
+ public:
+  Detector(Ref<BitMatrix> image);
+  Ref<AztecDetectorResult> detect();
+};
+
+}
+}
+
+#endif

data/lib/commonAPI/barcode/ext/platform/qt/src/qzxing/zxing/zxing/common/Array.h

@@ -0,0 +1,173 @@
+// -*- mode:c++; tab-width:2; indent-tabs-mode:nil; c-basic-offset:2 -*-
+#ifndef __ARRAY_H__
+#define __ARRAY_H__
+
+/*
+ *  Array.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 <vector>
+
+#include <zxing/common/Counted.h>
+
+namespace zxing {
+
+template<typename T> class Array : public Counted {
+protected:
+public:
+  std::vector<T> values_;
+  Array() {}
+  Array(int n) :
+      Counted(), values_(n, T()) {
+  }
+  Array(T const* ts, int n) :
+      Counted(), values_(ts, ts+n) {
+  }
+  Array(T const* ts, T const* te) :
+      Counted(), values_(ts, te) {
+  }
+  Array(T v, int n) :
+      Counted(), values_(n, v) {
+  }
+  Array(std::vector<T> &v) :
+      Counted(), values_(v) {
+  }
+  Array(Array<T> &other) :
+      Counted(), values_(other.values_) {
+  }
+  Array(Array<T> *other) :
+      Counted(), values_(other->values_) {
+  }
+  virtual ~Array() {
+  }
+  Array<T>& operator=(const Array<T> &other) {
+    values_ = other.values_;
+    return *this;
+  }
+  Array<T>& operator=(const std::vector<T> &array) {
+    values_ = array;
+    return *this;
+  }
+  T const& operator[](int i) const {
+    return values_[i];
+  }
+  T& operator[](int i) {
+    return values_[i];
+  }
+  int size() const {
+    return values_.size();
+  }
+  bool empty() const {
+    return values_.size() == 0;
+  }
+  std::vector<T> const& values() const {
+    return values_;
+  }
+  std::vector<T>& values() {
+    return values_;
+  }
+  void push_back(T value) {
+    values_.push_back(value);
+  }
+};
+
+template<typename T> class ArrayRef : public Counted {
+private:
+public:
+  Array<T> *array_;
+  ArrayRef() :
+      array_(0) {
+  }
+  explicit ArrayRef(int n) :
+      array_(0) {
+    reset(new Array<T> (n));
+  }
+  ArrayRef(T *ts, int n) :
+      array_(0) {
+    reset(new Array<T> (ts, n));
+  }
+  ArrayRef(Array<T> *a) :
+      array_(0) {
+    reset(a);
+  }
+  ArrayRef(const ArrayRef &other) :
+      Counted(), array_(0) {
+    reset(other.array_);
+  }
+
+  template<class Y>
+  ArrayRef(const ArrayRef<Y> &other) :
+      array_(0) {
+    reset(static_cast<const Array<T> *>(other.array_));
+  }
+
+  ~ArrayRef() {
+    if (array_) {
+      array_->release();
+    }
+    array_ = 0;
+  }
+
+  T const& operator[](int i) const {
+    return (*array_)[i];
+  }
+
+  T& operator[](int i) {
+    return (*array_)[i];
+  }
+
+  void reset(Array<T> *a) {
+    if (a) {
+      a->retain();
+    }
+    if (array_) {
+      array_->release();
+    }
+    array_ = a;
+  }
+  void reset(const ArrayRef<T> &other) {
+    reset(other.array_);
+  }
+  ArrayRef<T>& operator=(const ArrayRef<T> &other) {
+    reset(other);
+    return *this;
+  }
+  ArrayRef<T>& operator=(Array<T> *a) {
+    reset(a);
+    return *this;
+  }
+
+  Array<T>& operator*() const {
+    return *array_;
+  }
+
+  Array<T>* operator->() const {
+    return array_;
+  }
+
+  operator bool () const {
+    return array_ != 0;
+  }
+  bool operator ! () const {
+    return array_ == 0;
+  }
+};
+
+} // namespace zxing
+
+#endif // __ARRAY_H__

data/lib/commonAPI/barcode/ext/platform/qt/src/qzxing/zxing/zxing/common/BitArray.cpp

@@ -0,0 +1,237 @@
+// -*- 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 <zxing/common/BitArray.h>
+#include <zxing/common/Array.h>
+#include <cstring>
+
+using std::vector;
+using zxing::BitArray;
+
+
+// VC++
+using zxing::Ref;
+
+int BitArray::makeArraySize(int size) {
+    return (size + bitsPerWord-1) >> logBits;
+}
+
+BitArray::BitArray(): size(0), bits(1) {}
+
+BitArray::BitArray(int size_)
+    : size(size_), bits(makeArraySize(size)) {}
+
+BitArray::~BitArray() {
+}
+
+int BitArray::getSize() const {
+    return size;
+}
+
+int BitArray::getSizeInBytes() const
+{
+    return (size + 7)/8;\
+}
+
+void BitArray::setBulk(int i, int newBits) {
+    bits[i >> logBits] = newBits;
+}
+
+void BitArray::clear() {
+    int max = bits->size();
+    for (int i = 0; i < max; i++) {
+        bits[i] = 0;
+    }
+}
+
+bool BitArray::isRange(int start, int end, bool value) {
+    if (end < start) {
+        throw IllegalArgumentException();
+    }
+    if (end == start) {
+        return true; // empty range matches
+    }
+    end--; // will be easier to treat this as the last actually set bit -- inclusive
+    int firstInt = start >> logBits;
+    int lastInt = end >> logBits;
+    for (int i = firstInt; i <= lastInt; i++) {
+        int firstBit = i > firstInt ? 0 : start & bitsMask;
+        int lastBit = i < lastInt ? (bitsPerWord-1) : end & bitsMask;
+        int mask;
+        if (firstBit == 0 && lastBit == (bitsPerWord-1)) {
+            mask = -1;
+        } else {
+            mask = 0;
+            for (int j = firstBit; j <= lastBit; j++) {
+                mask |= 1 << j;
+            }
+        }
+
+        // Return false if we're looking for 1s and the masked bits[i] isn't all 1s (that is,
+        // equals the mask, or we're looking for 0s and the masked portion is not all 0s
+        if ((bits[i] & mask) != (value ? mask : 0)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+vector<int>& BitArray::getBitArray() {
+    return bits->values();
+}
+
+void BitArray::reverse() {
+    ArrayRef<int> newBits(bits->size());
+    int size = this->size;
+    for (int i = 0; i < size; i++) {
+        if (get(size - i - 1)) {
+            newBits[i >> logBits] |= 1 << (i & bitsMask);
+        }
+    }
+    bits = newBits;
+}
+
+BitArray::Reverse::Reverse(Ref<BitArray> array_) : array(array_) {
+    array->reverse();
+}
+
+BitArray::Reverse::~Reverse() {
+    array->reverse();
+}
+
+namespace {
+// N.B.: This only works for 32 bit ints ...
+int numberOfTrailingZeros(int i) {
+    // HD, Figure 5-14
+    int y;
+    if (i == 0) return 32;
+    int n = 31;
+    y = i <<16; if (y != 0) { n = n -16; i = y; }
+    y = i << 8; if (y != 0) { n = n - 8; i = y; }
+    y = i << 4; if (y != 0) { n = n - 4; i = y; }
+    y = i << 2; if (y != 0) { n = n - 2; i = y; }
+    return n - (((unsigned int)(i << 1)) >> 31);
+}
+}
+
+int BitArray::getNextSet(int from) {
+    if (from >= size) {
+        return size;
+    }
+    int bitsOffset = from >> logBits;
+    int currentBits = bits[bitsOffset];
+    // mask off lesser bits first
+    currentBits &= ~((1 << (from & bitsMask)) - 1);
+    while (currentBits == 0) {
+        if (++bitsOffset == (int)bits->size()) {
+            return size;
+        }
+        currentBits = bits[bitsOffset];
+    }
+    int result = (bitsOffset << logBits) + numberOfTrailingZeros(currentBits);
+    return result > size ? size : result;
+}
+
+int BitArray::getNextUnset(int from) {
+    if (from >= size) {
+        return size;
+    }
+    int bitsOffset = from >> logBits;
+    int currentBits = ~bits[bitsOffset];
+    // mask off lesser bits first
+    currentBits &= ~((1 << (from & bitsMask)) - 1);
+    while (currentBits == 0) {
+        if (++bitsOffset == (int)bits->size()) {
+            return size;
+        }
+        currentBits = ~bits[bitsOffset];
+    }
+    int result = (bitsOffset << logBits) + numberOfTrailingZeros(currentBits);
+    return result > size ? size : result;
+}
+
+void BitArray::appendBit(bool bit)
+{
+    ensureCapacity(size + 1);
+    if (bit) {
+        bits[size / 32] |= 1 << (size & 0x1F);
+    }
+    size++;
+}
+
+void BitArray::appendBits(int value, int numBits)
+{
+    if (numBits < 0 || numBits > 32) {
+        throw IllegalArgumentException("Num bits must be between 0 and 32");
+    }
+    ensureCapacity(size + numBits);
+    for (int numBitsLeft = numBits; numBitsLeft > 0; numBitsLeft--) {
+        appendBit(((value >> (numBitsLeft - 1)) & 0x01) == 1);
+    }
+}
+
+void BitArray::appendBitArray(const BitArray& other)
+{
+    int otherSize = other.size;
+    ensureCapacity(size + otherSize);
+    for (int i = 0; i < otherSize; i++) {
+        appendBit(other.get(i));
+    }
+}
+
+void BitArray::ensureCapacity(int size)
+{
+    if (size > bits->size() * 32)
+    {
+        ArrayRef<int> newBits = makeArray(size);
+        //memcpy(bits, newBits->, bits->size());
+        for (size_t i=0; i<bits->size(); ++i) {
+            newBits[i] = bits[i];
+        }
+        bits = newBits;
+
+    }
+}
+
+void BitArray::xor_(const BitArray& other)
+{
+    if (bits->size() != other.bits->size()) {
+        throw IllegalArgumentException("Sizes don't match");
+    }
+    for (int i = 0; i < bits->size(); i++) {
+        // The last byte could be incomplete (i.e. not have 8 bits in
+        // it) but there is no problem since 0 XOR 0 == 0.
+        bits[i] ^= other.bits[i];
+    }
+}
+
+void BitArray::toBytes(int bitOffset, std::vector<char>& array, int offset, int numBytes) const
+{
+    if(array.size() < (numBytes + offset))
+        array.resize(numBytes + offset);
+
+    for (int i = 0; i < numBytes; i++) {
+        int theByte = 0;
+        for (int j = 0; j < 8; j++) {
+            if (get(bitOffset)) {
+                theByte |= 1 << (7 - j);
+            }
+            bitOffset++;
+        }
+        array[offset + i] = (char) theByte;
+    }
+}