aboutsummaryrefslogtreecommitdiff
path: root/src/QR-Code-generator/BitBuffer.hpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/QR-Code-generator/BitBuffer.hpp')
-rw-r--r--src/QR-Code-generator/BitBuffer.hpp104
1 files changed, 0 insertions, 104 deletions
diff --git a/src/QR-Code-generator/BitBuffer.hpp b/src/QR-Code-generator/BitBuffer.hpp
deleted file mode 100644
index f39437b6..00000000
--- a/src/QR-Code-generator/BitBuffer.hpp
+++ /dev/null
@@ -1,104 +0,0 @@
-// 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.
- */
-
-#pragma once
-
-#include <cstdint>
-#include <vector>
-#include "QrSegment.hpp"
-
-
-namespace qrcodegen {
-
-/*
- * An appendable sequence of bits. Bits are packed in big endian within a byte.
- */
-class BitBuffer final {
-
- /*---- Fields ----*/
-private:
-
- std::vector<uint8_t> data;
- int bitLength;
-
-
-
- /*---- Constructor ----*/
-public:
-
- // Creates an empty bit buffer (length 0).
- BitBuffer();
-
-
-
- /*---- Methods ----*/
-public:
-
- // Returns the number of bits in the buffer, which is a non-negative value.
- int getBitLength() const;
-
-
- // Returns a copy of all bytes, padding up to the nearest byte.
- std::vector<uint8_t> getBytes() const;
-
-
- // Appends the given number of bits of the given value to this sequence.
- // If 0 <= len <= 31, then this requires 0 <= val < 2^len.
- void appendBits(uint32_t val, int len);
-
-
- // Appends the data of the given segment to this bit buffer.
- void appendData(const QrSegment &seg);
-
-};
-
-}