sparrow 0.6.0
Loading...
Searching...
No Matches
dynamic_bitset.hpp
Go to the documentation of this file.
1// Copyright 2024 Man Group Operations Limited
2//
3// Licensed under the Apache License, Version 2.0 (the "License");
4// you may not use this file except in compliance with the License.
5// You may obtain a copy of the License at
6//
7// http://www.apache.org/licenses/LICENSE-2.0
8//
9// Unless required by applicable law or agreed to in writing, software
10// distributed under the License is distributed on an "AS IS" BASIS,
11// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12// See the License for the specific language governing permissions and
13// limitations under the License.
14
15#pragma once
16
17#include <type_traits>
18
22
23namespace sparrow
24{
32 template <std::integral T>
33 class dynamic_bitset : public dynamic_bitset_base<buffer<T>>
34 {
35 public:
36
42
43 template <std::ranges::input_range R>
44 requires std::convertible_to<std::ranges::range_value_t<R>, value_type>
45 explicit dynamic_bitset(const R& r)
46 : dynamic_bitset(std::ranges::size(r), true)
47 {
48 std::size_t i = 0;
49 for (auto value : r)
50 {
51 if (!value)
52 {
53 this->set(i, false);
54 }
55 i++;
56 }
57 }
58
59 constexpr dynamic_bitset();
60 constexpr explicit dynamic_bitset(size_type n);
64
65 constexpr ~dynamic_bitset() = default;
66 constexpr dynamic_bitset(const dynamic_bitset&) = default;
67 constexpr dynamic_bitset(dynamic_bitset&&) noexcept = default;
68
69 constexpr dynamic_bitset& operator=(const dynamic_bitset&) = default;
70 constexpr dynamic_bitset& operator=(dynamic_bitset&&) noexcept = default;
71
72 using base_type::clear;
73 using base_type::emplace;
74 using base_type::erase;
75 using base_type::insert;
76 using base_type::pop_back;
77 using base_type::push_back;
78 using base_type::resize;
79 };
80
81 template <std::integral T>
87
88 template <std::integral T>
94
95 template <std::integral T>
97 : base_type(
99 n,
100 value ? 0u : n
101 )
102 {
104 }
105
106 template <std::integral T>
112
113 template <std::integral T>
120
122
123 namespace detail
124 {
126
127 inline validity_bitmap ensure_validity_bitmap_impl(std::size_t size, const validity_bitmap& bitmap)
128 {
129 if (bitmap.size() == 0)
130 {
131 return validity_bitmap(size, true);
132 }
133 return bitmap; // copy
134 }
135
137 {
138 if (bitmap.size() == 0)
139 {
140 bitmap.resize(size, true);
141 }
142 return std::move(bitmap);
143 }
144
145 // range of booleans
146 template <std::ranges::input_range R>
147 requires(std::same_as<std::ranges::range_value_t<R>, bool>)
148 validity_bitmap ensure_validity_bitmap_impl(std::size_t size, R&& range)
149 {
150 SPARROW_ASSERT_TRUE(size == range_size(range) || range_size(range) == 0);
151 validity_bitmap bitmap(size, true);
152 std::size_t i = 0;
153 for (auto value : range)
154 {
155 if (!value)
156 {
157 bitmap.set(i, false);
158 }
159 i++;
160 }
161 return bitmap;
162 }
163
164 // range of indices / integers (but not booleans)
165 template <std::ranges::input_range R>
166 requires(
167 std::unsigned_integral<std::ranges::range_value_t<R>>
168 && !std::same_as<std::ranges::range_value_t<R>, bool>
169 && !std::same_as<std::decay_t<R>, validity_bitmap>
170 )
171 validity_bitmap ensure_validity_bitmap_impl(std::size_t size, R&& range_of_indices)
172 {
173 validity_bitmap bitmap(size, true);
174 for (auto index : range_of_indices)
175 {
176 bitmap.set(index, false);
177 }
178 return bitmap;
179 }
180 } // namespace detail
181
182 template <class T>
183 concept validity_bitmap_input = (std::same_as<T, validity_bitmap> || std::same_as<T, const validity_bitmap&>
184 || (std::ranges::input_range<T>
185 && std::same_as<std::ranges::range_value_t<T>, bool>)
186 || (std::ranges::input_range<T>
187 && std::unsigned_integral<std::ranges::range_value_t<T>>) )
188 && (!std::same_as<std::remove_cvref_t<T>, std::string>
189 && !std::same_as<std::remove_cvref_t<T>, std::string_view>
190 && !std::same_as<std::decay_t<T>, const char*>);
191
192 template <validity_bitmap_input R>
193 validity_bitmap ensure_validity_bitmap(std::size_t size, R&& validity_input)
194 {
195 return detail::ensure_validity_bitmap_impl(size, std::forward<R>(validity_input));
196 }
197
198} // namespace sparrow
typename storage_type_without_cvrefpointer::value_type block_type
size_type count_non_null() const noexcept
typename storage_type_without_cvrefpointer::size_type size_type
constexpr size_type null_count() const noexcept
static constexpr size_type compute_block_count(size_type bits_count) noexcept
constexpr size_type size() const noexcept
constexpr void set(size_type pos, value_type value)
constexpr dynamic_bitset_base(storage_type buffer, size_type size)
This class represents a dynamic size sequence of bits.
constexpr dynamic_bitset(dynamic_bitset &&) noexcept=default
constexpr void clear() noexcept
constexpr dynamic_bitset(size_type n)
constexpr dynamic_bitset(size_type n, value_type v)
constexpr void resize(size_type n, value_type b=false)
typename base_type::block_type block_type
constexpr dynamic_bitset(const dynamic_bitset &)=default
constexpr void push_back(value_type value)
constexpr iterator erase(const_iterator pos)
constexpr dynamic_bitset(block_type *p, size_type n, size_type null_count)
dynamic_bitset_base< buffer< T > > base_type
typename base_type::storage_type storage_type
constexpr dynamic_bitset(block_type *p, size_type n)
constexpr iterator insert(const_iterator pos, value_type value)
constexpr iterator emplace(const_iterator pos, value_type value)
typename base_type::value_type value_type
typename base_type::size_type size_type
constexpr ~dynamic_bitset()=default
#define SPARROW_ASSERT_TRUE(expr__)
sparrow::validity_bitmap validity_bitmap
validity_bitmap ensure_validity_bitmap_impl(std::size_t size, const validity_bitmap &bitmap)
dynamic_bitset< std::uint8_t > validity_bitmap
validity_bitmap ensure_validity_bitmap(std::size_t size, R &&validity_input)
std::size_t range_size(R &&r)
Definition ranges.hpp:33