2020-07-06 14:07:20 +00:00
|
|
|
/*
|
|
|
|
This file is part of TON Blockchain Library.
|
|
|
|
|
|
|
|
TON Blockchain Library is free software: you can redistribute it and/or modify
|
|
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
|
|
the Free Software Foundation, either version 2 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
TON Blockchain Library is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU Lesser General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
|
|
along with TON Blockchain Library. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
|
|
|
|
Copyright 2017-2020 Telegram Systems LLP
|
|
|
|
*/
|
|
|
|
|
2020-05-27 18:10:46 +00:00
|
|
|
#pragma once
|
|
|
|
|
|
|
|
#include "td/utils/Slice.h"
|
|
|
|
#include "td/utils/logging.h"
|
|
|
|
|
|
|
|
namespace td {
|
|
|
|
struct Bitset {
|
|
|
|
public:
|
|
|
|
td::Slice as_slice() const {
|
|
|
|
return td::Slice(bits_).substr(0, (bits_size_ + 7) / 8);
|
|
|
|
}
|
|
|
|
bool get(size_t offset) const {
|
|
|
|
auto i = offset / 8;
|
|
|
|
if (i >= bits_.size()) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
auto bit_i = offset % 8;
|
|
|
|
return (bits_[i] & (1 << bit_i)) != 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void reserve(size_t offset) {
|
|
|
|
auto i = offset / 8;
|
|
|
|
if (i >= bits_.size()) {
|
|
|
|
bits_.resize(i + 1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool set_one(size_t offset) {
|
|
|
|
auto i = offset / 8;
|
|
|
|
auto bit_i = offset % 8;
|
|
|
|
bits_size_ = std::max(bits_size_, offset + 1);
|
|
|
|
if (i >= bits_.size()) {
|
|
|
|
bits_.resize(std::max(i + 1, bits_.size() * 2));
|
|
|
|
}
|
|
|
|
auto mask = 1 << bit_i;
|
|
|
|
if ((bits_[i] & mask) == 0) {
|
2022-12-22 09:24:13 +00:00
|
|
|
bits_[i] |= (char)mask;
|
2020-05-27 18:10:46 +00:00
|
|
|
count_++;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2022-12-22 09:24:13 +00:00
|
|
|
bool set_zero(size_t offset) {
|
|
|
|
auto i = offset / 8;
|
|
|
|
if (i >= bits_.size()) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
auto bit_i = offset % 8;
|
|
|
|
auto mask = 1 << bit_i;
|
|
|
|
if (bits_[i] & mask) {
|
|
|
|
bits_[i] &= (char)~mask;
|
|
|
|
count_--;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2020-05-27 18:10:46 +00:00
|
|
|
size_t ones_count() const {
|
|
|
|
return count_;
|
|
|
|
}
|
|
|
|
|
|
|
|
void set_raw(std::string bits) {
|
|
|
|
bits_ = std::move(bits);
|
|
|
|
bits_size_ = 0;
|
|
|
|
count_ = 0;
|
|
|
|
for (size_t n = size(), i = 0; i < n; i++) {
|
|
|
|
if (get(i)) {
|
|
|
|
count_++;
|
|
|
|
bits_size_ = i + 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t size() const {
|
|
|
|
return bits_.size() * 8;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
std::string bits_;
|
|
|
|
size_t bits_size_{0};
|
|
|
|
size_t count_{0};
|
|
|
|
};
|
|
|
|
} // namespace td
|