#include <zxing/common/BitArray.h>
#include <iostream>
#include <zxing/common/BitArray.h>
#include <iostream>
-const unsigned int BitArray::bitsPerWord_ = sizeof(unsigned int)*8;
+const unsigned int BitArray::bitsPerWord_ = numeric_limits<unsigned int>::digits;
const unsigned int BitArray::logBits_ = logDigits(bitsPerWord_);
const unsigned int BitArray::bitsMask_ = (1 << logBits_) - 1;
size_t BitArray::wordsForBits(size_t bits) {
const unsigned int BitArray::logBits_ = logDigits(bitsPerWord_);
const unsigned int BitArray::bitsMask_ = (1 << logBits_) - 1;
size_t BitArray::wordsForBits(size_t bits) {
#include <zxing/common/Counted.h>
#include <zxing/common/IllegalArgumentException.h>
#include <vector>
#include <zxing/common/Counted.h>
#include <zxing/common/IllegalArgumentException.h>
#include <vector>
#include <iostream>
namespace zxing {
#include <iostream>
namespace zxing {
-const unsigned int bitsPerWord = sizeof(unsigned int)*8;
+const unsigned int bitsPerWord = numeric_limits<unsigned int>::digits;
const unsigned int logBits = logDigits(bitsPerWord);
const unsigned int bitsMask = (1 << logBits) - 1;
const unsigned int logBits = logDigits(bitsPerWord);
const unsigned int bitsMask = (1 << logBits) - 1;
int fromY = (int) from->getY();
int toX = (int) to->getX();
int toY = (int) to->getY();
int fromY = (int) from->getY();
int toX = (int) to->getX();
int toY = (int) to->getY();
- bool steep = labs(toY - fromY) > labs(toX - fromX);
+ bool steep = abs(toY - fromY) > abs(toX - fromX);
if (steep) {
int temp = fromX;
fromX = fromY;
if (steep) {
int temp = fromX;
fromX = fromY;
- int dx = labs(toX - fromX);
- int dy = labs(toY - fromY);
+ int dx = abs(toX - fromX);
+ int dy = abs(toY - fromY);
int error = -dx >> 1;
int ystep = fromY < toY ? 1 : -1;
int xstep = fromX < toX ? 1 : -1;
int error = -dx >> 1;
int ystep = fromY < toY ? 1 : -1;
int xstep = fromX < toX ? 1 : -1;
const char *DecodedBitStreamParser::SHIFT_JIS = "SHIFT_JIS";
const char *DecodedBitStreamParser::EUC_JP = "EUC-JP";
const char *DecodedBitStreamParser::SHIFT_JIS = "SHIFT_JIS";
const char *DecodedBitStreamParser::EUC_JP = "EUC-JP";
-string DecodedBitStreamParser::convert(const unsigned char *bufIn, size_t nIn, const char *src) {
+void DecodedBitStreamParser::append(std::string &result, const unsigned char *bufIn, size_t nIn, const char *src) {
#ifndef NO_ICONV
if (nIn == 0) {
#ifndef NO_ICONV
if (nIn == 0) {
}
iconv_t cd = iconv_open(UTF8, src);
}
iconv_t cd = iconv_open(UTF8, src);
int nResult = maxOut - nTo;
bufOut[nResult] = '\0';
int nResult = maxOut - nTo;
bufOut[nResult] = '\0';
- string result((const char *)bufOut);
+ result.append((const char *)bufOut);
- return string((const char *)bufIn, nIn);
+ result.append((const char *)bufIn, nIn);
-string DecodedBitStreamParser::decodeKanjiSegment(Ref<BitSource> bits, int count) {
+void DecodedBitStreamParser::decodeKanjiSegment(Ref<BitSource> bits, std::string &result, int count) {
// Each character will require 2 bytes. Read the characters as 2-byte pairs
// and decode as Shift_JIS afterwards
size_t nBytes = 2 * count;
// Each character will require 2 bytes. Read the characters as 2-byte pairs
// and decode as Shift_JIS afterwards
size_t nBytes = 2 * count;
- string result = convert(buffer, nBytes, SHIFT_JIS);
+ append(result, buffer, nBytes, SHIFT_JIS);
-string DecodedBitStreamParser::decodeByteSegment(Ref<BitSource> bits, int count) {
+void DecodedBitStreamParser::decodeByteSegment(Ref<BitSource> bits, std::string &result, int count) {
int nBytes = count;
unsigned char* readBytes = new unsigned char[nBytes];
if (count << 3 > bits->available()) {
int nBytes = count;
unsigned char* readBytes = new unsigned char[nBytes];
if (count << 3 > bits->available()) {
// Shift_JIS -- without anything like an ECI designator to
// give a hint.
const char *encoding = guessEncoding(readBytes, nBytes);
// Shift_JIS -- without anything like an ECI designator to
// give a hint.
const char *encoding = guessEncoding(readBytes, nBytes);
- string result = convert(readBytes, nBytes, encoding);
+ append(result, readBytes, nBytes, encoding);
-string DecodedBitStreamParser::decodeNumericSegment(Ref<BitSource> bits, int count) {
+void DecodedBitStreamParser::decodeNumericSegment(Ref<BitSource> bits, std::string &result, int count) {
int nBytes = count;
unsigned char* bytes = new unsigned char[nBytes];
int i = 0;
int nBytes = count;
unsigned char* bytes = new unsigned char[nBytes];
int i = 0;
}
bytes[i++] = ALPHANUMERIC_CHARS[digitBits];
}
}
bytes[i++] = ALPHANUMERIC_CHARS[digitBits];
}
- string result = convert(bytes, nBytes, ASCII);
+ append(result, bytes, nBytes, ASCII);
-string DecodedBitStreamParser::decodeAlphanumericSegment(Ref<BitSource> bits, int count) {
+void DecodedBitStreamParser::decodeAlphanumericSegment(Ref<BitSource> bits, std::string &result, int count) {
int nBytes = count;
unsigned char* bytes = new unsigned char[nBytes];
int i = 0;
int nBytes = count;
unsigned char* bytes = new unsigned char[nBytes];
int i = 0;
if (count == 1) {
bytes[i++] = ALPHANUMERIC_CHARS[bits->readBits(6)];
}
if (count == 1) {
bytes[i++] = ALPHANUMERIC_CHARS[bits->readBits(6)];
}
- string result = convert(bytes, nBytes, ASCII);
+ append(result, bytes, nBytes, ASCII);
// How many characters will follow, encoded in this mode?
int count = bits->readBits(mode->getCharacterCountBits(version));
if (mode == &Mode::NUMERIC) {
// How many characters will follow, encoded in this mode?
int count = bits->readBits(mode->getCharacterCountBits(version));
if (mode == &Mode::NUMERIC) {
- result = decodeNumericSegment(bits, count);
+ decodeNumericSegment(bits, result, count);
} else if (mode == &Mode::ALPHANUMERIC) {
} else if (mode == &Mode::ALPHANUMERIC) {
- result = decodeAlphanumericSegment(bits, count);
+ decodeAlphanumericSegment(bits, result, count);
} else if (mode == &Mode::BYTE) {
} else if (mode == &Mode::BYTE) {
- result = decodeByteSegment(bits, count);
+ decodeByteSegment(bits, result, count);
} else if (mode == &Mode::KANJI) {
} else if (mode == &Mode::KANJI) {
- result = decodeKanjiSegment(bits, count);
+ decodeKanjiSegment(bits, result, count);
} else {
throw ReaderException("Unsupported mode indicator");
}
} else {
throw ReaderException("Unsupported mode indicator");
}
static const char *SHIFT_JIS;
static const char *EUC_JP;
static const char *SHIFT_JIS;
static const char *EUC_JP;
- static std::string decodeKanjiSegment(Ref<BitSource> bits, int count);
- static std::string decodeByteSegment(Ref<BitSource> bits, int count);
- static std::string decodeAlphanumericSegment(Ref<BitSource> bits, int count);
- static std::string decodeNumericSegment(Ref<BitSource> bits, int count);
+ static void decodeKanjiSegment(Ref<BitSource> bits, std::string &result, int count);
+ static void decodeByteSegment(Ref<BitSource> bits, std::string &result, int count);
+ static void decodeAlphanumericSegment(Ref<BitSource> bits, std::string &result, int count);
+ static void decodeNumericSegment(Ref<BitSource> bits, std::string &result, int count);
static const char *guessEncoding(unsigned char *bytes, int length);
static const char *guessEncoding(unsigned char *bytes, int length);
- static std::string convert(const unsigned char *bufIn, size_t nIn, const char *src);
+ static void append(std::string &ost, const unsigned char *bufIn, size_t nIn, const char *src);
public:
static std::string decode(ArrayRef<unsigned char> bytes, Version *version);
public:
static std::string decode(ArrayRef<unsigned char> bytes, Version *version);
bool AlignmentPatternFinder::foundPatternCross(vector<int> &stateCount) {
float maxVariance = moduleSize_ / 2.0f;
for (size_t i = 0; i < 3; i++) {
bool AlignmentPatternFinder::foundPatternCross(vector<int> &stateCount) {
float maxVariance = moduleSize_ / 2.0f;
for (size_t i = 0; i < 3; i++) {
- if (labs(moduleSize_ - stateCount[i]) >= maxVariance) {
+ if (abs(moduleSize_ - stateCount[i]) >= maxVariance) {
}
int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
}
int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2];
- if (5 * labs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {
+ if (5 * abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {
float Detector::sizeOfBlackWhiteBlackRun(int fromX, int fromY, int toX, int toY) {\r
// Mild variant of Bresenham's algorithm;\r
// see http://en.wikipedia.org/wiki/Bresenham's_line_algorithm\r
float Detector::sizeOfBlackWhiteBlackRun(int fromX, int fromY, int toX, int toY) {\r
// Mild variant of Bresenham's algorithm;\r
// see http://en.wikipedia.org/wiki/Bresenham's_line_algorithm\r
- bool steep = labs(toY - fromY) > labs(toX - fromX);\r
+ bool steep = abs(toY - fromY) > abs(toX - fromX);\r
if (steep) {\r
int temp = fromX;\r
fromX = fromY;\r
if (steep) {\r
int temp = fromX;\r
fromX = fromY;\r
- int dx = labs(toX - fromX);\r
- int dy = labs(toY - fromY);\r
+ int dx = abs(toX - fromX);\r
+ int dy = abs(toY - fromY);\r
int error = -dx >> 1;\r
int ystep = fromY < toY ? 1 : -1;\r
int xstep = fromX < toX ? 1 : -1;\r
int error = -dx >> 1;\r
int ystep = fromY < toY ? 1 : -1;\r
int xstep = fromX < toX ? 1 : -1;\r
// If we found a finder-pattern-like section, but its size is more than 40% different than
// the original, assume it's a false positive
int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
// If we found a finder-pattern-like section, but its size is more than 40% different than
// the original, assume it's a false positive
int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
- if (5 * labs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {
+ if (5 * abs(stateCountTotal - originalStateCountTotal) >= 2 * originalStateCountTotal) {
// If we found a finder-pattern-like section, but its size is significantly different than
// the original, assume it's a false positive
int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
// If we found a finder-pattern-like section, but its size is significantly different than
// the original, assume it's a false positive
int stateCountTotal = stateCount[0] + stateCount[1] + stateCount[2] + stateCount[3] + stateCount[4];
- if (5 * labs(stateCountTotal - originalStateCountTotal) >= originalStateCountTotal) {
+ if (5 * abs(stateCountTotal - originalStateCountTotal) >= originalStateCountTotal) {
int toX = (int)to.x;\r
int toY = (int)to.y;\r
\r
int toX = (int)to.x;\r
int toY = (int)to.y;\r
\r
- bool steep = labs(toY - fromY) > labs(toX - fromX);\r
+ bool steep = abs(toY - fromY) > abs(toX - fromX);\r
if (steep) {\r
int temp = fromX;\r
fromX = fromY;\r
if (steep) {\r
int temp = fromX;\r
fromX = fromY;\r
- int dx = labs(toX - fromX);\r
- int dy = labs(toY - fromY);\r
+ int dx = abs(toX - fromX);\r
+ int dy = abs(toY - fromY);\r
int error = -dx >> 1;\r
int ystep = fromY < toY ? -1 : 1;\r
int xstep = fromX < toX ? -1 : 1;\r
int error = -dx >> 1;\r
int ystep = fromY < toY ? -1 : 1;\r
int xstep = fromX < toX ? -1 : 1;\r