You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
92 lines
3.8 KiB
92 lines
3.8 KiB
// Copyright (c) 2014-2019, The Monero Project
|
|
//
|
|
// All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without modification, are
|
|
// permitted provided that the following conditions are met:
|
|
//
|
|
// 1. Redistributions of source code must retain the above copyright notice, this list of
|
|
// conditions and the following disclaimer.
|
|
//
|
|
// 2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
// of conditions and the following disclaimer in the documentation and/or other
|
|
// materials provided with the distribution.
|
|
//
|
|
// 3. Neither the name of the copyright holder nor the names of its contributors may be
|
|
// used to endorse or promote products derived from this software without specific
|
|
// prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
/*
|
|
* QR Code generator library (C++)
|
|
*
|
|
* Copyright (c) 2016 Project Nayuki
|
|
* https://www.nayuki.io/page/qr-code-generator-library
|
|
*
|
|
* (MIT License)
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy of
|
|
* this software and associated documentation files (the "Software"), to deal in
|
|
* the Software without restriction, including without limitation the rights to
|
|
* use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
|
* the Software, and to permit persons to whom the Software is furnished to do so,
|
|
* subject to the following conditions:
|
|
* - The above copyright notice and this permission notice shall be included in
|
|
* all copies or substantial portions of the Software.
|
|
* - The Software is provided "as is", without warranty of any kind, express or
|
|
* implied, including but not limited to the warranties of merchantability,
|
|
* fitness for a particular purpose and noninfringement. In no event shall the
|
|
* authors or copyright holders be liable for any claim, damages or other
|
|
* liability, whether in an action of contract, tort or otherwise, arising from,
|
|
* out of or in connection with the Software or the use or other dealings in the
|
|
* Software.
|
|
*/
|
|
|
|
#include <cstddef>
|
|
#include "BitBuffer.hpp"
|
|
|
|
|
|
qrcodegen::BitBuffer::BitBuffer() :
|
|
data(),
|
|
bitLength(0) {}
|
|
|
|
|
|
int qrcodegen::BitBuffer::getBitLength() const {
|
|
return bitLength;
|
|
}
|
|
|
|
|
|
std::vector<uint8_t> qrcodegen::BitBuffer::getBytes() const {
|
|
return data;
|
|
}
|
|
|
|
|
|
void qrcodegen::BitBuffer::appendBits(uint32_t val, int len) {
|
|
if (len < 0 || len > 32 || (len < 32 && (val >> len) != 0))
|
|
throw "Value out of range";
|
|
size_t newBitLen = bitLength + len;
|
|
while (data.size() * 8 < newBitLen)
|
|
data.push_back(0);
|
|
for (int i = len - 1; i >= 0; i--, bitLength++) // Append bit by bit
|
|
data.at(bitLength >> 3) |= ((val >> i) & 1) << (7 - (bitLength & 7));
|
|
}
|
|
|
|
|
|
void qrcodegen::BitBuffer::appendData(const QrSegment &seg) {
|
|
size_t newBitLen = bitLength + seg.bitLength;
|
|
while (data.size() * 8 < newBitLen)
|
|
data.push_back(0);
|
|
for (int i = 0; i < seg.bitLength; i++, bitLength++) { // Append bit by bit
|
|
int bit = (seg.data.at(i >> 3) >> (7 - (i & 7))) & 1;
|
|
data.at(bitLength >> 3) |= bit << (7 - (bitLength & 7));
|
|
}
|
|
}
|