blob: 7a41ad0910d3612edb263d395e350abaad0057b0 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
// Copyright 2014 PDFium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
// Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com
// Original code is licensed as follows:
/*
* Copyright 2007 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.
*/
#include "fxbarcode/qrcode/BC_QRCoderBitVector.h"
#include "core/fxcrt/fx_memory.h"
#include "fxbarcode/utils.h"
CBC_QRCoderBitVector::CBC_QRCoderBitVector() {}
CBC_QRCoderBitVector::~CBC_QRCoderBitVector() {}
int32_t CBC_QRCoderBitVector::At(size_t index, int32_t& e) const {
if (index >= m_sizeInBits) {
e = BCExceptionBadIndexException;
return 0;
}
int32_t value = m_array[index >> 3] & 0xff;
return (value >> (7 - (index & 0x7))) & 1;
}
size_t CBC_QRCoderBitVector::sizeInBytes() const {
return (m_sizeInBits + 7) >> 3;
}
size_t CBC_QRCoderBitVector::Size() const {
return m_sizeInBits;
}
void CBC_QRCoderBitVector::AppendBit(int32_t bit) {
ASSERT(bit == 0 || bit == 1);
int32_t numBitsInLastByte = m_sizeInBits & 0x7;
if (numBitsInLastByte == 0) {
AppendByte(0);
m_sizeInBits -= 8;
}
m_array[m_sizeInBits >> 3] |= (bit << (7 - numBitsInLastByte));
++m_sizeInBits;
}
void CBC_QRCoderBitVector::AppendBits(int32_t value, int32_t numBits) {
ASSERT(numBits > 0);
ASSERT(numBits <= 32);
int32_t numBitsLeft = numBits;
while (numBitsLeft > 0) {
if ((m_sizeInBits & 0x7) == 0 && numBitsLeft >= 8) {
AppendByte(static_cast<int8_t>((value >> (numBitsLeft - 8)) & 0xff));
numBitsLeft -= 8;
} else {
AppendBit((value >> (numBitsLeft - 1)) & 1);
--numBitsLeft;
}
}
}
void CBC_QRCoderBitVector::AppendBitVector(CBC_QRCoderBitVector* bits) {
int32_t size = bits->Size();
for (int32_t i = 0; i < size; i++) {
int e = BCExceptionNO;
int32_t num = bits->At(i, e);
ASSERT(e == BCExceptionNO);
AppendBit(num);
}
}
bool CBC_QRCoderBitVector::XOR(const CBC_QRCoderBitVector* other) {
if (m_sizeInBits != other->Size())
return false;
const auto* pOther = other->GetArray();
for (size_t i = 0; i < sizeInBytes(); ++i)
m_array[i] ^= pOther[i];
return true;
}
const uint8_t* CBC_QRCoderBitVector::GetArray() const {
return m_array.data();
}
void CBC_QRCoderBitVector::AppendByte(int8_t value) {
if ((m_sizeInBits >> 3) == m_array.size())
m_array.push_back(0);
m_array[m_sizeInBits >> 3] = value;
m_sizeInBits += 8;
}
|
